{"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/tokenize-multipart-input","entry":"tokenize_multipart_input","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":8,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":8,"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":0,"ran":4,"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":"2408.13656","arxiv_id_is_arxiv":true,"paper":"/paper/localize-and-stitch-efficient-model-merging","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","date":"2024-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifei-he/localize-and-stitch","path":"language/src/dataset.py","file_url":"https://github.com/yifei-he/localize-and-stitch/blob/HEAD/language/src/dataset.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":"e3eed9fd49cd08fb","code_sha256_prefix":"e3eed9fd49cd08fb","mcp_get_code":{"code_sha256":"e3eed9fd49cd08fb"}},{"arxiv_id":"2406.12527","arxiv_id_is_arxiv":true,"paper":"/paper/fusegen-plm-fusion-for-data-generation-based","title":"FuseGen: PLM Fusion for Data-generation based Zero-shot Learning","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yumeng5/SuperGen","path":"src/dataset.py","file_url":"https://github.com/yumeng5/SuperGen/blob/HEAD/src/dataset.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":"a23897d8e4196682","code_sha256_prefix":"a23897d8e4196682","mcp_get_code":{"code_sha256":"a23897d8e4196682"}},{"arxiv_id":"2310.09639","arxiv_id_is_arxiv":true,"paper":"/paper/dpzero-dimension-independent-and","title":"DPZero: Private Fine-Tuning of Language Models without Backpropagation","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liang137/DPZero","path":"roberta/src/dataset.py","file_url":"https://github.com/Liang137/DPZero/blob/HEAD/roberta/src/dataset.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":"9a62fa939fc563a4","code_sha256_prefix":"9a62fa939fc563a4","mcp_get_code":{"code_sha256":"9a62fa939fc563a4"}},{"arxiv_id":"2305.17333","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-language-models-with-just-forward-1","title":"Fine-Tuning Language Models with Just Forward Passes","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/mezo","path":"medium_models/src/dataset.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/medium_models/src/dataset.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":"9a62fa939fc563a4","code_sha256_prefix":"9a62fa939fc563a4","mcp_get_code":{"code_sha256":"9a62fa939fc563a4"}},{"arxiv_id":"2210.05643","arxiv_id_is_arxiv":true,"paper":"/paper/a-kernel-based-view-of-language-model-fine","title":"A Kernel-Based View of Language Model Fine-Tuning","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/lm-kernel-ft","path":"src/dataset.py","file_url":"https://github.com/princeton-nlp/lm-kernel-ft/blob/HEAD/src/dataset.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":"7338b63ff734edaa","code_sha256_prefix":"7338b63ff734edaa","mcp_get_code":{"code_sha256":"7338b63ff734edaa"}},{"arxiv_id":"2205.01308","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-for-prompt-based-few","title":"Contrastive Learning for Prompt-Based Few-Shot Language Learners","date":"2022-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiren-jian/LM-SupCon","path":"src/dataset.py","file_url":"https://github.com/yiren-jian/LM-SupCon/blob/HEAD/src/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":"090deb73a074d4df","code_sha256_prefix":"090deb73a074d4df","mcp_get_code":{"code_sha256":"090deb73a074d4df"}},{"arxiv_id":"2110.06274","arxiv_id_is_arxiv":true,"paper":"/paper/list-lite-self-training-makes-efficient-few-1","title":"LiST: Lite Prompted Self-training Makes Parameter-Efficient Few-shot Learners","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/list","path":"src/dataset.py","file_url":"https://github.com/microsoft/list/blob/HEAD/src/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":"71af7b8adce2cf48","code_sha256_prefix":"71af7b8adce2cf48","mcp_get_code":{"code_sha256":"71af7b8adce2cf48"}},{"arxiv_id":"2110.01256","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-self-training-for-few-shot","title":"Revisiting Self-Training for Few-Shot Learning of Language Model","date":"2021-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matthewcym/sflm","path":"src/dataset.py","file_url":"https://github.com/matthewcym/sflm/blob/HEAD/src/dataset.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":"72e4be6e6f4cdc7e","code_sha256_prefix":"72e4be6e6f4cdc7e","mcp_get_code":{"code_sha256":"72e4be6e6f4cdc7e"}}],"record_sha256":"74101bcfb0d71ec082ed6e98fb810c7d823df0aff75c0426923bc0c4bdd18af8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}