{"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/radius-gaussian","entry":"radius_gaussian","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":11,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":9,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":11,"n_places_pointer_only":4,"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":0,"ran":2,"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":"2410.03644","arxiv_id_is_arxiv":true,"paper":"/paper/unlearnable-3d-point-clouds-class-wise","title":"Unlearnable 3D Point Clouds: Class-wise Transformation Is All You Need","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CGCL-codes/UnlearnablePC","path":"model_utils/kpconv_util.py","file_url":"https://github.com/CGCL-codes/UnlearnablePC/blob/HEAD/model_utils/kpconv_util.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"42f2cd40ba483d3b","code_sha256_prefix":"42f2cd40ba483d3b","mcp_get_code":{"code_sha256":"42f2cd40ba483d3b"}},{"arxiv_id":"2308.05525","arxiv_id_is_arxiv":true,"paper":"/paper/critical-points-an-agile-point-cloud","title":"Robustifying Point Cloud Networks by Refocusing","date":"2023-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yossilevii100/critical_points2","path":"shape_invariant_attack/model_utils/kpconv_util.py","file_url":"https://github.com/yossilevii100/critical_points2/blob/HEAD/shape_invariant_attack/model_utils/kpconv_util.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, yossilevii100/critical_points2 when it was checked","code_sha256":"42f2cd40ba483d3b","code_sha256_prefix":"42f2cd40ba483d3b","mcp_get_code":{"code_sha256":"42f2cd40ba483d3b"}},{"arxiv_id":"2308.04782","arxiv_id_is_arxiv":true,"paper":"/paper/pointmbf-a-multi-scale-bidirectional-fusion","title":"PointMBF: A Multi-scale Bidirectional Fusion Network for Unsupervised RGB-D Point Cloud Registration","date":"2023-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phdymz/pointmbf","path":"models/block.py","file_url":"https://github.com/phdymz/pointmbf/blob/HEAD/models/block.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, phdymz/pointmbf when it was checked","code_sha256":"42f2cd40ba483d3b","code_sha256_prefix":"42f2cd40ba483d3b","mcp_get_code":{"code_sha256":"42f2cd40ba483d3b"}},{"arxiv_id":"2301.10222","arxiv_id_is_arxiv":true,"paper":"/paper/rangevit-towards-vision-transformers-for-3d","title":"RangeViT: Towards Vision Transformers for 3D Semantic Segmentation in Autonomous Driving","date":"2023-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"valeoai/rangevit","path":"models/rangevit.py","file_url":"https://github.com/valeoai/rangevit/blob/HEAD/models/rangevit.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"42f2cd40ba483d3b","code_sha256_prefix":"42f2cd40ba483d3b","mcp_get_code":{"code_sha256":"42f2cd40ba483d3b"}},{"arxiv_id":"2203.04041","arxiv_id_is_arxiv":true,"paper":"/paper/shape-invariant-3d-adversarial-point-clouds","title":"Shape-invariant 3D Adversarial Point Clouds","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shikiw/SI-Adv","path":"model_utils/kpconv_util.py","file_url":"https://github.com/shikiw/SI-Adv/blob/HEAD/model_utils/kpconv_util.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"42f2cd40ba483d3b","code_sha256_prefix":"42f2cd40ba483d3b","mcp_get_code":{"code_sha256":"42f2cd40ba483d3b"}},{"arxiv_id":"2111.12591","arxiv_id_is_arxiv":true,"paper":"/paper/lepard-learning-partial-point-cloud-matching","title":"Lepard: Learning partial point cloud matching in rigid and deformable scenes","date":"2021-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rabbityl/lepard","path":"models/blocks.py","file_url":"https://github.com/rabbityl/lepard/blob/HEAD/models/blocks.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"42f2cd40ba483d3b","code_sha256_prefix":"42f2cd40ba483d3b","mcp_get_code":{"code_sha256":"42f2cd40ba483d3b"}},{"arxiv_id":"2007.12668","arxiv_id_is_arxiv":true,"paper":"/paper/kprnet-improving-projection-based-lidar","title":"KPRNet: Improving projection-based LiDAR semantic segmentation","date":"2020-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeyvidKochanov-TomTom/kprnet","path":"models/kpconv/blocks.py","file_url":"https://github.com/DeyvidKochanov-TomTom/kprnet/blob/HEAD/models/kpconv/blocks.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"42f2cd40ba483d3b","code_sha256_prefix":"42f2cd40ba483d3b","mcp_get_code":{"code_sha256":"42f2cd40ba483d3b"}},{"arxiv_id":"2007.06888","arxiv_id_is_arxiv":true,"paper":"/paper/jsenet-joint-semantic-segmentation-and-edge","title":"JSENet: Joint Semantic Segmentation and Edge Detection Network for 3D Point Clouds","date":"2020-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzykent/JSENet","path":"JSENet_code/kernels/convolution_ops.py","file_url":"https://github.com/hzykent/JSENet/blob/HEAD/JSENet_code/kernels/convolution_ops.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":"b211e6b58ff40f29","code_sha256_prefix":"b211e6b58ff40f29","mcp_get_code":{"code_sha256":"b211e6b58ff40f29"}},{"arxiv_id":"2007.01294","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-local-aggregation-operators","title":"A Closer Look at Local Aggregation Operators in Point Cloud Analysis","date":"2020-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zeliu98/CloserLook3D","path":"pytorch/models/utlis.py","file_url":"https://github.com/zeliu98/CloserLook3D/blob/HEAD/pytorch/models/utlis.py","status":"ran","verification_level":1,"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, zeliu98/CloserLook3D, 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":"7140c9e040fc1297","code_sha256_prefix":"7140c9e040fc1297","mcp_get_code":{"code_sha256":"7140c9e040fc1297"}},{"arxiv_id":"1904.08889","arxiv_id_is_arxiv":true,"paper":"/paper/kpconv-flexible-and-deformable-convolution","title":"KPConv: Flexible and Deformable Convolution for Point Clouds","date":"2019-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isl-org/Open3D-ML","path":"ml3d/torch/models/kpconv.py","file_url":"https://github.com/isl-org/Open3D-ML/blob/HEAD/ml3d/torch/models/kpconv.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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, isl-org/Open3D-ML (NOASSERTION)","code_sha256":"c0186f8ddb0bc115","code_sha256_prefix":"c0186f8ddb0bc115","mcp_get_code":{"code_sha256":"c0186f8ddb0bc115"}},{"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":"models/point_learner.py","file_url":"https://github.com/aosheng1996/BUFFER/blob/HEAD/models/point_learner.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":"7829aba7b104b42a","code_sha256_prefix":"7829aba7b104b42a","mcp_get_code":{"code_sha256":"7829aba7b104b42a"}}],"record_sha256":"5682a82f3c6a75483e2ba52828df2d16f388f5fed66f463019af2c181529a260","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}