{"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/get-cifar10-dataset","entry":"get_cifar10_dataset","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":7,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":2,"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":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":7,"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":2,"ran_fixture":0,"ran":0,"unverified":5},"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":"2502.07547","arxiv_id_is_arxiv":true,"paper":"/paper/instance-dependent-early-stopping","title":"Instance-dependent Early Stopping","date":"2025-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmllab/2025_iclr_ies","path":"cifar_main.py","file_url":"https://github.com/tmllab/2025_iclr_ies/blob/HEAD/cifar_main.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, tmllab/2025_iclr_ies when it was checked","code_sha256":"c8fbf107d9014e50","code_sha256_prefix":"c8fbf107d9014e50","mcp_get_code":{"code_sha256":"c8fbf107d9014e50"}},{"arxiv_id":"2408.07268","arxiv_id_is_arxiv":true,"paper":"/paper/fast-unconstrained-optimization-via-hessian","title":"Fast Unconstrained Optimization via Hessian Averaging and Adaptive Gradient Sampling Methods","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tomoleary/hessianaveraging","path":"applications/resnet/dataUtilities.py","file_url":"https://github.com/tomoleary/hessianaveraging/blob/HEAD/applications/resnet/dataUtilities.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":"4e118497a397a8e2","code_sha256_prefix":"4e118497a397a8e2","mcp_get_code":{"code_sha256":"4e118497a397a8e2"}},{"arxiv_id":"2312.04528","arxiv_id_is_arxiv":true,"paper":"/paper/using-large-language-models-for","title":"Using Large Language Models for Hyperparameter Optimization","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michaelrzhang/llm-hyperopt","path":"cifar/pipeline.py","file_url":"https://github.com/michaelrzhang/llm-hyperopt/blob/HEAD/cifar/pipeline.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, michaelrzhang/llm-hyperopt when it was checked","code_sha256":"747fbaa891c47810","code_sha256_prefix":"747fbaa891c47810","mcp_get_code":{"code_sha256":"747fbaa891c47810"}},{"arxiv_id":"2102.13416","arxiv_id_is_arxiv":true,"paper":"/paper/moreau-yosida-f-divergences","title":"Moreau-Yosida $f$-divergences","date":"2021-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renyi-ai/moreau-yosida-f-divergences","path":"gan_cifar10.py","file_url":"https://github.com/renyi-ai/moreau-yosida-f-divergences/blob/HEAD/gan_cifar10.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, renyi-ai/moreau-yosida-f-divergences when it was checked","code_sha256":"257839deea092962","code_sha256_prefix":"257839deea092962","mcp_get_code":{"code_sha256":"257839deea092962"}},{"arxiv_id":"2003.13678","arxiv_id_is_arxiv":true,"paper":"/paper/designing-network-design-spaces","title":"Designing Network Design Spaces","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wilile26811249/RegNet","path":"utils.py","file_url":"https://github.com/wilile26811249/RegNet/blob/HEAD/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":"ba1d6e8ebcd04bd9","code_sha256_prefix":"ba1d6e8ebcd04bd9","mcp_get_code":{"code_sha256":"ba1d6e8ebcd04bd9"}},{"arxiv_id":"1911.03149","arxiv_id_is_arxiv":true,"paper":"/paper/quality-aware-generative-adversarial-networks","title":"Quality Aware Generative Adversarial Networks","date":"2019-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lfovia/QAGANS","path":"QAGAN-SSIM/cifar10_SSIM_GP.py","file_url":"https://github.com/lfovia/QAGANS/blob/HEAD/QAGAN-SSIM/cifar10_SSIM_GP.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, lfovia/QAGANS when it was checked","code_sha256":"b91909d28f43cb0a","code_sha256_prefix":"b91909d28f43cb0a","mcp_get_code":{"code_sha256":"b91909d28f43cb0a"}},{"arxiv_id":"1907.05681","arxiv_id_is_arxiv":true,"paper":"/paper/virtual-adversarial-lipschitz-regularization","title":"Adversarial Lipschitz Regularization","date":"2019-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dterjek/adversarial_lipschitz_regularization","path":"wgan_alp.py","file_url":"https://github.com/dterjek/adversarial_lipschitz_regularization/blob/HEAD/wgan_alp.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, dterjek/adversarial_lipschitz_regularization when it was checked","code_sha256":"fcf4eb1c1263706c","code_sha256_prefix":"fcf4eb1c1263706c","mcp_get_code":{"code_sha256":"fcf4eb1c1263706c"}}],"record_sha256":"f9bb0a39d84d5dfc9def01ca06adad684798ee390d8e93bfdac75e459b6e3125","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}