{"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-dataloader","entry":"make_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":18,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":8,"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":17,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":1,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":18,"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":8,"unverified":8},"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.22361","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-22361","title":"Indexing: the Beginning and the End","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"visho33/IndexRetrieval","path":"data.py","file_url":"https://github.com/visho33/IndexRetrieval/blob/HEAD/data.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, visho33/IndexRetrieval when it was checked","code_sha256":"5ec4dbc58de6aaed","code_sha256_prefix":"5ec4dbc58de6aaed","mcp_get_code":{"code_sha256":"5ec4dbc58de6aaed"}},{"arxiv_id":"2604.16242","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-16242","title":"Detecting and Suppressing Reward Hacking with Gradient Fingerprints","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"songtao-x/reward_hack","path":"arlsat/icl/gradient/gradient_h.py","file_url":"https://github.com/songtao-x/reward_hack/blob/HEAD/arlsat/icl/gradient/gradient_h.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, songtao-x/reward_hack when it was checked","code_sha256":"ebf641f187e6a57d","code_sha256_prefix":"ebf641f187e6a57d","mcp_get_code":{"code_sha256":"ebf641f187e6a57d"}},{"arxiv_id":"2407.15451","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adaptive-2d-human-pose-estimation-via","title":"Domain-Adaptive 2D Human Pose Estimation via Dual Teachers in Extremely Low-Light Conditions","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ayh015-dev/da-llpose","path":"lib/dataset/build.py","file_url":"https://github.com/ayh015-dev/da-llpose/blob/HEAD/lib/dataset/build.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, ayh015-dev/da-llpose when it was checked","code_sha256":"bbb37470905b1d7c","code_sha256_prefix":"bbb37470905b1d7c","mcp_get_code":{"code_sha256":"bbb37470905b1d7c"}},{"arxiv_id":"2406.10215","arxiv_id_is_arxiv":true,"paper":"/paper/devbench-a-multimodal-developmental-benchmark","title":"DevBench: A multimodal developmental benchmark for language learning","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alvinwmtan/dev-bench","path":"data_handling.py","file_url":"https://github.com/alvinwmtan/dev-bench/blob/HEAD/data_handling.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, alvinwmtan/dev-bench when it was checked","code_sha256":"c089a242b7caf694","code_sha256_prefix":"c089a242b7caf694","mcp_get_code":{"code_sha256":"c089a242b7caf694"}},{"arxiv_id":"2403.08851","arxiv_id_is_arxiv":true,"paper":"/paper/paperclip-associating-astronomical","title":"PAPERCLIP: Associating Astronomical Observations and Natural Language with Multi-Modal Models","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smsharma/paperclip-hubble","path":"utils/dataset_utils.py","file_url":"https://github.com/smsharma/paperclip-hubble/blob/HEAD/utils/dataset_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":"de7306a52cef789b","code_sha256_prefix":"de7306a52cef789b","mcp_get_code":{"code_sha256":"de7306a52cef789b"}},{"arxiv_id":"2311.17141","arxiv_id_is_arxiv":true,"paper":"/paper/a-point-cloud-approach-to-generative-modeling","title":"A point cloud approach to generative modeling for galaxy surveys at the field level","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smsharma/point-cloud-galaxy-diffusion","path":"datasets.py","file_url":"https://github.com/smsharma/point-cloud-galaxy-diffusion/blob/HEAD/datasets.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":"2b82302daabd3921","code_sha256_prefix":"2b82302daabd3921","mcp_get_code":{"code_sha256":"2b82302daabd3921"}},{"arxiv_id":"2309.16342","arxiv_id_is_arxiv":true,"paper":"/paper/lagrangebench-a-lagrangian-fluid-mechanics-1","title":"LagrangeBench: A Lagrangian Fluid Mechanics Benchmarking Suite","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RobDHess/Steerable-E3-GNN","path":"utils.py","file_url":"https://github.com/RobDHess/Steerable-E3-GNN/blob/HEAD/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":"f9e43abe93b5283e","code_sha256_prefix":"f9e43abe93b5283e","mcp_get_code":{"code_sha256":"f9e43abe93b5283e"}},{"arxiv_id":"2307.10163","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-backdoor-attacks","title":"Rethinking Backdoor Attacks","date":"2023-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SewoongLab/spectre-defense","path":"util.py","file_url":"https://github.com/SewoongLab/spectre-defense/blob/HEAD/util.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":"63c8b7f7ecc37a2e","code_sha256_prefix":"63c8b7f7ecc37a2e","mcp_get_code":{"code_sha256":"63c8b7f7ecc37a2e"}},{"arxiv_id":"2207.07797","arxiv_id_is_arxiv":true,"paper":"/paper/carben-composite-adversarial-robustness","title":"CARBEN: Composite Adversarial Robustness Benchmark","date":"2022-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/composite-adv","path":"composite_adv/utilities.py","file_url":"https://github.com/IBM/composite-adv/blob/HEAD/composite_adv/utilities.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":"fb0186900a11e115","code_sha256_prefix":"fb0186900a11e115","mcp_get_code":{"code_sha256":"fb0186900a11e115"}},{"arxiv_id":"2105.06152","arxiv_id_is_arxiv":true,"paper":"/paper/when-human-pose-estimation-meets-robustness","title":"When Human Pose Estimation Meets Robustness: Adversarial Algorithms and Benchmarks","date":"2021-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HRNet/HigherHRNet-Human-Pose-Estimation","path":"lib/dataset/build.py","file_url":"https://github.com/HRNet/HigherHRNet-Human-Pose-Estimation/blob/HEAD/lib/dataset/build.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":"df9c22deab975625","code_sha256_prefix":"df9c22deab975625","mcp_get_code":{"code_sha256":"df9c22deab975625"}},{"arxiv_id":"2010.02637","arxiv_id_is_arxiv":true,"paper":"/paper/disentangled-generative-causal-representation-1","title":"Weakly Supervised Disentangled Generative Causal Representation Learning","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xwshen51/DEAR","path":"utils.py","file_url":"https://github.com/xwshen51/DEAR/blob/HEAD/utils.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":"02f5fcae9df37e0b","code_sha256_prefix":"02f5fcae9df37e0b","mcp_get_code":{"code_sha256":"02f5fcae9df37e0b"}},{"arxiv_id":"2001.04872","arxiv_id_is_arxiv":true,"paper":"/paper/disentanglement-by-nonlinear-ica-with-general","title":"Disentanglement by Nonlinear ICA with General Incompressible-flow Networks (GIN)","date":"2020-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VLL-HD/GIN","path":"data.py","file_url":"https://github.com/VLL-HD/GIN/blob/HEAD/data.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":"b3f77a6966255640","code_sha256_prefix":"b3f77a6966255640","mcp_get_code":{"code_sha256":"b3f77a6966255640"}},{"arxiv_id":"1908.10357","arxiv_id_is_arxiv":true,"paper":"/paper/bottom-up-higher-resolution-networks-for","title":"HigherHRNet: Scale-Aware Representation Learning for Bottom-Up Human Pose Estimation","date":"2019-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HRNet/Higher-HRNet-Human-Pose-Estimation","path":"lib/dataset/build.py","file_url":"https://github.com/HRNet/Higher-HRNet-Human-Pose-Estimation/blob/HEAD/lib/dataset/build.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":"df9c22deab975625","code_sha256_prefix":"df9c22deab975625","mcp_get_code":{"code_sha256":"df9c22deab975625"}},{"arxiv_id":"1906.09868","arxiv_id_is_arxiv":true,"paper":"/paper/pose-estimation-for-non-cooperative-1","title":"Pose Estimation for Non-Cooperative Rendezvous Using Neural Networks","date":"2019-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tpark94/speedplusbaseline","path":"src/datasets/build.py","file_url":"https://github.com/tpark94/speedplusbaseline/blob/HEAD/src/datasets/build.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":"f801d48a9961c9d1","code_sha256_prefix":"f801d48a9961c9d1","mcp_get_code":{"code_sha256":"f801d48a9961c9d1"}},{"arxiv_id":"1903.07071","arxiv_id_is_arxiv":true,"paper":"/paper/bags-of-tricks-and-a-strong-baseline-for-deep","title":"Bag of Tricks and A Strong Baseline for Deep Person Re-identification","date":"2019-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lulujianjie/person-reid-tiny-baseline","path":"datasets/make_dataloader.py","file_url":"https://github.com/lulujianjie/person-reid-tiny-baseline/blob/HEAD/datasets/make_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":"618f7837c08190dd","code_sha256_prefix":"618f7837c08190dd","mcp_get_code":{"code_sha256":"618f7837c08190dd"}},{"arxiv_id":"1809.07454","arxiv_id_is_arxiv":true,"paper":"/paper/tasnet-surpassing-ideal-time-frequency","title":"Conv-TasNet: Surpassing Ideal Time-Frequency Magnitude Masking for Speech Separation","date":"2018-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"funcwj/conv-tasnet","path":"nnet/libs/dataset.py","file_url":"https://github.com/funcwj/conv-tasnet/blob/HEAD/nnet/libs/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":"4e23d73a9b135dab","code_sha256_prefix":"4e23d73a9b135dab","mcp_get_code":{"code_sha256":"4e23d73a9b135dab"}},{"arxiv_id":"1805.08318","arxiv_id_is_arxiv":true,"paper":"/paper/self-attention-generative-adversarial","title":"Self-Attention Generative Adversarial Networks","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"voletiv/self-attention-GAN-pytorch","path":"utils.py","file_url":"https://github.com/voletiv/self-attention-GAN-pytorch/blob/HEAD/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":"d605248fc0b2740e","code_sha256_prefix":"d605248fc0b2740e","mcp_get_code":{"code_sha256":"d605248fc0b2740e"}},{"arxiv_id":"1804.03999","arxiv_id_is_arxiv":true,"paper":"/paper/attention-u-net-learning-where-to-look-for","title":"Attention U-Net: Learning Where to Look for the Pancreas","date":"2018-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SINGROUP/ED-AFM","path":"edafm/training.py","file_url":"https://github.com/SINGROUP/ED-AFM/blob/HEAD/edafm/training.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":"e0604b6518ab750d","code_sha256_prefix":"e0604b6518ab750d","mcp_get_code":{"code_sha256":"e0604b6518ab750d"}}],"record_sha256":"82888de2bd8054eace20dbc560aa0c810ae77286d8594c28de61af81a9484217","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}