{"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/get-info","entry":"get_info","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":12,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":3,"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":16,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":16,"n_places_pointer_only":3,"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":3,"ran_fixture":0,"ran":10,"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":"2502.10362","arxiv_id_is_arxiv":true,"paper":"/paper/clamp-3-universal-music-information-retrieval","title":"CLaMP 3: Universal Music Information Retrieval Across Unaligned Modalities and Unseen Languages","date":null,"month_inferred_from_arxiv_id":"2025-02","title_source":"archive","repo":"sanderwood/clamp3","path":"inference/clamp3_search.py","file_url":"https://github.com/sanderwood/clamp3/blob/HEAD/inference/clamp3_search.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":"01415f8417b1ee1b","code_sha256_prefix":"01415f8417b1ee1b","mcp_get_code":{"code_sha256":"01415f8417b1ee1b"}},{"arxiv_id":"2412.18381","arxiv_id_is_arxiv":true,"paper":"/paper/mr-cographs-communication-efficient-multi","title":"MR-COGraphs: Communication-efficient Multi-Robot Open-vocabulary Mapping System via 3D Scene Graphs","date":null,"month_inferred_from_arxiv_id":"2024-12","title_source":"archive","repo":"efc-robot/mr-cographs","path":"r3d_to_ROS/r3d_to_rosbag.py","file_url":"https://github.com/efc-robot/mr-cographs/blob/HEAD/r3d_to_ROS/r3d_to_rosbag.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, efc-robot/mr-cographs when it was checked","code_sha256":"6bbfb12bb8f56c1f","code_sha256_prefix":"6bbfb12bb8f56c1f","mcp_get_code":{"code_sha256":"6bbfb12bb8f56c1f"}},{"arxiv_id":"2406.02178","arxiv_id_is_arxiv":true,"paper":"/paper/audio-mamba-selective-state-spaces-for-self","title":"Audio Mamba: Selective State Spaces for Self-Supervised Audio Representations","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SarthakYadav/audio-mamba-official","path":"stats_aggregation.py","file_url":"https://github.com/SarthakYadav/audio-mamba-official/blob/HEAD/stats_aggregation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"59d7db08da442a55","code_sha256_prefix":"59d7db08da442a55","mcp_get_code":{"code_sha256":"59d7db08da442a55"}},{"arxiv_id":"2403.16218","arxiv_id_is_arxiv":true,"paper":"/paper/coverup-coverage-guided-llm-based-test","title":"CoverUp: Effective High Coverage Test Generation for Python","date":"2024-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plasma-umass/coverup","path":"src/coverup/codeinfo.py","file_url":"https://github.com/plasma-umass/coverup/blob/HEAD/src/coverup/codeinfo.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":"9b6d481e57689ee5","code_sha256_prefix":"9b6d481e57689ee5","mcp_get_code":{"code_sha256":"9b6d481e57689ee5"}},{"arxiv_id":"2403.11124","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-data-diversity-for-fine-tuning","title":"Scaling Data Diversity for Fine-Tuning Language Models in Human Alignment","date":"2024-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"f2-song/scalingalignment","path":"data_preprocess/diversity.py","file_url":"https://github.com/f2-song/scalingalignment/blob/HEAD/data_preprocess/diversity.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, f2-song/scalingalignment, is not in the permissive set Syntology serves inline","code_sha256":"6ca582890a040098","code_sha256_prefix":"6ca582890a040098","mcp_get_code":{"code_sha256":"6ca582890a040098"}},{"arxiv_id":"2401.03205","arxiv_id_is_arxiv":true,"paper":"/paper/the-dawn-after-the-dark-an-empirical-study-on","title":"The Dawn After the Dark: An Empirical Study on Factuality Hallucination in Large Language Models","date":"2024-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/halueval-2.0","path":"metric.py","file_url":"https://github.com/rucaibox/halueval-2.0/blob/HEAD/metric.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, rucaibox/halueval-2.0 when it was checked","code_sha256":"652567466c2f028b","code_sha256_prefix":"652567466c2f028b","mcp_get_code":{"code_sha256":"652567466c2f028b"}},{"arxiv_id":"2306.13924","arxiv_id_is_arxiv":true,"paper":"/paper/structuring-representation-geometry-with","title":"Structuring Representation Geometry with Rotationally Equivariant Contrastive Learning","date":"2023-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sharut/care","path":"imagenet100/model/loss.py","file_url":"https://github.com/sharut/care/blob/HEAD/imagenet100/model/loss.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":"ec0e9d4fc69533ae","code_sha256_prefix":"ec0e9d4fc69533ae","mcp_get_code":{"code_sha256":"ec0e9d4fc69533ae"}},{"arxiv_id":"2303.16982","arxiv_id_is_arxiv":true,"paper":"/paper/highly-accurate-quantum-chemical-property","title":"Highly Accurate Quantum Chemical Property Prediction with Uni-Mol+","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmodeling/Uni-Mol","path":"unimol_plus/scripts/get_3d_lmdb.py","file_url":"https://github.com/deepmodeling/Uni-Mol/blob/HEAD/unimol_plus/scripts/get_3d_lmdb.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":"92cdc968d05099c4","code_sha256_prefix":"92cdc968d05099c4","mcp_get_code":{"code_sha256":"92cdc968d05099c4"}},{"arxiv_id":"2003.12464","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-autonomous-driving-perception-with","title":"End-to-end Autonomous Driving Perception with Sequential Latent Representation Learning","date":"2020-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cjy1992/gym-carla","path":"gym_carla/envs/misc.py","file_url":"https://github.com/cjy1992/gym-carla/blob/HEAD/gym_carla/envs/misc.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":"3b06cf6170c8f79a","code_sha256_prefix":"3b06cf6170c8f79a","mcp_get_code":{"code_sha256":"3b06cf6170c8f79a"}},{"arxiv_id":"1904.02113","arxiv_id_is_arxiv":true,"paper":"/paper/point-cloud-oversegmentation-with-graph","title":"Point Cloud Oversegmentation with Graph-Structured Deep Metric Learning","date":"2019-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"loicland/superpoint_graph","path":"learning/custom_dataset.py","file_url":"https://github.com/loicland/superpoint_graph/blob/HEAD/learning/custom_dataset.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":"787baadda400bd94","code_sha256_prefix":"787baadda400bd94","mcp_get_code":{"code_sha256":"787baadda400bd94"}},{"arxiv_id":"1904.02113","arxiv_id_is_arxiv":true,"paper":"/paper/point-cloud-oversegmentation-with-graph","title":"Point Cloud Oversegmentation with Graph-Structured Deep Metric Learning","date":"2019-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"loicland/superpoint_graph","path":"learning/s3dis_dataset.py","file_url":"https://github.com/loicland/superpoint_graph/blob/HEAD/learning/s3dis_dataset.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":"ba1f19c5139c4825","code_sha256_prefix":"ba1f19c5139c4825","mcp_get_code":{"code_sha256":"ba1f19c5139c4825"}},{"arxiv_id":"1904.02113","arxiv_id_is_arxiv":true,"paper":"/paper/point-cloud-oversegmentation-with-graph","title":"Point Cloud Oversegmentation with Graph-Structured Deep Metric Learning","date":"2019-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"loicland/superpoint_graph","path":"learning/sema3d_dataset.py","file_url":"https://github.com/loicland/superpoint_graph/blob/HEAD/learning/sema3d_dataset.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":"b36f9b676c19b53b","code_sha256_prefix":"b36f9b676c19b53b","mcp_get_code":{"code_sha256":"b36f9b676c19b53b"}},{"arxiv_id":"aaai_35301","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_35301","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"shovito66/FUSE-MET","path":"code/datamanager/hfailure/data_details.py","file_url":"https://github.com/shovito66/FUSE-MET/blob/HEAD/code/datamanager/hfailure/data_details.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":"1f9b96676e952202","code_sha256_prefix":"1f9b96676e952202","mcp_get_code":{"code_sha256":"1f9b96676e952202"}},{"arxiv_id":"Chao_Equivalent_Transformation_and_Dual_Stream_Network_Construction_for_Mobile_Image_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Chao_Equivalent_Transformation_and_Dual_Stream_Network_Construction_for_Mobile_Image_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ECNUSR/ETDS","path":"converter.py","file_url":"https://github.com/ECNUSR/ETDS/blob/HEAD/converter.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":"334401fbeaada5ce","code_sha256_prefix":"334401fbeaada5ce","mcp_get_code":{"code_sha256":"334401fbeaada5ce"}},{"arxiv_id":"Chao_Equivalent_Transformation_and_Dual_Stream_Network_Construction_for_Mobile_Image_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Chao_Equivalent_Transformation_and_Dual_Stream_Network_Construction_for_Mobile_Image_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ECNUSR/ETDS","path":"converter_abpn_et.py","file_url":"https://github.com/ECNUSR/ETDS/blob/HEAD/converter_abpn_et.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":"a789a51bbaf93a8c","code_sha256_prefix":"a789a51bbaf93a8c","mcp_get_code":{"code_sha256":"a789a51bbaf93a8c"}},{"arxiv_id":"Chao_Equivalent_Transformation_and_Dual_Stream_Network_Construction_for_Mobile_Image_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Chao_Equivalent_Transformation_and_Dual_Stream_Network_Construction_for_Mobile_Image_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ECNUSR/ETDS","path":"converter_ecbsr.py","file_url":"https://github.com/ECNUSR/ETDS/blob/HEAD/converter_ecbsr.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":"c7133d1f3df85d59","code_sha256_prefix":"c7133d1f3df85d59","mcp_get_code":{"code_sha256":"c7133d1f3df85d59"}}],"record_sha256":"5333c7e2c94c5acf17e4a70ee88faba3014074dcd068ae7c3c63d4c3a2aa54e7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}