{"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-mnist","entry":"get_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":10,"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":10,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":10,"n_samples_fingerprinted":0,"n_places":10,"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":10},"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":"2604.09452","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-09452","title":"SafeAdapt: Provably Safe Policy Updates in Deep Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"maxanisimov/provably-safe-policy-updates","path":"src/data_utils.py","file_url":"https://github.com/maxanisimov/provably-safe-policy-updates/blob/HEAD/src/data_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":"bcd17f3fc951f451","code_sha256_prefix":"bcd17f3fc951f451","mcp_get_code":{"code_sha256":"bcd17f3fc951f451"}},{"arxiv_id":"2410.03263","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-adaptation-for-regression-by","title":"Test-time Adaptation for Regression by Subspace Alignment","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kzkadc/regression-tta","path":"dataset/raw_datasets.py","file_url":"https://github.com/kzkadc/regression-tta/blob/HEAD/dataset/raw_datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, kzkadc/regression-tta (NOASSERTION)","code_sha256":"dde50ff44f98f9b9","code_sha256_prefix":"dde50ff44f98f9b9","mcp_get_code":{"code_sha256":"dde50ff44f98f9b9"}},{"arxiv_id":"2401.12689","arxiv_id_is_arxiv":true,"paper":"/paper/energy-based-automated-model-evaluation","title":"Energy-based Automated Model Evaluation","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pengr/energy_autoeval","path":"datasets.py","file_url":"https://github.com/pengr/energy_autoeval/blob/HEAD/datasets.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":"32ba6ca3329fac10","code_sha256_prefix":"32ba6ca3329fac10","mcp_get_code":{"code_sha256":"32ba6ca3329fac10"}},{"arxiv_id":"2204.12965","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-particle-based-alternatives-to-em","title":"Particle algorithms for maximum likelihood training of latent variable models","date":"2022-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juankuntz/parem","path":"torch/parem/utils.py","file_url":"https://github.com/juankuntz/parem/blob/HEAD/torch/parem/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":"1ae194faab4a6b78","code_sha256_prefix":"1ae194faab4a6b78","mcp_get_code":{"code_sha256":"1ae194faab4a6b78"}},{"arxiv_id":"2105.04319","arxiv_id_is_arxiv":true,"paper":"/paper/a-bregman-learning-framework-for-sparse","title":"A Bregman Learning Framework for Sparse Neural Networks","date":"2021-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TimRoith/BregmanLearning","path":"utils/datasets.py","file_url":"https://github.com/TimRoith/BregmanLearning/blob/HEAD/utils/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":"2f27d73dd37f8bdc","code_sha256_prefix":"2f27d73dd37f8bdc","mcp_get_code":{"code_sha256":"2f27d73dd37f8bdc"}},{"arxiv_id":"2103.12531","arxiv_id_is_arxiv":true,"paper":"/paper/clip-cheap-lipschitz-training-of-neural","title":"CLIP: Cheap Lipschitz Training of Neural Networks","date":"2021-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TimRoith/CLIP","path":"utils/datasets.py","file_url":"https://github.com/TimRoith/CLIP/blob/HEAD/utils/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":"b50182fd2c352f6c","code_sha256_prefix":"b50182fd2c352f6c","mcp_get_code":{"code_sha256":"b50182fd2c352f6c"}},{"arxiv_id":"2008.05030","arxiv_id_is_arxiv":true,"paper":"/paper/how-much-should-i-trust-you-modeling","title":"Reliable Post hoc Explanations: Modeling Uncertainty in Explainability","date":"2020-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dylan-slack/modeling-uncertainty-local-explainability","path":"bayes/data_routines.py","file_url":"https://github.com/dylan-slack/modeling-uncertainty-local-explainability/blob/HEAD/bayes/data_routines.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":"e947cb61477d2661","code_sha256_prefix":"e947cb61477d2661","mcp_get_code":{"code_sha256":"e947cb61477d2661"}},{"arxiv_id":"1810.12042","arxiv_id_is_arxiv":true,"paper":"/paper/logit-pairing-methods-can-fool-gradient-based","title":"Logit Pairing Methods Can Fool Gradient-Based Attacks","date":"2018-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uds-lsv/evaluating-logit-pairing-methods","path":"mnist_cifar10/data_loader.py","file_url":"https://github.com/uds-lsv/evaluating-logit-pairing-methods/blob/HEAD/mnist_cifar10/data_loader.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":"60f00d58b4540401","code_sha256_prefix":"60f00d58b4540401","mcp_get_code":{"code_sha256":"60f00d58b4540401"}},{"arxiv_id":"1805.08079","arxiv_id_is_arxiv":true,"paper":"/paper/faster-neural-network-training-with","title":"Faster Neural Network Training with Approximate Tensor Operations","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acsl-technion/approx","path":"src/pytorch/mnist_mlp_pytorch/data.py","file_url":"https://github.com/acsl-technion/approx/blob/HEAD/src/pytorch/mnist_mlp_pytorch/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"485595ea85ffbcc1","code_sha256_prefix":"485595ea85ffbcc1","mcp_get_code":{"code_sha256":"485595ea85ffbcc1"}},{"arxiv_id":"1712.09005","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-algorithms-for-t-distributed","title":"Efficient Algorithms for t-distributed Stochastic Neighborhood Embedding","date":"2017-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huguyuehuhu/fasttsne","path":"benchmarks/benchmark_tsne.py","file_url":"https://github.com/huguyuehuhu/fasttsne/blob/HEAD/benchmarks/benchmark_tsne.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"923ed39e937ce5e1","code_sha256_prefix":"923ed39e937ce5e1","mcp_get_code":{"code_sha256":"923ed39e937ce5e1"}}],"record_sha256":"370682126cd6a372f0b51b2bb91bb2bf6f1e93a5ba1f62f58ef57072ff65e207","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}