{"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-context","entry":"get_context","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":6,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":7,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":10,"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":7,"ran_fixture":0,"ran":3,"unverified":0},"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":"2601.16462","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-16462","title":"Finding What Matters: Anchoring Context Knowledge with Evolving Indices for Iterative Retrieval","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"NEUIR/KAIR","path":"src/KAIR.py","file_url":"https://github.com/NEUIR/KAIR/blob/HEAD/src/KAIR.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0b68be4c85e7c8e","code_sha256_prefix":"e0b68be4c85e7c8e","mcp_get_code":{"code_sha256":"e0b68be4c85e7c8e"}},{"arxiv_id":"2411.00204","arxiv_id_is_arxiv":true,"paper":"/paper/restor-knowledge-recovery-through-machine","title":"RESTOR: Knowledge Recovery through Machine Unlearning","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"k1rezaei/restor","path":"evaluation/eval_utils.py","file_url":"https://github.com/k1rezaei/restor/blob/HEAD/evaluation/eval_utils.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":"07cdcb5843a038df","code_sha256_prefix":"07cdcb5843a038df","mcp_get_code":{"code_sha256":"07cdcb5843a038df"}},{"arxiv_id":"2409.18602","arxiv_id_is_arxiv":true,"paper":"/paper/do-llms-suffer-from-multi-party-hangover-a","title":"Do LLMs suffer from Multi-Party Hangover? A Diagnostic Approach to Addressee Recognition and Response Selection in Conversations","date":"2024-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dhfbk/MPH","path":"diagnostic_analysis/prompt_design/0-verbose/mycode/tools.py","file_url":"https://github.com/dhfbk/MPH/blob/HEAD/diagnostic_analysis/prompt_design/0-verbose/mycode/tools.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dhfbk/MPH when it was checked","code_sha256":"d3b0e8859f6fc680","code_sha256_prefix":"d3b0e8859f6fc680","mcp_get_code":{"code_sha256":"d3b0e8859f6fc680"}},{"arxiv_id":"2409.07123","arxiv_id_is_arxiv":true,"paper":"/paper/cross-refine-improving-natural-language","title":"Cross-Refine: Improving Natural Language Explanation Generation by Learning in Tandem","date":"2024-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiaw99/Cross-Refine","path":"experiments/critic_feedback_explanation_generation.py","file_url":"https://github.com/qiaw99/Cross-Refine/blob/HEAD/experiments/critic_feedback_explanation_generation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, qiaw99/Cross-Refine when it was checked","code_sha256":"500d02661de16879","code_sha256_prefix":"500d02661de16879","mcp_get_code":{"code_sha256":"500d02661de16879"}},{"arxiv_id":"2404.10975","arxiv_id_is_arxiv":true,"paper":"/paper/procedural-dilemma-generation-for-evaluating","title":"Procedural Dilemma Generation for Evaluating Moral Reasoning in Humans and Language Models","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cicl-stanford/moral-evals","path":"offtherails/src/helpers.py","file_url":"https://github.com/cicl-stanford/moral-evals/blob/HEAD/offtherails/src/helpers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0fd89f5e55b1a4f","code_sha256_prefix":"e0fd89f5e55b1a4f","mcp_get_code":{"code_sha256":"e0fd89f5e55b1a4f"}},{"arxiv_id":"2404.10975","arxiv_id_is_arxiv":true,"paper":"/paper/procedural-dilemma-generation-for-evaluating","title":"Procedural Dilemma Generation for Evaluating Moral Reasoning in Humans and Language Models","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cicl-stanford/moral-evals","path":"offtherails/src/stage_1.py","file_url":"https://github.com/cicl-stanford/moral-evals/blob/HEAD/offtherails/src/stage_1.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a58aba4c1171a579","code_sha256_prefix":"a58aba4c1171a579","mcp_get_code":{"code_sha256":"a58aba4c1171a579"}},{"arxiv_id":"2311.09805","arxiv_id_is_arxiv":true,"paper":"/paper/docmath-eval-evaluating-numerical-reasoning","title":"DocMath-Eval: Evaluating Math Reasoning Capabilities of LLMs in Understanding Long and Specialized Documents","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yale-nlp/docmath-eval","path":"utils/model_input_utils.py","file_url":"https://github.com/yale-nlp/docmath-eval/blob/HEAD/utils/model_input_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, yale-nlp/docmath-eval when it was checked","code_sha256":"eb7d8895ef9a732f","code_sha256_prefix":"eb7d8895ef9a732f","mcp_get_code":{"code_sha256":"eb7d8895ef9a732f"}},{"arxiv_id":"2306.04757","arxiv_id_is_arxiv":true,"paper":"/paper/instructeval-towards-holistic-evaluation-of","title":"INSTRUCTEVAL: Towards Holistic Evaluation of Instruction-Tuned Large Language Models","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"declare-lab/instruct-eval","path":"red-eval/generate_responses.py","file_url":"https://github.com/declare-lab/instruct-eval/blob/HEAD/red-eval/generate_responses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00074a360d506eb8","code_sha256_prefix":"00074a360d506eb8","mcp_get_code":{"code_sha256":"00074a360d506eb8"}},{"arxiv_id":"2206.01347","arxiv_id_is_arxiv":true,"paper":"/paper/multihiertt-numerical-reasoning-over-multi-1","title":"MultiHiertt: Numerical Reasoning over Multi Hierarchical Tabular and Textual Data","date":"2022-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psunlpgroup/multihiertt","path":"convert_retriever_result.py","file_url":"https://github.com/psunlpgroup/multihiertt/blob/HEAD/convert_retriever_result.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":"65c5b5b5c7482e97","code_sha256_prefix":"65c5b5b5c7482e97","mcp_get_code":{"code_sha256":"65c5b5b5c7482e97"}},{"arxiv_id":"1807.03748","arxiv_id_is_arxiv":true,"paper":"/paper/representation-learning-with-contrastive","title":"Representation Learning with Contrastive Predictive Coding","date":"2018-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yusuke0519/constrastive_predictive_coding","path":"cpc.py","file_url":"https://github.com/yusuke0519/constrastive_predictive_coding/blob/HEAD/cpc.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, yusuke0519/constrastive_predictive_coding when it was checked","code_sha256":"3fd9a785ec6e3e12","code_sha256_prefix":"3fd9a785ec6e3e12","mcp_get_code":{"code_sha256":"3fd9a785ec6e3e12"}}],"record_sha256":"8382e53b95f0c4300cc4f95dd56a78b9f632b9ad9a700a4b569623bd0b9c0dbb","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}