{"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/load-trajectories","entry":"load_trajectories","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":4,"n_papers_ran_no_instrument_failure":3,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":8,"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":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"unverified":2},"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":"2605.30880","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-30880","title":"PatchWorld: Gradient-Free Optimization of Executable World Models for Agent Environments","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"HKBU-KnowComp/PatchWorld","path":"patchworld/worldmodel_data.py","file_url":"https://github.com/HKBU-KnowComp/PatchWorld/blob/HEAD/patchworld/worldmodel_data.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":"df272630397f75fe","code_sha256_prefix":"df272630397f75fe","mcp_get_code":{"code_sha256":"df272630397f75fe"}},{"arxiv_id":"2602.10793","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10793","title":"Semi-Supervised Cross-Domain Imitation Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Div-Infinity/IQ-Learn","path":"iq_learn/dataset/expert_dataset.py","file_url":"https://github.com/Div-Infinity/IQ-Learn/blob/HEAD/iq_learn/dataset/expert_dataset.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, Div-Infinity/IQ-Learn (NOASSERTION)","code_sha256":"7d10ded5ef8029af","code_sha256_prefix":"7d10ded5ef8029af","mcp_get_code":{"code_sha256":"7d10ded5ef8029af"}},{"arxiv_id":"2602.06923","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-06923","title":"From Kepler to Newton: Inductive Biases Guide Learned World Models in Transformers","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"KindXiaoming/newton-kepler","path":"kepler.py","file_url":"https://github.com/KindXiaoming/newton-kepler/blob/HEAD/kepler.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, KindXiaoming/newton-kepler when it was checked","code_sha256":"e75836153ab7e442","code_sha256_prefix":"e75836153ab7e442","mcp_get_code":{"code_sha256":"e75836153ab7e442"}},{"arxiv_id":"2602.06923","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-06923","title":"From Kepler to Newton: Inductive Biases Guide Learned World Models in Transformers","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"KindXiaoming/newton-kepler","path":"kepler_cv_blocksize.py","file_url":"https://github.com/KindXiaoming/newton-kepler/blob/HEAD/kepler_cv_blocksize.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, KindXiaoming/newton-kepler when it was checked","code_sha256":"f06d7888d73cea85","code_sha256_prefix":"f06d7888d73cea85","mcp_get_code":{"code_sha256":"f06d7888d73cea85"}},{"arxiv_id":"2503.14443","arxiv_id_is_arxiv":true,"paper":"/paper/envbench-a-benchmark-for-automated","title":"EnvBench: A Benchmark for Automated Environment Setup","date":"2025-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JetBrains-Research/EnvBench","path":"env_setup_utils/analysis/analysis_utils.py","file_url":"https://github.com/JetBrains-Research/EnvBench/blob/HEAD/env_setup_utils/analysis/analysis_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":"fb8ef64f77241e01","code_sha256_prefix":"fb8ef64f77241e01","mcp_get_code":{"code_sha256":"fb8ef64f77241e01"}},{"arxiv_id":"2503.14443","arxiv_id_is_arxiv":true,"paper":"/paper/envbench-a-benchmark-for-automated","title":"EnvBench: A Benchmark for Automated Environment Setup","date":"2025-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JetBrains-Research/EnvBench","path":"env_setup_utils/analysis/traj_viewer.py","file_url":"https://github.com/JetBrains-Research/EnvBench/blob/HEAD/env_setup_utils/analysis/traj_viewer.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":"6d632320966d776a","code_sha256_prefix":"6d632320966d776a","mcp_get_code":{"code_sha256":"6d632320966d776a"}},{"arxiv_id":"2312.11598","arxiv_id_is_arxiv":true,"paper":"/paper/skilldiffuser-interpretable-hierarchical","title":"SkillDiffuser: Interpretable Hierarchical Planning via Skill Abstractions in Diffusion-Based Task Execution","date":"2023-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liang-ZX/SkillDiffuser","path":"skilldiffuser/hrl/expert_dataset.py","file_url":"https://github.com/Liang-ZX/SkillDiffuser/blob/HEAD/skilldiffuser/hrl/expert_dataset.py","status":"unverified","verification_level":0,"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, Liang-ZX/SkillDiffuser when it was checked","code_sha256":"f2bf1c69ffe9deea","code_sha256_prefix":"f2bf1c69ffe9deea","mcp_get_code":{"code_sha256":"f2bf1c69ffe9deea"}},{"arxiv_id":"2307.07205","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-motion-conditioned-diffusion-model","title":"Multimodal Motion Conditioned Diffusion Model for Skeleton-based Video Anomaly Detection","date":"2023-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aleflabo/MoCoDAD","path":"utils/data.py","file_url":"https://github.com/aleflabo/MoCoDAD/blob/HEAD/utils/data.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":"f7e3b54a8686d2b2","code_sha256_prefix":"f7e3b54a8686d2b2","mcp_get_code":{"code_sha256":"f7e3b54a8686d2b2"}}],"record_sha256":"aec0d5d1d6d3334d18483468cdb87e30b47b463f0e30aa410f396f23281678a4","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}