{"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/apply-template","entry":"apply_template","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":7,"n_places_pointer_only":3,"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":6,"unverified":1},"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":"2509.12158","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-12158","title":"Pun Unintended: LLMs and the Illusion of Humor Understanding","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"alezanga/punintended","path":"finetuning/llama/utils/data.py","file_url":"https://github.com/alezanga/punintended/blob/HEAD/finetuning/llama/utils/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, alezanga/punintended when it was checked","code_sha256":"ab9b465e6cd92bf6","code_sha256_prefix":"ab9b465e6cd92bf6","mcp_get_code":{"code_sha256":"ab9b465e6cd92bf6"}},{"arxiv_id":"2502.02384","arxiv_id_is_arxiv":true,"paper":"/paper/stair-improving-safety-alignment-with","title":"STAIR: Improving Safety Alignment with Introspective Reasoning","date":"2025-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/stair","path":"src/final_orm.py","file_url":"https://github.com/thu-ml/stair/blob/HEAD/src/final_orm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0396dbaaf06aef8f","code_sha256_prefix":"0396dbaaf06aef8f","mcp_get_code":{"code_sha256":"0396dbaaf06aef8f"}},{"arxiv_id":"2402.10024","arxiv_id_is_arxiv":true,"paper":"/paper/self-augmented-in-context-learning-for","title":"Self-Augmented In-Context Learning for Unsupervised Word Translation","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridgeltl/sail-bli","path":"src/util.py","file_url":"https://github.com/cambridgeltl/sail-bli/blob/HEAD/src/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":"e76df3c849e328e1","code_sha256_prefix":"e76df3c849e328e1","mcp_get_code":{"code_sha256":"e76df3c849e328e1"}},{"arxiv_id":"2312.05762","arxiv_id_is_arxiv":true,"paper":"/paper/multi-defendant-legal-judgment-prediction-via","title":"Multi-Defendant Legal Judgment Prediction via Hierarchical Reasoning","date":"2023-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"currentf/hrn","path":"models/HRN/src/data_templates.py","file_url":"https://github.com/currentf/hrn/blob/HEAD/models/HRN/src/data_templates.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, currentf/hrn when it was checked","code_sha256":"0098e17bf86eed6a","code_sha256_prefix":"0098e17bf86eed6a","mcp_get_code":{"code_sha256":"0098e17bf86eed6a"}},{"arxiv_id":"2310.13988","arxiv_id_is_arxiv":true,"paper":"/paper/gemba-mqm-detecting-translation-quality-error","title":"GEMBA-MQM: Detecting Translation Quality Error Spans with GPT-4","date":"2023-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsofttranslator/gemba","path":"gemba/gemba_mqm_utils.py","file_url":"https://github.com/microsofttranslator/gemba/blob/HEAD/gemba/gemba_mqm_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-SA-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-SA-4.0, as GitHub detects it on this paper's repository, microsofttranslator/gemba, is not in the permissive set Syntology serves inline","code_sha256":"9d3adecc4f3a3d3d","code_sha256_prefix":"9d3adecc4f3a3d3d","mcp_get_code":{"code_sha256":"9d3adecc4f3a3d3d"}},{"arxiv_id":"2211.01786","arxiv_id_is_arxiv":true,"paper":"/paper/crosslingual-generalization-through-multitask","title":"Crosslingual Generalization through Multitask Finetuning","date":"2022-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigscience-workshop/xmtf","path":"create_xp3x.py","file_url":"https://github.com/bigscience-workshop/xmtf/blob/HEAD/create_xp3x.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":"3cea2e48e72663a4","code_sha256_prefix":"3cea2e48e72663a4","mcp_get_code":{"code_sha256":"3cea2e48e72663a4"}},{"arxiv_id":"2023.acl-long.452","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.acl-long.452","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"terarachang/DataICL","path":"calib_evaluate.py","file_url":"https://github.com/terarachang/DataICL/blob/HEAD/calib_evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f314a2eec8b3ea4e","code_sha256_prefix":"f314a2eec8b3ea4e","mcp_get_code":{"code_sha256":"f314a2eec8b3ea4e"}}],"record_sha256":"c9abdc6cd690826910d2754a1584232e2f34fdad61072a4227b3dd0de0739f87","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}