{"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/chamfer-distance","entry":"chamfer_distance","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":8,"n_papers_ran_no_instrument_failure":7,"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":15,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":2,"n_samples_unverified":6,"n_samples_fingerprinted":4,"n_places":18,"n_places_pointer_only":7,"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":1,"ran_draft_wrong":1,"ran_fixture":1,"ran":6,"unverified":6},"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":"2605.01171","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01171","title":"CADFit: Precise Mesh-to-CAD Program Generation with Hybrid Optimization","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ghadinehme/CADFit","path":"analyze_loop_translation.py","file_url":"https://github.com/ghadinehme/CADFit/blob/HEAD/analyze_loop_translation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ghadinehme/CADFit (NOASSERTION)","code_sha256":"60b5af3eeb1bd12c","code_sha256_prefix":"60b5af3eeb1bd12c","mcp_get_code":{"code_sha256":"60b5af3eeb1bd12c"}},{"arxiv_id":"2605.01171","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01171","title":"CADFit: Precise Mesh-to-CAD Program Generation with Hybrid Optimization","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ghadinehme/CADFit","path":"analyze_revolve_axis.py","file_url":"https://github.com/ghadinehme/CADFit/blob/HEAD/analyze_revolve_axis.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ghadinehme/CADFit (NOASSERTION)","code_sha256":"5b3963c58f11f90f","code_sha256_prefix":"5b3963c58f11f90f","mcp_get_code":{"code_sha256":"5b3963c58f11f90f"}},{"arxiv_id":"2410.02101","arxiv_id_is_arxiv":true,"paper":"/paper/orient-anything","title":"Symmetry-Robust 3D Orientation Estimation","date":"2024-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cscarv/3d-orienter","path":"utils/losses.py","file_url":"https://github.com/cscarv/3d-orienter/blob/HEAD/utils/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, cscarv/3d-orienter, is not in the permissive set Syntology serves inline","code_sha256":"782097a83466299d","code_sha256_prefix":"782097a83466299d","mcp_get_code":{"code_sha256":"782097a83466299d"}},{"arxiv_id":"2310.01678","arxiv_id_is_arxiv":true,"paper":"/paper/score-dynamics-scaling-molecular-dynamics","title":"Score dynamics: scaling molecular dynamics with picoseconds timestep via conditional diffusion model","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llnl/graphite","path":"src/graphite/nn/loss.py","file_url":"https://github.com/llnl/graphite/blob/HEAD/src/graphite/nn/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"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, llnl/graphite (NOASSERTION)","code_sha256":"137215967efdffce","code_sha256_prefix":"137215967efdffce","mcp_get_code":{"code_sha256":"137215967efdffce"}},{"arxiv_id":"2309.05098","arxiv_id_is_arxiv":true,"paper":"/paper/3d-implicit-transporter-for-temporally","title":"3D Implicit Transporter for Temporally Consistent Keypoint Discovery","date":"2023-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongcl-thu/3D-Implicit-Transporter","path":"core/nets/common.py","file_url":"https://github.com/zhongcl-thu/3D-Implicit-Transporter/blob/HEAD/core/nets/common.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":"f4d8f4c4d0f7da71","code_sha256_prefix":"f4d8f4c4d0f7da71","mcp_get_code":{"code_sha256":"f4d8f4c4d0f7da71"}},{"arxiv_id":"2304.11379","arxiv_id_is_arxiv":true,"paper":"/paper/lidar2map-in-defense-of-lidar-based-semantic","title":"LiDAR2Map: In Defense of LiDAR-Based Semantic Map Construction Using Online Camera Distillation","date":"2023-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"songw-zju/LiDAR2Map","path":"map/evaluation/chamfer_distance.py","file_url":"https://github.com/songw-zju/LiDAR2Map/blob/HEAD/map/evaluation/chamfer_distance.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":"bd2738dcfbe8cea9","code_sha256_prefix":"bd2738dcfbe8cea9","mcp_get_code":{"code_sha256":"bd2738dcfbe8cea9"}},{"arxiv_id":"2206.01724","arxiv_id_is_arxiv":true,"paper":"/paper/snake-shape-aware-neural-3d-keypoint-field","title":"SNAKE: Shape-aware Neural 3D Keypoint Field","date":"2022-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongcl-thu/SNAKE","path":"core/nets/common.py","file_url":"https://github.com/zhongcl-thu/SNAKE/blob/HEAD/core/nets/common.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":"f4d8f4c4d0f7da71","code_sha256_prefix":"f4d8f4c4d0f7da71","mcp_get_code":{"code_sha256":"f4d8f4c4d0f7da71"}},{"arxiv_id":"2204.01264","arxiv_id_is_arxiv":true,"paper":"/paper/probabilistic-implicit-scene-completion-1","title":"Probabilistic Implicit Scene Completion","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"96lives/gca","path":"baselines/common.py","file_url":"https://github.com/96lives/gca/blob/HEAD/baselines/common.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":"abfc6cc1d6dbd59b","code_sha256_prefix":"abfc6cc1d6dbd59b","mcp_get_code":{"code_sha256":"abfc6cc1d6dbd59b"}},{"arxiv_id":"2203.16832","arxiv_id_is_arxiv":true,"paper":"/paper/point-scene-understanding-via-disentangled","title":"Point Scene Understanding via Disentangled Instance Mesh Reconstruction","date":"2022-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ashawkey/dimr","path":"evaluation/cd/metrics.py","file_url":"https://github.com/ashawkey/dimr/blob/HEAD/evaluation/cd/metrics.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":"db0ecf50d179a176","code_sha256_prefix":"db0ecf50d179a176","mcp_get_code":{"code_sha256":"db0ecf50d179a176"}},{"arxiv_id":"2203.03833","arxiv_id_is_arxiv":true,"paper":"/paper/quasi-balanced-self-training-on-noise-aware","title":"Quasi-Balanced Self-Training on Noise-Aware Synthesis of Object Point Clouds for Closing Domain Gap","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gorilla-Lab-SCUT/QS3","path":"DefRec.py","file_url":"https://github.com/Gorilla-Lab-SCUT/QS3/blob/HEAD/DefRec.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":"f3aebb3c24fe89d6","code_sha256_prefix":"f3aebb3c24fe89d6","mcp_get_code":{"code_sha256":"f3aebb3c24fe89d6"}},{"arxiv_id":"2107.06307","arxiv_id_is_arxiv":true,"paper":"/paper/hdmapnet-an-online-hd-map-construction-and","title":"HDMapNet: An Online HD Map Construction and Evaluation Framework","date":"2021-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HFAiLab/hdmapnet","path":"evaluation/chamfer_distance.py","file_url":"https://github.com/HFAiLab/hdmapnet/blob/HEAD/evaluation/chamfer_distance.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":"bd2738dcfbe8cea9","code_sha256_prefix":"bd2738dcfbe8cea9","mcp_get_code":{"code_sha256":"bd2738dcfbe8cea9"}},{"arxiv_id":"2107.01899","arxiv_id_is_arxiv":true,"paper":"/paper/ray-onet-efficient-3d-reconstruction-from-a","title":"Ray-ONet: Efficient 3D Reconstruction From A Single RGB Image","date":"2021-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ActiveVisionLab/ray-onet","path":"im2mesh/common.py","file_url":"https://github.com/ActiveVisionLab/ray-onet/blob/HEAD/im2mesh/common.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":"f4d8f4c4d0f7da71","code_sha256_prefix":"f4d8f4c4d0f7da71","mcp_get_code":{"code_sha256":"f4d8f4c4d0f7da71"}},{"arxiv_id":"2008.06471","arxiv_id_is_arxiv":true,"paper":"/paper/self-sampling-for-neural-point-cloud","title":"Self-Sampling for Neural Point Cloud Consolidation","date":"2020-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"galmetzer/self-sample","path":"losses.py","file_url":"https://github.com/galmetzer/self-sample/blob/HEAD/losses.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":"ffba37a04755f124","code_sha256_prefix":"ffba37a04755f124","mcp_get_code":{"code_sha256":"ffba37a04755f124"}},{"arxiv_id":"2004.02693","arxiv_id_is_arxiv":true,"paper":"/paper/finding-your-3d-center-3d-object-detection","title":"Finding Your (3D) Center: 3D Object Detection Using a Learned Loss","date":"2020-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dgriffiths3/finding-your-center","path":"utils/losses.py","file_url":"https://github.com/dgriffiths3/finding-your-center/blob/HEAD/utils/losses.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":"08fd7e4daf7b69ef","code_sha256_prefix":"08fd7e4daf7b69ef","mcp_get_code":{"code_sha256":"08fd7e4daf7b69ef"}},{"arxiv_id":"2003.13479","arxiv_id_is_arxiv":true,"paper":"/paper/2003-13479","title":"RPM-Net: Robust Point Matching using Learned Features","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinits5/masknet","path":"learning3d/losses/chamfer_distance.py","file_url":"https://github.com/vinits5/masknet/blob/HEAD/learning3d/losses/chamfer_distance.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, vinits5/masknet, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"1adcfbd14aa61be6","code_sha256_prefix":"1adcfbd14aa61be6","mcp_get_code":{"code_sha256":"1adcfbd14aa61be6"}},{"arxiv_id":"2003.12641","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-for-domain","title":"Self-Supervised Learning for Domain Adaptation on Point-Clouds","date":"2020-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IdanAchituve/DefRec_and_PCM","path":"DefRec_and_PCM/DefRec.py","file_url":"https://github.com/IdanAchituve/DefRec_and_PCM/blob/HEAD/DefRec_and_PCM/DefRec.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, IdanAchituve/DefRec_and_PCM when it was checked","code_sha256":"ab0adee9afdcd4d0","code_sha256_prefix":"ab0adee9afdcd4d0","mcp_get_code":{"code_sha256":"ab0adee9afdcd4d0"}},{"arxiv_id":"1908.09186","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-learning-on-point-clouds-with-basis","title":"Efficient Learning on Point Clouds with Basis Point Sets","date":"2019-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sergeyprokudin/bps","path":"bps_demos/chamfer_distance.py","file_url":"https://github.com/sergeyprokudin/bps/blob/HEAD/bps_demos/chamfer_distance.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT-0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT-0, as GitHub detects it on this paper's repository, sergeyprokudin/bps, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"0125e5be33ffc62f","code_sha256_prefix":"0125e5be33ffc62f","mcp_get_code":{"code_sha256":"0125e5be33ffc62f"}},{"arxiv_id":"1905.06292","arxiv_id_is_arxiv":true,"paper":"/paper/3d-point-cloud-generative-adversarial-network","title":"3D Point Cloud Generative Adversarial Network Based on Tree Structured Graph Convolutions","date":"2019-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prajwalsingh/TreeGCN-ED","path":"losses.py","file_url":"https://github.com/prajwalsingh/TreeGCN-ED/blob/HEAD/losses.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":"d55242abeb8deaae","code_sha256_prefix":"d55242abeb8deaae","mcp_get_code":{"code_sha256":"d55242abeb8deaae"}}],"record_sha256":"87094929944b9c2990c2744f58253ffe3da9b06e0b34b5a82e8a9349ecd0b0e5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}