{"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/parse-header","entry":"parse_header","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":9,"n_papers_ran_no_instrument_failure":9,"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":5,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":10,"n_places_pointer_only_link_open":7,"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":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":"2607.17765","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-17765","title":"FIFA World Cup 2026 as a Contamination-Free Benchmark for LLM Forecasting Agents: Four Models, a Bookmaker, and 104 Matches","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"graphuofm/FIFA2026LLM","path":"src/build_dataset.py","file_url":"https://github.com/graphuofm/FIFA2026LLM/blob/HEAD/src/build_dataset.py","status":"unverified","verification_level":0,"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, graphuofm/FIFA2026LLM (NOASSERTION)","code_sha256":"1007b4fc0c057ce9","code_sha256_prefix":"1007b4fc0c057ce9","mcp_get_code":{"code_sha256":"1007b4fc0c057ce9"}},{"arxiv_id":"2602.14200","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-14200","title":"TS-Haystack: A Multi-Task Retrieval Benchmark for Long-Context Time-Series Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"AI-X-Labs/TS-Haystack","path":"src/datasets/ltaf_haystack/loader.py","file_url":"https://github.com/AI-X-Labs/TS-Haystack/blob/HEAD/src/datasets/ltaf_haystack/loader.py","status":"unverified","verification_level":0,"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, AI-X-Labs/TS-Haystack (NOASSERTION)","code_sha256":"f6a94d22295e44cb","code_sha256_prefix":"f6a94d22295e44cb","mcp_get_code":{"code_sha256":"f6a94d22295e44cb"}},{"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","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, valeoai/ttyd when it was checked","code_sha256":"27aa4c3bde697bf7","code_sha256_prefix":"27aa4c3bde697bf7","mcp_get_code":{"code_sha256":"27aa4c3bde697bf7"}},{"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":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 valeoai/ttyd, and GitHub detected no licence in that repository when it was checked","code_sha256":"27aa4c3bde697bf7","code_sha256_prefix":"27aa4c3bde697bf7","mcp_get_code":{"code_sha256":"27aa4c3bde697bf7"}},{"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":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 valeoai/ttyd, and GitHub detected no licence in that repository when it was checked","code_sha256":"27aa4c3bde697bf7","code_sha256_prefix":"27aa4c3bde697bf7","mcp_get_code":{"code_sha256":"27aa4c3bde697bf7"}},{"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":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 valeoai/ttyd, and GitHub detected no licence in that repository when it was checked","code_sha256":"27aa4c3bde697bf7","code_sha256_prefix":"27aa4c3bde697bf7","mcp_get_code":{"code_sha256":"27aa4c3bde697bf7"}},{"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":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 valeoai/ttyd, and GitHub detected no licence in that repository when it was checked","code_sha256":"27aa4c3bde697bf7","code_sha256_prefix":"27aa4c3bde697bf7","mcp_get_code":{"code_sha256":"27aa4c3bde697bf7"}},{"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":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 valeoai/ttyd, and GitHub detected no licence in that repository when it was checked","code_sha256":"27aa4c3bde697bf7","code_sha256_prefix":"27aa4c3bde697bf7","mcp_get_code":{"code_sha256":"27aa4c3bde697bf7"}},{"arxiv_id":"2001.08499","arxiv_id_is_arxiv":true,"paper":"/paper/a-large-scale-event-based-detection-dataset","title":"A Large Scale Event-based Detection Dataset for Automotive","date":"2020-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prophesee-ai/prophesee-automotive-dataset-toolbox","path":"src/io/dat_events_tools.py","file_url":"https://github.com/prophesee-ai/prophesee-automotive-dataset-toolbox/blob/HEAD/src/io/dat_events_tools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fbdd5fe13d8d02d7","code_sha256_prefix":"fbdd5fe13d8d02d7","mcp_get_code":{"code_sha256":"fbdd5fe13d8d02d7"}},{"arxiv_id":"2001.08499","arxiv_id_is_arxiv":true,"paper":"/paper/a-large-scale-event-based-detection-dataset","title":"A Large Scale Event-based Detection Dataset for Automotive","date":"2020-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prophesee-ai/prophesee-automotive-dataset-toolbox","path":"src/io/npy_events_tools.py","file_url":"https://github.com/prophesee-ai/prophesee-automotive-dataset-toolbox/blob/HEAD/src/io/npy_events_tools.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dc3efec1267082d4","code_sha256_prefix":"dc3efec1267082d4","mcp_get_code":{"code_sha256":"dc3efec1267082d4"}},{"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":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 valeoai/ttyd, and GitHub detected no licence in that repository when it was checked","code_sha256":"27aa4c3bde697bf7","code_sha256_prefix":"27aa4c3bde697bf7","mcp_get_code":{"code_sha256":"27aa4c3bde697bf7"}},{"arxiv_id":"Hu_VMNet_Voxel-Mesh_Network_for_Geodesic-Aware_3D_Semantic_Segmentation_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Hu_VMNet_Voxel-Mesh_Network_for_Geodesic-Aware_3D_Semantic_Segmentation_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"hzykent/VMNet","path":"utils.py","file_url":"https://github.com/hzykent/VMNet/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 valeoai/ttyd, and GitHub detected no licence in that repository when it was checked","code_sha256":"27aa4c3bde697bf7","code_sha256_prefix":"27aa4c3bde697bf7","mcp_get_code":{"code_sha256":"27aa4c3bde697bf7"}}],"record_sha256":"d49b6e75e05639391bb1c6357a58d262e9d7527953ce560a765faccca7b0a371","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}