{"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-test-dataloader","entry":"get_test_dataloader","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":3,"n_papers_ran_no_instrument_failure":2,"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":7,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":4,"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":2,"unverified":4},"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":"2603.26842","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-26842","title":"VAN-AD: Visual Masked Autoencoder with Normalizing Flow for Time Series Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"PenyChen/VAN-AD","path":"data_factory/data_loader.py","file_url":"https://github.com/PenyChen/VAN-AD/blob/HEAD/data_factory/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":"39060335d43c5001","code_sha256_prefix":"39060335d43c5001","mcp_get_code":{"code_sha256":"39060335d43c5001"}},{"arxiv_id":"2501.04970","arxiv_id_is_arxiv":true,"paper":"/paper/battling-the-non-stationarity-in-time-series","title":"Battling the Non-stationarity in Time Series Forecasting via Test-time Adaptation","date":"2025-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kimanki/tafas","path":"tta/tafas.py","file_url":"https://github.com/kimanki/tafas/blob/HEAD/tta/tafas.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, kimanki/tafas (NOASSERTION)","code_sha256":"d8f02721ee5c52db","code_sha256_prefix":"d8f02721ee5c52db","mcp_get_code":{"code_sha256":"d8f02721ee5c52db"}},{"arxiv_id":"2410.02369","arxiv_id_is_arxiv":true,"paper":"/paper/unleashing-the-potential-of-the-diffusion","title":"Unleashing the Potential of the Diffusion Model in Few-shot Semantic Segmentation","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aim-uofa/DiffewS","path":"train_tools/train_icl_multitask_nocrop_nearest_nshot_v3.py","file_url":"https://github.com/aim-uofa/DiffewS/blob/HEAD/train_tools/train_icl_multitask_nocrop_nearest_nshot_v3.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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, aim-uofa/DiffewS (NOASSERTION)","code_sha256":"28409ff8b4768607","code_sha256_prefix":"28409ff8b4768607","mcp_get_code":{"code_sha256":"28409ff8b4768607"}},{"arxiv_id":"2310.10180","arxiv_id_is_arxiv":true,"paper":"/paper/trigo-benchmarking-formal-mathematical-proof","title":"TRIGO: Benchmarking Formal Mathematical Proof Reduction for Generative Language Models","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"menik1126/TRIGO","path":"auto_generate_atp/data_manager.py","file_url":"https://github.com/menik1126/TRIGO/blob/HEAD/auto_generate_atp/data_manager.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, menik1126/TRIGO when it was checked","code_sha256":"618ea61c989279b7","code_sha256_prefix":"618ea61c989279b7","mcp_get_code":{"code_sha256":"618ea61c989279b7"}},{"arxiv_id":"2308.06582","arxiv_id_is_arxiv":true,"paper":"/paper/gated-attention-coding-for-training-high","title":"Gated Attention Coding for Training High-performance and Efficient Spiking Neural Networks","date":"2023-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bollossom/GAC","path":"CODE/ImageNet/utils.py","file_url":"https://github.com/bollossom/GAC/blob/HEAD/CODE/ImageNet/utils.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, bollossom/GAC when it was checked","code_sha256":"81dca27176dba617","code_sha256_prefix":"81dca27176dba617","mcp_get_code":{"code_sha256":"81dca27176dba617"}},{"arxiv_id":"2209.07162","arxiv_id_is_arxiv":true,"paper":"/paper/brain-imaging-generation-with-latent","title":"Brain Imaging Generation with Latent Diffusion Models","date":"2022-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"warvito/generative_chestxray","path":"src/python/testing/util.py","file_url":"https://github.com/warvito/generative_chestxray/blob/HEAD/src/python/testing/util.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":"d8d949e1d1d36643","code_sha256_prefix":"d8d949e1d1d36643","mcp_get_code":{"code_sha256":"d8d949e1d1d36643"}},{"arxiv_id":"2103.14021","arxiv_id_is_arxiv":true,"paper":"/paper/orthogonal-projection-loss","title":"Orthogonal Projection Loss","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kahnchana/opl","path":"classification/cifar/utils.py","file_url":"https://github.com/kahnchana/opl/blob/HEAD/classification/cifar/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":"98bd1c9bc8319ae9","code_sha256_prefix":"98bd1c9bc8319ae9","mcp_get_code":{"code_sha256":"98bd1c9bc8319ae9"}}],"record_sha256":"af5e5d1e609c0050500f698da72a51f5badb28a380b680db37de4bac812e1e33","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}