{"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/cifar100-2","entry":"cifar100","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":6,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":2,"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":6,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"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":2,"unverified":4},"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":"2206.12680","arxiv_id_is_arxiv":true,"paper":"/paper/topology-aware-generalization-of","title":"Topology-aware Generalization of Decentralized SGD","date":"2022-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raiden-zhu/generalization-of-dsgd","path":"gpu_work.py","file_url":"https://github.com/raiden-zhu/generalization-of-dsgd/blob/HEAD/gpu_work.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, raiden-zhu/generalization-of-dsgd when it was checked","code_sha256":"766cdf9454c0f265","code_sha256_prefix":"766cdf9454c0f265","mcp_get_code":{"code_sha256":"766cdf9454c0f265"}},{"arxiv_id":"2206.05893","arxiv_id_is_arxiv":true,"paper":"/paper/deploying-convolutional-networks-on-untrusted","title":"Deploying Convolutional Networks on Untrusted Platforms Using 2D Holographic Reduced Representations","date":"2022-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuromorphiccomputationresearchprogram/connectionist-symbolic-pseudo-secrets","path":"cifar100.py","file_url":"https://github.com/neuromorphiccomputationresearchprogram/connectionist-symbolic-pseudo-secrets/blob/HEAD/cifar100.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":"82c1231ab9c4f2d1","code_sha256_prefix":"82c1231ab9c4f2d1","mcp_get_code":{"code_sha256":"82c1231ab9c4f2d1"}},{"arxiv_id":"2202.00455","arxiv_id_is_arxiv":true,"paper":"/paper/hcsc-hierarchical-contrastive-selective","title":"HCSC: Hierarchical Contrastive Selective Coding","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hirl-team/hcsc","path":"hcsc/loader.py","file_url":"https://github.com/hirl-team/hcsc/blob/HEAD/hcsc/loader.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":"4af58a90cc3abb60","code_sha256_prefix":"4af58a90cc3abb60","mcp_get_code":{"code_sha256":"4af58a90cc3abb60"}},{"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":"cifar/model.py","file_url":"https://github.com/Alibaba-AAIG/Beyond-ImageNet-Attack/blob/HEAD/cifar/model.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":"3baa599c5d5d5bb5","code_sha256_prefix":"3baa599c5d5d5bb5","mcp_get_code":{"code_sha256":"3baa599c5d5d5bb5"}},{"arxiv_id":"2006.12135","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-generate-noise-for-robustness","title":"Learning to Generate Noise for Multi-Attack Robustness","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"divyam3897/MNG_AC","path":"torch_backend.py","file_url":"https://github.com/divyam3897/MNG_AC/blob/HEAD/torch_backend.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":"62cfcd202fa9f187","code_sha256_prefix":"62cfcd202fa9f187","mcp_get_code":{"code_sha256":"62cfcd202fa9f187"}},{"arxiv_id":"1811.02625","arxiv_id_is_arxiv":true,"paper":"/paper/mixtrain-scalable-training-of-verifiably","title":"MixTrain: Scalable Training of Verifiably Robust Neural Networks","date":"2018-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ARiSE-Lab/DeepInspect","path":"deepinspect/cifar100/model.py","file_url":"https://github.com/ARiSE-Lab/DeepInspect/blob/HEAD/deepinspect/cifar100/model.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":"01d6cf907175f18b","code_sha256_prefix":"01d6cf907175f18b","mcp_get_code":{"code_sha256":"01d6cf907175f18b"}}],"record_sha256":"4da32394d7509b41403e35f25f5224f68d6358f52e61bf220fa3fff88b4d56bc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}