{"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/read-ply","entry":"read_ply","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":16,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":14,"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":12,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":16,"n_places_pointer_only":2,"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":0,"ran":9,"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":"2502.05874","arxiv_id_is_arxiv":true,"paper":"/paper/mmgdreamer-mixed-modality-graph-for-geometry-1","title":"MMGDreamer: Mixed-Modality Graph for Geometry-Controllable 3D Indoor Scene Generation","date":"2025-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangzhifeio/MMGDreamer","path":"dataset/util.py","file_url":"https://github.com/yangzhifeio/MMGDreamer/blob/HEAD/dataset/util.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":"d99992e2baeb87d2","code_sha256_prefix":"d99992e2baeb87d2","mcp_get_code":{"code_sha256":"d99992e2baeb87d2"}},{"arxiv_id":"2411.05823","arxiv_id_is_arxiv":true,"paper":"/paper/flexcad-unified-and-versatile-controllable","title":"FlexCAD: Unified and Versatile Controllable CAD Generation with Fine-tuned Large Language Models","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/flexcad","path":"utils/eval_cad.py","file_url":"https://github.com/microsoft/flexcad/blob/HEAD/utils/eval_cad.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7ea8042cb1e765a6","code_sha256_prefix":"7ea8042cb1e765a6","mcp_get_code":{"code_sha256":"7ea8042cb1e765a6"}},{"arxiv_id":"2409.04409","arxiv_id_is_arxiv":true,"paper":"/paper/train-till-you-drop-towards-stable-and-robust","title":"Train Till You Drop: Towards Stable and Robust Source-free Unsupervised 3D Domain Adaptation","date":"2024-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"valeoai/ttyd","path":"datasets/semantic_kitti.py","file_url":"https://github.com/valeoai/ttyd/blob/HEAD/datasets/semantic_kitti.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, valeoai/ttyd when it was checked","code_sha256":"2dd532d51a1cbc79","code_sha256_prefix":"2dd532d51a1cbc79","mcp_get_code":{"code_sha256":"2dd532d51a1cbc79"}},{"arxiv_id":"2401.15563","arxiv_id_is_arxiv":true,"paper":"/paper/brepgen-a-b-rep-generative-diffusion-model","title":"BrepGen: A B-rep Generative Diffusion Model with Structured Latent Geometry","date":"2024-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samxuxiang/brepgen","path":"pc_metric.py","file_url":"https://github.com/samxuxiang/brepgen/blob/HEAD/pc_metric.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, samxuxiang/brepgen when it was checked","code_sha256":"7ea8042cb1e765a6","code_sha256_prefix":"7ea8042cb1e765a6","mcp_get_code":{"code_sha256":"7ea8042cb1e765a6"}},{"arxiv_id":"2205.12183","arxiv_id_is_arxiv":true,"paper":"/paper/stylizednerf-consistent-3d-scene-stylization","title":"StylizedNeRF: Consistent 3D Scene Stylization as Stylized NeRF via 2D-3D Mutual Learning","date":"2022-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iglict/stylizednerf","path":"utils.py","file_url":"https://github.com/iglict/stylizednerf/blob/HEAD/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":"c6f78245da55a3f8","code_sha256_prefix":"c6f78245da55a3f8","mcp_get_code":{"code_sha256":"c6f78245da55a3f8"}},{"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":"lib/ply.py","file_url":"https://github.com/rabbityl/lepard/blob/HEAD/lib/ply.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":"b6122b5ef2c0c4e9","code_sha256_prefix":"b6122b5ef2c0c4e9","mcp_get_code":{"code_sha256":"b6122b5ef2c0c4e9"}},{"arxiv_id":"2109.13410","arxiv_id_is_arxiv":true,"paper":"/paper/kitti-360-a-novel-dataset-and-benchmarks-for","title":"KITTI-360: A Novel Dataset and Benchmarks for Urban Scene Understanding in 2D and 3D","date":"2021-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/kitti360scripts","path":"kitti360scripts/helpers/ply.py","file_url":"https://github.com/autonomousvision/kitti360scripts/blob/HEAD/kitti360scripts/helpers/ply.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":"1e26a8ee45f6722c","code_sha256_prefix":"1e26a8ee45f6722c","mcp_get_code":{"code_sha256":"1e26a8ee45f6722c"}},{"arxiv_id":"2105.10203","arxiv_id_is_arxiv":true,"paper":"/paper/omni-supervised-point-cloud-segmentation-via","title":"Omni-supervised Point Cloud Segmentation via Gradual Receptive Field Component Reasoning","date":"2021-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"azuki-miho/RFCR","path":"RandLA_Net_S3DIS/helper_ply.py","file_url":"https://github.com/azuki-miho/RFCR/blob/HEAD/RandLA_Net_S3DIS/helper_ply.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":"1e26a8ee45f6722c","code_sha256_prefix":"1e26a8ee45f6722c","mcp_get_code":{"code_sha256":"1e26a8ee45f6722c"}},{"arxiv_id":"2105.09492","arxiv_id_is_arxiv":true,"paper":"/paper/deepcad-a-deep-generative-network-for","title":"DeepCAD: A Deep Generative Network for Computer-Aided Design Models","date":"2021-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChrisWu1997/DeepCAD","path":"pc2cad_train.py","file_url":"https://github.com/ChrisWu1997/DeepCAD/blob/HEAD/pc2cad_train.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":"918976217124e145","code_sha256_prefix":"918976217124e145","mcp_get_code":{"code_sha256":"918976217124e145"}},{"arxiv_id":"2104.02246","arxiv_id_is_arxiv":true,"paper":"/paper/one-thing-one-click-a-self-training-approach","title":"One Thing One Click: A Self-Training Approach for Weakly Supervised 3D Semantic Segmentation","date":"2021-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PointCloudYC/SQN_tensorflow","path":"helper_ply.py","file_url":"https://github.com/PointCloudYC/SQN_tensorflow/blob/HEAD/helper_ply.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":"1e26a8ee45f6722c","code_sha256_prefix":"1e26a8ee45f6722c","mcp_get_code":{"code_sha256":"1e26a8ee45f6722c"}},{"arxiv_id":"2009.03137","arxiv_id_is_arxiv":true,"paper":"/paper/towards-semantic-segmentation-of-urban-scale","title":"Towards Semantic Segmentation of Urban-Scale 3D Point Clouds: A Dataset, Benchmarks and Challenges","date":"2020-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QingyongHu/SensatUrban","path":"helper_ply.py","file_url":"https://github.com/QingyongHu/SensatUrban/blob/HEAD/helper_ply.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":"1e26a8ee45f6722c","code_sha256_prefix":"1e26a8ee45f6722c","mcp_get_code":{"code_sha256":"1e26a8ee45f6722c"}},{"arxiv_id":"2001.07715","arxiv_id_is_arxiv":true,"paper":"/paper/teaser-fast-and-certifiable-point-cloud","title":"TEASER: Fast and Certifiable Point Cloud Registration","date":"2020-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-spark/kiss-matcher","path":"python/kiss_matcher/io_utils.py","file_url":"https://github.com/mit-spark/kiss-matcher/blob/HEAD/python/kiss_matcher/io_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":"d33d4de02bd79322","code_sha256_prefix":"d33d4de02bd79322","mcp_get_code":{"code_sha256":"d33d4de02bd79322"}},{"arxiv_id":"1909.00321","arxiv_id_is_arxiv":true,"paper":"/paper/deep-mesh-reconstruction-from-single-rgb","title":"Deep Mesh Reconstruction from Single RGB Images via Topology Modification Networks","date":"2019-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jnypan/TMNet","path":"auxiliary/ply.py","file_url":"https://github.com/jnypan/TMNet/blob/HEAD/auxiliary/ply.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":"db21141e2af6f077","code_sha256_prefix":"db21141e2af6f077","mcp_get_code":{"code_sha256":"db21141e2af6f077"}},{"arxiv_id":"1812.03794","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-deep-learning-for-structured","title":"Unsupervised Deep Learning for Structured Shape Matching","date":"2018-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pvnieo/SURFMNet-pytorch","path":"surfmnet/utils/io.py","file_url":"https://github.com/pvnieo/SURFMNet-pytorch/blob/HEAD/surfmnet/utils/io.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":"5afbd385bcee8a31","code_sha256_prefix":"5afbd385bcee8a31","mcp_get_code":{"code_sha256":"5afbd385bcee8a31"}},{"arxiv_id":"1812.03320","arxiv_id_is_arxiv":true,"paper":"/paper/gspn-generative-shape-proposal-network-for-3d","title":"GSPN: Generative Shape Proposal Network for 3D Instance Segmentation in Point Cloud","date":"2018-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ericyi/GSPN","path":"utils/io_util.py","file_url":"https://github.com/ericyi/GSPN/blob/HEAD/utils/io_util.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":"62046c0483d24f55","code_sha256_prefix":"62046c0483d24f55","mcp_get_code":{"code_sha256":"62046c0483d24f55"}},{"arxiv_id":"Rong_RepKPU_Point_Cloud_Upsampling_with_Kernel_Point_Representation_and_Deformation_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Rong_RepKPU_Point_Cloud_Upsampling_with_Kernel_Point_Representation_and_Deformation_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"EasyRy/RepKPU","path":"models/kernel_points/plyutils.py","file_url":"https://github.com/EasyRy/RepKPU/blob/HEAD/models/kernel_points/plyutils.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":"bad1e83ad4f5845d","code_sha256_prefix":"bad1e83ad4f5845d","mcp_get_code":{"code_sha256":"bad1e83ad4f5845d"}}],"record_sha256":"2f5ff640c8d591d744bf91ffb2b31f9249b6c54dd2375c7f8d0a0c824aa7a843","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}