{"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/cdist","entry":"cdist","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":13,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":9,"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":10,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":14,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":5,"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":"2606.30778","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-30778","title":"ReactionAtlas: Ab origine exploration of chemical reaction networks with machine learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"mx-e/md-et","path":"src/md_et/nn/pair_encoder.py","file_url":"https://github.com/mx-e/md-et/blob/HEAD/src/md_et/nn/pair_encoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3e0a833b1a4124df","code_sha256_prefix":"3e0a833b1a4124df","mcp_get_code":{"code_sha256":"3e0a833b1a4124df"}},{"arxiv_id":"2503.07940","arxiv_id_is_arxiv":true,"paper":"/paper/buffer-x-towards-zero-shot-point-cloud","title":"BUFFER-X: Towards Zero-Shot Point Cloud Registration in Diverse Scenes","date":"2025-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MIT-SPARK/BUFFER-X","path":"loss/desc_loss.py","file_url":"https://github.com/MIT-SPARK/BUFFER-X/blob/HEAD/loss/desc_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":"635d919e6e95900c","code_sha256_prefix":"635d919e6e95900c","mcp_get_code":{"code_sha256":"635d919e6e95900c"}},{"arxiv_id":"2411.06070","arxiv_id_is_arxiv":true,"paper":"/paper/gft-graph-foundation-model-with-transferable","title":"GFT: Graph Foundation Model with Transferable Tree Vocabulary","date":"2024-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zehong-wang/gft","path":"GFT/model/vq.py","file_url":"https://github.com/zehong-wang/gft/blob/HEAD/GFT/model/vq.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":"4b4182a1077e1685","code_sha256_prefix":"4b4182a1077e1685","mcp_get_code":{"code_sha256":"4b4182a1077e1685"}},{"arxiv_id":"2310.15999","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2310.15999","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"abhrac/trd","path":"src/models/gnn_agg_hausdorff.py","file_url":"https://github.com/abhrac/trd/blob/HEAD/src/models/gnn_agg_hausdorff.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":"9df482a4f8365a5f","code_sha256_prefix":"9df482a4f8365a5f","mcp_get_code":{"code_sha256":"9df482a4f8365a5f"}},{"arxiv_id":"2303.09877","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-effects-of-self-supervision-and","title":"On the Effects of Self-supervision and Contrastive Alignment in Deep Multi-view Clustering","date":"2023-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DanielTrosten/DeepMVC","path":"src/lib/kernel.py","file_url":"https://github.com/DanielTrosten/DeepMVC/blob/HEAD/src/lib/kernel.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":"0bedbd9344d129bf","code_sha256_prefix":"0bedbd9344d129bf","mcp_get_code":{"code_sha256":"0bedbd9344d129bf"}},{"arxiv_id":"2207.12389","arxiv_id_is_arxiv":true,"paper":"/paper/memsac-memory-augmented-sample-consistency","title":"MemSAC: Memory Augmented Sample Consistency for Large Scale Unsupervised Domain Adaptation","date":"2022-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ViLab-UCSD/MemSAC_ECCV2022","path":"model/memory.py","file_url":"https://github.com/ViLab-UCSD/MemSAC_ECCV2022/blob/HEAD/model/memory.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4566d19eaac3127a","code_sha256_prefix":"4566d19eaac3127a","mcp_get_code":{"code_sha256":"4566d19eaac3127a"}},{"arxiv_id":"2206.04670","arxiv_id_is_arxiv":true,"paper":"/paper/pointnext-revisiting-pointnet-with-improved","title":"PointNeXt: Revisiting PointNet++ with Improved Training and Scaling Strategies","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kentechx/pointnext","path":"pointnext/pointnext.py","file_url":"https://github.com/kentechx/pointnext/blob/HEAD/pointnext/pointnext.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":"23f479914e4bf067","code_sha256_prefix":"23f479914e4bf067","mcp_get_code":{"code_sha256":"23f479914e4bf067"}},{"arxiv_id":"2203.14493","arxiv_id_is_arxiv":true,"paper":"/paper/arcs-accurate-rotation-and-correspondence","title":"ARCS: Accurate Rotation and Correspondence Search","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zgojcic/3DSmoothNet","path":"core/loss.py","file_url":"https://github.com/zgojcic/3DSmoothNet/blob/HEAD/core/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3dbcae6ca6415ede","code_sha256_prefix":"3dbcae6ca6415ede","mcp_get_code":{"code_sha256":"3dbcae6ca6415ede"}},{"arxiv_id":"2110.14007","arxiv_id_is_arxiv":true,"paper":"/paper/tod-tensor-based-outlier-detection","title":"TOD: GPU-accelerated Outlier Detection via Tensor Operations","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yzhao062/pytod","path":"pytod/models/basic_operators.py","file_url":"https://github.com/yzhao062/pytod/blob/HEAD/pytod/models/basic_operators.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"39ce0c614605e81e","code_sha256_prefix":"39ce0c614605e81e","mcp_get_code":{"code_sha256":"39ce0c614605e81e"}},{"arxiv_id":"2003.03164","arxiv_id_is_arxiv":true,"paper":"/paper/d3feat-joint-learning-of-dense-detection-and","title":"D3Feat: Joint Learning of Dense Detection and Description of 3D Local Features","date":"2020-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XuyangBai/D3Feat","path":"utils/loss.py","file_url":"https://github.com/XuyangBai/D3Feat/blob/HEAD/utils/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":"3dbcae6ca6415ede","code_sha256_prefix":"3dbcae6ca6415ede","mcp_get_code":{"code_sha256":"3dbcae6ca6415ede"}},{"arxiv_id":"1811.06879","arxiv_id_is_arxiv":true,"paper":"/paper/the-perfect-match-3d-point-cloud-matching","title":"The Perfect Match: 3D Point Cloud Matching with Smoothed Densities","date":"2018-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LONG-9621/Match_SmoothNet","path":"core/loss.py","file_url":"https://github.com/LONG-9621/Match_SmoothNet/blob/HEAD/core/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3dbcae6ca6415ede","code_sha256_prefix":"3dbcae6ca6415ede","mcp_get_code":{"code_sha256":"3dbcae6ca6415ede"}},{"arxiv_id":"1703.07737","arxiv_id_is_arxiv":true,"paper":"/paper/in-defense-of-the-triplet-loss-for-person-re","title":"In Defense of the Triplet Loss for Person Re-Identification","date":"2017-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thomas-liao/diva_tracking_reid","path":"loss.py","file_url":"https://github.com/thomas-liao/diva_tracking_reid/blob/HEAD/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":"3dbcae6ca6415ede","code_sha256_prefix":"3dbcae6ca6415ede","mcp_get_code":{"code_sha256":"3dbcae6ca6415ede"}},{"arxiv_id":"1703.07737","arxiv_id_is_arxiv":true,"paper":"/paper/in-defense-of-the-triplet-loss-for-person-re","title":"In Defense of the Triplet Loss for Person Re-Identification","date":"2017-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AsuradaYuci/tripletreid-zhushi","path":"loss.py","file_url":"https://github.com/AsuradaYuci/tripletreid-zhushi/blob/HEAD/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":"ffe848e860beaf70","code_sha256_prefix":"ffe848e860beaf70","mcp_get_code":{"code_sha256":"ffe848e860beaf70"}},{"arxiv_id":"Ao_BUFFER_Balancing_Accuracy_Efficiency_and_Generalizability_in_Point_Cloud_Registration_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ao_BUFFER_Balancing_Accuracy_Efficiency_and_Generalizability_in_Point_Cloud_Registration_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"aosheng1996/BUFFER","path":"loss/desc_loss.py","file_url":"https://github.com/aosheng1996/BUFFER/blob/HEAD/loss/desc_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":"635d919e6e95900c","code_sha256_prefix":"635d919e6e95900c","mcp_get_code":{"code_sha256":"635d919e6e95900c"}}],"record_sha256":"f12bcaaff1909fab40a030706a544bc1fca1043aae027e344d44c40d28a0d762","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}