{"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-loss","entry":"chamfer_loss","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":0,"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":0,"ran_fixture":1,"ran":2,"unverified":2},"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":"2212.06331","arxiv_id_is_arxiv":true,"paper":"/paper/deepmapping2-self-supervised-large-scale","title":"DeepMapping2: Self-Supervised Large-Scale LiDAR Map Optimization","date":"2022-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4ce/DeepMapping2","path":"loss/chamfer_dist.py","file_url":"https://github.com/ai4ce/DeepMapping2/blob/HEAD/loss/chamfer_dist.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":"fb4d5906d5f4e5fb","code_sha256_prefix":"fb4d5906d5f4e5fb","mcp_get_code":{"code_sha256":"fb4d5906d5f4e5fb"}},{"arxiv_id":"2106.13679","arxiv_id_is_arxiv":true,"paper":"/paper/shape-registration-in-the-time-of","title":"Shape registration in the time of transformers","date":"2021-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GiovanniTRA/transmatching","path":"transmatching/Utils/utils.py","file_url":"https://github.com/GiovanniTRA/transmatching/blob/HEAD/transmatching/Utils/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bfc7a8a93a90581d","code_sha256_prefix":"bfc7a8a93a90581d","mcp_get_code":{"code_sha256":"bfc7a8a93a90581d"}},{"arxiv_id":"2103.15619","arxiv_id_is_arxiv":true,"paper":"/paper/setvae-learning-hierarchical-composition-for","title":"SetVAE: Learning Hierarchical Composition for Generative Modeling of Set-Structured Data","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jw9730/setvae","path":"models/networks.py","file_url":"https://github.com/jw9730/setvae/blob/HEAD/models/networks.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"42c489cac0ddf783","code_sha256_prefix":"42c489cac0ddf783","mcp_get_code":{"code_sha256":"42c489cac0ddf783"}},{"arxiv_id":"1908.04725","arxiv_id_is_arxiv":true,"paper":"/paper/learning-elementary-structures-for-3d-shape","title":"Learning elementary structures for 3D shape generation and matching","date":"2019-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RobinBaumann/TF-AtlasNetV2","path":"atlasnet_v2/loss.py","file_url":"https://github.com/RobinBaumann/TF-AtlasNetV2/blob/HEAD/atlasnet_v2/loss.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":"663072eb30c6ff8c","code_sha256_prefix":"663072eb30c6ff8c","mcp_get_code":{"code_sha256":"663072eb30c6ff8c"}},{"arxiv_id":"1906.06565","arxiv_id_is_arxiv":true,"paper":"/paper/deep-set-prediction-networks","title":"Deep Set Prediction Networks","date":"2019-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cyanogenoid/dspn","path":"dspn/utils.py","file_url":"https://github.com/Cyanogenoid/dspn/blob/HEAD/dspn/utils.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":"4bdbdc8b3194a14c","code_sha256_prefix":"4bdbdc8b3194a14c","mcp_get_code":{"code_sha256":"4bdbdc8b3194a14c"}},{"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":"0a1ea77d65404236","code_sha256_prefix":"0a1ea77d65404236","mcp_get_code":{"code_sha256":"0a1ea77d65404236"}}],"record_sha256":"183546ccdbf8a6f01b9a54584b3e9d6c57bc7dab2536d726a309ae60bf77d5d6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}