{"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/dataset-2","entry":"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":10,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"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":5,"n_samples_constructed":2,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":2,"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":1,"ran_fixture":0,"ran":4,"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":"2605.24903","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-24903","title":"SEED: Semi-supervised Continual MalwarE Detection for Tackling ConcEpt Drift on a BuDget","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"amalapuram/SEED","path":"SSCL.py","file_url":"https://github.com/amalapuram/SEED/blob/HEAD/SSCL.py","status":"ran","verification_level":1,"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, amalapuram/SEED when it was checked","code_sha256":"d51001132cf6692e","code_sha256_prefix":"d51001132cf6692e","mcp_get_code":{"code_sha256":"d51001132cf6692e"}},{"arxiv_id":"2403.14715","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-why-label-smoothing-degrades","title":"Towards Understanding Why Label Smoothing Degrades Selective Classification and How to Fix It","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tensorflow/tpu","path":"models/official/mnist/mnist_tpu.py","file_url":"https://github.com/tensorflow/tpu/blob/HEAD/models/official/mnist/mnist_tpu.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e4c38986c252157","code_sha256_prefix":"2e4c38986c252157","mcp_get_code":{"code_sha256":"2e4c38986c252157"}},{"arxiv_id":"2312.04947","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-and-analysis-of-unsupervised","title":"Benchmarking and Analysis of Unsupervised Object Segmentation from Real-world Single Images","date":"2023-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vlar-group/unsupobjseg","path":"IODINE/modules/dataloader.py","file_url":"https://github.com/vlar-group/unsupobjseg/blob/HEAD/IODINE/modules/dataloader.py","status":"ran","verification_level":1,"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, vlar-group/unsupobjseg (NOASSERTION)","code_sha256":"2047d2acff2eedeb","code_sha256_prefix":"2047d2acff2eedeb","mcp_get_code":{"code_sha256":"2047d2acff2eedeb"}},{"arxiv_id":"2302.08466","arxiv_id_is_arxiv":true,"paper":"/paper/marich-a-query-efficient-distributionally","title":"Marich: A Query-efficient Distributionally Equivalent Model Extraction Attack using Public Data","date":"2023-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"debabrota-basu/marich","path":"lr_cnn_res_marich/utils.py","file_url":"https://github.com/debabrota-basu/marich/blob/HEAD/lr_cnn_res_marich/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"05a18ee834f7c5ca","code_sha256_prefix":"05a18ee834f7c5ca","mcp_get_code":{"code_sha256":"05a18ee834f7c5ca"}},{"arxiv_id":"2106.08265","arxiv_id_is_arxiv":true,"paper":"/paper/towards-total-recall-in-industrial-anomaly","title":"Towards Total Recall in Industrial Anomaly Detection","date":"2021-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/patchcore-inspection","path":"bin/load_and_evaluate_patchcore.py","file_url":"https://github.com/amazon-research/patchcore-inspection/blob/HEAD/bin/load_and_evaluate_patchcore.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":"1850ff44d813323e","code_sha256_prefix":"1850ff44d813323e","mcp_get_code":{"code_sha256":"1850ff44d813323e"}},{"arxiv_id":"2106.00651","arxiv_id_is_arxiv":true,"paper":"/paper/asymptotics-of-representation-learning-in","title":"Asymptotics of representation learning in finite Bayesian neural networks","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pehlevan-group/finite-width-bayesian","path":"langevin/dataset.py","file_url":"https://github.com/pehlevan-group/finite-width-bayesian/blob/HEAD/langevin/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":"ba72c4f1fc9d2d35","code_sha256_prefix":"ba72c4f1fc9d2d35","mcp_get_code":{"code_sha256":"ba72c4f1fc9d2d35"}},{"arxiv_id":"1909.05273","arxiv_id_is_arxiv":true,"paper":"/paper/the-quijote-simulations","title":"The Quijote simulations","date":null,"month_inferred_from_arxiv_id":"2019-09","title_source":"archive","repo":"JDonaldM/Matryoshka","path":"matryoshka/training_funcs.py","file_url":"https://github.com/JDonaldM/Matryoshka/blob/HEAD/matryoshka/training_funcs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cf8d04ee686f0458","code_sha256_prefix":"cf8d04ee686f0458","mcp_get_code":{"code_sha256":"cf8d04ee686f0458"}},{"arxiv_id":"1904.01569","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-randomly-wired-neural-networks-for","title":"Exploring Randomly Wired Neural Networks for Image Recognition","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"timctho/random-wired-nn-tensorflow","path":"src/dataset/mnist.py","file_url":"https://github.com/timctho/random-wired-nn-tensorflow/blob/HEAD/src/dataset/mnist.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":"11ec2c233298a0d4","code_sha256_prefix":"11ec2c233298a0d4","mcp_get_code":{"code_sha256":"11ec2c233298a0d4"}},{"arxiv_id":"1807.10875","arxiv_id_is_arxiv":true,"paper":"/paper/tensorfuzz-debugging-neural-networks-with","title":"TensorFuzz: Debugging Neural Networks with Coverage-Guided Fuzzing","date":"2018-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dlshriver/tensorfuzz","path":"tensorfuzz/dataset.py","file_url":"https://github.com/dlshriver/tensorfuzz/blob/HEAD/tensorfuzz/dataset.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":"164f1de8053b6538","code_sha256_prefix":"164f1de8053b6538","mcp_get_code":{"code_sha256":"164f1de8053b6538"}},{"arxiv_id":"1406.2572","arxiv_id_is_arxiv":true,"paper":"/paper/identifying-and-attacking-the-saddle-point","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","date":"2014-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dave-fernandes/SaddleFreeOptimizer","path":"mnist/dataset.py","file_url":"https://github.com/dave-fernandes/SaddleFreeOptimizer/blob/HEAD/mnist/dataset.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":"5cef777435aec68b","code_sha256_prefix":"5cef777435aec68b","mcp_get_code":{"code_sha256":"5cef777435aec68b"}}],"record_sha256":"955996f521398a0205981df3c44b66989c19ba15556b3b00d85e66171ecec372","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}