{"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/make-custom-dataset","entry":"make_custom_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":4,"n_papers_ran_no_instrument_failure":2,"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":3,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":7,"n_places_pointer_only_link_open":1,"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":1,"unverified":1},"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":"2606.21488","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-21488","title":"Robustness Cannot be Reduced to Regularization: Studying Adversarial Training Beyond the Linear Case","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"RobustBench/robustbench","path":"robustbench/loaders.py","file_url":"https://github.com/RobustBench/robustbench/blob/HEAD/robustbench/loaders.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, RobustBench/robustbench (NOASSERTION)","code_sha256":"c4c57c3f5b63ae66","code_sha256_prefix":"c4c57c3f5b63ae66","mcp_get_code":{"code_sha256":"c4c57c3f5b63ae66"}},{"arxiv_id":"2604.21728","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-21728","title":"Ramen: Robust Test-Time Adaptation of Vision-Language Models with Active Sample Selection","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"baowenxuan/Ramen","path":"src/datasets/utils.py","file_url":"https://github.com/baowenxuan/Ramen/blob/HEAD/src/datasets/utils.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, baowenxuan/Ramen when it was checked","code_sha256":"c62c4350be9aa59f","code_sha256_prefix":"c62c4350be9aa59f","mcp_get_code":{"code_sha256":"c62c4350be9aa59f"}},{"arxiv_id":"2510.22127","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-22127","title":"Mint: A Simple Test-Time Adaptation of Vision-Language Models against Common Corruptions","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"baowenxuan/Mint","path":"src/datasets/utils.py","file_url":"https://github.com/baowenxuan/Mint/blob/HEAD/src/datasets/utils.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, baowenxuan/Mint when it was checked","code_sha256":"c62c4350be9aa59f","code_sha256_prefix":"c62c4350be9aa59f","mcp_get_code":{"code_sha256":"c62c4350be9aa59f"}},{"arxiv_id":"2405.16486","arxiv_id_is_arxiv":true,"paper":"/paper/decomposing-the-neurons-activation-sparsity","title":"Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"royzry98/moase-pytorch","path":"robustbench/loaders.py","file_url":"https://github.com/royzry98/moase-pytorch/blob/HEAD/robustbench/loaders.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, royzry98/moase-pytorch when it was checked","code_sha256":"4aedf5bc9100546f","code_sha256_prefix":"4aedf5bc9100546f","mcp_get_code":{"code_sha256":"4aedf5bc9100546f"}},{"arxiv_id":"2403.06668","arxiv_id_is_arxiv":true,"paper":"/paper/peeraid-improving-adversarial-distillation","title":"PeerAiD: Improving Adversarial Distillation from a Specialized Peer Tutor","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaewonalive/peeraid","path":"robustbench/loaders.py","file_url":"https://github.com/jaewonalive/peeraid/blob/HEAD/robustbench/loaders.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, jaewonalive/peeraid, is not in the permissive set Syntology serves inline","code_sha256":"c4c57c3f5b63ae66","code_sha256_prefix":"c4c57c3f5b63ae66","mcp_get_code":{"code_sha256":"c4c57c3f5b63ae66"}},{"arxiv_id":"2307.03133","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-test-time-adaptation-against","title":"Benchmarking Test-Time Adaptation against Distribution Shifts in Image Classification","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyongcan/benchmark-tta","path":"robustbench/loaders.py","file_url":"https://github.com/yuyongcan/benchmark-tta/blob/HEAD/robustbench/loaders.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, yuyongcan/benchmark-tta when it was checked","code_sha256":"4aedf5bc9100546f","code_sha256_prefix":"4aedf5bc9100546f","mcp_get_code":{"code_sha256":"4aedf5bc9100546f"}},{"arxiv_id":"2306.09844","arxiv_id_is_arxiv":true,"paper":"/paper/wasserstein-distributional-robustness-of-1","title":"Wasserstein distributional robustness of neural networks","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"janobloj/w-dro-adversarial-methods","path":"src/imagenet_loader.py","file_url":"https://github.com/janobloj/w-dro-adversarial-methods/blob/HEAD/src/imagenet_loader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from RobustBench/robustbench, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"c4c57c3f5b63ae66","code_sha256_prefix":"c4c57c3f5b63ae66","mcp_get_code":{"code_sha256":"c4c57c3f5b63ae66"}}],"record_sha256":"ffcaa74b7b23fb5d1ad0c00fd9096a6ceef2e78001fc68b4389c7abbf64e289e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}