{"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/load-cifar100","entry":"load_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":0,"n_papers_ran_no_instrument_failure":0,"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":4,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":0,"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":"2407.06315","arxiv_id_is_arxiv":true,"paper":"/paper/shedding-more-light-on-robust-classifiers","title":"Shedding More Light on Robust Classifiers under the lens of Energy-based Models","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omnai-lab/robust-classifiers-under-the-lens-of-ebm","path":"image_generation/utils.py","file_url":"https://github.com/omnai-lab/robust-classifiers-under-the-lens-of-ebm/blob/HEAD/image_generation/utils.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":"681c8eb66d1b4ebc","code_sha256_prefix":"681c8eb66d1b4ebc","mcp_get_code":{"code_sha256":"681c8eb66d1b4ebc"}},{"arxiv_id":"2406.10737","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-domains-dynamic-solutions-dpcore-for","title":"Dynamic Domains, Dynamic Solutions: DPCore for Continual Test-Time Adaptation","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zybeich/DPCore","path":"imagenet/robustbench/data.py","file_url":"https://github.com/zybeich/DPCore/blob/HEAD/imagenet/robustbench/data.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":"52acd5b81cee97b1","code_sha256_prefix":"52acd5b81cee97b1","mcp_get_code":{"code_sha256":"52acd5b81cee97b1"}},{"arxiv_id":"2406.05927","arxiv_id_is_arxiv":true,"paper":"/paper/meansparse-post-training-robustness","title":"MeanSparse: Post-Training Robustness Enhancement Through Mean-Centered Feature Sparsification","date":"2024-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spin-umass/meansparse","path":"CIFAR100_Linfinity/data.py","file_url":"https://github.com/spin-umass/meansparse/blob/HEAD/CIFAR100_Linfinity/data.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, spin-umass/meansparse when it was checked","code_sha256":"2775934904810b7e","code_sha256_prefix":"2775934904810b7e","mcp_get_code":{"code_sha256":"2775934904810b7e"}},{"arxiv_id":"2405.16486","arxiv_id_is_arxiv":true,"paper":"/paper/decomposing-the-neurons-activation-sparsity","title":"Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"royzry98/moase-pytorch","path":"robustbench/data.py","file_url":"https://github.com/royzry98/moase-pytorch/blob/HEAD/robustbench/data.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, royzry98/moase-pytorch when it was checked","code_sha256":"52acd5b81cee97b1","code_sha256_prefix":"52acd5b81cee97b1","mcp_get_code":{"code_sha256":"52acd5b81cee97b1"}},{"arxiv_id":"2307.03133","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-test-time-adaptation-against","title":"Benchmarking Test-Time Adaptation against Distribution Shifts in Image Classification","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyongcan/benchmark-tta","path":"robustbench/data.py","file_url":"https://github.com/yuyongcan/benchmark-tta/blob/HEAD/robustbench/data.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, yuyongcan/benchmark-tta when it was checked","code_sha256":"52acd5b81cee97b1","code_sha256_prefix":"52acd5b81cee97b1","mcp_get_code":{"code_sha256":"52acd5b81cee97b1"}},{"arxiv_id":"2201.01212","arxiv_id_is_arxiv":true,"paper":"/paper/autobalance-optimized-loss-functions-for-1","title":"AutoBalance: Optimized Loss Functions for Imbalanced Data","date":"2022-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucr-optml/autobalance","path":"dataset/cifar100.py","file_url":"https://github.com/ucr-optml/autobalance/blob/HEAD/dataset/cifar100.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":"297d16d00bf739bb","code_sha256_prefix":"297d16d00bf739bb","mcp_get_code":{"code_sha256":"297d16d00bf739bb"}}],"record_sha256":"c8c38ea2a2af68192545113e50e2d7b0f0f9f393a59f69a56b77a024320bc313","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}