SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2312.08098 · 2023

Adversarial Socialbots Modeling Based on Structural Information Principles

arXiv · PDF · Open in the Atlas

Code that ran

7 of 7 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 5 failures of our instrument; 0 no recorded run), measured 2026-11-21; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2312.08098.json · badge: /api/ran/2312.08098.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
selgroup/siasm canonical (classifier label)
classifier basis: census
7 ran · 0 no recorded run
FunctionStatusWhere it lives
alias_sample Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
selgroup/siasm/ge/alias.py
pointer only (licence: NONE) · get_code("5a75781caceb9236")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, selgroup/siasm when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

child_tree_deepth Ran
ran, honoured the contract we drafted
selgroup/siasm/sip.py
pointer only (licence: NONE); the stored copy get_code serves, from Rooooyy/HiTIN, is pointer only (licence: NONE) · get_code("b16d0d091d08f27f")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, selgroup/siasm when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

create_alias_table Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
selgroup/siasm/ge/alias.py
pointer only (licence: NONE) · get_code("8985b3c4085e0103")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, selgroup/siasm when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

cut_volume Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
selgroup/siasm/sip.py
pointer only (licence: NONE) · get_code("991b295d78d5a1e0")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, selgroup/siasm when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

graph_parse Ran
ran; our contract draft was wrong, not the code
selgroup/siasm/sip.py
pointer only (licence: NONE) · get_code("21dda7ecf92b5b2c")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, selgroup/siasm when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

load_graph Ran
ran; our contract draft was wrong, not the code
selgroup/siasm/utils.py
pointer only (licence: NONE) · get_code("632953e731dce2d0")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, selgroup/siasm when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

random_star Ran
ran on a synthesized input
selgroup/siasm/ge/graph_utils.py
pointer only (licence: NONE) · get_code("f1b87ed537ff9d9f")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, selgroup/siasm when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

Also present in other papers' code

Of 7 samples lifted from this paper's linked repositories, 7 carry a function identity and 0 do not. Of the 7 distinct functions with an identity, 4 are also present in other papers whose code we hold (4 with at least one paper dated earlier, 0 the same month, 2 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
child_tree_deepth 7 other papers
5 dated earlier, 2 later · 3 only as an assembly brick
2206.02404 (2022-06)
A Simple yet Effective Method for Graph Classification
2206.13510 (2022-06)
Structural Entropy Guided Graph Hierarchical Pooling
2304.12000 (2023-04)
Hierarchical State Abstraction Based on Structural Information Principles
and 4 more not named here
graph_parse 6 other papers
4 dated earlier, 2 later · 2 only as an assembly brick
2206.02404 (2022-06)
A Simple yet Effective Method for Graph Classification
2206.13510 (2022-06)
Structural Entropy Guided Graph Hierarchical Pooling
2304.12000 (2023-04)
Hierarchical State Abstraction Based on Structural Information Principles
and 3 more not named here
alias_sample 3 other papers
3 dated earlier
1907.11625 (2019-07)
Influence maximization in unknown social networks: Learning Policies for Effective Graph Sampling
2112.00955 (2021-12)
Source Free Unsupervised Graph Domain Adaptation
2203.00199 (2022-03)
Equivariant and Stable Positional Encoding for More Powerful Graph Neural Networks
create_alias_table 1 other paper
1 dated earlier
1907.11625 (2019-07)
Influence maximization in unknown social networks: Learning Policies for Effective Graph Sampling

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

The importance of effective detection is underscored by the fact that socialbots imitate human behavior to propagate misinformation, leading to an ongoing competition between socialbots and detectors. Despite the rapid advancement of reactive detectors, the exploration of adversarial socialbot modeling remains incomplete, significantly hindering the development of proactive detectors. To address this issue, we propose a mathematical Structural Information principles-based Adversarial Socialbots Modeling framework, namely SIASM, to enable more accurate and effective modeling of adversarial behaviors. First, a heterogeneous graph is presented to integrate various users and rich activities in the original social network and measure its dynamic uncertainty as structural entropy. By minimizing the high-dimensional structural entropy, a hierarchical community structure of the social network is generated and referred to as the optimal encoding tree. Secondly, a novel method is designed to quantify influence by utilizing the assigned structural entropy, which helps reduce the computational cost of SIASM by filtering out uninfluential users. Besides, a new conditional structural entropy is defined between the socialbot and other users to guide the follower selection for network influence maximization. Extensive and comparative experiments on both homogeneous and heterogeneous social networks demonstrate that, compared with state-of-the-art baselines, the proposed SIASM framework yields substantial performance improvements in terms of network influence (up to 16.32%) and sustainable stealthiness (up to 16.29%) when evaluated against a robust detector with 90% accuracy.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2312.08098")
get_code_for_paper("2312.08098")
have("2312.08098")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2312.08098.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2312.08098.svg)](https://syntology.ai/paper/2312.08098)

Connect an agent — have() is free.