{"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-train-dataloader","entry":"get_train_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":6,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"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":1,"ran":4,"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":"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":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6ca93a0e8d25fecb","code_sha256_prefix":"6ca93a0e8d25fecb","mcp_get_code":{"code_sha256":"6ca93a0e8d25fecb"}},{"arxiv_id":"2411.05735","arxiv_id_is_arxiv":true,"paper":"/paper/aioli-a-unified-optimization-framework-for","title":"Aioli: A Unified Optimization Framework for Language Model Data Mixing","date":"2024-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hazyresearch/aioli","path":"trainer/aioli_trainer.py","file_url":"https://github.com/hazyresearch/aioli/blob/HEAD/trainer/aioli_trainer.py","status":"ran","verification_level":1,"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":"2832a5cae93655cc","code_sha256_prefix":"2832a5cae93655cc","mcp_get_code":{"code_sha256":"2832a5cae93655cc"}},{"arxiv_id":"2201.11903","arxiv_id_is_arxiv":true,"paper":"/paper/chain-of-thought-prompting-elicits-reasoning","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TianduoWang/MsAT","path":"deductreasoner/prepare_dataset.py","file_url":"https://github.com/TianduoWang/MsAT/blob/HEAD/deductreasoner/prepare_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":"10a9e1bd9dab41c9","code_sha256_prefix":"10a9e1bd9dab41c9","mcp_get_code":{"code_sha256":"10a9e1bd9dab41c9"}},{"arxiv_id":"2010.13009","arxiv_id_is_arxiv":true,"paper":"/paper/discriminative-nearest-neighbor-few-shot","title":"Discriminative Nearest Neighbor Few-Shot Intent Detection by Transferring Natural Language Inference","date":"2020-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/DNNC-few-shot-intent","path":"models/utils.py","file_url":"https://github.com/salesforce/DNNC-few-shot-intent/blob/HEAD/models/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":"03a18407e67123f1","code_sha256_prefix":"03a18407e67123f1","mcp_get_code":{"code_sha256":"03a18407e67123f1"}},{"arxiv_id":"2004.13431","arxiv_id_is_arxiv":true,"paper":"/paper/angle-based-search-space-shrinking-for-neural","title":"Angle-based Search Space Shrinking for Neural Architecture Search","date":"2020-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megvii-model/AngleNAS","path":"utils/imagenet.py","file_url":"https://github.com/megvii-model/AngleNAS/blob/HEAD/utils/imagenet.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":"2dd731ba5968d6ce","code_sha256_prefix":"2dd731ba5968d6ce","mcp_get_code":{"code_sha256":"2dd731ba5968d6ce"}},{"arxiv_id":"2001.06838","arxiv_id_is_arxiv":true,"paper":"/paper/towards-stabilizing-batch-statistics-in-1","title":"Towards Stabilizing Batch Statistics in Backward Propagation of Batch Normalization","date":"2020-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megvii-model/MABN","path":"cls/utils.py","file_url":"https://github.com/megvii-model/MABN/blob/HEAD/cls/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":"2dd50f3ea73256ab","code_sha256_prefix":"2dd50f3ea73256ab","mcp_get_code":{"code_sha256":"2dd50f3ea73256ab"}}],"record_sha256":"63a4c0cf87d8bea22113b9843a1467b133fff79aca0dd6189390b9b4a8078358","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}