{"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/load-hf-dataset","entry":"load_hf_dataset","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":5,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"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":5,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":5,"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":0,"ran_fixture":0,"ran":1,"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":"2403.13027","arxiv_id_is_arxiv":true,"paper":"/paper/towards-better-statistical-understanding-of","title":"Towards Better Statistical Understanding of Watermarking LLMs","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongzecai/dualga","path":"WatermarkAlgorithm/utils/data_processing.py","file_url":"https://github.com/zhongzecai/dualga/blob/HEAD/WatermarkAlgorithm/utils/data_processing.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, zhongzecai/dualga when it was checked","code_sha256":"86b01270fe49c4d1","code_sha256_prefix":"86b01270fe49c4d1","mcp_get_code":{"code_sha256":"86b01270fe49c4d1"}},{"arxiv_id":"2402.03660","arxiv_id_is_arxiv":true,"paper":"/paper/cross-task-linearity-emerges-in-the","title":"On the Emergence of Cross-Task Linearity in the Pretraining-Finetuning Paradigm","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzp1012/cross-task-linearity","path":"task_arithemetic_t5/data_utils.py","file_url":"https://github.com/zzp1012/cross-task-linearity/blob/HEAD/task_arithemetic_t5/data_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":"598fb7842545bd8e","code_sha256_prefix":"598fb7842545bd8e","mcp_get_code":{"code_sha256":"598fb7842545bd8e"}},{"arxiv_id":"2401.11374","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-as-hierarchy-encoders","title":"Language Models as Hierarchy Encoders","date":"2024-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krr-oxford/hierarchytransformers","path":"src/hierarchy_transformers/datasets/load.py","file_url":"https://github.com/krr-oxford/hierarchytransformers/blob/HEAD/src/hierarchy_transformers/datasets/load.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":"67ff2eddd3f6c090","code_sha256_prefix":"67ff2eddd3f6c090","mcp_get_code":{"code_sha256":"67ff2eddd3f6c090"}},{"arxiv_id":"2201.03514","arxiv_id_is_arxiv":true,"paper":"/paper/black-box-tuning-for-language-model-as-a","title":"Black-Box Tuning for Language-Model-as-a-Service","date":"2022-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jubgjf/plmtuningcompetition","path":"dataloader.py","file_url":"https://github.com/jubgjf/plmtuningcompetition/blob/HEAD/dataloader.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":"94689a629c7580ff","code_sha256_prefix":"94689a629c7580ff","mcp_get_code":{"code_sha256":"94689a629c7580ff"}},{"arxiv_id":"1910.10683","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shivamraval98/multitask-t5_ae","path":"src/models/T5Model/t5_utils.py","file_url":"https://github.com/shivamraval98/multitask-t5_ae/blob/HEAD/src/models/T5Model/t5_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":"189deed085d33fb1","code_sha256_prefix":"189deed085d33fb1","mcp_get_code":{"code_sha256":"189deed085d33fb1"}}],"record_sha256":"b199d7d41e1b0fb1f6bbfcc731736dde047f1785c67d7ad5ceda8bd0941d24a6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}