{"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/transition-2","entry":"Transition","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":0,"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":7,"n_samples_ran":6,"n_samples_constructed":6,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":7,"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":0,"ran_fixture":0,"ran":6,"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":"2607.25236","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-25236","title":"VisualPatchWorld: Code World Models as Latent Structured Representations for Planning","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"HKBU-KnowComp/VisualPatchWorld","path":"src/visualpatchworld/structure_induction.py","file_url":"https://github.com/HKBU-KnowComp/VisualPatchWorld/blob/HEAD/src/visualpatchworld/structure_induction.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ccc986c237c99cc1","code_sha256_prefix":"ccc986c237c99cc1","mcp_get_code":{"code_sha256":"ccc986c237c99cc1"}},{"arxiv_id":"2603.11395","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-11395","title":"ARROW: Augmented Replay for RObust World models","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Cerenaut/ARROW","path":"Code/ARROW_and_DV3/Atari/rssm.py","file_url":"https://github.com/Cerenaut/ARROW/blob/HEAD/Code/ARROW_and_DV3/Atari/rssm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"385e472bca3a8b2c","code_sha256_prefix":"385e472bca3a8b2c","mcp_get_code":{"code_sha256":"385e472bca3a8b2c"}},{"arxiv_id":"2511.02304","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-02304","title":"Automata-Conditioned Cooperative Multi-Agent Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"rad-dfa/acc-marl","path":"acc_marl/train_recurrent_policy.py","file_url":"https://github.com/rad-dfa/acc-marl/blob/HEAD/acc_marl/train_recurrent_policy.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, rad-dfa/acc-marl (NOASSERTION)","code_sha256":"0a52c00ef0bcc3f3","code_sha256_prefix":"0a52c00ef0bcc3f3","mcp_get_code":{"code_sha256":"0a52c00ef0bcc3f3"}},{"arxiv_id":"2104.01231","arxiv_id_is_arxiv":true,"paper":"/paper/misclassification-aware-gaussian-smoothing","title":"Diverse Gaussian Noise Consistency Regularization for Robustness and Uncertainty Calibration","date":"2021-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theot1/dign","path":"DiGN.py","file_url":"https://github.com/theot1/dign/blob/HEAD/DiGN.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"da9155d90cea93d6","code_sha256_prefix":"da9155d90cea93d6","mcp_get_code":{"code_sha256":"da9155d90cea93d6"}},{"arxiv_id":"2010.08001","arxiv_id_is_arxiv":true,"paper":"/paper/maximum-entropy-adversarial-data-augmentation","title":"Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustness","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"garyzhao/ME-ADA","path":"model_cifar.py","file_url":"https://github.com/garyzhao/ME-ADA/blob/HEAD/model_cifar.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8710e0de3e2bf007","code_sha256_prefix":"8710e0de3e2bf007","mcp_get_code":{"code_sha256":"8710e0de3e2bf007"}},{"arxiv_id":"1512.03385","arxiv_id_is_arxiv":true,"paper":"/paper/deep-residual-learning-for-image-recognition","title":"Deep Residual Learning for Image Recognition","date":"2015-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangHa0411/CIFAR100","path":"model.py","file_url":"https://github.com/sangHa0411/CIFAR100/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"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, sangHa0411/CIFAR100 when it was checked","code_sha256":"1b874ee95860d46d","code_sha256_prefix":"1b874ee95860d46d","mcp_get_code":{"code_sha256":"1b874ee95860d46d"}},{"arxiv_id":"1509.06461","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-with-double-q","title":"Deep Reinforcement Learning with Double Q-learning","date":"2015-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hamishs/JAX-RL","path":"src/jax_rl/algorithms/dqn.py","file_url":"https://github.com/hamishs/JAX-RL/blob/HEAD/src/jax_rl/algorithms/dqn.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":"1652d7453e55d633","code_sha256_prefix":"1652d7453e55d633","mcp_get_code":{"code_sha256":"1652d7453e55d633"}}],"record_sha256":"b1ab6b6f50d7d46bd1515a4e5377e1befa3fda4218b7562a0dd7bed5c7b4c77c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}