{"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/pointnetfeaturepropagation","entry":"PointNetFeaturePropagation","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":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":6,"n_samples_ran":6,"n_samples_constructed":3,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":6,"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":6,"unverified":0},"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":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ac744ada43a50a0e","code_sha256_prefix":"ac744ada43a50a0e","mcp_get_code":{"code_sha256":"ac744ada43a50a0e"}},{"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":"a7149928f441a509","code_sha256_prefix":"a7149928f441a509","mcp_get_code":{"code_sha256":"a7149928f441a509"}},{"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":"cd4fdf31e5dc11a8","code_sha256_prefix":"cd4fdf31e5dc11a8","mcp_get_code":{"code_sha256":"cd4fdf31e5dc11a8"}},{"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":"e728a893952f2603","code_sha256_prefix":"e728a893952f2603","mcp_get_code":{"code_sha256":"e728a893952f2603"}},{"arxiv_id":"2303.10437","arxiv_id_is_arxiv":true,"paper":"/paper/grounding-3d-object-affordance-from-2d","title":"Grounding 3D Object Affordance from 2D Interactions in Images","date":"2023-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yyvhang/IAGNet","path":"model/IAGNet.py","file_url":"https://github.com/yyvhang/IAGNet/blob/HEAD/model/IAGNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yyvhang/IAGNet when it was checked","code_sha256":"bff3ef0d16e7f5e7","code_sha256_prefix":"bff3ef0d16e7f5e7","mcp_get_code":{"code_sha256":"bff3ef0d16e7f5e7"}},{"arxiv_id":"2103.10814","arxiv_id_is_arxiv":true,"paper":"/paper/skeleton-merger-an-unsupervised-aligned","title":"Skeleton Merger: an Unsupervised Aligned Keypoint Detector","date":"2021-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eliphatfs/SkeletonMerger","path":"merger/merger_net.py","file_url":"https://github.com/eliphatfs/SkeletonMerger/blob/HEAD/merger/merger_net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bcb0d966a2004d18","code_sha256_prefix":"bcb0d966a2004d18","mcp_get_code":{"code_sha256":"bcb0d966a2004d18"}}],"record_sha256":"8d478b2f76f71f39ea15eff583eaadffb139a49d0b02c944927fbdfdee8491e0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}