{"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/dispatch-openai-chat-requests","entry":"dispatch_openai_chat_requests","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":6,"n_papers_ran":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":1,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"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.22993","paper":"/paper/verify-in-the-graph-entity-disambiguation","title":"Verify-in-the-Graph: Entity Disambiguation Enhancement for Complex Claim Verification with Interactive Graph Representation","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"teacherpeterpan/ProgramFC","path":"models/utils.py","file_url":"https://github.com/teacherpeterpan/ProgramFC/blob/HEAD/models/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4e1c4ff342f96bc9","mcp_get_code":{"code_sha256":"4e1c4ff342f96bc9"}},{"arxiv_id":"2410.08047","paper":"/paper/divide-and-translate-compositional-first","title":"Divide and Translate: Compositional First-Order Logic Translation and Verification for Complex Logical Reasoning","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hyun-Ryu/clover","path":"models/utils.py","file_url":"https://github.com/Hyun-Ryu/clover/blob/HEAD/models/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4e1c4ff342f96bc9","mcp_get_code":{"code_sha256":"4e1c4ff342f96bc9"}},{"arxiv_id":"2408.13654","paper":"/paper/symbolic-working-memory-enhances-language","title":"Symbolic Working Memory Enhances Language Models for Complex Rule Application","date":"2024-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siyuanwangw/ruleapplication","path":"Src/models/openai_models.py","file_url":"https://github.com/siyuanwangw/ruleapplication/blob/HEAD/Src/models/openai_models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4e1c4ff342f96bc9","mcp_get_code":{"code_sha256":"4e1c4ff342f96bc9"}},{"arxiv_id":"2405.18357","paper":"/paper/faithful-logical-reasoning-via-symbolic-chain","title":"Faithful Logical Reasoning via Symbolic Chain-of-Thought","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aiden0526/SymbCoT","path":"utils.py","file_url":"https://github.com/Aiden0526/SymbCoT/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4e1c4ff342f96bc9","mcp_get_code":{"code_sha256":"4e1c4ff342f96bc9"}},{"arxiv_id":"2305.12744","paper":"/paper/fact-checking-complex-claims-with-program","title":"Fact-Checking Complex Claims with Program-Guided Reasoning","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbzuai-nlp/programfc","path":"models/utils.py","file_url":"https://github.com/mbzuai-nlp/programfc/blob/HEAD/models/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4e1c4ff342f96bc9","mcp_get_code":{"code_sha256":"4e1c4ff342f96bc9"}},{"arxiv_id":"2305.12295","paper":"/paper/logic-lm-empowering-large-language-models","title":"Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning","date":"2023-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"teacherpeterpan/logic-llm","path":"models/utils.py","file_url":"https://github.com/teacherpeterpan/logic-llm/blob/HEAD/models/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4e1c4ff342f96bc9","mcp_get_code":{"code_sha256":"4e1c4ff342f96bc9"}}]}