{"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/em-2","entry":"EM","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":6,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":6,"n_places_pointer_only":2,"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":2,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"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":"2410.06617","arxiv_id_is_arxiv":true,"paper":"/paper/learning-evolving-tools-for-large-language","title":"Learning Evolving Tools for Large Language Models","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chen-GX/ToolEVO","path":"MCTS/src/evaluation.py","file_url":"https://github.com/Chen-GX/ToolEVO/blob/HEAD/MCTS/src/evaluation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, Chen-GX/ToolEVO when it was checked","code_sha256":"21aa81edfe5a0c85","code_sha256_prefix":"21aa81edfe5a0c85","mcp_get_code":{"code_sha256":"21aa81edfe5a0c85"}},{"arxiv_id":"2403.00843","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-long-term-recommendation-with-bi","title":"Large Language Models are Learnable Planners for Long-Term Recommendation","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jizhi-zhang/billp","path":"Agents/agent_reflexion.py","file_url":"https://github.com/jizhi-zhang/billp/blob/HEAD/Agents/agent_reflexion.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20c8a77ea03b234c","code_sha256_prefix":"20c8a77ea03b234c","mcp_get_code":{"code_sha256":"20c8a77ea03b234c"}},{"arxiv_id":"2402.03659","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-generate-explainable-stock","title":"Learning to Generate Explainable Stock Predictions using Self-Reflective Large Language Models","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"koa-fin/sep","path":"explain_module/agents.py","file_url":"https://github.com/koa-fin/sep/blob/HEAD/explain_module/agents.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, koa-fin/sep when it was checked","code_sha256":"6296f4fd5cc3db50","code_sha256_prefix":"6296f4fd5cc3db50","mcp_get_code":{"code_sha256":"6296f4fd5cc3db50"}},{"arxiv_id":"2306.13304","arxiv_id_is_arxiv":true,"paper":"/paper/toolqa-a-dataset-for-llm-question-answering-1","title":"ToolQA: A Dataset for LLM Question Answering with External Tools","date":"2023-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"night-chen/toolqa","path":"benchmark/ReAct/code/environment.py","file_url":"https://github.com/night-chen/toolqa/blob/HEAD/benchmark/ReAct/code/environment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"898fb37499d60ace","code_sha256_prefix":"898fb37499d60ace","mcp_get_code":{"code_sha256":"898fb37499d60ace"}},{"arxiv_id":"2303.11366","arxiv_id_is_arxiv":true,"paper":"/paper/reflexion-language-agents-with-verbal","title":"Reflexion: Language Agents with Verbal Reinforcement Learning","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"noahshinn/reflexion","path":"hotpotqa_runs/environment.py","file_url":"https://github.com/noahshinn/reflexion/blob/HEAD/hotpotqa_runs/environment.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":"6f79fe1ce6d553fa","code_sha256_prefix":"6f79fe1ce6d553fa","mcp_get_code":{"code_sha256":"6f79fe1ce6d553fa"}},{"arxiv_id":"1908.11515","arxiv_id_is_arxiv":true,"paper":"/paper/practical-and-robust-privacy-amplification","title":"Improving Utility and Security of the Shuffler-based Differential Privacy","date":"2019-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vvv214/LDP_Protocols","path":"sw.py","file_url":"https://github.com/vvv214/LDP_Protocols/blob/HEAD/sw.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":"a132c0ee784427bc","code_sha256_prefix":"a132c0ee784427bc","mcp_get_code":{"code_sha256":"a132c0ee784427bc"}}],"record_sha256":"ee21566e0d6142830d918517305f6d76233b2741fc27f7db54403ce243be3276","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}