{"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-dataset-path","entry":"get_dataset_path","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":10,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":5,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":2,"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":4,"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":"2602.16897","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-16897","title":"Machine Learning Hamiltonians are Accurate Energy-Force Predictors","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"seongsukim-ml/QHFlow2","path":"src/common/data_utils.py","file_url":"https://github.com/seongsukim-ml/QHFlow2/blob/HEAD/src/common/data_utils.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, seongsukim-ml/QHFlow2 (NOASSERTION)","code_sha256":"3578032b17ad4c45","code_sha256_prefix":"3578032b17ad4c45","mcp_get_code":{"code_sha256":"3578032b17ad4c45"}},{"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/core/constants.py","file_url":"https://github.com/LeiLiLab/susvibes/blob/HEAD/susvibes/core/constants.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":"87febe0057931286","code_sha256_prefix":"87febe0057931286","mcp_get_code":{"code_sha256":"87febe0057931286"}},{"arxiv_id":"2505.13934","arxiv_id_is_arxiv":true,"paper":"/paper/rlvr-world-training-world-models-with","title":"RLVR-World: Training World Models with Reinforcement Learning","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/RLVR-World","path":"vid_wm/oxe_data_converter.py","file_url":"https://github.com/thuml/RLVR-World/blob/HEAD/vid_wm/oxe_data_converter.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":"b49a1b06cda0c01a","code_sha256_prefix":"b49a1b06cda0c01a","mcp_get_code":{"code_sha256":"b49a1b06cda0c01a"}},{"arxiv_id":"2410.11247","arxiv_id_is_arxiv":true,"paper":"/paper/a-unified-framework-for-forward-and-inverse","title":"A Unified Framework for Forward and Inverse Problems in Subsurface Imaging using Latent Space Translations","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kgml-lab/generalized-forward-inverse-framework-for-dl4si","path":"evaluate/evaluate_zero_shot_forward_models.py","file_url":"https://github.com/kgml-lab/generalized-forward-inverse-framework-for-dl4si/blob/HEAD/evaluate/evaluate_zero_shot_forward_models.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, kgml-lab/generalized-forward-inverse-framework-for-dl4si when it was checked","code_sha256":"4f879f29f5dc3bb8","code_sha256_prefix":"4f879f29f5dc3bb8","mcp_get_code":{"code_sha256":"4f879f29f5dc3bb8"}},{"arxiv_id":"2402.04821","arxiv_id_is_arxiv":true,"paper":"/paper/e-3-equivariant-mesh-neural-networks","title":"E(3)-Equivariant Mesh Neural Networks","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hysonlab/equimesh","path":"experiments/exp_utils.py","file_url":"https://github.com/hysonlab/equimesh/blob/HEAD/experiments/exp_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":"8083454727b7f3ba","code_sha256_prefix":"8083454727b7f3ba","mcp_get_code":{"code_sha256":"8083454727b7f3ba"}},{"arxiv_id":"2306.08553","arxiv_id_is_arxiv":true,"paper":"/paper/noise-stability-optimization-for-flat-minima","title":"Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"virtuosoresearch/noise-stability-optimization","path":"chain-of-thought-finetuning/src/paths.py","file_url":"https://github.com/virtuosoresearch/noise-stability-optimization/blob/HEAD/chain-of-thought-finetuning/src/paths.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":"3df12d92fd1ba3ec","code_sha256_prefix":"3df12d92fd1ba3ec","mcp_get_code":{"code_sha256":"3df12d92fd1ba3ec"}},{"arxiv_id":"2212.10071","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-models-are-reasoning-teachers","title":"Large Language Models Are Reasoning Teachers","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"itsnamgyu/reasoning-teacher","path":"src/paths.py","file_url":"https://github.com/itsnamgyu/reasoning-teacher/blob/HEAD/src/paths.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":"3df12d92fd1ba3ec","code_sha256_prefix":"3df12d92fd1ba3ec","mcp_get_code":{"code_sha256":"3df12d92fd1ba3ec"}},{"arxiv_id":"2206.07557","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-reduce-change-detection-to-semantic","title":"How to Reduce Change Detection to Semantic Segmentation","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DoctorKey/C-3PO","path":"src/dataset/path_config.py","file_url":"https://github.com/DoctorKey/C-3PO/blob/HEAD/src/dataset/path_config.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":"68cd081c29e0536d","code_sha256_prefix":"68cd081c29e0536d","mcp_get_code":{"code_sha256":"68cd081c29e0536d"}},{"arxiv_id":"2205.10662","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-mesh-attention-networks","title":"Equivariant Mesh Attention Networks","date":"2022-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gallego-posada/eman","path":"experiments/exp_utils.py","file_url":"https://github.com/gallego-posada/eman/blob/HEAD/experiments/exp_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":"8083454727b7f3ba","code_sha256_prefix":"8083454727b7f3ba","mcp_get_code":{"code_sha256":"8083454727b7f3ba"}},{"arxiv_id":"1805.10915","arxiv_id_is_arxiv":true,"paper":"/paper/dirichlet-based-gaussian-processes-for-large","title":"Dirichlet-based Gaussian Processes for Large-scale Calibrated Classification","date":"2018-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmilios/dirichletGPC","path":"src/utilities.py","file_url":"https://github.com/dmilios/dirichletGPC/blob/HEAD/src/utilities.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":"1fe44eff6534cc57","code_sha256_prefix":"1fe44eff6534cc57","mcp_get_code":{"code_sha256":"1fe44eff6534cc57"}}],"record_sha256":"446124d18280a61ffe06f1a909f108e53d2089e3870ad7d3be48fa8decdfa03c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}