{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/cifar100-dataloaders","entry":"cifar100_dataloaders","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":1,"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":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":6},"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":"2402.11846","paper":"/paper/unlearncanvas-a-stylized-image-dataset-to","title":"UnlearnCanvas: Stylized Image Dataset for Enhanced Machine Unlearning Evaluation in Diffusion Models","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JingWu321/Scissorhands","path":"Classification/dataset.py","file_url":"https://github.com/JingWu321/Scissorhands/blob/HEAD/Classification/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9ea29973ea0485a1","mcp_get_code":{"code_sha256":"9ea29973ea0485a1"}},{"arxiv_id":"2401.06187","paper":"/paper/scissorhands-scrub-data-influence-via","title":"Scissorhands: Scrub Data Influence via Connection Sensitivity in Networks","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingwu321/scissorhands","path":"Classification/dataset.py","file_url":"https://github.com/jingwu321/scissorhands/blob/HEAD/Classification/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9ea29973ea0485a1","mcp_get_code":{"code_sha256":"9ea29973ea0485a1"}},{"arxiv_id":"2310.18574","paper":"/paper/breaking-the-trilemma-of-privacy-utility","title":"Breaking the Trilemma of Privacy, Utility, Efficiency via Controllable Machine Unlearning","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guangyaodou/conmu","path":"dataset.py","file_url":"https://github.com/guangyaodou/conmu/blob/HEAD/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ae8ce8acbccfd13d","mcp_get_code":{"code_sha256":"ae8ce8acbccfd13d"}},{"arxiv_id":"2302.12480","paper":"/paper/robust-weight-signatures-gaining-robustness","title":"Robust Weight Signatures: Gaining Robustness as Easy as Patching Weights?","date":"2023-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/Robust_Weight_Signatures","path":"datasets/cifar.py","file_url":"https://github.com/VITA-Group/Robust_Weight_Signatures/blob/HEAD/datasets/cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2401e51688b0f4c4","mcp_get_code":{"code_sha256":"2401e51688b0f4c4"}},{"arxiv_id":"2202.09844","paper":"/paper/sparsity-winning-twice-better-robust-1","title":"Sparsity Winning Twice: Better Robust Generalization from More Efficient Training","date":"2022-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/sparsity-win-robust-generalization","path":"Robust-Bird/datasets.py","file_url":"https://github.com/vita-group/sparsity-win-robust-generalization/blob/HEAD/Robust-Bird/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c1fae20306092b7b","mcp_get_code":{"code_sha256":"c1fae20306092b7b"}},{"arxiv_id":"2106.03225","paper":"/paper/efficient-lottery-ticket-finding-less-data-is","title":"Efficient Lottery Ticket Finding: Less Data is More","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/PrAC-LTH","path":"dataset.py","file_url":"https://github.com/VITA-Group/PrAC-LTH/blob/HEAD/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0a0dbd36d312037d","mcp_get_code":{"code_sha256":"0a0dbd36d312037d"}},{"arxiv_id":"2104.08215","paper":"/paper/bnn-bn-training-binary-neural-networks","title":"\"BNN - BN = ?\": Training Binary Neural Networks without Batch Normalization","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/BNN_NoBN","path":"dataset.py","file_url":"https://github.com/VITA-Group/BNN_NoBN/blob/HEAD/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5ae551aef288dd66","mcp_get_code":{"code_sha256":"5ae551aef288dd66"}},{"arxiv_id":"2103.12171","paper":"/paper/adversarial-feature-augmentation-and","title":"Adversarial Feature Augmentation and Normalization for Visual Recognition","date":"2021-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/CV_A-FAN","path":"Classification/dataset.py","file_url":"https://github.com/VITA-Group/CV_A-FAN/blob/HEAD/Classification/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"accb544e928582b0","mcp_get_code":{"code_sha256":"accb544e928582b0"}}]}