{"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/build-instruction-dataset","entry":"build_instruction_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":0,"n_papers_ran_no_instrument_failure":0,"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":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":6,"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":0,"ran_fixture":0,"ran":0,"unverified":5},"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":"2406.15741","arxiv_id_is_arxiv":true,"paper":"/paper/ladder-a-model-agnostic-framework-boosting","title":"Ladder: A Model-Agnostic Framework Boosting LLM-based Machine Translation to the Next Level","date":"2024-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fzp0424/MT-Ladder","path":"utils/build_dataset.py","file_url":"https://github.com/fzp0424/MT-Ladder/blob/HEAD/utils/build_dataset.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, fzp0424/MT-Ladder when it was checked","code_sha256":"bdd9da0b8a3cb233","code_sha256_prefix":"bdd9da0b8a3cb233","mcp_get_code":{"code_sha256":"bdd9da0b8a3cb233"}},{"arxiv_id":"2406.15741","arxiv_id_is_arxiv":true,"paper":"/paper/ladder-a-model-agnostic-framework-boosting","title":"Ladder: A Model-Agnostic Framework Boosting LLM-based Machine Translation to the Next Level","date":"2024-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fzp0424/ladder","path":"utils/build_dataset.py","file_url":"https://github.com/fzp0424/ladder/blob/HEAD/utils/build_dataset.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, fzp0424/ladder when it was checked","code_sha256":"43c9b0db7cb0dbf8","code_sha256_prefix":"43c9b0db7cb0dbf8","mcp_get_code":{"code_sha256":"43c9b0db7cb0dbf8"}},{"arxiv_id":"2405.08553","arxiv_id_is_arxiv":true,"paper":"/paper/improving-transformers-with-dynamically","title":"Improving Transformers with Dynamically Composable Multi-Head Attention","date":"2024-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caiyun-ai/dcformer","path":"pytorch/dcformer/build_dataset.py","file_url":"https://github.com/caiyun-ai/dcformer/blob/HEAD/pytorch/dcformer/build_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":"bb033a34d8b49b9d","code_sha256_prefix":"bb033a34d8b49b9d","mcp_get_code":{"code_sha256":"bb033a34d8b49b9d"}},{"arxiv_id":"2404.19245","arxiv_id_is_arxiv":true,"paper":"/paper/hydralora-an-asymmetric-lora-architecture-for","title":"HydraLoRA: An Asymmetric LoRA Architecture for Efficient Fine-Tuning","date":"2024-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clin0212/hydralora","path":"HydraLoRA/build_dataset.py","file_url":"https://github.com/clin0212/hydralora/blob/HEAD/HydraLoRA/build_dataset.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, clin0212/hydralora when it was checked","code_sha256":"2776dfe4cf53097d","code_sha256_prefix":"2776dfe4cf53097d","mcp_get_code":{"code_sha256":"2776dfe4cf53097d"}},{"arxiv_id":"2312.09979","arxiv_id_is_arxiv":true,"paper":"/paper/the-art-of-balancing-revolutionizing-mixture","title":"LoRAMoE: Alleviate World Knowledge Forgetting in Large Language Models via MoE-Style Plugin","date":"2023-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ablustrund/loramoe","path":"build_dataset.py","file_url":"https://github.com/ablustrund/loramoe/blob/HEAD/build_dataset.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, ablustrund/loramoe when it was checked","code_sha256":"2776dfe4cf53097d","code_sha256_prefix":"2776dfe4cf53097d","mcp_get_code":{"code_sha256":"2776dfe4cf53097d"}},{"arxiv_id":"2025.acl-long.669","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.acl-long.669","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"DCDmllm/TeamLoRA","path":"build_datasets.py","file_url":"https://github.com/DCDmllm/TeamLoRA/blob/HEAD/build_datasets.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":"d68b4899232c01da","code_sha256_prefix":"d68b4899232c01da","mcp_get_code":{"code_sha256":"d68b4899232c01da"}}],"record_sha256":"23258128050fcd37264cc483666da2342b83258270af0c252e2dc6d0dbb5894d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}