{"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/compute-distances","entry":"compute_distances","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":10,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":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":10,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":3,"n_places":11,"n_places_pointer_only":5,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":4,"unverified":4},"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":"2602.17975","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-17975","title":"Generating adversarial inputs for a graph neural network model of AC power flow","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Robbybp/pfdelta","path":"con_error_summary.py","file_url":"https://github.com/Robbybp/pfdelta/blob/HEAD/con_error_summary.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":"dc8b6b364f653085","code_sha256_prefix":"dc8b6b364f653085","mcp_get_code":{"code_sha256":"dc8b6b364f653085"}},{"arxiv_id":"2409.03662","arxiv_id_is_arxiv":true,"paper":"/paper/the-representation-landscape-of-few-shot","title":"The representation landscape of few-shot learning and fine-tuning in large language models","date":"2024-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diegodoimo/geometry_icl_finetuning","path":"extraction/pairwise_distances.py","file_url":"https://github.com/diegodoimo/geometry_icl_finetuning/blob/HEAD/extraction/pairwise_distances.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, diegodoimo/geometry_icl_finetuning when it was checked","code_sha256":"d371140435e592be","code_sha256_prefix":"d371140435e592be","mcp_get_code":{"code_sha256":"d371140435e592be"}},{"arxiv_id":"2406.01561","arxiv_id_is_arxiv":true,"paper":"/paper/long-and-short-guidance-in-score-identity","title":"Long and Short Guidance in Score identity Distillation for One-Step Text-to-Image Generation","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingyuanzhou/SiD-LSG","path":"metrics/sid_precision_recall.py","file_url":"https://github.com/mingyuanzhou/SiD-LSG/blob/HEAD/metrics/sid_precision_recall.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":"790b320b90341326","code_sha256_prefix":"790b320b90341326","mcp_get_code":{"code_sha256":"790b320b90341326"}},{"arxiv_id":"2406.00721","arxiv_id_is_arxiv":true,"paper":"/paper/explore-internal-and-external-similarity-for","title":"Explore Internal and External Similarity for Single Image Deraining with Graph Neural Networks","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"supersupercong/MSGNN","path":"msgnn/config/graph/graph_module.py","file_url":"https://github.com/supersupercong/MSGNN/blob/HEAD/msgnn/config/graph/graph_module.py","status":"unverified","verification_level":0,"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, supersupercong/MSGNN when it was checked","code_sha256":"053a40727da7d7d6","code_sha256_prefix":"053a40727da7d7d6","mcp_get_code":{"code_sha256":"053a40727da7d7d6"}},{"arxiv_id":"2406.00721","arxiv_id_is_arxiv":true,"paper":"/paper/explore-internal-and-external-similarity-for","title":"Explore Internal and External Similarity for Single Image Deraining with Graph Neural Networks","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"supersupercong/msgnn","path":"msgnn/config/graph/graph_agg.py","file_url":"https://github.com/supersupercong/msgnn/blob/HEAD/msgnn/config/graph/graph_agg.py","status":"unverified","verification_level":0,"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, supersupercong/msgnn when it was checked","code_sha256":"6235338c52d1b7e2","code_sha256_prefix":"6235338c52d1b7e2","mcp_get_code":{"code_sha256":"6235338c52d1b7e2"}},{"arxiv_id":"2404.06453","arxiv_id_is_arxiv":true,"paper":"/paper/pure-turning-polysemantic-neurons-into-pure","title":"PURE: Turning Polysemantic Neurons Into Pure Features by Identifying Relevant Circuits","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maxdreyer/pure","path":"experiments/disentangling/eval_CLIP_alignment.py","file_url":"https://github.com/maxdreyer/pure/blob/HEAD/experiments/disentangling/eval_CLIP_alignment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3879cca40ffb1d1e","code_sha256_prefix":"3879cca40ffb1d1e","mcp_get_code":{"code_sha256":"3879cca40ffb1d1e"}},{"arxiv_id":"2404.04057","arxiv_id_is_arxiv":true,"paper":"/paper/score-identity-distillation-exponentially","title":"Score identity Distillation: Exponentially Fast Distillation of Pretrained Diffusion Models for One-Step Generation","date":"2024-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingyuanzhou/SiD","path":"metrics/sid_precision_recall.py","file_url":"https://github.com/mingyuanzhou/SiD/blob/HEAD/metrics/sid_precision_recall.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":"790b320b90341326","code_sha256_prefix":"790b320b90341326","mcp_get_code":{"code_sha256":"790b320b90341326"}},{"arxiv_id":"2211.05314","arxiv_id_is_arxiv":true,"paper":"/paper/disc-differential-spectral-clustering-of","title":"DiSC: Differential Spectral Clustering of Features","date":"2022-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mishne-lab/disc","path":"helper_functions.py","file_url":"https://github.com/mishne-lab/disc/blob/HEAD/helper_functions.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mishne-lab/disc when it was checked","code_sha256":"12b4d333db24f46a","code_sha256_prefix":"12b4d333db24f46a","mcp_get_code":{"code_sha256":"12b4d333db24f46a"}},{"arxiv_id":"2110.06672","arxiv_id_is_arxiv":true,"paper":"/paper/the-deep-generative-decoder-using-map-1","title":"The Deep Generative Decoder: MAP estimation of representations improves modeling of single-cell RNA data","date":"2021-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Center-for-Health-Data-Science/scDGD","path":"scDGD/functions/analysis.py","file_url":"https://github.com/Center-for-Health-Data-Science/scDGD/blob/HEAD/scDGD/functions/analysis.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":"eca70d88d14b7499","code_sha256_prefix":"eca70d88d14b7499","mcp_get_code":{"code_sha256":"eca70d88d14b7499"}},{"arxiv_id":"1904.04882","arxiv_id_is_arxiv":true,"paper":"/paper/contextual-attention-for-hand-detection-in","title":"Contextual Attention for Hand Detection in the Wild","date":"2019-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SupreethN/Hand-CNN","path":"mrcnn/contextual_attention.py","file_url":"https://github.com/SupreethN/Hand-CNN/blob/HEAD/mrcnn/contextual_attention.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, SupreethN/Hand-CNN (NOASSERTION)","code_sha256":"31f997be24b7baf8","code_sha256_prefix":"31f997be24b7baf8","mcp_get_code":{"code_sha256":"31f997be24b7baf8"}},{"arxiv_id":"1812.04246","arxiv_id_is_arxiv":true,"paper":"/paper/classification-reconstruction-learning-for","title":"Classification-Reconstruction Learning for Open-Set Recognition","date":"2018-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saketd403/CROSR","path":"compute_distances.py","file_url":"https://github.com/saketd403/CROSR/blob/HEAD/compute_distances.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":"d1dbc1358d595b06","code_sha256_prefix":"d1dbc1358d595b06","mcp_get_code":{"code_sha256":"d1dbc1358d595b06"}}],"record_sha256":"9b6cc63475a32116af5c2c7d3fd42710408fcad84417143bd43b3754747696e7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}