{"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/find-nearest","entry":"find_nearest","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":16,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":13,"n_papers_ran_instrument_only":3,"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":13,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":10,"n_places":16,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":1,"ran_draft_wrong":0,"ran_fixture":2,"ran":10,"unverified":0},"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":"2412.07277","arxiv_id_is_arxiv":true,"paper":"/paper/backdoor-attacks-against-no-reference-image","title":"Backdoor Attacks against No-Reference Image Quality Assessment Models via a Scalable Trigger","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyi-sd/baiqa","path":"HyperIQASolver_multi_v6.py","file_url":"https://github.com/yuyi-sd/baiqa/blob/HEAD/HyperIQASolver_multi_v6.py","status":"ran","verification_level":1,"contract_check":null,"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, yuyi-sd/baiqa when it was checked","code_sha256":"a82dce4b3a95f2b1","code_sha256_prefix":"a82dce4b3a95f2b1","mcp_get_code":{"code_sha256":"a82dce4b3a95f2b1"}},{"arxiv_id":"2407.05789","arxiv_id_is_arxiv":true,"paper":"/paper/candid-dac-leveraging-coupled-action","title":"CANDID DAC: Leveraging Coupled Action Dimensions with Importance Differences in DAC","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"philippbordne/candiddac","path":"analysis/plotting_nb/plotting_helpers.py","file_url":"https://github.com/philippbordne/candiddac/blob/HEAD/analysis/plotting_nb/plotting_helpers.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"59ddea48839ef729","code_sha256_prefix":"59ddea48839ef729","mcp_get_code":{"code_sha256":"59ddea48839ef729"}},{"arxiv_id":"2311.11600","arxiv_id_is_arxiv":true,"paper":"/paper/deep-equilibrium-diffusion-restoration-with","title":"Deep Equilibrium Diffusion Restoration with Parallel Sampling","date":"2023-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caojiezhang/deqir","path":"utils/utils_model.py","file_url":"https://github.com/caojiezhang/deqir/blob/HEAD/utils/utils_model.py","status":"ran","verification_level":1,"contract_check":null,"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, caojiezhang/deqir when it was checked","code_sha256":"e180ab043e88b4f0","code_sha256_prefix":"e180ab043e88b4f0","mcp_get_code":{"code_sha256":"e180ab043e88b4f0"}},{"arxiv_id":"2210.01917","arxiv_id_is_arxiv":true,"paper":"/paper/dfferentiable-raycasting-for-self-supervised","title":"Differentiable Raycasting for Self-supervised Occupancy Forecasting","date":"2022-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tarashakhurana/emergent-occ-forecasting","path":"data.py","file_url":"https://github.com/tarashakhurana/emergent-occ-forecasting/blob/HEAD/data.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":"6d8bb2f8e90e3f0e","code_sha256_prefix":"6d8bb2f8e90e3f0e","mcp_get_code":{"code_sha256":"6d8bb2f8e90e3f0e"}},{"arxiv_id":"2207.01898","arxiv_id_is_arxiv":true,"paper":"/paper/even-if-diverse-semifactual-explanations-of","title":"\"Even if ...\" -- Diverse Semifactual Explanations of Reject","date":"2022-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andreartelt/diversesemifactualsreject","path":"Implementation/modelselection.py","file_url":"https://github.com/andreartelt/diversesemifactualsreject/blob/HEAD/Implementation/modelselection.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":"579fa0d53f14ed26","code_sha256_prefix":"579fa0d53f14ed26","mcp_get_code":{"code_sha256":"579fa0d53f14ed26"}},{"arxiv_id":"2203.01929","arxiv_id_is_arxiv":true,"paper":"/paper/centersnap-single-shot-multi-object-3d-shape","title":"CenterSnap: Single-Shot Multi-Object 3D Shape Reconstruction and Categorical 6D Pose and Size Estimation","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibaiGorordo/ONNX-CenterSnap-6D-Pose-and-Shape-Estimation","path":"centersnap/original_repo_utils.py","file_url":"https://github.com/ibaiGorordo/ONNX-CenterSnap-6D-Pose-and-Shape-Estimation/blob/HEAD/centersnap/original_repo_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":"764464f2d8106e6f","code_sha256_prefix":"764464f2d8106e6f","mcp_get_code":{"code_sha256":"764464f2d8106e6f"}},{"arxiv_id":"2112.11716","arxiv_id_is_arxiv":true,"paper":"/paper/comparing-radiologists-gaze-and-saliency-maps","title":"Comparing radiologists' gaze and saliency maps generated by interpretability methods for chest x-rays","date":"2021-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ricbl/etsaliencymaps","path":"src/get_segmentation_baseline.py","file_url":"https://github.com/ricbl/etsaliencymaps/blob/HEAD/src/get_segmentation_baseline.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":"1ed2739588f5bbbe","code_sha256_prefix":"1ed2739588f5bbbe","mcp_get_code":{"code_sha256":"1ed2739588f5bbbe"}},{"arxiv_id":"2110.13151","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-similarity-search-for-large","title":"Self-supervised similarity search for large scientific datasets","date":"2021-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"georgestein/ssl-legacysurvey","path":"scripts/similarity_search_nxn.py","file_url":"https://github.com/georgestein/ssl-legacysurvey/blob/HEAD/scripts/similarity_search_nxn.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2b9700703933892f","code_sha256_prefix":"2b9700703933892f","mcp_get_code":{"code_sha256":"2b9700703933892f"}},{"arxiv_id":"2104.09952","arxiv_id_is_arxiv":true,"paper":"/paper/mgsampler-an-explainable-sampling-strategy","title":"MGSampler: An Explainable Sampling Strategy for Video Action Recognition","date":"2021-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MCG-NJU/MGSampler","path":"generate_feature_diff.py","file_url":"https://github.com/MCG-NJU/MGSampler/blob/HEAD/generate_feature_diff.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from caojiezhang/deqir, and GitHub detected no licence in that repository when it was checked","code_sha256":"e180ab043e88b4f0","code_sha256_prefix":"e180ab043e88b4f0","mcp_get_code":{"code_sha256":"e180ab043e88b4f0"}},{"arxiv_id":"2004.12360","arxiv_id_is_arxiv":true,"paper":"/paper/learning-molecular-dynamics-with-simple","title":"Learning Molecular Dynamics with Simple Language Model built upon Long Short-Term Memory Neural Network","date":null,"month_inferred_from_arxiv_id":"2020-04","title_source":"archive","repo":"Lina492375qW1188/LSTM-predict-MD","path":"LSTM_LM_4s.py","file_url":"https://github.com/Lina492375qW1188/LSTM-predict-MD/blob/HEAD/LSTM_LM_4s.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, Lina492375qW1188/LSTM-predict-MD when it was checked","code_sha256":"d8002dfc644128c6","code_sha256_prefix":"d8002dfc644128c6","mcp_get_code":{"code_sha256":"d8002dfc644128c6"}},{"arxiv_id":"2002.06483","arxiv_id_is_arxiv":true,"paper":"/paper/face-recognition-too-bias-or-not-too-bias","title":"Face Recognition: Too Bias, or Not Too Bias?","date":"2020-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visionjo/facerec-bias-bfw","path":"code/experiments/calculate_tar_at_far_table.py","file_url":"https://github.com/visionjo/facerec-bias-bfw/blob/HEAD/code/experiments/calculate_tar_at_far_table.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":"0bd0953befe9d261","code_sha256_prefix":"0bd0953befe9d261","mcp_get_code":{"code_sha256":"0bd0953befe9d261"}},{"arxiv_id":"1909.12285","arxiv_id_is_arxiv":true,"paper":"/paper/interaction-networks-for-the-identification","title":"Interaction networks for the identification of boosted $H\\to b\\overline{b}$ decays","date":null,"month_inferred_from_arxiv_id":"2019-09","title_source":"archive","repo":"jmduarte/capstone-particle-physics-domain","path":"weeks/utils.py","file_url":"https://github.com/jmduarte/capstone-particle-physics-domain/blob/HEAD/weeks/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2b9700703933892f","code_sha256_prefix":"2b9700703933892f","mcp_get_code":{"code_sha256":"2b9700703933892f"}},{"arxiv_id":"1906.07132","arxiv_id_is_arxiv":true,"paper":"/paper/avoiding-reasoning-shortcuts-adversarial","title":"Avoiding Reasoning Shortcuts: Adversarial Evaluation, Training, and Model Development for Multi-Hop QA","date":"2019-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangycTarheel/Adversarial-MultiHopQA","path":"nearest_glove/get_nearest.py","file_url":"https://github.com/jiangycTarheel/Adversarial-MultiHopQA/blob/HEAD/nearest_glove/get_nearest.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":"2e226d735609d4e1","code_sha256_prefix":"2e226d735609d4e1","mcp_get_code":{"code_sha256":"2e226d735609d4e1"}},{"arxiv_id":"1809.09600","arxiv_id_is_arxiv":true,"paper":"/paper/hotpotqa-a-dataset-for-diverse-explainable","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","date":"2018-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hotpotqa/hotpot","path":"prepro.py","file_url":"https://github.com/hotpotqa/hotpot/blob/HEAD/prepro.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":"5733fa44ca6deb1f","code_sha256_prefix":"5733fa44ca6deb1f","mcp_get_code":{"code_sha256":"5733fa44ca6deb1f"}},{"arxiv_id":"1702.06234","arxiv_id_is_arxiv":true,"paper":"/paper/easily-parallelizable-and-distributable-class","title":"Easily parallelizable and distributable class of algorithms for structured sparsity, with optimal acceleration","date":"2017-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kose-y/dist-primal-dual","path":"dist_pd/utils.py","file_url":"https://github.com/kose-y/dist-primal-dual/blob/HEAD/dist_pd/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":"9f7aa7b4ea0da26d","code_sha256_prefix":"9f7aa7b4ea0da26d","mcp_get_code":{"code_sha256":"9f7aa7b4ea0da26d"}},{"arxiv_id":"1612.05560","arxiv_id_is_arxiv":true,"paper":"/paper/the-pan-starrs1-surveys","title":"The Pan-STARRS1 Surveys","date":null,"month_inferred_from_arxiv_id":"2016-12","title_source":"archive","repo":"sshah1502/irgsc","path":"generated_irgsc/partial_irgsc_for_test_fields/tf2/try_mix_selectivekp_model.py","file_url":"https://github.com/sshah1502/irgsc/blob/HEAD/generated_irgsc/partial_irgsc_for_test_fields/tf2/try_mix_selectivekp_model.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":"0bd0953befe9d261","code_sha256_prefix":"0bd0953befe9d261","mcp_get_code":{"code_sha256":"0bd0953befe9d261"}}],"record_sha256":"56dba5534cb502e809b95b3fb648419cfff03fb381a1870838bc4c1b185fbc38","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}