Home › Code › zeros

zeros

Syntologyentry name in harvested code

Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record.

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

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

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

26 papers shown of 26, newest first; 27 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
Combating Bilateral Edge Noise for Robust Link Prediction 2 Nov 2023 flyingdoog/PTDNet/inits.py b190ef9c60b2629a ran no licence file found · pointer only
A Representation Learning Framework for Property Graphs 27 Jun 2022 yifan-h/pge/pge/inits.py b190ef9c60b2629a ran MIT (permissive) here; the stored copy is pointer only
Deep Reinforcement Learning for Entity Alignment 7 Mar 2022 guolingbing/RLEA/src/openea/approaches/gcn_align.py b190ef9c60b2629a ran MIT (permissive) here; the stored copy is pointer only
Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations 5 Feb 2022 AdrienC21/CCSD/ccsd/src/models/ScoreNetwork_A.py 5f1a4e1cb60dea51 unverified MIT (permissive)
Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations 5 Feb 2022 harryjo97/gdss/models/ScoreNetwork_A.py ea9c6ff61fbc9c4e unverified no licence file found · pointer only
Uncertainty-Based Offline Reinforcement Learning with Diversified Q-Ensemble 4 Oct 2021 snu-mllab/edac/lifelong_rl/models/networks.py 662ecb7bbf9644d8 unverified MIT (permissive)
Knowing the No-match: Entity Alignment with Dangling Cases 4 Jun 2021 nju-websoft/OpenEA/src/openea/approaches/gmnn.py 0a0766dae72ea646 ran; the contract check could not run (RAISES) · metamorphic tier: well formed GPL-3.0 (copyleft) · pointer only
Hyperparameter Auto-tuning in Self-Supervised Robotic Learning 16 Oct 2020 huangjiancong1/rlkit_autotune/rlkit/torch/vae/vae_trainer.py d10e01e9a37f24d6 unverified MIT (permissive)
A geodesic interior-point method for linear optimization over symmetric cones 2020-08 (from id) frankpermenter/conex/interfaces/python/ConexProgram.py a62fac0899a92c08 ran · honoured contract fingerprinted MIT (permissive)
Sat2Graph: Road Graph Extraction through Graph-Tensor Encoding 19 Jul 2020 songtaohe/Sat2Graph/model/tf_common_layer.py b1cae89b7ac10150 unverified MIT (permissive)
Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs 20 Jun 2020 tkipf/gcn/gcn/inits.py b190ef9c60b2629a ran MIT (permissive) here; the stored copy is pointer only
Knowledge Embedding Based Graph Convolutional Network 12 Jun 2020 Maysir/GEM-GCN/inits.py 0a0766dae72ea646 ran; the contract check could not run (RAISES) · metamorphic tier: well formed MIT (permissive) here; the stored copy is pointer only
Bandit Samplers for Training Graph Neural Networks 10 Jun 2020 xavierzw/ogb-geniepath-bs/inits.py b190ef9c60b2629a ran MIT (permissive) here; the stored copy is pointer only
Modeling Dynamic Heterogeneous Network for Link Prediction using Hierarchical Attention with Temporal RNN 1 Apr 2020 skx300/DyHATR/src/models/inits.py b190ef9c60b2629a ran MIT (permissive) here; the stored copy is pointer only
Unifying Graph Convolutional Neural Networks and Label Propagation 17 Feb 2020 achalagarwal/gcn-lpa/src/inits.py 595ca46a0fcb65fa ran MIT (permissive)
GraphAIR: Graph Representation Learning with Neighborhood Aggregation and Interaction 5 Nov 2019 CRIPAC-DIG/GraphAIR/tensorflow_code/inits.py b190ef9c60b2629a ran MIT (permissive) here; the stored copy is pointer only
Pixel2Mesh++: Multi-View 3D Mesh Generation via Deformation 5 Aug 2019 walsvid/Pixel2MeshPlusPlus/modules/inits.py b190ef9c60b2629a ran BSD-3-Clause (permissive) here; the stored copy is pointer only
Deep Bayesian Optimization on Attributed Graphs 31 May 2019 csjtx1021/DGBO/gcn/inits.py b190ef9c60b2629a ran MIT (permissive) here; the stored copy is pointer only
Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification 13 Feb 2019 CRIPAC-DIG/H-GCN/tensorflow_code/inits.py b190ef9c60b2629a ran MIT (permissive) here; the stored copy is pointer only
Label Efficient Semi-Supervised Learning via Graph Filtering 28 Jan 2019 liqimai/Efficient-SSL/gcn/inits.py b190ef9c60b2629a ran MIT (permissive) here; the stored copy is pointer only
Bayesian graph convolutional neural networks for semi-supervised classification 27 Nov 2018 huawei-noah/BGCN/src/inits.py b190ef9c60b2629a ran MIT recorded; this copy not marked cleared · pointer only
A Recurrent Graph Neural Network for Multi-Relational Data 5 Nov 2018 bioannidis/adaptive_recurrent_graph_neural_network/inits.py b190ef9c60b2629a ran MIT (permissive) here; the stored copy is pointer only
Pixel2Mesh: Generating 3D Mesh Models from Single RGB Images 5 Apr 2018 nywang16/Pixel2Mesh/p2m/inits.py b190ef9c60b2629a ran Apache-2.0 (permissive) here; the stored copy is pointer only
Graph2Seq: Graph to Sequence Learning with Attention-based Neural Networks 3 Apr 2018 IBM/Graph2Seq/main/inits.py b190ef9c60b2629a ran Apache-2.0 (permissive) here; the stored copy is pointer only
Stochastic Training of Graph Convolutional Networks with Variance Reduction 29 Oct 2017 thu-ml/stochastic_gcn/gcn/inits.py 681e93201c975fb9 unverified MIT (permissive)
Revisiting Semi-Supervised Learning with Graph Embeddings 29 Mar 2016 asarigun/la-gcn-tensorflow/inits.py b190ef9c60b2629a ran MIT (permissive) here; the stored copy is pointer only
AAAI id aaai_20873 RICE-EIC/Early-Bird-GCN/gcn/inits.py b190ef9c60b2629a ran Apache-2.0 (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