Home › Code › get_neighbors

get_neighbors

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.

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

Licence is a property of each copy, so it is counted per place: 3 of the 17 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

17 papers shown of 17, newest first; 17 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. 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
(Sparse) Attention to the Details: Preserving Spectral Fidelity in ML-based Weather Forecasting Models added by Syntology 2026-04 (from id) maxxxzdn/mosaic/utils.py 94c83c976790c117 ran; the contract check could not run (RAISES) Apache-2.0 (permissive)
Generalization in LLM Problem Solving: The Case of the Shortest Path added by Syntology 2026-04 (from id) privacytrustlab/PathGeneralization/utils/model.py 25e5c366a21243bb ran; the contract check could not run (RAISES) fingerprinted no licence file found · pointer only
iVISPAR -- An Interactive Visual-Spatial Reasoning Benchmark for VLMs 5 Feb 2025 SharkyBamboozle/iVISPAR/Source/Configure/find_random_move_sequence.py 6cf8ccfcf1db2c95 ran MIT (permissive)
Covered Forest: Fine-grained generalization analysis of graph neural networks 10 Dec 2024 benfinkelshtein/CoveredForests/utils/tmd.py e7914319fc8435a7 ran · our draft was wrong MIT (permissive)
Graphusion: A RAG Framework for Knowledge Graph Construction with a Global Perspective 23 Oct 2024 irenezihuili/graphusion/graphs.py 66fc6e42285f36cb ran no licence file found · pointer only
Reinforcement Learning in Dynamic Treatment Regimes Needs Critical Reexamination 28 May 2024 GilesLuo/ReassessDTR/DTRGym/utils.py 687d05a4f65717ae ran no licence file found · pointer only
Neural Graph Map: Dense Mapping with Efficient Loop Closure Integration 6 May 2024 kth-rpl/neural_graph_mapping/src/neural_graph_mapping/graph.py f514004255342669 ran MIT (permissive)
A Gromov--Wasserstein Geometric View of Spectrum-Preserving Graph Coarsening 15 Jun 2023 ychen-stat-ml/gw-graph-coarsening/graph_coarsening/graph_utils.py 5f9905758c8b3c7e ran MIT (permissive)
Tree Mover's Distance: Bridging Graph Metrics and Stability of Graph Neural Networks 4 Oct 2022 chingyaoc/tmd/tmd.py e7914319fc8435a7 ran · our draft was wrong MIT (permissive)
Learning to Untangle Genome Assembly with Graph Convolutional Networks 1 Jun 2022 lvrcek/gnnome-assembly/graph_parser.py c477bd6fb6e11e89 unverified MIT (permissive)
BNV-Fusion: Dense 3D Reconstruction using Bi-level Neural Volume Fusion 3 Apr 2022 likojack/bnv_fusion/src/models/fusion/utils.py 00b8fd61b4a50066 ran fingerprinted MIT (permissive)
Zipfian environments for Reinforcement Learning 15 Mar 2022 deepmind/zipfian_environments/gridworld/map_building.py c2ee6ccbf4f97abe ran Apache-2.0 (permissive)
The decomposition of the higher-order homology embedding constructed from the $k$-Laplacian 23 Jul 2021 yuchaz/homology_emb/homology_emb/cycles.py 744aadc8c908a3e8 ran BSD-2-Clause (permissive)
Scaling Up Graph Neural Networks Via Graph Coarsening 9 Jun 2021 szzhang17/Scaling-Up-Graph-Neural-Networks-Via-Graph-Coarsening/APPNP/graph_coarsening/graph_utils.py 5f9905758c8b3c7e ran MIT (permissive)
Nurse is Closer to Woman than Surgeon? Mitigating Gender-Biased Proximities in Word Embeddings 2 Jun 2020 TimeTraveller-San/RAN-Debias/src/gipe.py 34c4e09e34e2fc7b ran MIT (permissive)
ABCNet: An attention-based method for particle tagging 2020-01 (from id) ViniciusMikuni/ABCNet/utils/tf_util.py 6f504fc3842e612b unverified MIT (permissive)
Neural Variational Inference for Text Processing 19 Nov 2015 carpedm20/variational-text-tensorflow/toy_generator.py 1f8d62e9dcc2ed5b unverified 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