{"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/cifar10-2","entry":"CIFAR10","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":9,"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":7,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":9,"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":0,"unverified":7},"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":"2511.17399","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-17399","title":"Stable Coresets via Posterior Sampling: Aligning Induced and Full Loss Landscapes","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"PatrickZH/DeepCore","path":"deepcore/datasets/cifar10.py","file_url":"https://github.com/PatrickZH/DeepCore/blob/HEAD/deepcore/datasets/cifar10.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":"75af3219fc982938","code_sha256_prefix":"75af3219fc982938","mcp_get_code":{"code_sha256":"75af3219fc982938"}},{"arxiv_id":"2506.14473","arxiv_id_is_arxiv":true,"paper":"/paper/foundation-model-insights-and-a-multi-model","title":"Foundation Model Insights and a Multi-Model Approach for Superior Fine-Grained One-shot Subset Selection","date":"2025-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhijingWan/RAM-APL","path":"deepcore/datasets/cifar10.py","file_url":"https://github.com/ZhijingWan/RAM-APL/blob/HEAD/deepcore/datasets/cifar10.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":"75af3219fc982938","code_sha256_prefix":"75af3219fc982938","mcp_get_code":{"code_sha256":"75af3219fc982938"}},{"arxiv_id":"2306.09595","arxiv_id_is_arxiv":true,"paper":"/paper/structured-cooperative-learning-with","title":"Structured Cooperative Learning with Graphical Model Priors","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuangtongli/scool","path":"SCooL_SBM.py","file_url":"https://github.com/shuangtongli/scool/blob/HEAD/SCooL_SBM.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, shuangtongli/scool, is not in the permissive set Syntology serves inline","code_sha256":"5ee024da6c8949f5","code_sha256_prefix":"5ee024da6c8949f5","mcp_get_code":{"code_sha256":"5ee024da6c8949f5"}},{"arxiv_id":"2306.07215","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-quantization-aware-training-with","title":"Efficient and Robust Quantization-aware Training via Adaptive Coreset Selection","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangowen/qat-acs","path":"deepcore/datasets/cifar10.py","file_url":"https://github.com/huangowen/qat-acs/blob/HEAD/deepcore/datasets/cifar10.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":"75af3219fc982938","code_sha256_prefix":"75af3219fc982938","mcp_get_code":{"code_sha256":"75af3219fc982938"}},{"arxiv_id":"2212.07359","arxiv_id_is_arxiv":true,"paper":"/paper/post-hoc-uncertainty-learning-using-a","title":"Post-hoc Uncertainty Learning using a Dirichlet Meta-Model","date":"2022-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maohaos2/PosthocUQ","path":"dataloaders.py","file_url":"https://github.com/maohaos2/PosthocUQ/blob/HEAD/dataloaders.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":"f26da832e81bbb10","code_sha256_prefix":"f26da832e81bbb10","mcp_get_code":{"code_sha256":"f26da832e81bbb10"}},{"arxiv_id":"2204.07249","arxiv_id_is_arxiv":true,"paper":"/paper/minimizing-control-for-credit-assignment-with","title":"Minimizing Control for Credit Assignment with Strong Feedback","date":"2022-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pennfranc/bio-inspired-continual-learning","path":"Continual-Learning-Benchmark/clb_dataloaders/base.py","file_url":"https://github.com/pennfranc/bio-inspired-continual-learning/blob/HEAD/Continual-Learning-Benchmark/clb_dataloaders/base.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":"af0506c68398edcc","code_sha256_prefix":"af0506c68398edcc","mcp_get_code":{"code_sha256":"af0506c68398edcc"}},{"arxiv_id":"2010.04003","arxiv_id_is_arxiv":true,"paper":"/paper/a-theoretical-analysis-of-catastrophic","title":"A Theoretical Analysis of Catastrophic Forgetting through the NTK Overlap Matrix","date":"2020-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tldoan/PCA-OGD","path":"dataloaders/base.py","file_url":"https://github.com/tldoan/PCA-OGD/blob/HEAD/dataloaders/base.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":"b5b0b299677171a5","code_sha256_prefix":"b5b0b299677171a5","mcp_get_code":{"code_sha256":"b5b0b299677171a5"}},{"arxiv_id":"2003.11498","arxiv_id_is_arxiv":true,"paper":"/paper/similarity-of-neural-networks-with-gradients","title":"Similarity of Neural Networks with Gradients","date":"2020-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marcozullich/pruned_layer_similarity","path":"layer_sim/datasets.py","file_url":"https://github.com/marcozullich/pruned_layer_similarity/blob/HEAD/layer_sim/datasets.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":"c4a027ab6113a900","code_sha256_prefix":"c4a027ab6113a900","mcp_get_code":{"code_sha256":"c4a027ab6113a900"}},{"arxiv_id":"1901.00544","arxiv_id_is_arxiv":true,"paper":"/paper/multi-class-classification-without-multi","title":"Multi-class Classification without Multi-class Labels","date":"2019-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-RIPL/L2C","path":"dataloaders/default.py","file_url":"https://github.com/GT-RIPL/L2C/blob/HEAD/dataloaders/default.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":"04e2b1373940491b","code_sha256_prefix":"04e2b1373940491b","mcp_get_code":{"code_sha256":"04e2b1373940491b"}}],"record_sha256":"38fbad6421d64ee73451d8e6456126aedd8448f74c3b0a9becb86eea6ec3365a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}