{"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/nearest-neighbor","entry":"nearest_neighbor","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":12,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":0,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":12,"n_places_pointer_only":6,"n_places_pointer_only_link_open":3,"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":2,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":1},"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":"2407.20299","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-distillation-for-offline","title":"Dataset Distillation for Offline Reinforcement Learning","date":"2024-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princetonvisualai/multimodal_dataset_distillation","path":"distill.py","file_url":"https://github.com/princetonvisualai/multimodal_dataset_distillation/blob/HEAD/distill.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, princetonvisualai/multimodal_dataset_distillation when it was checked","code_sha256":"c84ddf44fce519da","code_sha256_prefix":"c84ddf44fce519da","mcp_get_code":{"code_sha256":"c84ddf44fce519da"}},{"arxiv_id":"2406.03793","arxiv_id_is_arxiv":true,"paper":"/paper/low-rank-similarity-mining-for-multimodal","title":"Low-Rank Similarity Mining for Multimodal Dataset Distillation","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"silicx/LoRS_Distill","path":"src/vl_distill_utils.py","file_url":"https://github.com/silicx/LoRS_Distill/blob/HEAD/src/vl_distill_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from princetonvisualai/multimodal_dataset_distillation, and GitHub detected no licence in that repository when it was checked","code_sha256":"c84ddf44fce519da","code_sha256_prefix":"c84ddf44fce519da","mcp_get_code":{"code_sha256":"c84ddf44fce519da"}},{"arxiv_id":"2402.17351","arxiv_id_is_arxiv":true,"paper":"/paper/icp-flow-lidar-scene-flow-estimation-with-icp","title":"ICP-Flow: LiDAR Scene Flow Estimation with ICP","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanconglin/icp-flow","path":"utils_helper.py","file_url":"https://github.com/yanconglin/icp-flow/blob/HEAD/utils_helper.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"909bc990df90a728","code_sha256_prefix":"909bc990df90a728","mcp_get_code":{"code_sha256":"909bc990df90a728"}},{"arxiv_id":"2402.04915","arxiv_id_is_arxiv":true,"paper":"/paper/moco-a-learnable-meta-optimizer-for","title":"Moco: A Learnable Meta Optimizer for Combinatorial Optimization","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"timd3/moco","path":"moco/tsp_actors.py","file_url":"https://github.com/timd3/moco/blob/HEAD/moco/tsp_actors.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":"02ad115e2c22c22b","code_sha256_prefix":"02ad115e2c22c22b","mcp_get_code":{"code_sha256":"02ad115e2c22c22b"}},{"arxiv_id":"2308.07545","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-dataset-distillation-for-image","title":"Vision-Language Dataset Distillation","date":"2023-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"c84ddf44fce519da","code_sha256_prefix":"c84ddf44fce519da","mcp_get_code":{"code_sha256":"c84ddf44fce519da"}},{"arxiv_id":"2307.01770","arxiv_id_is_arxiv":true,"paper":"/paper/fast-optimal-transport-through-sliced","title":"Fast Optimal Transport through Sliced Wasserstein Generalized Geodesics","date":"2023-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaheyG/SWGG","path":"code/ICP.py","file_url":"https://github.com/MaheyG/SWGG/blob/HEAD/code/ICP.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":"06574dd18197d712","code_sha256_prefix":"06574dd18197d712","mcp_get_code":{"code_sha256":"06574dd18197d712"}},{"arxiv_id":"2303.02442","arxiv_id_is_arxiv":true,"paper":"/paper/neural-airport-ground-handling","title":"Neural Airport Ground Handling","date":"2023-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"royalskye/agh","path":"Construction_based/agh_baseline.py","file_url":"https://github.com/royalskye/agh/blob/HEAD/Construction_based/agh_baseline.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":"0968a04fa663c687","code_sha256_prefix":"0968a04fa663c687","mcp_get_code":{"code_sha256":"0968a04fa663c687"}},{"arxiv_id":"2112.12053","arxiv_id_is_arxiv":true,"paper":"/paper/multi-view-partial-mvp-point-cloud-challenge","title":"Multi-View Partial (MVP) Point Cloud Challenge 2021 on Completion and Registration: Methods and Results","date":"2021-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paul007pl/MVP_Benchmark","path":"registration/model_utils.py","file_url":"https://github.com/paul007pl/MVP_Benchmark/blob/HEAD/registration/model_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","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 WangYueFt/dcp, and GitHub detected no licence in that repository when it was checked","code_sha256":"fd310351a155056f","code_sha256_prefix":"fd310351a155056f","mcp_get_code":{"code_sha256":"fd310351a155056f"}},{"arxiv_id":"2110.02210","arxiv_id_is_arxiv":true,"paper":"/paper/mix3d-out-of-context-data-augmentation-for-3d","title":"Mix3D: Out-of-Context Data Augmentation for 3D Scenes","date":"2021-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TejasAnvekar/Mahalanobis-k-NN","path":"DeepUME/model.py","file_url":"https://github.com/TejasAnvekar/Mahalanobis-k-NN/blob/HEAD/DeepUME/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from WangYueFt/dcp, and GitHub detected no licence in that repository when it was checked","code_sha256":"fd310351a155056f","code_sha256_prefix":"fd310351a155056f","mcp_get_code":{"code_sha256":"fd310351a155056f"}},{"arxiv_id":"1905.03304","arxiv_id_is_arxiv":true,"paper":"/paper/190503304","title":"Deep Closest Point: Learning Representations for Point Cloud Registration","date":"2019-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WangYueFt/dcp","path":"model.py","file_url":"https://github.com/WangYueFt/dcp/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"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, WangYueFt/dcp when it was checked","code_sha256":"fd310351a155056f","code_sha256_prefix":"fd310351a155056f","mcp_get_code":{"code_sha256":"fd310351a155056f"}},{"arxiv_id":"1807.07796","arxiv_id_is_arxiv":true,"paper":"/paper/3d-lmnet-latent-embedding-matching-for","title":"3D-LMNet: Latent Embedding Matching for Accurate and Diverse 3D Point Cloud Reconstruction from a Single Image","date":"2018-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/3d-lmnet","path":"utils/icp.py","file_url":"https://github.com/val-iisc/3d-lmnet/blob/HEAD/utils/icp.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":"7c2aebd32888bd07","code_sha256_prefix":"7c2aebd32888bd07","mcp_get_code":{"code_sha256":"7c2aebd32888bd07"}},{"arxiv_id":"1804.04168","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-learning-of-quantum-circuit","title":"Differentiable Learning of Quantum Circuit Born Machine","date":"2018-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GiggleLiu/QuantumCircuitBornMachine","path":"qcbm/structure.py","file_url":"https://github.com/GiggleLiu/QuantumCircuitBornMachine/blob/HEAD/qcbm/structure.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":"2d0e7e62df60ffa6","code_sha256_prefix":"2d0e7e62df60ffa6","mcp_get_code":{"code_sha256":"2d0e7e62df60ffa6"}}],"record_sha256":"826e0a9f2a945215a2dbb433baa98f8e82622beac7e70e8a08272f0325a501a7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}