{"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/mnist-2","entry":"MNIST","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":12,"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":11,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":11,"n_samples_fingerprinted":0,"n_places":13,"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":11},"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":"2605.22644","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-22644","title":"Why SGD is not Brownian Motion: A New Perspective on Stochastic Dynamics","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"brain-lab-research/SGDiffusion","path":"src/utils.py","file_url":"https://github.com/brain-lab-research/SGDiffusion/blob/HEAD/src/utils.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, brain-lab-research/SGDiffusion when it was checked","code_sha256":"6b3e2abd8b904f36","code_sha256_prefix":"6b3e2abd8b904f36","mcp_get_code":{"code_sha256":"6b3e2abd8b904f36"}},{"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/mnist.py","file_url":"https://github.com/PatrickZH/DeepCore/blob/HEAD/deepcore/datasets/mnist.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":"386d95ec922f5372","code_sha256_prefix":"386d95ec922f5372","mcp_get_code":{"code_sha256":"386d95ec922f5372"}},{"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/mnist.py","file_url":"https://github.com/ZhijingWan/RAM-APL/blob/HEAD/deepcore/datasets/mnist.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":"386d95ec922f5372","code_sha256_prefix":"386d95ec922f5372","mcp_get_code":{"code_sha256":"386d95ec922f5372"}},{"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/mnist.py","file_url":"https://github.com/huangowen/qat-acs/blob/HEAD/deepcore/datasets/mnist.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":"386d95ec922f5372","code_sha256_prefix":"386d95ec922f5372","mcp_get_code":{"code_sha256":"386d95ec922f5372"}},{"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":"9a3033fb697cd22a","code_sha256_prefix":"9a3033fb697cd22a","mcp_get_code":{"code_sha256":"9a3033fb697cd22a"}},{"arxiv_id":"2112.06384","arxiv_id_is_arxiv":true,"paper":"/paper/wood-wasserstein-based-out-of-distribution","title":"WOOD: Wasserstein-based Out-of-Distribution Detection","date":"2021-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyn430/wood","path":"Dataset.py","file_url":"https://github.com/wyn430/wood/blob/HEAD/Dataset.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":"a0cba96655cb0ff3","code_sha256_prefix":"a0cba96655cb0ff3","mcp_get_code":{"code_sha256":"a0cba96655cb0ff3"}},{"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":"72c9598b309e4e5a","code_sha256_prefix":"72c9598b309e4e5a","mcp_get_code":{"code_sha256":"72c9598b309e4e5a"}},{"arxiv_id":"2010.00352","arxiv_id_is_arxiv":true,"paper":"/paper/meta-consolidation-for-continual-learning","title":"Meta-Consolidation for Continual Learning","date":"2020-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JosephKJ/merlin","path":"lib/consolidate.py","file_url":"https://github.com/JosephKJ/merlin/blob/HEAD/lib/consolidate.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, JosephKJ/merlin when it was checked","code_sha256":"b82ee827d83c2eff","code_sha256_prefix":"b82ee827d83c2eff","mcp_get_code":{"code_sha256":"b82ee827d83c2eff"}},{"arxiv_id":"2006.14748","arxiv_id_is_arxiv":true,"paper":"/paper/proper-network-interpretability-helps","title":"Proper Network Interpretability Helps Adversarial Robustness in Classification","date":"2020-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akhilanb/proper-interpretability","path":"funcs.py","file_url":"https://github.com/akhilanb/proper-interpretability/blob/HEAD/funcs.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":"ed99dc8820ef0915","code_sha256_prefix":"ed99dc8820ef0915","mcp_get_code":{"code_sha256":"ed99dc8820ef0915"}},{"arxiv_id":"2006.14748","arxiv_id_is_arxiv":true,"paper":"/paper/proper-network-interpretability-helps","title":"Proper Network Interpretability Helps Adversarial Robustness in Classification","date":"2020-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AkhilanB/Proper-Interpretability","path":"funcs.py","file_url":"https://github.com/AkhilanB/Proper-Interpretability/blob/HEAD/funcs.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":"aeb5bbdc2435ad02","code_sha256_prefix":"aeb5bbdc2435ad02","mcp_get_code":{"code_sha256":"aeb5bbdc2435ad02"}},{"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":"15d4f21d63e777a0","code_sha256_prefix":"15d4f21d63e777a0","mcp_get_code":{"code_sha256":"15d4f21d63e777a0"}},{"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":"b5ffa7a38f9d609e","code_sha256_prefix":"b5ffa7a38f9d609e","mcp_get_code":{"code_sha256":"b5ffa7a38f9d609e"}},{"arxiv_id":"1312.6114","arxiv_id_is_arxiv":true,"paper":"/paper/auto-encoding-variational-bayes","title":"Auto-Encoding Variational Bayes","date":"2013-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shib0li/VAE-PyTorch","path":"models/vae.py","file_url":"https://github.com/shib0li/VAE-PyTorch/blob/HEAD/models/vae.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, shib0li/VAE-PyTorch when it was checked","code_sha256":"019d56cdaaaaeb51","code_sha256_prefix":"019d56cdaaaaeb51","mcp_get_code":{"code_sha256":"019d56cdaaaaeb51"}}],"record_sha256":"b6d9f32c156f8e051c9b803e48a104111fd6b01e4cd03d1ff252650c177b973d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}