{"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/cfg","entry":"cfg","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":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":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":11,"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":5,"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":"2603.20206","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-20206","title":"Enhancing Safety of Large Language Models via Embedding Space Separation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"SproutNan/AI-Safety_SCAV","path":"embedding-level/perturbation.py","file_url":"https://github.com/SproutNan/AI-Safety_SCAV/blob/HEAD/embedding-level/perturbation.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, SproutNan/AI-Safety_SCAV when it was checked","code_sha256":"0bef6a58c78658fc","code_sha256_prefix":"0bef6a58c78658fc","mcp_get_code":{"code_sha256":"0bef6a58c78658fc"}},{"arxiv_id":"2602.21910","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-21910","title":"The Error of Deep Operator Networks Is the Sum of Its Parts: Branch-Trunk and Mode Error Decompositions","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"jotaraz/ModeDecomposition-DeepONets","path":"make_seed_sweep.py","file_url":"https://github.com/jotaraz/ModeDecomposition-DeepONets/blob/HEAD/make_seed_sweep.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, jotaraz/ModeDecomposition-DeepONets when it was checked","code_sha256":"2bb29a8193a0bf1c","code_sha256_prefix":"2bb29a8193a0bf1c","mcp_get_code":{"code_sha256":"2bb29a8193a0bf1c"}},{"arxiv_id":"2503.09411","arxiv_id_is_arxiv":true,"paper":"/paper/benefits-of-learning-rate-annealing-for","title":"Benefits of Learning Rate Annealing for Tuning-Robustness in Stochastic Optimization","date":"2025-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bmsookim/wide-resnet.pytorch","path":"networks/resnet.py","file_url":"https://github.com/bmsookim/wide-resnet.pytorch/blob/HEAD/networks/resnet.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":"5bf5755e73275b29","code_sha256_prefix":"5bf5755e73275b29","mcp_get_code":{"code_sha256":"5bf5755e73275b29"}},{"arxiv_id":"2503.09411","arxiv_id_is_arxiv":true,"paper":"/paper/benefits-of-learning-rate-annealing-for","title":"Benefits of Learning Rate Annealing for Tuning-Robustness in Stochastic Optimization","date":"2025-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bmsookim/wide-resnet.pytorch","path":"networks/vggnet.py","file_url":"https://github.com/bmsookim/wide-resnet.pytorch/blob/HEAD/networks/vggnet.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":"39ded92dbd260902","code_sha256_prefix":"39ded92dbd260902","mcp_get_code":{"code_sha256":"39ded92dbd260902"}},{"arxiv_id":"2210.14026","arxiv_id_is_arxiv":true,"paper":"/paper/swift-rapid-decentralized-federated-learning","title":"SWIFT: Rapid Decentralized Federated Learning via Wait-Free Model Communication","date":"2022-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umd-huang-lab/SWIFT","path":"GDM/Resnet.py","file_url":"https://github.com/umd-huang-lab/SWIFT/blob/HEAD/GDM/Resnet.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":"5bf5755e73275b29","code_sha256_prefix":"5bf5755e73275b29","mcp_get_code":{"code_sha256":"5bf5755e73275b29"}},{"arxiv_id":"2204.10839","arxiv_id_is_arxiv":true,"paper":"/paper/how-sampling-impacts-the-robustness-of","title":"How Sampling Impacts the Robustness of Stochastic Neural Networks","date":"2022-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meliketoy/wide-resnet.pytorch","path":"networks/resnet.py","file_url":"https://github.com/meliketoy/wide-resnet.pytorch/blob/HEAD/networks/resnet.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":"5bf5755e73275b29","code_sha256_prefix":"5bf5755e73275b29","mcp_get_code":{"code_sha256":"5bf5755e73275b29"}},{"arxiv_id":"2204.10839","arxiv_id_is_arxiv":true,"paper":"/paper/how-sampling-impacts-the-robustness-of","title":"How Sampling Impacts the Robustness of Stochastic Neural Networks","date":"2022-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meliketoy/wide-resnet.pytorch","path":"networks/vggnet.py","file_url":"https://github.com/meliketoy/wide-resnet.pytorch/blob/HEAD/networks/vggnet.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":"39ded92dbd260902","code_sha256_prefix":"39ded92dbd260902","mcp_get_code":{"code_sha256":"39ded92dbd260902"}},{"arxiv_id":"2202.13711","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-the-adversarial-robustness-of","title":"Evaluating the Adversarial Robustness of Adaptive Test-time Defenses","date":"2022-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fra31/evaluating-adaptive-test-time-defenses","path":"shi_2020/resnet.py","file_url":"https://github.com/fra31/evaluating-adaptive-test-time-defenses/blob/HEAD/shi_2020/resnet.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":"5bf5755e73275b29","code_sha256_prefix":"5bf5755e73275b29","mcp_get_code":{"code_sha256":"5bf5755e73275b29"}},{"arxiv_id":"1903.04411","arxiv_id_is_arxiv":true,"paper":"/paper/stroke-based-artistic-rendering-agent-with","title":"Learning to Paint With Model-based Deep Reinforcement Learning","date":"2019-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzwer/ICCV2019-LearningToPaint","path":"baseline_modelfree/DRL/actor.py","file_url":"https://github.com/hzwer/ICCV2019-LearningToPaint/blob/HEAD/baseline_modelfree/DRL/actor.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":"3e805cc6355e47d6","code_sha256_prefix":"3e805cc6355e47d6","mcp_get_code":{"code_sha256":"3e805cc6355e47d6"}},{"arxiv_id":"1903.04411","arxiv_id_is_arxiv":true,"paper":"/paper/stroke-based-artistic-rendering-agent-with","title":"Learning to Paint With Model-based Deep Reinforcement Learning","date":"2019-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzwer/ICCV2019-LearningToPaint","path":"baseline_modelfree/DRL/critic.py","file_url":"https://github.com/hzwer/ICCV2019-LearningToPaint/blob/HEAD/baseline_modelfree/DRL/critic.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":"824c6b3b443d148a","code_sha256_prefix":"824c6b3b443d148a","mcp_get_code":{"code_sha256":"824c6b3b443d148a"}},{"arxiv_id":"openreview_HJ0JFzdwUo","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_HJ0JFzdwUo","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"showlab/Code2Video","path":"src/gpt_request.py","file_url":"https://github.com/showlab/Code2Video/blob/HEAD/src/gpt_request.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":"c06515bec847003b","code_sha256_prefix":"c06515bec847003b","mcp_get_code":{"code_sha256":"c06515bec847003b"}}],"record_sha256":"24deb04c87c47b1cc2540654bec0b9989a2e2bd5d15ef864a21ef0ddf0b7868b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}