{"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/natural-sort-key","entry":"natural_sort_key","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":1,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":5,"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":1,"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":"2604.27685","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-27685","title":"VibroML: an automated toolkit for high-throughput vibrational analysis and dynamic instability remediation of crystalline materials using machine-learned potentials","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"rogeriog/VibroML_SupportData","path":"LiF_anomaly_tests/get_statistics_path.py","file_url":"https://github.com/rogeriog/VibroML_SupportData/blob/HEAD/LiF_anomaly_tests/get_statistics_path.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, rogeriog/VibroML_SupportData when it was checked","code_sha256":"e9e6b64db3e85003","code_sha256_prefix":"e9e6b64db3e85003","mcp_get_code":{"code_sha256":"e9e6b64db3e85003"}},{"arxiv_id":"2505.23671","arxiv_id_is_arxiv":true,"paper":"/paper/gso-challenging-software-optimization-tasks","title":"GSO: Challenging Software Optimization Tasks for Evaluating SWE-Agents","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gso-bench/gso","path":"src/gso/harness/utils.py","file_url":"https://github.com/gso-bench/gso/blob/HEAD/src/gso/harness/utils.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":"78b4b1c42711889b","code_sha256_prefix":"78b4b1c42711889b","mcp_get_code":{"code_sha256":"78b4b1c42711889b"}},{"arxiv_id":"2410.09883","arxiv_id_is_arxiv":true,"paper":"/paper/physics-informed-neural-mapping-and-motion","title":"Physics-informed Neural Mapping and Motion Planning in Unknown Environments","date":null,"month_inferred_from_arxiv_id":"2024-10","title_source":"archive","repo":"rtlyc/antfields-demo","path":"dataprocessing/data_pc_validate.py","file_url":"https://github.com/rtlyc/antfields-demo/blob/HEAD/dataprocessing/data_pc_validate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, rtlyc/antfields-demo (NOASSERTION)","code_sha256":"cf5ef1770035a1a2","code_sha256_prefix":"cf5ef1770035a1a2","mcp_get_code":{"code_sha256":"cf5ef1770035a1a2"}},{"arxiv_id":"2408.05526","arxiv_id_is_arxiv":true,"paper":"/paper/cryobench-diverse-and-challenging-datasets","title":"CryoBench: Diverse and challenging datasets for the heterogeneity problem in cryo-EM","date":"2024-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-struct-bio/cryobench","path":"metrics/visualization/visualize_umap_IgG-RL.py","file_url":"https://github.com/ml-struct-bio/cryobench/blob/HEAD/metrics/visualization/visualize_umap_IgG-RL.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ml-struct-bio/cryobench when it was checked","code_sha256":"d53a2550f4900bc5","code_sha256_prefix":"d53a2550f4900bc5","mcp_get_code":{"code_sha256":"d53a2550f4900bc5"}},{"arxiv_id":"2209.12890","arxiv_id_is_arxiv":true,"paper":"/paper/it-takes-two-learning-to-plan-for-human-robot","title":"It Takes Two: Learning to Plan for Human-Robot Cooperative Carrying","date":"2022-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eleyng/table-carrying-ai","path":"libs/real_robot_utils.py","file_url":"https://github.com/eleyng/table-carrying-ai/blob/HEAD/libs/real_robot_utils.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":"7c0d126c0751adae","code_sha256_prefix":"7c0d126c0751adae","mcp_get_code":{"code_sha256":"7c0d126c0751adae"}}],"record_sha256":"1a1e8010b87cd1ef4a0627dd492a0eb726e505e8cb95f593825d56e2a906ef48","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}