{"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/prepare-dataloader","entry":"prepare_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":4,"n_papers_ran_no_instrument_failure":3,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":7,"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":1,"ran_fixture":0,"ran":3,"unverified":3},"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":"2501.15598","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-generative-modeling-for-spatially","title":"Diffusion Generative Modeling for Spatially Resolved Gene Expression Inference from Histology Images","date":"2025-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sichenzhu/stem","path":"stem_train.py","file_url":"https://github.com/sichenzhu/stem/blob/HEAD/stem_train.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":"4e55445cfcf67291","code_sha256_prefix":"4e55445cfcf67291","mcp_get_code":{"code_sha256":"4e55445cfcf67291"}},{"arxiv_id":"2411.01623","arxiv_id_is_arxiv":true,"paper":"/paper/filternet-harnessing-frequency-filters-for","title":"FilterNet: Harnessing Frequency Filters for Time Series Forecasting","date":"2024-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ant-research/Pyraformer","path":"long_range_main.py","file_url":"https://github.com/ant-research/Pyraformer/blob/HEAD/long_range_main.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":"b688d662492743b0","code_sha256_prefix":"b688d662492743b0","mcp_get_code":{"code_sha256":"b688d662492743b0"}},{"arxiv_id":"2410.09343","arxiv_id_is_arxiv":true,"paper":"/paper/elicit-llm-augmentation-via-external-in","title":"ELICIT: LLM Augmentation via External In-Context Capability","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lins-lab/elicit","path":"train_retriever.py","file_url":"https://github.com/lins-lab/elicit/blob/HEAD/train_retriever.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":"171e7700fc50ab49","code_sha256_prefix":"171e7700fc50ab49","mcp_get_code":{"code_sha256":"171e7700fc50ab49"}},{"arxiv_id":"2409.13652","arxiv_id_is_arxiv":true,"paper":"/paper/oats-outlier-aware-pruning-through-sparse-and","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","date":"2024-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stephenqz/oats","path":"data_utils.py","file_url":"https://github.com/stephenqz/oats/blob/HEAD/data_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, stephenqz/oats when it was checked","code_sha256":"b8bb7d55280d7e8f","code_sha256_prefix":"b8bb7d55280d7e8f","mcp_get_code":{"code_sha256":"b8bb7d55280d7e8f"}},{"arxiv_id":"2310.17715","arxiv_id_is_arxiv":true,"paper":"/paper/outlier-dimensions-encode-task-specific","title":"Outlier Dimensions Encode Task-Specific Knowledge","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wrudman/outlier_dimensions","path":"training_utils.py","file_url":"https://github.com/wrudman/outlier_dimensions/blob/HEAD/training_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":"4ff638cae94d2eb4","code_sha256_prefix":"4ff638cae94d2eb4","mcp_get_code":{"code_sha256":"4ff638cae94d2eb4"}},{"arxiv_id":"2310.08975","arxiv_id_is_arxiv":true,"paper":"/paper/chatkbqa-a-generate-then-retrieve-framework","title":"ChatKBQA: A Generate-then-Retrieve Framework for Knowledge Base Question Answering with Fine-tuned Large Language Models","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhrlab/chatkbqa","path":"run_generator_final.py","file_url":"https://github.com/lhrlab/chatkbqa/blob/HEAD/run_generator_final.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":"7600856fdde258c1","code_sha256_prefix":"7600856fdde258c1","mcp_get_code":{"code_sha256":"7600856fdde258c1"}},{"arxiv_id":"2304.14133","arxiv_id_is_arxiv":true,"paper":"/paper/figments-and-misalignments-a-framework-for","title":"VERITE: A Robust Benchmark for Multimodal Misinformation Detection Accounting for Unimodal Bias","date":"2023-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevejpapad/figments-and-misalignments","path":"utils.py","file_url":"https://github.com/stevejpapad/figments-and-misalignments/blob/HEAD/utils.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":"ee3f6929dd21fa19","code_sha256_prefix":"ee3f6929dd21fa19","mcp_get_code":{"code_sha256":"ee3f6929dd21fa19"}}],"record_sha256":"c4000fe65593a60931d6999eb98d5ffbd66fc9af8380ddf7546a9a43bae90b89","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}