{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/format-query","entry":"format_query","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":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":5,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":3},"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":"2606.00660","paper":"/paper/arxiv-2606-00660","title":"FINEVERIFY: Scaling Test-Time Compute with Fine-Grained Self-Verification for Agentic Search","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"XuZhao0/fineverify","path":"prompts.py","file_url":"https://github.com/XuZhao0/fineverify/blob/HEAD/prompts.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5118a2591c02ba6a","mcp_get_code":{"code_sha256":"5118a2591c02ba6a"}},{"arxiv_id":"2604.00438","paper":"/paper/arxiv-2604-00438","title":"TR-ICRL: Test-Time Rethinking for In-Context Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"pangpang-xuan/TR_ICRL","path":"embedding.py","file_url":"https://github.com/pangpang-xuan/TR_ICRL/blob/HEAD/embedding.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3a6bb37be2e0340d","mcp_get_code":{"code_sha256":"3a6bb37be2e0340d"}},{"arxiv_id":"2411.07404","paper":"/paper/controllable-context-sensitivity-and-the-knob","title":"Controllable Context Sensitivity and the Knob Behind It","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kdu4108/context-vs-prior-finetuning","path":"preprocessing/utils.py","file_url":"https://github.com/kdu4108/context-vs-prior-finetuning/blob/HEAD/preprocessing/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a5e0f7e4358d7948","mcp_get_code":{"code_sha256":"a5e0f7e4358d7948"}},{"arxiv_id":"2403.00843","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_a2c.py","file_url":"https://github.com/jizhi-zhang/billp/blob/HEAD/Agents/agent_a2c.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0afdb39510e14e05","mcp_get_code":{"code_sha256":"0afdb39510e14e05"}},{"arxiv_id":"2311.08718","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b1f045341985ed00","mcp_get_code":{"code_sha256":"b1f045341985ed00"}}]}