Home › Code › index_to_mask

index_to_mask

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

index_to_mask appears in the code Syntology harvested for 25 papers, as 9 distinct code bodies found in 25 places (a place is one code body under one paper). Of the 25 papers, 25 with a sample that ran: 2 with a run with no instrument failure, 23 where every run was a failure of Syntology's instrument. 0 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named index_to_mask do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 9 distinct code bodies named index_to_mask: 9 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 7 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
7ran · our draft was wrong
0ran; the contract check could not run
2ran
0unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 21 of the 25 places are pointer only (Syntology does not serve that copy's text); at 8 of those this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text (hover the licence cell for why). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

25 papers shown of 25, newest first; 25 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 2 papers added by Syntology; 3 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Full-Spectrum Graph Neural Networks: Expressive and Scalable added by Syntology 2026-05 (from id) xwangxshi/FSpecGNN/Heterophily/large/utils.py 015b48620e1b8319 ran · our draft was wrong no licence file found · pointer only
View Space: Learning Representation across Arbitrary Graphs added by Syntology 2025-12 (from id) jianhao2016/GPRGNN/src/utils.py da80a2b9fd449bd2 ran · our draft was wrong no licence file found · pointer only
arXiv:2507.16347 2025-07 (from id) streetcorner/HPGNN/utils/dataset_utils.py 015b48620e1b8319 ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only
GFM-RAG: Graph Foundation Model for Retrieval Augmented Generation 3 Feb 2025 identical code first harvested elsewhere 9664f4b5c60ab1bf ran · our draft was wrong licence of this copy not recorded
You Can't Ignore Either: Unifying Structure and Feature Denoising for Robust Graph Learning 1 Aug 2024 youngtimmy/ugd/generate_noisedata/attack_injection_noise.py b575184b083dc83b ran · our draft was wrong no licence file found · pointer only
Balanced Multi-Relational Graph Clustering 23 Jul 2024 zxlearningdeep/bmgc/BMGC/cSBM_dataset.py da80a2b9fd449bd2 ran · our draft was wrong no licence file found · pointer only
PolyFormer: Scalable Node-wise Filters via Polynomial Graph Transformer 19 Jul 2024 air029/polyformer/node_classification/utils.py 015b48620e1b8319 ran · our draft was wrong no licence file found · pointer only
Rethinking Fair Graph Neural Networks from Re-balancing 16 Jul 2024 zhixunlee/fairgb/data_utils.py 9ed7d6ea040a9619 ran · our draft was wrong MIT (permissive)
Self-Guided Robust Graph Structure Refinement 19 Feb 2024 yeonjun-in/torch-sg-gsr/utils/data.py 68823e485d4d106a ran · our draft was wrong no licence file found · pointer only
Every Node is Different: Dynamically Fusing Self-Supervised Tasks for Attributed Graph Clustering 12 Jan 2024 q086/DyFSS/DyFSS/utils.py fbb0568018649a4d ran · our draft was wrong no licence file found · pointer only
PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering 22 Dec 2023 uestclbh/pc-conv/utils.py 015b48620e1b8319 ran · our draft was wrong no licence file found · pointer only
NodeMixup: Tackling Under-Reaching for Graph Neural Networks 20 Dec 2023 weiganglu/nodemixup/dataset.py da80a2b9fd449bd2 ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only
FiGURe: Simple and Efficient Unsupervised Node Representations with Filter Augmentations 3 Oct 2023 microsoft/figure/dataset.py 7a9e612624603b69 ran MIT (permissive)
Learning How to Propagate Messages in Graph Neural Networks 1 Oct 2023 tengxiao1/l2p/full/utils.py da80a2b9fd449bd2 ran · our draft was wrong no licence file found · pointer only
arXiv:2307.06422 2023-07 (from id) thupchnsky/dp-gnn/core/datasets/cSBM_dataset.py da80a2b9fd449bd2 ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only
HiGen: Hierarchical Graph Generative Networks 30 May 2023 karami-m/higen_main/utils/graph_helper.py 9123e2f7b1ebd40b ran MIT (permissive)
Understanding convolution on graphs via energies 22 Jun 2022 jrowbottomgit/graff/src/heterophilic.py da80a2b9fd449bd2 ran · our draft was wrong Apache-2.0 (permissive) here; the stored copy is pointer only
Beyond Real-world Benchmark Datasets: An Empirical Study of Node Classification with GNNs 18 Jun 2022 seijimaekawa/empirical-study-of-gnns/models/utils.py da80a2b9fd449bd2 ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only
Rethinking the Setting of Semi-supervised Learning on Graphs 28 May 2022 identical code first harvested elsewhere da80a2b9fd449bd2 ran · our draft was wrong licence of this copy not recorded
SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networks 22 Dec 2021 weiganglu/skipnode/utils/dataset.py da80a2b9fd449bd2 ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only
$p$-Laplacian Based Graph Neural Networks 14 Nov 2021 guoji-fu/pGNNs/cSBM_dataset.py da80a2b9fd449bd2 ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only
Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction 13 Jun 2021 KiddoZhu/NBFNet-PyG/nbfnet/models.py 9664f4b5c60ab1bf ran · our draft was wrong MIT (permissive)
Towards Deeper Graph Neural Networks 18 Jul 2020 identical code first harvested elsewhere da80a2b9fd449bd2 ran · our draft was wrong licence of this copy not recorded
Non-Local Graph Neural Networks 29 May 2020 divelab/Non-Local-GNN/NLGNN/src/train_eval.py da80a2b9fd449bd2 ran · our draft was wrong GPL-3.0 (copyleft) · pointer only
AAAI id aaai_29328 WeigangLu/NodeMixup/dataset.py da80a2b9fd449bd2 ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections