{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_543b405f2e7b5d6d0612bd3d91682ba31a4f1db08961311fca6c954bd9bf1c3e","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_543b405f2e7b5d6d0612bd3d91682ba31a4f1db08961311fca6c954bd9bf1c3e","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"150c2eec8da6070d700314420248b7e4c8e3cc1a5c1ea27b31e687129cfcb5ab","published":"Wed, 27 May 2026 00:00:00 -0400","receipt_hash":"150c2eec8da6070d700314420248b7e4c8e3cc1a5c1ea27b31e687129cfcb5ab","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"150c2eec8da6070d700314420248b7e4c8e3cc1a5c1ea27b31e687129cfcb5ab","observed_at":"2026-05-27T04:43:18.926230Z","parent_run_hash":"6f581915edab4326e2b95fed7c82c2ee149e978d6d7c2443439442a927c31dfa","published":"Wed, 27 May 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2601.18987v5 Announce Type: replace-cross \nAbstract: Determining whether a program terminates is a central problem in computer science. Turing's Halting Problem established termination as undecidable, showing that no algorithm can universally determine termination for all programs and inputs. Hence, verification tools approximate termination, sometimes failing to prove or disprove; these tools rely on problem specific architectures, and are usually tied to particular programming languages. Recent advances in LLMs raise a natural question: To what extent can they reason about program termination? We evaluate frontier LLMs on a diverse set of C programs from the International Competition on Software Verification (SV Comp) 2025. Our results show that GPT-5 and Claude Sonnet 4.5 achieve scores comparable to top ranked verification tools (with test time scaling). However, while models often correctly infer whether programs terminate, they frequently fail to construct a witness as form","title":"LLMs versus the Halting Problem: Characterizing Program Termination Reasoning","url":"https://arxiv.org/abs/2601.18987","vendor":"arxiv_cs_ai"},"summary":"arXiv:2601.18987v5 Announce Type: replace-cross \nAbstract: Determining whether a program terminates is a central problem in computer science. Turing's Halting Problem established termination as undecidable, showing that no algorithm can universally determine termination for all programs and inputs. Hence, verification tools approximate termination, sometimes failing to prove or disprove; these tools rely on problem specific architectures, and are usually tied to particular programming languages. Recent advances in LLMs raise a natural question: To what extent can they reason about program termination? We evaluate frontier LLMs on a diverse set of C programs from the International Competition on Software Verification (SV Comp) 2025. Our results show that GPT-5 and Claude Sonnet 4.5 achieve scores comparable to top ranked verification tools (with test time scaling). However, while models often correctly infer whether programs terminate, they frequently fail to construct a witness as form","title":"LLMs versus the Halting Problem: Characterizing Program Termination Reasoning","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-27T04:43:18Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2601.18987"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:c86f3d50c6ce15427a999516ef900c6bde48cf0d30afe8c4558264eff33533ae19a8d12fe1b65b02a920cb802b1b6ddfd0e6ee3f0bb2ed507c2644506049b10e","signer":"crovia.substrate","subject":{"observed_at":"2026-05-27T04:43:18Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2601.18987"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"78e0f876779fdd1e77369f597619cd159d4ea60b19ed9ee0193404858bf5af1d","leaf_index":153920,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"8b07ed73e12b7b9086e8071d3c77c93e8fbd11ea9db5391a3e6743924da17e11","side":"right"},{"sibling":"8d224b5f0bd6fa2794d472e4ac20945c01bf6f1f500c923a6ac0e5f5ba437b44","side":"right"},{"sibling":"6feb976232b2738df953630f24a2a51dce9eb7a0b514a3156b2e246e269033b8","side":"right"},{"sibling":"a3316ff2c8547705b568e3731d4ea73787ba66e5e77917e0b12e61238f92273d","side":"right"},{"sibling":"37983d12a61c7424bffbbffe09e87111028d90acefcaa80ba2fa9d757bae7257","side":"right"},{"sibling":"377536273325dc128b57510786f76e46ea56a372fbd6530419421c956176a81f","side":"right"},{"sibling":"bc35d95b20384bcefab067b00429ecc07965f080c071ee591082cba7c0f219a2","side":"left"},{"sibling":"16c794666e8ffc4b9e71a0bacc0e4f9bbc68a8544c340b385c6d1abff1d748e5","side":"right"},{"sibling":"c14a4eb4b07d22a6a83f548cf6c304559dc63f0e53071e550ecc566dbba50b14","side":"left"},{"sibling":"3165125427a29042fc9d02858a59a68858dbdcb2e19d1afa5f6dd6a95cfbce6a","side":"right"},{"sibling":"04b9a68b8ec6fa37251564383c685c23ce69e5e031df4eae69f79a3a334b68bf","side":"right"},{"sibling":"816f233274bb10f5a122aac086a0c8c697b78fec67a4af55190bb596b7506fab","side":"left"},{"sibling":"d415e6939aee710631f5062799379b547d2c3e3d9a68f263bbb5a693285ab2ca","side":"left"},{"sibling":"374c02d15fb12bd356c179c94766043a982052c6132af8bfc15361b431ffa9f7","side":"right"},{"sibling":"35ca36cee447f0ef7064a25d55f59357c66901e31427729c4c1d8b14aa8adb6c","side":"left"},{"sibling":"990705096edf483cc877217308f731dc42d6f6d99f82880167bbdbbfef32560a","side":"right"},{"sibling":"dd265753d95fa2e2fb4f5768e37fab6f691ccff09ad60d0910ff7dc23bac9226","side":"right"},{"sibling":"d841ad93efda0869e5eb97678f348f03f5caab4353e05ff4bf18f47fb945b822","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":154065,"merkle_root":"4993cfdc172e7880b60667f16789dc2e831ff000f81bb1ecba248e73f1510eca","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260527T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-27T05:37:36Z","sig_algorithm":"ed25519","signature":"76ecf118011540405e96506e6219752df04a2850632f2903dc6f10e08b98bc5a42c8d9e1cb5b7c5bf714479806a403df5f34399afa40c23fbb71493a1f77bd0c","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_543b405f2e7b5d6d0612bd3d91682ba31a4f1db08961311fca6c954bd9bf1c3e"}}