{"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/format-message","entry":"format_message","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":7,"n_papers_ran_no_instrument_failure":5,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":0,"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":2,"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":"2604.04356","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-04356","title":"REAM: Merging Improves Pruning of Experts in LLMs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"zai-org/glm-simple-evals","path":"evals/hle_eval.py","file_url":"https://github.com/zai-org/glm-simple-evals/blob/HEAD/evals/hle_eval.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, zai-org/glm-simple-evals when it was checked","code_sha256":"ba6ce7a502b69fbe","code_sha256_prefix":"ba6ce7a502b69fbe","mcp_get_code":{"code_sha256":"ba6ce7a502b69fbe"}},{"arxiv_id":"2410.12361","arxiv_id_is_arxiv":true,"paper":"/paper/proactive-agent-shifting-llm-agents-from","title":"Proactive Agent: Shifting LLM Agents from Reactive Responses to Active Assistance","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/proactiveagent","path":"dataset/build_reward_trainset.py","file_url":"https://github.com/thunlp/proactiveagent/blob/HEAD/dataset/build_reward_trainset.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":"288e12deebad1396","code_sha256_prefix":"288e12deebad1396","mcp_get_code":{"code_sha256":"288e12deebad1396"}},{"arxiv_id":"2311.08718","arxiv_id_is_arxiv":true,"paper":"/paper/decomposing-uncertainty-for-large-language","title":"Decomposing Uncertainty for Large Language Models through Input Clarification Ensembling","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsb-nlp-chang/llm_uncertainty","path":"forward.py","file_url":"https://github.com/ucsb-nlp-chang/llm_uncertainty/blob/HEAD/forward.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, ucsb-nlp-chang/llm_uncertainty when it was checked","code_sha256":"77af3c547fb9d4a6","code_sha256_prefix":"77af3c547fb9d4a6","mcp_get_code":{"code_sha256":"77af3c547fb9d4a6"}},{"arxiv_id":"2311.04887","arxiv_id_is_arxiv":true,"paper":"/paper/autochip-automating-hdl-generation-using-llm","title":"AutoChip: Automating HDL Generation Using LLM Feedback","date":null,"month_inferred_from_arxiv_id":"2023-11","title_source":"archive","repo":"shailja-thakur/autochip","path":"autochip_scripts/verilog_handling.py","file_url":"https://github.com/shailja-thakur/autochip/blob/HEAD/autochip_scripts/verilog_handling.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, shailja-thakur/autochip when it was checked","code_sha256":"a2b1ce482a799c83","code_sha256_prefix":"a2b1ce482a799c83","mcp_get_code":{"code_sha256":"a2b1ce482a799c83"}},{"arxiv_id":"2310.13724","arxiv_id_is_arxiv":true,"paper":"/paper/habitat-3-0-a-co-habitat-for-humans-avatars","title":"Habitat 3.0: A Co-Habitat for Humans, Avatars and Robots","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/habitat-sim","path":"src_python/habitat_sim/logging.py","file_url":"https://github.com/facebookresearch/habitat-sim/blob/HEAD/src_python/habitat_sim/logging.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":"5083abf3cf062090","code_sha256_prefix":"5083abf3cf062090","mcp_get_code":{"code_sha256":"5083abf3cf062090"}},{"arxiv_id":"2106.14405","arxiv_id_is_arxiv":true,"paper":"/paper/habitat-2-0-training-home-assistants-to","title":"Habitat 2.0: Training Home Assistants to Rearrange their Habitat","date":"2021-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"super5-22/habitat-vis","path":"habitat_sim/logging.py","file_url":"https://github.com/super5-22/habitat-vis/blob/HEAD/habitat_sim/logging.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, super5-22/habitat-vis, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"5083abf3cf062090","code_sha256_prefix":"5083abf3cf062090","mcp_get_code":{"code_sha256":"5083abf3cf062090"}},{"arxiv_id":"1904.01201","arxiv_id_is_arxiv":true,"paper":"/paper/habitat-a-platform-for-embodied-ai-research","title":"Habitat: A Platform for Embodied AI Research","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BKAUTO/Trinocular-habitat-sim","path":"habitat_sim/logging.py","file_url":"https://github.com/BKAUTO/Trinocular-habitat-sim/blob/HEAD/habitat_sim/logging.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, BKAUTO/Trinocular-habitat-sim, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"214c1da41950a171","code_sha256_prefix":"214c1da41950a171","mcp_get_code":{"code_sha256":"214c1da41950a171"}}],"record_sha256":"ab42845cad28bbbd0c750e0503aa99783e8c4f73e62c2a26360bf28c66dc0a7c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}