{"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/aug","entry":"aug","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":7,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":5,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":5,"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":3,"ran_fixture":2,"ran":2,"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":"2606.00738","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-00738","title":"SORA: Free Second-Order Attacks in Fast Adversarial Training","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"HuangZhiChao95/ATAS","path":"data_aug.py","file_url":"https://github.com/HuangZhiChao95/ATAS/blob/HEAD/data_aug.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, HuangZhiChao95/ATAS when it was checked","code_sha256":"1db1dd6425b63b5f","code_sha256_prefix":"1db1dd6425b63b5f","mcp_get_code":{"code_sha256":"1db1dd6425b63b5f"}},{"arxiv_id":"2312.17244","arxiv_id_is_arxiv":true,"paper":"/paper/the-llm-surgeon","title":"The LLM Surgeon","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qualcomm-ai-research/llm-surgeon","path":"utils.py","file_url":"https://github.com/qualcomm-ai-research/llm-surgeon/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause-Clear","inline_ok":false,"inline_ok_link":false,"withheld_clause":"BSD-3-Clause-Clear, as GitHub detects it on this paper's repository, qualcomm-ai-research/llm-surgeon, is not in the permissive set Syntology serves inline","code_sha256":"a431af9d814c9eaa","code_sha256_prefix":"a431af9d814c9eaa","mcp_get_code":{"code_sha256":"a431af9d814c9eaa"}},{"arxiv_id":"2308.15499","arxiv_id_is_arxiv":true,"paper":"/paper/classification-robustness-to-common-optical","title":"Classification robustness to common optical aberrations","date":"2023-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"patmue/classification_robustness","path":"optics_augment/augmix.py","file_url":"https://github.com/patmue/classification_robustness/blob/HEAD/optics_augment/augmix.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, patmue/classification_robustness when it was checked","code_sha256":"83ebb53ea26f0520","code_sha256_prefix":"83ebb53ea26f0520","mcp_get_code":{"code_sha256":"83ebb53ea26f0520"}},{"arxiv_id":"2203.16481","arxiv_id_is_arxiv":true,"paper":"/paper/on-uncertainty-tempering-and-data","title":"On Uncertainty, Tempering, and Data Augmentation in Bayesian Classification","date":"2022-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/bayesian-classification","path":"src/data_aug/datasets.py","file_url":"https://github.com/activatedgeek/bayesian-classification/blob/HEAD/src/data_aug/datasets.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":"f3e585fbf55734ee","code_sha256_prefix":"f3e585fbf55734ee","mcp_get_code":{"code_sha256":"f3e585fbf55734ee"}},{"arxiv_id":"2109.06480","arxiv_id_is_arxiv":true,"paper":"/paper/logic-level-evidence-retrieval-and-graph","title":"Logic-level Evidence Retrieval and Graph-based Verification Network for Table-based Fact Verification","date":"2021-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qshi95/lergv","path":"modeling_gnn.py","file_url":"https://github.com/qshi95/lergv/blob/HEAD/modeling_gnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, qshi95/lergv when it was checked","code_sha256":"4f7bf8f9ff270a79","code_sha256_prefix":"4f7bf8f9ff270a79","mcp_get_code":{"code_sha256":"4f7bf8f9ff270a79"}},{"arxiv_id":"2007.04309","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-policy-adaptation-during","title":"Self-Supervised Policy Adaptation during Deployment","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joshnroy/contrastive-pad","path":"src/agent/agent.py","file_url":"https://github.com/joshnroy/contrastive-pad/blob/HEAD/src/agent/agent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, joshnroy/contrastive-pad when it was checked","code_sha256":"e432c8c8eddcb3b7","code_sha256_prefix":"e432c8c8eddcb3b7","mcp_get_code":{"code_sha256":"e432c8c8eddcb3b7"}},{"arxiv_id":"1912.02781","arxiv_id_is_arxiv":true,"paper":"/paper/augmix-a-simple-data-processing-method-to","title":"AugMix: A Simple Data Processing Method to Improve Robustness and Uncertainty","date":"2019-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"etetteh/sota-data-augmentation-and-optimizers","path":"augmentation/AugMix/AugMix.py","file_url":"https://github.com/etetteh/sota-data-augmentation-and-optimizers/blob/HEAD/augmentation/AugMix/AugMix.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7775613c3a12e0b6","code_sha256_prefix":"7775613c3a12e0b6","mcp_get_code":{"code_sha256":"7775613c3a12e0b6"}},{"arxiv_id":"1802.02950","arxiv_id_is_arxiv":true,"paper":"/paper/rotate-your-networks-better-weight","title":"Rotate your Networks: Better Weight Consolidation and Less Catastrophic Forgetting","date":"2018-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xialeiliu/RotateNetworks","path":"utils/utils_cifar100.py","file_url":"https://github.com/xialeiliu/RotateNetworks/blob/HEAD/utils/utils_cifar100.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"519322e2bab1faca","code_sha256_prefix":"519322e2bab1faca","mcp_get_code":{"code_sha256":"519322e2bab1faca"}}],"record_sha256":"127c33748208581b3b0a7a96fcc67394aa2ba765bfc9f267057c58f9a3005d0a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}