Home › Code › sparse_to_tuple

sparse_to_tuple

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.

sparse_to_tuple appears in the code Syntology harvested for 22 papers, as 7 distinct code bodies found in 22 places (a place is one code body under one paper). Of the 22 papers, 22 with a sample that ran: 4 with a run with no instrument failure, 18 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 sparse_to_tuple 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 7 distinct code bodies named sparse_to_tuple: 7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 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
3ran · our draft was wrong
0ran; the contract check could not run
4ran
0unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 11 of the 22 places are pointer only (Syntology does not serve that copy's text); at 5 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

22 papers shown of 22, newest first; 22 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; 4 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
Zero-shot Generalist Graph Anomaly Detection with Unified Neighborhood Prompts 18 Oct 2024 mala-lab/UNPrompt/utils.py 0300d9b136d85dfb ran · our draft was wrong MIT (permissive)
Balanced Multi-Relational Graph Clustering 23 Jul 2024 zxlearningdeep/bmgc/BMGC/module/preprocess.py 3965c8f8e2d0023e ran · our draft was wrong no licence file found · pointer only
IGL-Bench: Establishing the Comprehensive Benchmark for Imbalanced Graph Learning 14 Jun 2024 RingBDStack/IGL-Bench/IGL_Bench/algorithm/DEMONet/util.py eaa82e9c7a22e930 ran · our draft was wrong MIT (permissive)
Graph Adversarial Diffusion Convolution 4 Jun 2024 songtaoliu0823/gadc/Adaptive_Adversarial_Attack/utils.py eaa82e9c7a22e930 ran · our draft was wrong no licence file found · pointer only
PREM: A Simple Yet Effective Approach for Node-Level Graph Anomaly Detection 18 Oct 2023 campanulabells/prem-gad/modules/utils.py 0300d9b136d85dfb ran · our draft was wrong no licence file found · pointer only
FiGURe: Simple and Efficient Unsupervised Node Representations with Filter Augmentations 3 Oct 2023 microsoft/figure/utils.py eaa82e9c7a22e930 ran · our draft was wrong MIT (permissive)
arXiv:2310.00800 2023-10 (from id) jumxglhf/ParetoGNN/link_gen.py 78ccfe0f0f11ce2c ran CC0-1.0 (permissive)
On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topology 6 Feb 2023 lrnzgiusti/on-oversquashing/utils/utils.py eaa82e9c7a22e930 ran · our draft was wrong MIT (permissive)
Deep Reinforcement Learning for Entity Alignment 7 Mar 2022 guolingbing/RLEA/src/openea/approaches/alinet.py 05d5e3c8eda73847 ran MIT (permissive)
Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction 13 Jun 2021 fs302/EasyLink/easylink/common/data_utils.py 4ada13b9756aa281 ran Apache-2.0 (permissive)
FairDrop: Biased Edge Dropout for Enhancing Fairness in Graph Representation Learning 29 Apr 2021 juellsprott/graphair-reproducibility/models/fairgraph/method/fairadj/utils.py 3965c8f8e2d0023e ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only
Unifying Graph Convolutional Neural Networks and Label Propagation 17 Feb 2020 achalagarwal/gcn-lpa/src/data_loader.py 13c5950f6e3ab34b ran MIT (permissive)
AnomalyDAE: Dual autoencoder for anomaly detection on attributed networks 10 Feb 2020 haoyfan/AnomalyDAE/src/preprocessing.py 3965c8f8e2d0023e ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only
Semi-Implicit Graph Variational Auto-Encoders 19 Aug 2019 identical code first harvested elsewhere 3965c8f8e2d0023e ran · our draft was wrong licence of this copy not recorded
Graph Embedding on Biomedical Networks: Methods, Applications, and Evaluations 12 Jun 2019 xiangyue9607/BioNEV/src/bionev/GAE/preprocessing.py 3965c8f8e2d0023e ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only
MedGCN: Medication recommendation and lab test imputation via graph convolutional networks 31 Mar 2019 mocherson/MedGCN/utility/preprocessing.py 3965c8f8e2d0023e ran · our draft was wrong no licence file found · pointer only
Fisher-Bures Adversary Graph Convolutional Networks 11 Mar 2019 stellargraph/FisherGCN/gcn/utils.py eaa82e9c7a22e930 ran · our draft was wrong MIT (permissive)
Graph Convolutional Neural Networks via Scattering 31 Mar 2018 identical code first harvested elsewhere 3965c8f8e2d0023e ran · our draft was wrong licence of this copy not recorded
Variational Graph Auto-Encoders 21 Nov 2016 Omairss/RepresentationLearning/src/preprocessing.py 3965c8f8e2d0023e ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only
IJCAI id ijcai2022_0498 xinxingwu-uk/DGAE/Python/Models/dgae_alpha/preprocessing.py 3965c8f8e2d0023e ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only
IJCAI id ijcai2022_0310 zjunet/PathNet/dataset.py eaa82e9c7a22e930 ran · our draft was wrong MIT (permissive)
AAAI id aaai_20388 xuehansheng/RepBin/utils.py eaa82e9c7a22e930 ran · our draft was wrong MIT (permissive)

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