{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:47BAZ2UJCNHVBC2UC5FDFGVDLK","short_pith_number":"pith:47BAZ2UJ","canonical_record":{"source":{"id":"2605.13944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T17:51:13Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"4f040d277ff0466df169b64e0999ca093eae132788f3fb01990a048a68c7d613","abstract_canon_sha256":"5f5f9129f7e6f98837f40572a283aecbf95bab1ba1c1654c33ff1488f90b3b6a"},"schema_version":"1.0"},"canonical_sha256":"e7c20cea89134f508b54174a329aa35a9c05ff05fb7632a430aceb11a2773e7e","source":{"kind":"arxiv","id":"2605.13944","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13944","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13944v1","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13944","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"47BAZ2UJCNHV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"47BAZ2UJCNHVBC2U","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"47BAZ2UJ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:47BAZ2UJCNHVBC2UC5FDFGVDLK","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T17:51:13Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"4f040d277ff0466df169b64e0999ca093eae132788f3fb01990a048a68c7d613","abstract_canon_sha256":"5f5f9129f7e6f98837f40572a283aecbf95bab1ba1c1654c33ff1488f90b3b6a"},"schema_version":"1.0"},"canonical_sha256":"e7c20cea89134f508b54174a329aa35a9c05ff05fb7632a430aceb11a2773e7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:13.822113Z","signature_b64":"Be9Hw94K4jZlr1+27XmbNMyo+ApT97O90gwYztoTkTIzmOGMM7nPtVuaMJtoj8hIxd81WFvpREkxrauS6YlyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7c20cea89134f508b54174a329aa35a9c05ff05fb7632a430aceb11a2773e7e","last_reissued_at":"2026-05-17T23:39:13.821427Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:13.821427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13944","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kD/nKBM2T8khsAbmWsLDuiJXjtCtZJzAXeZQsl/d3TUOT5wk6BdX9c+jUzRg5HaIhjalHrm/YF4y2o9rfiFXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:08:29.190590Z"},"content_sha256":"4a8d6b06e77a762c24d9fea7629aed167233592a9ee341a06c6a40b624ed9069","schema_version":"1.0","event_id":"sha256:4a8d6b06e77a762c24d9fea7629aed167233592a9ee341a06c6a40b624ed9069"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:47BAZ2UJCNHVBC2UC5FDFGVDLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A foundational characterization of Hoare Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A partial-correctness assertion for an iterative program is provable in Hoare logic if and only if it is provable in second-order logic with first-order comprehension.","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Daniel Leivant","submitted_at":"2026-05-13T17:51:13Z","abstract_excerpt":"We show that a partial-correctness assertion about an iterative program is provable in Hoare Logic iffit is provable in standard second-order logic with comprehension restricted to first-order predicates. This equivalence was claimed twice in the past, both with faulty proofs, and seems to be the first foundational characterization of Hoare Logic."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"a partial-correctness assertion about an iterative program is provable in Hoare Logic iff it is provable in standard second-order logic with comprehension restricted to first-order predicates.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The equivalence depends on the precise syntactic definitions of Hoare logic for iterative programs and on the exact restriction of comprehension to first-order predicates; any deviation in these definitions would invalidate the claimed if-and-only-if.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Partial-correctness assertions for iterative programs are provable in Hoare logic if and only if they are provable in second-order logic with comprehension restricted to first-order predicates.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A partial-correctness assertion for an iterative program is provable in Hoare logic if and only if it is provable in second-order logic with first-order comprehension.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f8b8b95a3f86985cd91af61bb7ec6a69306f1c3314b49883aa9e77d87b080917"},"source":{"id":"2605.13944","kind":"arxiv","version":1},"verdict":{"id":"333e2f73-08d5-4c69-9fb5-09c2859dc221","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:40:04.722172Z","strongest_claim":"a partial-correctness assertion about an iterative program is provable in Hoare Logic iff it is provable in standard second-order logic with comprehension restricted to first-order predicates.","one_line_summary":"Partial-correctness assertions for iterative programs are provable in Hoare logic if and only if they are provable in second-order logic with comprehension restricted to first-order predicates.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The equivalence depends on the precise syntactic definitions of Hoare logic for iterative programs and on the exact restriction of comprehension to first-order predicates; any deviation in these definitions would invalidate the claimed if-and-only-if.","pith_extraction_headline":"A partial-correctness assertion for an iterative program is provable in Hoare logic if and only if it is provable in second-order logic with first-order comprehension."},"references":{"count":216,"sample":[{"doi":"","year":null,"title":"Stephen Simpson , title=","work_id":"32922cba-c5ba-4574-ba32-f086f91d1260","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Dynamic Logic","work_id":"d1b04a75-ee0a-4c7a-9f41-df293f3d4d53","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Arithmetices principia, novo methodo exposita","work_id":"8ddfcebb-6139-4a23-84e4-cd245e902779","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1931,"title":"van Heijenoort","work_id":"62044c68-d023-4fd4-a37e-c44d97e8fa21","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Ramified recurrence and computational complexity I : Word recurrence and poly-time","work_id":"28fdb9a5-5620-4806-ad21-9d2f07475645","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":216,"snapshot_sha256":"d31674114d4b670adbbbee16a244b35e2afe7b61fac5235f0f18cde26f41fbbc","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9fc7cfa8567581c8579cfc969c4d12bcee38cb2177ed73c6ffd95779e0313518"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"333e2f73-08d5-4c69-9fb5-09c2859dc221"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UKnjqVmdVrqq3oQ02Fs/t71JNMTMW8+MYAQXlHKyYFqcdKT9y8d9wGYnnRB1EPRgK7IweRNSEBFyKud5yy65BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:08:29.191548Z"},"content_sha256":"7ac6f6b5e98d7686dd2136890c21e80e9c2a158d172f19dea44878e215d208de","schema_version":"1.0","event_id":"sha256:7ac6f6b5e98d7686dd2136890c21e80e9c2a158d172f19dea44878e215d208de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/47BAZ2UJCNHVBC2UC5FDFGVDLK/bundle.json","state_url":"https://pith.science/pith/47BAZ2UJCNHVBC2UC5FDFGVDLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/47BAZ2UJCNHVBC2UC5FDFGVDLK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T22:08:29Z","links":{"resolver":"https://pith.science/pith/47BAZ2UJCNHVBC2UC5FDFGVDLK","bundle":"https://pith.science/pith/47BAZ2UJCNHVBC2UC5FDFGVDLK/bundle.json","state":"https://pith.science/pith/47BAZ2UJCNHVBC2UC5FDFGVDLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/47BAZ2UJCNHVBC2UC5FDFGVDLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:47BAZ2UJCNHVBC2UC5FDFGVDLK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5f5f9129f7e6f98837f40572a283aecbf95bab1ba1c1654c33ff1488f90b3b6a","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T17:51:13Z","title_canon_sha256":"4f040d277ff0466df169b64e0999ca093eae132788f3fb01990a048a68c7d613"},"schema_version":"1.0","source":{"id":"2605.13944","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13944","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13944v1","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13944","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"47BAZ2UJCNHV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"47BAZ2UJCNHVBC2U","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"47BAZ2UJ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:7ac6f6b5e98d7686dd2136890c21e80e9c2a158d172f19dea44878e215d208de","target":"graph","created_at":"2026-05-17T23:39:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"a partial-correctness assertion about an iterative program is provable in Hoare Logic iff it is provable in standard second-order logic with comprehension restricted to first-order predicates."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The equivalence depends on the precise syntactic definitions of Hoare logic for iterative programs and on the exact restriction of comprehension to first-order predicates; any deviation in these definitions would invalidate the claimed if-and-only-if."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Partial-correctness assertions for iterative programs are provable in Hoare logic if and only if they are provable in second-order logic with comprehension restricted to first-order predicates."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A partial-correctness assertion for an iterative program is provable in Hoare logic if and only if it is provable in second-order logic with first-order comprehension."}],"snapshot_sha256":"f8b8b95a3f86985cd91af61bb7ec6a69306f1c3314b49883aa9e77d87b080917"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9fc7cfa8567581c8579cfc969c4d12bcee38cb2177ed73c6ffd95779e0313518"},"paper":{"abstract_excerpt":"We show that a partial-correctness assertion about an iterative program is provable in Hoare Logic iffit is provable in standard second-order logic with comprehension restricted to first-order predicates. This equivalence was claimed twice in the past, both with faulty proofs, and seems to be the first foundational characterization of Hoare Logic.","authors_text":"Daniel Leivant","cross_cats":["math.LO"],"headline":"A partial-correctness assertion for an iterative program is provable in Hoare logic if and only if it is provable in second-order logic with first-order comprehension.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T17:51:13Z","title":"A foundational characterization of Hoare Logic"},"references":{"count":216,"internal_anchors":0,"resolved_work":216,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Stephen Simpson , title=","work_id":"32922cba-c5ba-4574-ba32-f086f91d1260","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Dynamic Logic","work_id":"d1b04a75-ee0a-4c7a-9f41-df293f3d4d53","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Arithmetices principia, novo methodo exposita","work_id":"8ddfcebb-6139-4a23-84e4-cd245e902779","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"van Heijenoort","work_id":"62044c68-d023-4fd4-a37e-c44d97e8fa21","year":1931},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Ramified recurrence and computational complexity I : Word recurrence and poly-time","work_id":"28fdb9a5-5620-4806-ad21-9d2f07475645","year":null}],"snapshot_sha256":"d31674114d4b670adbbbee16a244b35e2afe7b61fac5235f0f18cde26f41fbbc"},"source":{"id":"2605.13944","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:40:04.722172Z","id":"333e2f73-08d5-4c69-9fb5-09c2859dc221","model_set":{"reader":"grok-4.3"},"one_line_summary":"Partial-correctness assertions for iterative programs are provable in Hoare logic if and only if they are provable in second-order logic with comprehension restricted to first-order predicates.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A partial-correctness assertion for an iterative program is provable in Hoare logic if and only if it is provable in second-order logic with first-order comprehension.","strongest_claim":"a partial-correctness assertion about an iterative program is provable in Hoare Logic iff it is provable in standard second-order logic with comprehension restricted to first-order predicates.","weakest_assumption":"The equivalence depends on the precise syntactic definitions of Hoare logic for iterative programs and on the exact restriction of comprehension to first-order predicates; any deviation in these definitions would invalidate the claimed if-and-only-if."}},"verdict_id":"333e2f73-08d5-4c69-9fb5-09c2859dc221"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4a8d6b06e77a762c24d9fea7629aed167233592a9ee341a06c6a40b624ed9069","target":"record","created_at":"2026-05-17T23:39:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5f5f9129f7e6f98837f40572a283aecbf95bab1ba1c1654c33ff1488f90b3b6a","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T17:51:13Z","title_canon_sha256":"4f040d277ff0466df169b64e0999ca093eae132788f3fb01990a048a68c7d613"},"schema_version":"1.0","source":{"id":"2605.13944","kind":"arxiv","version":1}},"canonical_sha256":"e7c20cea89134f508b54174a329aa35a9c05ff05fb7632a430aceb11a2773e7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7c20cea89134f508b54174a329aa35a9c05ff05fb7632a430aceb11a2773e7e","first_computed_at":"2026-05-17T23:39:13.821427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:13.821427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Be9Hw94K4jZlr1+27XmbNMyo+ApT97O90gwYztoTkTIzmOGMM7nPtVuaMJtoj8hIxd81WFvpREkxrauS6YlyDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:13.822113Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13944","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a8d6b06e77a762c24d9fea7629aed167233592a9ee341a06c6a40b624ed9069","sha256:7ac6f6b5e98d7686dd2136890c21e80e9c2a158d172f19dea44878e215d208de"],"state_sha256":"759468fd0daca0d64acc609f2b21bb4fbd28b6b58e1215b5b2371d7d7db9547e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/pzQu8DRXfJEhUYyszQLOweesGxA3XhwrlVw43X7+siUP8Ao24/ypgn6wa1i0NIFYPhkBH6N4Txsl+7qn5YpAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:08:29.195548Z","bundle_sha256":"caae6ae580aef2a7bacd4da3e1d91e1c858007c75ab6e5347ec8a3719e3cdc9d"}}