{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/get-neighbors","entry":"get_neighbors","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":17,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":4,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":15,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":2,"n_places":17,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":9,"unverified":3},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2604.16429","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-16429","title":"(Sparse) Attention to the Details: Preserving Spectral Fidelity in ML-based Weather Forecasting Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"maxxxzdn/mosaic","path":"utils.py","file_url":"https://github.com/maxxxzdn/mosaic/blob/HEAD/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"94c83c976790c117","code_sha256_prefix":"94c83c976790c117","mcp_get_code":{"code_sha256":"94c83c976790c117"}},{"arxiv_id":"2604.15306","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-15306","title":"Generalization in LLM Problem Solving: The Case of the Shortest Path","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"privacytrustlab/PathGeneralization","path":"utils/model.py","file_url":"https://github.com/privacytrustlab/PathGeneralization/blob/HEAD/utils/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, privacytrustlab/PathGeneralization when it was checked","code_sha256":"25e5c366a21243bb","code_sha256_prefix":"25e5c366a21243bb","mcp_get_code":{"code_sha256":"25e5c366a21243bb"}},{"arxiv_id":"2502.03214","arxiv_id_is_arxiv":true,"paper":"/paper/ivispar-an-interactive-visual-spatial","title":"iVISPAR -- An Interactive Visual-Spatial Reasoning Benchmark for VLMs","date":"2025-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SharkyBamboozle/iVISPAR","path":"Source/Configure/find_random_move_sequence.py","file_url":"https://github.com/SharkyBamboozle/iVISPAR/blob/HEAD/Source/Configure/find_random_move_sequence.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6cf8ccfcf1db2c95","code_sha256_prefix":"6cf8ccfcf1db2c95","mcp_get_code":{"code_sha256":"6cf8ccfcf1db2c95"}},{"arxiv_id":"2412.07106","arxiv_id_is_arxiv":true,"paper":"/paper/covered-forest-fine-grained-generalization","title":"Covered Forest: Fine-grained generalization analysis of graph neural networks","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benfinkelshtein/CoveredForests","path":"utils/tmd.py","file_url":"https://github.com/benfinkelshtein/CoveredForests/blob/HEAD/utils/tmd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e7914319fc8435a7","code_sha256_prefix":"e7914319fc8435a7","mcp_get_code":{"code_sha256":"e7914319fc8435a7"}},{"arxiv_id":"2410.17600","arxiv_id_is_arxiv":true,"paper":"/paper/graphusion-a-rag-framework-for-knowledge","title":"Graphusion: A RAG Framework for Knowledge Graph Construction with a Global Perspective","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"irenezihuili/graphusion","path":"graphs.py","file_url":"https://github.com/irenezihuili/graphusion/blob/HEAD/graphs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, irenezihuili/graphusion when it was checked","code_sha256":"66fc6e42285f36cb","code_sha256_prefix":"66fc6e42285f36cb","mcp_get_code":{"code_sha256":"66fc6e42285f36cb"}},{"arxiv_id":"2405.18556","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-in-dynamic-treatment","title":"Reinforcement Learning in Dynamic Treatment Regimes Needs Critical Reexamination","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GilesLuo/ReassessDTR","path":"DTRGym/utils.py","file_url":"https://github.com/GilesLuo/ReassessDTR/blob/HEAD/DTRGym/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, GilesLuo/ReassessDTR when it was checked","code_sha256":"687d05a4f65717ae","code_sha256_prefix":"687d05a4f65717ae","mcp_get_code":{"code_sha256":"687d05a4f65717ae"}},{"arxiv_id":"2405.03633","arxiv_id_is_arxiv":true,"paper":"/paper/neural-graph-mapping-for-dense-slam-with","title":"Neural Graph Map: Dense Mapping with Efficient Loop Closure Integration","date":"2024-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kth-rpl/neural_graph_mapping","path":"src/neural_graph_mapping/graph.py","file_url":"https://github.com/kth-rpl/neural_graph_mapping/blob/HEAD/src/neural_graph_mapping/graph.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f514004255342669","code_sha256_prefix":"f514004255342669","mcp_get_code":{"code_sha256":"f514004255342669"}},{"arxiv_id":"2306.08854","arxiv_id_is_arxiv":true,"paper":"/paper/a-gromov-wasserstein-geometric-view-of","title":"A Gromov--Wasserstein Geometric View of Spectrum-Preserving Graph Coarsening","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ychen-stat-ml/gw-graph-coarsening","path":"graph_coarsening/graph_utils.py","file_url":"https://github.com/ychen-stat-ml/gw-graph-coarsening/blob/HEAD/graph_coarsening/graph_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5f9905758c8b3c7e","code_sha256_prefix":"5f9905758c8b3c7e","mcp_get_code":{"code_sha256":"5f9905758c8b3c7e"}},{"arxiv_id":"2210.01906","arxiv_id_is_arxiv":true,"paper":"/paper/tree-mover-s-distance-bridging-graph-metrics","title":"Tree Mover's Distance: Bridging Graph Metrics and Stability of Graph Neural Networks","date":"2022-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chingyaoc/tmd","path":"tmd.py","file_url":"https://github.com/chingyaoc/tmd/blob/HEAD/tmd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e7914319fc8435a7","code_sha256_prefix":"e7914319fc8435a7","mcp_get_code":{"code_sha256":"e7914319fc8435a7"}},{"arxiv_id":"2206.00668","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-untangle-genome-assembly-with","title":"Learning to Untangle Genome Assembly with Graph Convolutional Networks","date":"2022-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lvrcek/gnnome-assembly","path":"graph_parser.py","file_url":"https://github.com/lvrcek/gnnome-assembly/blob/HEAD/graph_parser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c477bd6fb6e11e89","code_sha256_prefix":"c477bd6fb6e11e89","mcp_get_code":{"code_sha256":"c477bd6fb6e11e89"}},{"arxiv_id":"2204.01139","arxiv_id_is_arxiv":true,"paper":"/paper/bnv-fusion-dense-3d-reconstruction-using-bi","title":"BNV-Fusion: Dense 3D Reconstruction using Bi-level Neural Volume Fusion","date":"2022-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"likojack/bnv_fusion","path":"src/models/fusion/utils.py","file_url":"https://github.com/likojack/bnv_fusion/blob/HEAD/src/models/fusion/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00b8fd61b4a50066","code_sha256_prefix":"00b8fd61b4a50066","mcp_get_code":{"code_sha256":"00b8fd61b4a50066"}},{"arxiv_id":"2203.08222","arxiv_id_is_arxiv":true,"paper":"/paper/zipfian-environments-for-reinforcement","title":"Zipfian environments for Reinforcement Learning","date":"2022-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/zipfian_environments","path":"gridworld/map_building.py","file_url":"https://github.com/deepmind/zipfian_environments/blob/HEAD/gridworld/map_building.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2ee6ccbf4f97abe","code_sha256_prefix":"c2ee6ccbf4f97abe","mcp_get_code":{"code_sha256":"c2ee6ccbf4f97abe"}},{"arxiv_id":"2107.10970","arxiv_id_is_arxiv":true,"paper":"/paper/the-decomposition-of-the-higher-order","title":"The decomposition of the higher-order homology embedding constructed from the $k$-Laplacian","date":"2021-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuchaz/homology_emb","path":"homology_emb/cycles.py","file_url":"https://github.com/yuchaz/homology_emb/blob/HEAD/homology_emb/cycles.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"744aadc8c908a3e8","code_sha256_prefix":"744aadc8c908a3e8","mcp_get_code":{"code_sha256":"744aadc8c908a3e8"}},{"arxiv_id":"2106.05150","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-up-graph-neural-networks-via-graph","title":"Scaling Up Graph Neural Networks Via Graph Coarsening","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"szzhang17/Scaling-Up-Graph-Neural-Networks-Via-Graph-Coarsening","path":"APPNP/graph_coarsening/graph_utils.py","file_url":"https://github.com/szzhang17/Scaling-Up-Graph-Neural-Networks-Via-Graph-Coarsening/blob/HEAD/APPNP/graph_coarsening/graph_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5f9905758c8b3c7e","code_sha256_prefix":"5f9905758c8b3c7e","mcp_get_code":{"code_sha256":"5f9905758c8b3c7e"}},{"arxiv_id":"2006.01938","arxiv_id_is_arxiv":true,"paper":"/paper/nurse-is-closer-to-woman-than-surgeon","title":"Nurse is Closer to Woman than Surgeon? Mitigating Gender-Biased Proximities in Word Embeddings","date":"2020-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TimeTraveller-San/RAN-Debias","path":"src/gipe.py","file_url":"https://github.com/TimeTraveller-San/RAN-Debias/blob/HEAD/src/gipe.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"34c4e09e34e2fc7b","code_sha256_prefix":"34c4e09e34e2fc7b","mcp_get_code":{"code_sha256":"34c4e09e34e2fc7b"}},{"arxiv_id":"2001.05311","arxiv_id_is_arxiv":true,"paper":"/paper/abcnet-an-attention-based-method-for-particle","title":"ABCNet: An attention-based method for particle tagging","date":null,"month_inferred_from_arxiv_id":"2020-01","title_source":"archive","repo":"ViniciusMikuni/ABCNet","path":"utils/tf_util.py","file_url":"https://github.com/ViniciusMikuni/ABCNet/blob/HEAD/utils/tf_util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f504fc3842e612b","code_sha256_prefix":"6f504fc3842e612b","mcp_get_code":{"code_sha256":"6f504fc3842e612b"}},{"arxiv_id":"1511.06038","arxiv_id_is_arxiv":true,"paper":"/paper/neural-variational-inference-for-text","title":"Neural Variational Inference for Text Processing","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carpedm20/variational-text-tensorflow","path":"toy_generator.py","file_url":"https://github.com/carpedm20/variational-text-tensorflow/blob/HEAD/toy_generator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1f8d62e9dcc2ed5b","code_sha256_prefix":"1f8d62e9dcc2ed5b","mcp_get_code":{"code_sha256":"1f8d62e9dcc2ed5b"}}],"record_sha256":"4c64ca3a02157906087d49f0e0546a5c4d2137a566ec5edb6c483061cdd529d0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}