{"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/get-examples","entry":"get_examples","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":15,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":3,"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":15,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":15,"n_places_pointer_only":7,"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":3,"ran_fixture":0,"ran":10,"unverified":2},"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":"2505.18384","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-risk-assessments-for-offensive","title":"Dynamic Risk Assessments for Offensive Cybersecurity Agents","date":"2025-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boyiwei/dynamic-risk-assessment","path":"run_evaluation.py","file_url":"https://github.com/boyiwei/dynamic-risk-assessment/blob/HEAD/run_evaluation.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":"07105a13d005394c","code_sha256_prefix":"07105a13d005394c","mcp_get_code":{"code_sha256":"07105a13d005394c"}},{"arxiv_id":"2412.19513","arxiv_id_is_arxiv":true,"paper":"/paper/confidence-v-s-critique-a-decomposition-of","title":"Confidence v.s. Critique: A Decomposition of Self-Correction Capability for LLMs","date":"2024-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhe-Young/SelfCorrectDecompose","path":"eval_logits.py","file_url":"https://github.com/Zhe-Young/SelfCorrectDecompose/blob/HEAD/eval_logits.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Zhe-Young/SelfCorrectDecompose when it was checked","code_sha256":"fbe652c7fa7abfbc","code_sha256_prefix":"fbe652c7fa7abfbc","mcp_get_code":{"code_sha256":"fbe652c7fa7abfbc"}},{"arxiv_id":"2412.14093","arxiv_id_is_arxiv":true,"paper":"/paper/alignment-faking-in-large-language-models","title":"Alignment faking in large language models","date":"2024-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"redwoodresearch/alignment_faking_public","path":"model_organism/analyse_paraphrases.py","file_url":"https://github.com/redwoodresearch/alignment_faking_public/blob/HEAD/model_organism/analyse_paraphrases.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":"11be8a6d8c172ea7","code_sha256_prefix":"11be8a6d8c172ea7","mcp_get_code":{"code_sha256":"11be8a6d8c172ea7"}},{"arxiv_id":"2409.07429","arxiv_id_is_arxiv":true,"paper":"/paper/agent-workflow-memory","title":"Agent Workflow Memory","date":"2024-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zorazrw/agent-workflow-memory","path":"mind2web/workflow/retrieve.py","file_url":"https://github.com/zorazrw/agent-workflow-memory/blob/HEAD/mind2web/workflow/retrieve.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":"a1075bc76f348b17","code_sha256_prefix":"a1075bc76f348b17","mcp_get_code":{"code_sha256":"a1075bc76f348b17"}},{"arxiv_id":"2402.02834","arxiv_id_is_arxiv":true,"paper":"/paper/shortened-llama-a-simple-depth-pruning-for","title":"Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methods","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nota-netspresso/shortened-llm","path":"src/dataset.py","file_url":"https://github.com/nota-netspresso/shortened-llm/blob/HEAD/src/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, nota-netspresso/shortened-llm when it was checked","code_sha256":"dda7f6122e4d1904","code_sha256_prefix":"dda7f6122e4d1904","mcp_get_code":{"code_sha256":"dda7f6122e4d1904"}},{"arxiv_id":"2401.06766","arxiv_id_is_arxiv":true,"paper":"/paper/mind-your-format-towards-consistent","title":"Mind Your Format: Towards Consistent Evaluation of In-Context Learning Improvements","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yandex-research/mind-your-format","path":"examples.py","file_url":"https://github.com/yandex-research/mind-your-format/blob/HEAD/examples.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":"39c1250cde8fa4e6","code_sha256_prefix":"39c1250cde8fa4e6","mcp_get_code":{"code_sha256":"39c1250cde8fa4e6"}},{"arxiv_id":"2312.12832","arxiv_id_is_arxiv":true,"paper":"/paper/turning-dust-into-gold-distilling-complex","title":"Turning Dust into Gold: Distilling Complex Reasoning Capabilities from LLMs by Leveraging Negative Data","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yiwei98/TDG","path":"code/dataset.py","file_url":"https://github.com/Yiwei98/TDG/blob/HEAD/code/dataset.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, Yiwei98/TDG when it was checked","code_sha256":"b45ecd8e25d563f0","code_sha256_prefix":"b45ecd8e25d563f0","mcp_get_code":{"code_sha256":"b45ecd8e25d563f0"}},{"arxiv_id":"2310.17140","arxiv_id_is_arxiv":true,"paper":"/paper/symbolic-planning-and-code-generation-for","title":"Symbolic Planning and Code Generation for Grounded Dialogue","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justinchiu/onecommon-gpt","path":"oc/ocdata.py","file_url":"https://github.com/justinchiu/onecommon-gpt/blob/HEAD/oc/ocdata.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, justinchiu/onecommon-gpt when it was checked","code_sha256":"8cabae34903b7511","code_sha256_prefix":"8cabae34903b7511","mcp_get_code":{"code_sha256":"8cabae34903b7511"}},{"arxiv_id":"2310.07177","arxiv_id_is_arxiv":true,"paper":"/paper/online-speculative-decoding","title":"Online Speculative Decoding","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuxiaoxuanpku/osd","path":"distill/data.py","file_url":"https://github.com/liuxiaoxuanpku/osd/blob/HEAD/distill/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, liuxiaoxuanpku/osd when it was checked","code_sha256":"cfda031d44778d32","code_sha256_prefix":"cfda031d44778d32","mcp_get_code":{"code_sha256":"cfda031d44778d32"}},{"arxiv_id":"2308.15419","arxiv_id_is_arxiv":true,"paper":"/paper/characterizing-learning-curves-during","title":"Characterizing Learning Curves During Language Model Pre-Training: Learning, Forgetting, and Stability","date":"2023-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tylerachang/lm-learning-curves","path":"utils/data_utils.py","file_url":"https://github.com/tylerachang/lm-learning-curves/blob/HEAD/utils/data_utils.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, tylerachang/lm-learning-curves when it was checked","code_sha256":"71ab3c3ebeb19aed","code_sha256_prefix":"71ab3c3ebeb19aed","mcp_get_code":{"code_sha256":"71ab3c3ebeb19aed"}},{"arxiv_id":"2303.09092","arxiv_id_is_arxiv":true,"paper":"/paper/investigating-failures-to-generalize-for","title":"Challenges to Evaluating the Generalization of Coreference Resolution Models: A Measurement Modeling Perspective","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ianporada/coref-data","path":"dataset_creation/manual/ezcoref_raw/push_to_hub.py","file_url":"https://github.com/ianporada/coref-data/blob/HEAD/dataset_creation/manual/ezcoref_raw/push_to_hub.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":"1eb237786c327189","code_sha256_prefix":"1eb237786c327189","mcp_get_code":{"code_sha256":"1eb237786c327189"}},{"arxiv_id":"2302.06868","arxiv_id_is_arxiv":true,"paper":"/paper/switchprompt-learning-domain-specific-gated","title":"SwitchPrompt: Learning Domain-Specific Gated Soft Prompts for Classification in Low-Resource Domains","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/switchprompt","path":"databuilding_script.py","file_url":"https://github.com/boschresearch/switchprompt/blob/HEAD/databuilding_script.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, boschresearch/switchprompt, is not in the permissive set Syntology serves inline","code_sha256":"0926ffb7817e4ac6","code_sha256_prefix":"0926ffb7817e4ac6","mcp_get_code":{"code_sha256":"0926ffb7817e4ac6"}},{"arxiv_id":"2110.13880","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-interlocking-dynamics-of","title":"Understanding Interlocking Dynamics of Cooperative Rationalization","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gorov/understanding_interlocking","path":"beer_data_utils_neurips21.py","file_url":"https://github.com/gorov/understanding_interlocking/blob/HEAD/beer_data_utils_neurips21.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e3d9a7174e604bf2","code_sha256_prefix":"e3d9a7174e604bf2","mcp_get_code":{"code_sha256":"e3d9a7174e604bf2"}},{"arxiv_id":"2110.04400","arxiv_id_is_arxiv":true,"paper":"/paper/hydrasum-disentangling-stylistic-features-in-1","title":"HydraSum: Disentangling Stylistic Features in Text Summarization using Multi-Decoder Models","date":"2021-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/hydra-sum","path":"modelling/train_seq2seq_utils.py","file_url":"https://github.com/salesforce/hydra-sum/blob/HEAD/modelling/train_seq2seq_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1b2cef5d2e4a09bb","code_sha256_prefix":"1b2cef5d2e4a09bb","mcp_get_code":{"code_sha256":"1b2cef5d2e4a09bb"}},{"arxiv_id":"2003.09772","arxiv_id_is_arxiv":true,"paper":"/paper/invariant-rationalization","title":"Invariant Rationalization","date":"2020-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"code-terminator/invariant_rationalization","path":"imdb.py","file_url":"https://github.com/code-terminator/invariant_rationalization/blob/HEAD/imdb.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":"c7fb71ec3b394233","code_sha256_prefix":"c7fb71ec3b394233","mcp_get_code":{"code_sha256":"c7fb71ec3b394233"}}],"record_sha256":"5024e2bbe27a16a32b2fabc2f6ec3661b0e3c61a08466ace87f52df2f8b1e64b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}