{"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-exp-name","entry":"get_exp_name","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":4,"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":9,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"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":5,"ran_fixture":0,"ran":4,"unverified":0},"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.06156","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-06156","title":"Entropy-Regularized Adjoint Matching for Offline Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ColinQiyangLi/qam","path":"log_utils.py","file_url":"https://github.com/ColinQiyangLi/qam/blob/HEAD/log_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":"f18f9636b9254fb6","code_sha256_prefix":"f18f9636b9254fb6","mcp_get_code":{"code_sha256":"f18f9636b9254fb6"}},{"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":"bc3643cf28b0a592","code_sha256_prefix":"bc3643cf28b0a592","mcp_get_code":{"code_sha256":"bc3643cf28b0a592"}},{"arxiv_id":"2311.17286","arxiv_id_is_arxiv":true,"paper":"/paper/leod-label-efficient-object-detection-for","title":"LEOD: Label-Efficient Object Detection for Event Cameras","date":"2023-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Wuziyi616/LEOD","path":"vis_pred.py","file_url":"https://github.com/Wuziyi616/LEOD/blob/HEAD/vis_pred.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":"863d6d270922ea4a","code_sha256_prefix":"863d6d270922ea4a","mcp_get_code":{"code_sha256":"863d6d270922ea4a"}},{"arxiv_id":"2310.18844","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2310.18844","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"ThrunGroup/BanditPAM_plusplus_experiments","path":"experiments/create_configs.py","file_url":"https://github.com/ThrunGroup/BanditPAM_plusplus_experiments/blob/HEAD/experiments/create_configs.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":"8e89c610b080c6e8","code_sha256_prefix":"8e89c610b080c6e8","mcp_get_code":{"code_sha256":"8e89c610b080c6e8"}},{"arxiv_id":"2307.09520","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-bayesian-augmentation-for-single","title":"Adversarial Bayesian Augmentation for Single-Source Domain Generalization","date":"2023-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shengcheng/ABA","path":"trainer_bnn.py","file_url":"https://github.com/shengcheng/ABA/blob/HEAD/trainer_bnn.py","status":"ran","verification_level":1,"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, shengcheng/ABA when it was checked","code_sha256":"f709e785d2ca20cf","code_sha256_prefix":"f709e785d2ca20cf","mcp_get_code":{"code_sha256":"f709e785d2ca20cf"}},{"arxiv_id":"2305.16037","arxiv_id_is_arxiv":true,"paper":"/paper/generatect-text-guided-3d-chest-ct-generation","title":"GenerateCT: Text-Conditional Generation of 3D Chest CT Volumes","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibrahimethemhamamci/generatect","path":"inference_superres.py","file_url":"https://github.com/ibrahimethemhamamci/generatect/blob/HEAD/inference_superres.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":"89fb6a86f187a44f","code_sha256_prefix":"89fb6a86f187a44f","mcp_get_code":{"code_sha256":"89fb6a86f187a44f"}},{"arxiv_id":"2106.04619","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-with-data","title":"Self-Supervised Learning with Data Augmentations Provably Isolates Content from Style","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ysharma1126/ssl_identifiability","path":"main_mlp.py","file_url":"https://github.com/ysharma1126/ssl_identifiability/blob/HEAD/main_mlp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7c99fad0c328715","code_sha256_prefix":"b7c99fad0c328715","mcp_get_code":{"code_sha256":"b7c99fad0c328715"}},{"arxiv_id":"2106.04619","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-with-data","title":"Self-Supervised Learning with Data Augmentations Provably Isolates Content from Style","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ysharma1126/ssl_identifiability","path":"main_3dident.py","file_url":"https://github.com/ysharma1126/ssl_identifiability/blob/HEAD/main_3dident.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"def79ba06f792d6f","code_sha256_prefix":"def79ba06f792d6f","mcp_get_code":{"code_sha256":"def79ba06f792d6f"}},{"arxiv_id":"2006.03647","arxiv_id_is_arxiv":true,"paper":"/paper/deployment-efficient-reinforcement-learning","title":"Deployment-Efficient Reinforcement Learning via Model-Based Offline Optimization","date":"2020-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matsuolab/BREMEN","path":"recursive.py","file_url":"https://github.com/matsuolab/BREMEN/blob/HEAD/recursive.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, matsuolab/BREMEN when it was checked","code_sha256":"59f1ac51a1a949cc","code_sha256_prefix":"59f1ac51a1a949cc","mcp_get_code":{"code_sha256":"59f1ac51a1a949cc"}}],"record_sha256":"958bb4d981311879088338d268b9bae17423ac02bb2a4b94cab8edb1e36178ec","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}