{"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/pdist2","entry":"pdist2","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":10,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":2,"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":6,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":3,"n_places":10,"n_places_pointer_only":3,"n_places_pointer_only_link_open":2,"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":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":2,"unverified":3},"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":"2207.00371","arxiv_id_is_arxiv":true,"paper":"/paper/adapting-the-mean-teacher-for-keypoint-based","title":"Adapting the Mean Teacher for keypoint-based lung registration under geometric domain shifts","date":"2022-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"multimodallearning/registration-da-mean-teacher","path":"utils.py","file_url":"https://github.com/multimodallearning/registration-da-mean-teacher/blob/HEAD/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 multimodallearning/deep-geo-reg, and GitHub detected no licence in that repository when it was checked","code_sha256":"aa0a8c45bc6ad41c","code_sha256_prefix":"aa0a8c45bc6ad41c","mcp_get_code":{"code_sha256":"aa0a8c45bc6ad41c"}},{"arxiv_id":"2103.00885","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-based-geometric-registration","title":"Deep learning based geometric registration for medical images: How accurate can we get without visual features?","date":"2021-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"multimodallearning/deep-geo-reg","path":"utils.py","file_url":"https://github.com/multimodallearning/deep-geo-reg/blob/HEAD/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, multimodallearning/deep-geo-reg when it was checked","code_sha256":"aa0a8c45bc6ad41c","code_sha256_prefix":"aa0a8c45bc6ad41c","mcp_get_code":{"code_sha256":"aa0a8c45bc6ad41c"}},{"arxiv_id":"2005.06734","arxiv_id_is_arxiv":true,"paper":"/paper/dense-resolution-network-for-point-cloud","title":"Dense-Resolution Network for Point Cloud Classification and Segmentation","date":"2020-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShiQiu0419/DRNet","path":"pointnet2/utils/linalg_utils.py","file_url":"https://github.com/ShiQiu0419/DRNet/blob/HEAD/pointnet2/utils/linalg_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":"2afefacc6e996a95","code_sha256_prefix":"2afefacc6e996a95","mcp_get_code":{"code_sha256":"2afefacc6e996a95"}},{"arxiv_id":"2003.13017","arxiv_id_is_arxiv":true,"paper":"/paper/fast-mvsnet-sparse-to-dense-multi-view-stereo","title":"Fast-MVSNet: Sparse-to-Dense Multi-View Stereo With Learned Propagation and Gauss-Newton Refinement","date":"2020-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"svip-lab/FastMVSNet","path":"fastmvsnet/nn/functional.py","file_url":"https://github.com/svip-lab/FastMVSNet/blob/HEAD/fastmvsnet/nn/functional.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":"af899c701bfaea6b","code_sha256_prefix":"af899c701bfaea6b","mcp_get_code":{"code_sha256":"af899c701bfaea6b"}},{"arxiv_id":"1911.12408","arxiv_id_is_arxiv":true,"paper":"/paper/pointpwc-net-a-coarse-to-fine-network-for","title":"PointPWC-Net: A Coarse-to-Fine Network for Supervised and Self-Supervised Scene Flow Estimation on 3D Point Clouds","date":"2019-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"multimodallearning/Lung250M-4B","path":"registration_models/train_vxmpp_MIND_unsupervised.py","file_url":"https://github.com/multimodallearning/Lung250M-4B/blob/HEAD/registration_models/train_vxmpp_MIND_unsupervised.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 multimodallearning/deep-geo-reg, and GitHub detected no licence in that repository when it was checked","code_sha256":"aa0a8c45bc6ad41c","code_sha256_prefix":"aa0a8c45bc6ad41c","mcp_get_code":{"code_sha256":"aa0a8c45bc6ad41c"}},{"arxiv_id":"1909.03669","arxiv_id_is_arxiv":true,"paper":"/paper/densepoint-learning-densely-contextual","title":"DensePoint: Learning Densely Contextual Representation for Efficient Point Cloud Processing","date":"2019-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yochengliu/DensePoint","path":"utils/linalg_utils.py","file_url":"https://github.com/Yochengliu/DensePoint/blob/HEAD/utils/linalg_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":"13065cfadaddfe24","code_sha256_prefix":"13065cfadaddfe24","mcp_get_code":{"code_sha256":"13065cfadaddfe24"}},{"arxiv_id":"1904.13335","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-balancing-based-representation","title":"Adversarial Balancing-based Representation Learning for Causal Effect Inference with Observational Data","date":"2019-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"octeufer/Adversarial-Balancing-based-representation-learning-for-Causal-Effect-Inference","path":"ABCEI/evaluation.py","file_url":"https://github.com/octeufer/Adversarial-Balancing-based-representation-learning-for-Causal-Effect-Inference/blob/HEAD/ABCEI/evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8c8862895d1a2cfc","code_sha256_prefix":"8c8862895d1a2cfc","mcp_get_code":{"code_sha256":"8c8862895d1a2cfc"}},{"arxiv_id":"1904.07601","arxiv_id_is_arxiv":true,"paper":"/paper/relation-shape-convolutional-neural-network","title":"Relation-Shape Convolutional Neural Network for Point Cloud Analysis","date":"2019-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yochengliu/Relation-Shape-CNN","path":"utils/linalg_utils.py","file_url":"https://github.com/Yochengliu/Relation-Shape-CNN/blob/HEAD/utils/linalg_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":"13065cfadaddfe24","code_sha256_prefix":"13065cfadaddfe24","mcp_get_code":{"code_sha256":"13065cfadaddfe24"}},{"arxiv_id":"1810.00656","arxiv_id_is_arxiv":true,"paper":"/paper/perfect-match-a-simple-method-for-learning","title":"Perfect Match: A Simple Method for Learning Representations For Counterfactual Inference With Neural Networks","date":"2018-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"d909b/perfect_match","path":"perfect_match/models/pehe_loss.py","file_url":"https://github.com/d909b/perfect_match/blob/HEAD/perfect_match/models/pehe_loss.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":"08f299853fa6e6e0","code_sha256_prefix":"08f299853fa6e6e0","mcp_get_code":{"code_sha256":"08f299853fa6e6e0"}},{"arxiv_id":"Wang_MLVSNet_Multi-Level_Voting_Siamese_Network_for_3D_Visual_Tracking_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_MLVSNet_Multi-Level_Voting_Siamese_Network_for_3D_Visual_Tracking_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CodeWZT/MLVSNet","path":"pointnet2/utils/linalg_utils.py","file_url":"https://github.com/CodeWZT/MLVSNet/blob/HEAD/pointnet2/utils/linalg_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":"2afefacc6e996a95","code_sha256_prefix":"2afefacc6e996a95","mcp_get_code":{"code_sha256":"2afefacc6e996a95"}}],"record_sha256":"aa3eeefaa18a7d38bcc30cb2f2dda817ccf34f88ba505f26591be49c8af65188","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}