Home › Code › read_graph

read_graph

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.

read_graph appears in the code Syntology harvested for 11 papers, as 11 distinct code bodies found in 11 places (a place is one code body under one paper). Of the 11 papers, 9 with a sample that ran: 6 with a run with no instrument failure, 3 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 read_graph 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 11 distinct code bodies named read_graph: 9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 2 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:

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

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

11 papers shown of 11, newest first; 11 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; 1 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
Self-Explainable Graph Transformer for Link Sign Prediction 16 Aug 2024 liule66/SE-SGformer/reader.py e96f1e60a87dfb52 ran · our draft was wrong no licence file found · pointer only
ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning 14 Oct 2022 Dtrycode/ToupleGDD/utils/graph_utils.py 3d9f075d6bbf9b23 ran MIT (permissive)
Supplementing Recurrent Neural Networks with Annealing to Solve Combinatorial Optimization Problems 17 Jul 2022 rnn-vca-co/rnn-vca-co/SA/SA_Maxcut.py 67921beb3d209764 ran · our draft was wrong licence not identified · pointer only
SGCN:Sparse Graph Convolution Network for Pedestrian Trajectory Prediction 4 Apr 2021 lyqcom/sgcn/src/ms_utils.py 39a9b9592269ee51 ran Apache-2.0 (permissive)
IOS: Inter-Operator Scheduler for CNN Acceleration 2 Nov 2020 mit-han-lab/inter-operator-scheduler/python/ios/models/randwire.py ec2d99fa16d8fb57 ran MIT (permissive)
Nested Subspace Arrangement for Representation of Relational Data 4 Jul 2020 KyushuUniversityMathematics/DANCAR/graphUtil.py 951ee6eeb764072b unverified MIT (permissive)
NBDT: Neural-Backed Decision Trees 1 Apr 2020 XAVILLA/nbdt/nbdt/model.py 7ef704b1f90df1c8 ran · honoured contract MIT (permissive)
Learning to Solve NP-Complete Problems - A Graph Neural Network for Decision TSP 8 Sep 2018 Panichito/GNN-Decision-TSP/gen/instance_loader.py 9eecc9d4528992bd ran · our draft was wrong MIT (permissive)
Exploring the Semantic Content of Unsupervised Graph Embeddings: An Empirical Study 19 Jun 2018 sbonner0/unsupervised-graph-embedding/src/get_features.py 4043b350c07f28f3 ran · honoured contract MIT (permissive)
Identity Mappings in Deep Residual Networks 16 Mar 2016 brain-bzh/MCNN/graph_processing/translation_search.py 043a08fc8f5dbadb unverified MIT (permissive)
AAAI id aaai_16605 RingBDStack/DGGAN/code/utils.py 1b0b10551cfabec3 ran 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