SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2409.03127 · 2024

Fast algorithms to improve fair information access in networks

arXiv · PDF · Open in the Atlas

Code that ran

4 of 5 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; 2 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 failures of our instrument; 1 no recorded run), measured 2026-11-22; 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/2409.03127.json · badge: /api/ran/2409.03127.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
rhythmthief/FairnessNetworks canonical (classifier label)
classifier basis: census
4 ran · 1 no recorded run
FunctionStatusWhere it lives
fit_line Ran
ran; our contract draft was wrong, not the code
rhythmthief/FairnessNetworks/code/runners.py
pointer only (licence: NOASSERTION) · get_code("184c74533fe8eedf")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, rhythmthief/FairnessNetworks (NOASSERTION). 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.

get_graph Ran
ran, honoured the contract we drafted
rhythmthief/FairnessNetworks/code/networks.py
pointer only (licence: NOASSERTION) · get_code("2ff1d172db7d1764")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, rhythmthief/FairnessNetworks (NOASSERTION). 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.

reset_index Ran
ran, honoured the contract we drafted
rhythmthief/FairnessNetworks/code/networks.py
pointer only (licence: NOASSERTION) · get_code("842d2c4a7e4bb428")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, rhythmthief/FairnessNetworks (NOASSERTION). 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.

wrap_node_list Ran
ran; our contract draft was wrong, not the code
rhythmthief/FairnessNetworks/code/networks.py
pointer only (licence: NOASSERTION) · get_code("3a5ff7132dd9bd17")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, rhythmthief/FairnessNetworks (NOASSERTION). 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.

estimate Not yet run
unverified (harvested, no recorded run)
rhythmthief/FairnessNetworks/code/probability.py
pointer only (licence: NOASSERTION) · get_code("3dd7bd25cf6b5de6")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, rhythmthief/FairnessNetworks (NOASSERTION). 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. No invocation recorded.

Also present in other papers' code

Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 5 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.

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-22.

Repositories linked to this paper

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

Abstract

We consider the problem of selecting $k$ seed nodes in a network to maximize the minimum probability of activation under an independent cascade beginning at these seeds. The motivation is to promote fairness by ensuring that even the least advantaged members of the network have good access to information. Our problem can be viewed as a variant of the classic influence maximization objective, but it appears somewhat more difficult to solve: only heuristics are known. Moreover, the scalability of these methods is sharply constrained by the need to repeatedly estimate access probabilities. We design and evaluate a suite of $10$ new scalable algorithms which crucially do not require probability estimation. To facilitate comparison with the state-of-the-art, we make three more contributions which may be of broader interest. We introduce a principled method of selecting a pairwise information transmission parameter used in experimental evaluations, as well as a new performance metric which allows for comparison of algorithms across a range of values for the parameter $k$. Finally, we provide a new benchmark corpus of $174$ networks drawn from $6$ domains. Our algorithms retain most of the performance of the state-of-the-art while reducing running time by orders of magnitude. Specifically, a meta-learner approach is on average only $20\%$ less effective than the state-of-the-art on held-out data, but about $75-130$ times faster. Further, the meta-learner's performance exceeds the state-of the-art on about $20\%$ of networks, and the magnitude of its running time advantage is maintained on much larger networks.

For agents

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

get_harvested_code_for_paper("2409.03127")
get_code_for_paper("2409.03127")
have("2409.03127")

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

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

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

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

Connect an agent — have() is free.