{"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/vgg13-2","entry":"vgg13","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":9,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":3,"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":10,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":4,"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":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":"2405.18144","arxiv_id_is_arxiv":true,"paper":"/paper/4-bit-shampoo-for-memory-efficient-network","title":"4-bit Shampoo for Memory-Efficient Network Training","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sike-wang/low-bit-shampoo","path":"models/vgg.py","file_url":"https://github.com/sike-wang/low-bit-shampoo/blob/HEAD/models/vgg.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, sike-wang/low-bit-shampoo when it was checked","code_sha256":"d77d79a6e5db71b8","code_sha256_prefix":"d77d79a6e5db71b8","mcp_get_code":{"code_sha256":"d77d79a6e5db71b8"}},{"arxiv_id":"2403.00329","arxiv_id_is_arxiv":true,"paper":"/paper/learning-with-logical-constraints-but-without","title":"Learning with Logical Constraints but without Shortcut Satisfaction","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SoftWiser-group/NeSy-without-Shortcuts","path":"models/vgg.py","file_url":"https://github.com/SoftWiser-group/NeSy-without-Shortcuts/blob/HEAD/models/vgg.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, SoftWiser-group/NeSy-without-Shortcuts when it was checked","code_sha256":"3c7955d7089b595d","code_sha256_prefix":"3c7955d7089b595d","mcp_get_code":{"code_sha256":"3c7955d7089b595d"}},{"arxiv_id":"2402.18172","arxiv_id_is_arxiv":true,"paper":"/paper/nitedr-nighttime-image-de-raining-with-cross","title":"NiteDR: Nighttime Image De-Raining with Cross-View Sensor Cooperative Learning for Dynamic Driving Scenes","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cidanshi/nitedr-nighttime-image-de-raining","path":"vgg.py","file_url":"https://github.com/cidanshi/nitedr-nighttime-image-de-raining/blob/HEAD/vgg.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, cidanshi/nitedr-nighttime-image-de-raining when it was checked","code_sha256":"d567ea1f3c15e875","code_sha256_prefix":"d567ea1f3c15e875","mcp_get_code":{"code_sha256":"d567ea1f3c15e875"}},{"arxiv_id":"2402.00411","arxiv_id_is_arxiv":true,"paper":"/paper/lm-ht-snn-enhancing-the-performance-of-snn-to","title":"LM-HT SNN: Enhancing the Performance of SNN to ANN Counterpart through Learnable Multi-hierarchical Threshold Model","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzc1208/LMHT_SNN","path":"ann_models/VGG.py","file_url":"https://github.com/hzc1208/LMHT_SNN/blob/HEAD/ann_models/VGG.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, hzc1208/LMHT_SNN when it was checked","code_sha256":"d8bb4a9d1a90845c","code_sha256_prefix":"d8bb4a9d1a90845c","mcp_get_code":{"code_sha256":"d8bb4a9d1a90845c"}},{"arxiv_id":"2307.07873","arxiv_id_is_arxiv":true,"paper":"/paper/towards-understanding-adversarial","title":"Why Does Little Robustness Help? A Further Step Towards Understanding Adversarial Transferability","date":"2023-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgcl-codes/transferattacksurrogates","path":"TransferAttack/models/vgg.py","file_url":"https://github.com/cgcl-codes/transferattacksurrogates/blob/HEAD/TransferAttack/models/vgg.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":"573861d5c02def4d","code_sha256_prefix":"573861d5c02def4d","mcp_get_code":{"code_sha256":"573861d5c02def4d"}},{"arxiv_id":"2201.11528","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-imagenet-attack-towards-crafting-1","title":"Beyond ImageNet Attack: Towards Crafting Adversarial Examples for Black-box Domains","date":"2022-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alibaba-AAIG/Beyond-ImageNet-Attack","path":"imagenet/vgg.py","file_url":"https://github.com/Alibaba-AAIG/Beyond-ImageNet-Attack/blob/HEAD/imagenet/vgg.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":"f9a4c5c980953259","code_sha256_prefix":"f9a4c5c980953259","mcp_get_code":{"code_sha256":"f9a4c5c980953259"}},{"arxiv_id":"2010.04925","arxiv_id_is_arxiv":true,"paper":"/paper/regularizing-neural-networks-via-adversarial","title":"Regularizing Neural Networks via Adversarial Model Perturbation","date":"2020-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hiyouga/AMP-Regularizer","path":"models/vgg.py","file_url":"https://github.com/hiyouga/AMP-Regularizer/blob/HEAD/models/vgg.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":"a87c587db9bb46e7","code_sha256_prefix":"a87c587db9bb46e7","mcp_get_code":{"code_sha256":"a87c587db9bb46e7"}},{"arxiv_id":"1805.11614","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-under-privileged-information","title":"Deep Learning under Privileged Information Using Heteroscedastic Dropout","date":"2018-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johnwlambert/dlupi-heteroscedastic-dropout","path":"cnns/base_networks/vgg.py","file_url":"https://github.com/johnwlambert/dlupi-heteroscedastic-dropout/blob/HEAD/cnns/base_networks/vgg.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":"e4905952077a97ff","code_sha256_prefix":"e4905952077a97ff","mcp_get_code":{"code_sha256":"e4905952077a97ff"}},{"arxiv_id":"1609.04836","arxiv_id_is_arxiv":true,"paper":"/paper/on-large-batch-training-for-deep-learning","title":"On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minima","date":"2016-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keskarnitish/large-batch-training","path":"PyTorch/vgg.py","file_url":"https://github.com/keskarnitish/large-batch-training/blob/HEAD/PyTorch/vgg.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":"2ad86edffbcbccba","code_sha256_prefix":"2ad86edffbcbccba","mcp_get_code":{"code_sha256":"2ad86edffbcbccba"}},{"arxiv_id":"aaai_26027","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26027","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"UCAS-LCH/Twin-Rep","path":"models/vgg.py","file_url":"https://github.com/UCAS-LCH/Twin-Rep/blob/HEAD/models/vgg.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":"ae23e9758bbd9238","code_sha256_prefix":"ae23e9758bbd9238","mcp_get_code":{"code_sha256":"ae23e9758bbd9238"}}],"record_sha256":"aaa8340874015d1d3d049a4e13723022bf83ffb9f002052a8fa3beaa59120c82","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}