{"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-log-dir","entry":"get_log_dir","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":9,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":9,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":0,"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":2,"ran_fixture":0,"ran":3,"unverified":4},"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.15751","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-15751","title":"Trainable Spline Representations for Physics-Informed Learning","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"GiovanniCanali/PI-Splines","path":"src/utils/tools.py","file_url":"https://github.com/GiovanniCanali/PI-Splines/blob/HEAD/src/utils/tools.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":"3c05ae00fdc14b5d","code_sha256_prefix":"3c05ae00fdc14b5d","mcp_get_code":{"code_sha256":"3c05ae00fdc14b5d"}},{"arxiv_id":"2602.01619","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-01619","title":"SUSD: Structured Unsupervised Skill Discovery through State Factorization","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"hadi-hosseini/SUSD","path":"src/utils.py","file_url":"https://github.com/hadi-hosseini/SUSD/blob/HEAD/src/utils.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":"4781548f0ecb7e2f","code_sha256_prefix":"4781548f0ecb7e2f","mcp_get_code":{"code_sha256":"4781548f0ecb7e2f"}},{"arxiv_id":"2512.03262","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-03262","title":"Is Vibe Coding Safe? Benchmarking Vulnerability of Agent-Generated Code in Real-World Tasks","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"LeiLiLab/susvibes","path":"susvibes/curate/constants.py","file_url":"https://github.com/LeiLiLab/susvibes/blob/HEAD/susvibes/curate/constants.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":"82b747bd2d678cf7","code_sha256_prefix":"82b747bd2d678cf7","mcp_get_code":{"code_sha256":"82b747bd2d678cf7"}},{"arxiv_id":"2407.05996","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-diffusion-transformer-learning","title":"Multimodal Diffusion Transformer: Learning Versatile Behavior from Multimodal Goals","date":null,"month_inferred_from_arxiv_id":"2024-07","title_source":"archive","repo":"intuitive-robots/mdt_policy","path":"mdt/evaluation/mdt_evaluate.py","file_url":"https://github.com/intuitive-robots/mdt_policy/blob/HEAD/mdt/evaluation/mdt_evaluate.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":"e2bd842daf595f33","code_sha256_prefix":"e2bd842daf595f33","mcp_get_code":{"code_sha256":"e2bd842daf595f33"}},{"arxiv_id":"2311.12472","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-deconfounding-against-spatio","title":"Seeing the Unseen: Learning Basis Confounder Representations for Robust Traffic Prediction","date":"2023-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigscity/steve_code","path":"STEVE/lib/utils.py","file_url":"https://github.com/bigscity/steve_code/blob/HEAD/STEVE/lib/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":"7af6ba4835dfe31d","code_sha256_prefix":"7af6ba4835dfe31d","mcp_get_code":{"code_sha256":"7af6ba4835dfe31d"}},{"arxiv_id":"2311.00389","arxiv_id_is_arxiv":true,"paper":"/paper/neuralgf-unsupervised-point-normal-estimation-1","title":"NeuralGF: Unsupervised Point Normal Estimation by Learning Neural Gradient Function","date":"2023-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeoQLi/NeuralGF","path":"misc.py","file_url":"https://github.com/LeoQLi/NeuralGF/blob/HEAD/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":"21bfea4257dc3c0e","code_sha256_prefix":"21bfea4257dc3c0e","mcp_get_code":{"code_sha256":"21bfea4257dc3c0e"}},{"arxiv_id":"2204.06252","arxiv_id_is_arxiv":true,"paper":"/paper/what-matters-in-language-conditioned-robotic","title":"What Matters in Language Conditioned Robotic Imitation Learning over Unstructured Data","date":"2022-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lukashermann/hulc","path":"hulc/evaluation/run_multiple.py","file_url":"https://github.com/lukashermann/hulc/blob/HEAD/hulc/evaluation/run_multiple.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":"b008129d68433002","code_sha256_prefix":"b008129d68433002","mcp_get_code":{"code_sha256":"b008129d68433002"}},{"arxiv_id":"2112.03227","arxiv_id_is_arxiv":true,"paper":"/paper/calvin-a-benchmark-for-language-conditioned","title":"CALVIN: A Benchmark for Language-Conditioned Policy Learning for Long-Horizon Robot Manipulation Tasks","date":"2021-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mees/calvin","path":"calvin_models/calvin_agent/evaluation/utils.py","file_url":"https://github.com/mees/calvin/blob/HEAD/calvin_models/calvin_agent/evaluation/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":"d85175948c443563","code_sha256_prefix":"d85175948c443563","mcp_get_code":{"code_sha256":"d85175948c443563"}},{"arxiv_id":"1810.05934","arxiv_id_is_arxiv":true,"paper":"/paper/massively-parallel-hyperparameter-tuning","title":"A System for Massively Parallel Hyperparameter Tuning","date":"2018-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lukashedegaard/ride","path":"ride/logging.py","file_url":"https://github.com/lukashedegaard/ride/blob/HEAD/ride/logging.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":"9170c3ab64f34ec1","code_sha256_prefix":"9170c3ab64f34ec1","mcp_get_code":{"code_sha256":"9170c3ab64f34ec1"}}],"record_sha256":"b90f021a7600e4d1aa459834ebe43ba3684a4eac8406b4733ec6aa2888b4c529","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}