{"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/pointnetsetabstraction","entry":"PointNetSetAbstraction","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":0,"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":8,"n_samples_ran":7,"n_samples_constructed":6,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"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":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":7,"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":"2407.01191","arxiv_id_is_arxiv":true,"paper":"/paper/mars-multimodal-active-robotic-sensing-for","title":"MARS: Multimodal Active Robotic Sensing for Articulated Characterization","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robhlzeng/MARS","path":"mars/models/mffp.py","file_url":"https://github.com/robhlzeng/MARS/blob/HEAD/mars/models/mffp.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":"bf8d6ab94618b20c","code_sha256_prefix":"bf8d6ab94618b20c","mcp_get_code":{"code_sha256":"bf8d6ab94618b20c"}},{"arxiv_id":"2402.14380","arxiv_id_is_arxiv":true,"paper":"/paper/radarmoseve-a-spatial-temporal-transformer","title":"RadarMOSEVE: A Spatial-Temporal Transformer Network for Radar-Only Moving Object Segmentation and Ego-Velocity Estimation","date":null,"month_inferred_from_arxiv_id":"2024-02","title_source":"archive","repo":"ORCA-Uboat/RadarMOSEVE","path":"models/MOS/model.py","file_url":"https://github.com/ORCA-Uboat/RadarMOSEVE/blob/HEAD/models/MOS/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ORCA-Uboat/RadarMOSEVE when it was checked","code_sha256":"44ec89e25a263b58","code_sha256_prefix":"44ec89e25a263b58","mcp_get_code":{"code_sha256":"44ec89e25a263b58"}},{"arxiv_id":"2306.00777","arxiv_id_is_arxiv":true,"paper":"/paper/object-pop-up-can-we-infer-3d-objects-and-1","title":"Object pop-up: Can we infer 3D objects and their poses from human interactions alone?","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ptrvilya/object-popup","path":"popup/models/object_popup.py","file_url":"https://github.com/ptrvilya/object-popup/blob/HEAD/popup/models/object_popup.py","status":"ran","verification_level":1,"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, ptrvilya/object-popup (NOASSERTION)","code_sha256":"87477a59b65f8b0e","code_sha256_prefix":"87477a59b65f8b0e","mcp_get_code":{"code_sha256":"87477a59b65f8b0e"}},{"arxiv_id":"2305.16963","arxiv_id_is_arxiv":true,"paper":"/paper/semantic-segmentation-of-sparse-irregular-1","title":"Semantic segmentation of sparse irregular point clouds for leaf/wood discrimination","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"na1an/phd_mission","path":"src/model.py","file_url":"https://github.com/na1an/phd_mission/blob/HEAD/src/model.py","status":"ran","verification_level":1,"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, na1an/phd_mission (NOASSERTION)","code_sha256":"98fd9eae45a69452","code_sha256_prefix":"98fd9eae45a69452","mcp_get_code":{"code_sha256":"98fd9eae45a69452"}},{"arxiv_id":"2302.14348","arxiv_id_is_arxiv":true,"paper":"/paper/im2hands-learning-attentive-implicit","title":"Im2Hands: Learning Attentive Implicit Representation of Interacting Two-Hand Shapes","date":"2023-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jyunlee/im2hands","path":"artihand/nasa/models/core_ref_occ.py","file_url":"https://github.com/jyunlee/im2hands/blob/HEAD/artihand/nasa/models/core_ref_occ.py","status":"ran","verification_level":1,"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, jyunlee/im2hands when it was checked","code_sha256":"f4a13002570828f6","code_sha256_prefix":"f4a13002570828f6","mcp_get_code":{"code_sha256":"f4a13002570828f6"}},{"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":"boyden/pointtransformerfl","path":"models/point_transformer.py","file_url":"https://github.com/boyden/pointtransformerfl/blob/HEAD/models/point_transformer.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":"d0c7913713993782","code_sha256_prefix":"d0c7913713993782","mcp_get_code":{"code_sha256":"d0c7913713993782"}},{"arxiv_id":"1706.02413","arxiv_id_is_arxiv":true,"paper":"/paper/pointnet-deep-hierarchical-feature-learning","title":"PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Space","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanx27/Pointnet_Pointnet2_pytorch","path":"models/pointnet2_utils.py","file_url":"https://github.com/yanx27/Pointnet_Pointnet2_pytorch/blob/HEAD/models/pointnet2_utils.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":"b7bc001da9322423","code_sha256_prefix":"b7bc001da9322423","mcp_get_code":{"code_sha256":"b7bc001da9322423"}},{"arxiv_id":"1706.02413","arxiv_id_is_arxiv":true,"paper":"/paper/pointnet-deep-hierarchical-feature-learning","title":"PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Space","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ghailen-Ben-Achour/PointNet2_Segmentation","path":"models/pointnet2_cls_ssg.py","file_url":"https://github.com/Ghailen-Ben-Achour/PointNet2_Segmentation/blob/HEAD/models/pointnet2_cls_ssg.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":"f66046a728fcaaa4","code_sha256_prefix":"f66046a728fcaaa4","mcp_get_code":{"code_sha256":"f66046a728fcaaa4"}}],"record_sha256":"d626131f0621ddd4d0adf3a6ca7953a5194ae45f3199e4a5e4863b861a525e14","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}