{"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/dataloader-2","entry":"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":9,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":0,"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":3,"n_samples_constructed":3,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":6,"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":0,"ran":3,"unverified":7},"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":"2607.15562","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-15562","title":"Hard Rules, Soft Preferences: Bridging Reasoning, Learning, and Optimization for Personalized Packing Checklist Generation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Official529Tech/rlo-checklist","path":"src/combined_model.py","file_url":"https://github.com/Official529Tech/rlo-checklist/blob/HEAD/src/combined_model.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":"e6fa017eed4eb13f","code_sha256_prefix":"e6fa017eed4eb13f","mcp_get_code":{"code_sha256":"e6fa017eed4eb13f"}},{"arxiv_id":"2606.24995","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-24995","title":"Are Tabular Foundation Models Robust to Realistic Query Distribution Shifts in Microbiome Data?","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"UMMISCO/metagenomics-fm","path":"benchmarking/benchmarking.py","file_url":"https://github.com/UMMISCO/metagenomics-fm/blob/HEAD/benchmarking/benchmarking.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":"f0cc3b2498455251","code_sha256_prefix":"f0cc3b2498455251","mcp_get_code":{"code_sha256":"f0cc3b2498455251"}},{"arxiv_id":"2605.25814","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25814","title":"Adaptive Graph Refinement and Label Propagation with LLMs for Cost-Effective Entity Resolution","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"HKBU-LAGAS/Alper","path":"src/alper_framework.py","file_url":"https://github.com/HKBU-LAGAS/Alper/blob/HEAD/src/alper_framework.py","status":"unverified","verification_level":0,"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, HKBU-LAGAS/Alper when it was checked","code_sha256":"a8c38fca97e18b62","code_sha256_prefix":"a8c38fca97e18b62","mcp_get_code":{"code_sha256":"a8c38fca97e18b62"}},{"arxiv_id":"2505.23864","arxiv_id_is_arxiv":true,"paper":"/paper/personalized-subgraph-federated-learning-with","title":"Personalized Subgraph Federated Learning with Differentiable Auxiliary Projections","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JhuoW/FedAux","path":"models/fedaux/client.py","file_url":"https://github.com/JhuoW/FedAux/blob/HEAD/models/fedaux/client.py","status":"unverified","verification_level":0,"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, JhuoW/FedAux when it was checked","code_sha256":"62fd0a747ddfcb22","code_sha256_prefix":"62fd0a747ddfcb22","mcp_get_code":{"code_sha256":"62fd0a747ddfcb22"}},{"arxiv_id":"2407.20299","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-distillation-for-offline","title":"Dataset Distillation for Offline Reinforcement Learning","date":"2024-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ggflow123/ddrl","path":"src/data_distillation_training_offline.py","file_url":"https://github.com/ggflow123/ddrl/blob/HEAD/src/data_distillation_training_offline.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":"73df4926a09d96e6","code_sha256_prefix":"73df4926a09d96e6","mcp_get_code":{"code_sha256":"73df4926a09d96e6"}},{"arxiv_id":"2407.14459","arxiv_id_is_arxiv":true,"paper":"/paper/polyformer-scalable-node-wise-filters-via","title":"PolyFormer: Scalable Node-wise Filters via Polynomial Graph Transformer","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"air029/polyformer","path":"node_classification/dataloader/dataset_loader.py","file_url":"https://github.com/air029/polyformer/blob/HEAD/node_classification/dataloader/dataset_loader.py","status":"unverified","verification_level":0,"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, air029/polyformer when it was checked","code_sha256":"f36c10b62c48e05e","code_sha256_prefix":"f36c10b62c48e05e","mcp_get_code":{"code_sha256":"f36c10b62c48e05e"}},{"arxiv_id":"2407.14459","arxiv_id_is_arxiv":true,"paper":"/paper/polyformer-scalable-node-wise-filters-via","title":"PolyFormer: Scalable Node-wise Filters via Polynomial Graph Transformer","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"air029/polyformer","path":"node_classification_large_graph/dataloader/dataset_loader.py","file_url":"https://github.com/air029/polyformer/blob/HEAD/node_classification_large_graph/dataloader/dataset_loader.py","status":"unverified","verification_level":0,"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, air029/polyformer when it was checked","code_sha256":"3e9e130cf0f52cb4","code_sha256_prefix":"3e9e130cf0f52cb4","mcp_get_code":{"code_sha256":"3e9e130cf0f52cb4"}},{"arxiv_id":"2305.09235","arxiv_id_is_arxiv":true,"paper":"/paper/synthetic-data-real-errors-how-not-to-publish","title":"Synthetic data, real errors: how (not) to publish and use synthetic data","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bvanbreugel/deep_generative_ensemble","path":"DGE_utils.py","file_url":"https://github.com/bvanbreugel/deep_generative_ensemble/blob/HEAD/DGE_utils.py","status":"unverified","verification_level":0,"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, bvanbreugel/deep_generative_ensemble when it was checked","code_sha256":"e96e9dad554ff546","code_sha256_prefix":"e96e9dad554ff546","mcp_get_code":{"code_sha256":"e96e9dad554ff546"}},{"arxiv_id":"2206.08464","arxiv_id_is_arxiv":true,"paper":"/paper/pranc-pseudo-random-networks-for-compacting","title":"PRANC: Pseudo RAndom Networks for Compacting deep models","date":"2022-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucdvision/pranc","path":"dataloader.py","file_url":"https://github.com/ucdvision/pranc/blob/HEAD/dataloader.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":"5a9c45aaf6f7c743","code_sha256_prefix":"5a9c45aaf6f7c743","mcp_get_code":{"code_sha256":"5a9c45aaf6f7c743"}},{"arxiv_id":"2003.03196","arxiv_id_is_arxiv":true,"paper":"/paper/federated-continual-learning-with-adaptive","title":"Federated Continual Learning with Weighted Inter-client Transfer","date":"2020-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyjeong/FedWeIT","path":"models/fedweit/client.py","file_url":"https://github.com/wyjeong/FedWeIT/blob/HEAD/models/fedweit/client.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, wyjeong/FedWeIT when it was checked","code_sha256":"be6b5da001a06ad1","code_sha256_prefix":"be6b5da001a06ad1","mcp_get_code":{"code_sha256":"be6b5da001a06ad1"}}],"record_sha256":"564d1d06ae0b433f2ce66a62cff8d665edadd22dc46ea105cbf45108a703ecf8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}