{"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-prompts","entry":"build_prompts","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":4,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":2,"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":2,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":7,"n_places_pointer_only":5,"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":4,"ran_fixture":0,"ran":2,"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":"2605.01148","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01148","title":"Arithmetic in the Wild: Llama uses Base-10 Addition to Reason About Cyclic Concepts","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"goodfire-ai/arithmetic-wild","path":"src/cache_neuron_activations.py","file_url":"https://github.com/goodfire-ai/arithmetic-wild/blob/HEAD/src/cache_neuron_activations.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, goodfire-ai/arithmetic-wild when it was checked","code_sha256":"7e320c66925fb217","code_sha256_prefix":"7e320c66925fb217","mcp_get_code":{"code_sha256":"7e320c66925fb217"}},{"arxiv_id":"2602.02139","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02139","title":"EvoMU: Evolutionary Machine Unlearning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Batorskq/EvoMU","path":"generate.py","file_url":"https://github.com/Batorskq/EvoMU/blob/HEAD/generate.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, Batorskq/EvoMU when it was checked","code_sha256":"d82f38d3ff8ec37d","code_sha256_prefix":"d82f38d3ff8ec37d","mcp_get_code":{"code_sha256":"d82f38d3ff8ec37d"}},{"arxiv_id":"2602.02139","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02139","title":"EvoMU: Evolutionary Machine Unlearning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Batorskq/EvoMU","path":"generate_books.py","file_url":"https://github.com/Batorskq/EvoMU/blob/HEAD/generate_books.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Batorskq/EvoMU when it was checked","code_sha256":"ecc38e915af79368","code_sha256_prefix":"ecc38e915af79368","mcp_get_code":{"code_sha256":"ecc38e915af79368"}},{"arxiv_id":"2602.02139","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02139","title":"EvoMU: Evolutionary Machine Unlearning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Batorskq/EvoMU","path":"generate_muse.py","file_url":"https://github.com/Batorskq/EvoMU/blob/HEAD/generate_muse.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Batorskq/EvoMU when it was checked","code_sha256":"7599901a8968b428","code_sha256_prefix":"7599901a8968b428","mcp_get_code":{"code_sha256":"7599901a8968b428"}},{"arxiv_id":"2502.11191","arxiv_id_is_arxiv":true,"paper":"/paper/primus-a-pioneering-collection-of-open-source","title":"Primus: A Pioneering Collection of Open-Source Datasets for Cybersecurity LLM Training","date":"2025-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huggingface/cosmopedia","path":"prompts/openstax/build_openstax_prompts.py","file_url":"https://github.com/huggingface/cosmopedia/blob/HEAD/prompts/openstax/build_openstax_prompts.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":"18361e25f3aedbaa","code_sha256_prefix":"18361e25f3aedbaa","mcp_get_code":{"code_sha256":"18361e25f3aedbaa"}},{"arxiv_id":"2407.10834","arxiv_id_is_arxiv":true,"paper":"/paper/metallm-a-high-performant-and-cost-efficient","title":"MetaLLM: A High-performant and Cost-efficient Dynamic Framework for Wrapping LLMs","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mail-research/metallm-wrapper","path":"benchmark.py","file_url":"https://github.com/mail-research/metallm-wrapper/blob/HEAD/benchmark.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, mail-research/metallm-wrapper, is not in the permissive set Syntology serves inline","code_sha256":"88db7ece348edfb5","code_sha256_prefix":"88db7ece348edfb5","mcp_get_code":{"code_sha256":"88db7ece348edfb5"}},{"arxiv_id":"2211.09527","arxiv_id_is_arxiv":true,"paper":"/paper/ignore-previous-prompt-attack-techniques-for","title":"Ignore Previous Prompt: Attack Techniques For Language Models","date":"2022-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agencyenterprise/PromptInject","path":"promptinject/prompting.py","file_url":"https://github.com/agencyenterprise/PromptInject/blob/HEAD/promptinject/prompting.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":"f128e03664ebd735","code_sha256_prefix":"f128e03664ebd735","mcp_get_code":{"code_sha256":"f128e03664ebd735"}}],"record_sha256":"6711b6a205e37390032686964b16ccd4599e6b8cee7d5d5d277dbf2fc620983f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}