{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/find-nearest-idx","entry":"find_nearest_idx","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":1,"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":3,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":2},"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":"2305.19337","paper":"/paper/higen-hierarchical-graph-generative-networks","title":"HiGen: Hierarchical Graph Generative Networks","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karami-m/higen_main","path":"utils/eval_helper.py","file_url":"https://github.com/karami-m/higen_main/blob/HEAD/utils/eval_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a39feeeaa3cceac3","mcp_get_code":{"code_sha256":"a39feeeaa3cceac3"}},{"arxiv_id":"2209.11359","paper":"/paper/cuts-a-fully-unsupervised-framework-for","title":"CUTS: A Deep Learning and Topological Framework for Multigranular Unsupervised Medical Image Segmentation","date":"2022-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krishnaswamylab/cuts","path":"src/scripts_analysis/plot_paper_figure_main.py","file_url":"https://github.com/krishnaswamylab/cuts/blob/HEAD/src/scripts_analysis/plot_paper_figure_main.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"82315ca43ec3bb88","mcp_get_code":{"code_sha256":"82315ca43ec3bb88"}},{"arxiv_id":"2204.01613","paper":"/paper/spectre-spectral-conditioning-helps-to","title":"SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KarolisMart/SPECTRE","path":"util/eval_helper.py","file_url":"https://github.com/KarolisMart/SPECTRE/blob/HEAD/util/eval_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a39feeeaa3cceac3","mcp_get_code":{"code_sha256":"a39feeeaa3cceac3"}},{"arxiv_id":"1910.00760","paper":"/paper/efficient-graph-generation-with-graph","title":"Efficient Graph Generation with Graph Recurrent Attention Networks","date":"2019-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lrjconan/GRAN","path":"utils/eval_helper.py","file_url":"https://github.com/lrjconan/GRAN/blob/HEAD/utils/eval_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a39feeeaa3cceac3","mcp_get_code":{"code_sha256":"a39feeeaa3cceac3"}},{"arxiv_id":"1802.08773","paper":"/paper/graphrnn-generating-realistic-graphs-with","title":"GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models","date":"2018-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-stanford/GraphRNN","path":"evaluate.py","file_url":"https://github.com/snap-stanford/GraphRNN/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a39feeeaa3cceac3","mcp_get_code":{"code_sha256":"a39feeeaa3cceac3"}},{"arxiv_id":"1802.08773","paper":"/paper/graphrnn-generating-realistic-graphs-with","title":"GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models","date":"2018-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-stanford/GraphRNN","path":"analysis.py","file_url":"https://github.com/snap-stanford/GraphRNN/blob/HEAD/analysis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4c7a3523d6683b3a","mcp_get_code":{"code_sha256":"4c7a3523d6683b3a"}}]}