{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Q6HMV5SHG5BRC2ZRBGVF4HPLEI","short_pith_number":"pith:Q6HMV5SH","canonical_record":{"source":{"id":"1406.3988","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-16T12:06:49Z","cross_cats_sorted":[],"title_canon_sha256":"32edc939d079b3aa20032a99fe0aa640543e562a07d2c7599e2eac9471ac504d","abstract_canon_sha256":"519e948457dbce4af27931ac6aaee23f14dd91b76ba8bb1c5fe4c34b7265aeab"},"schema_version":"1.0"},"canonical_sha256":"878ecaf6473743116b3109aa5e1deb2211411ef147d50d26dfd4806500805e27","source":{"kind":"arxiv","id":"1406.3988","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3988","created_at":"2026-05-18T02:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3988v3","created_at":"2026-05-18T02:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3988","created_at":"2026-05-18T02:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"Q6HMV5SHG5BR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q6HMV5SHG5BRC2ZR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q6HMV5SH","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Q6HMV5SHG5BRC2ZRBGVF4HPLEI","target":"record","payload":{"canonical_record":{"source":{"id":"1406.3988","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-16T12:06:49Z","cross_cats_sorted":[],"title_canon_sha256":"32edc939d079b3aa20032a99fe0aa640543e562a07d2c7599e2eac9471ac504d","abstract_canon_sha256":"519e948457dbce4af27931ac6aaee23f14dd91b76ba8bb1c5fe4c34b7265aeab"},"schema_version":"1.0"},"canonical_sha256":"878ecaf6473743116b3109aa5e1deb2211411ef147d50d26dfd4806500805e27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:11.414582Z","signature_b64":"jBNhHj9zLsqRfY4AawZ4KtBgAYY5uPAvrXOnNI28XAEByXKVToDHndM3oPsCT4D6yLYRvCE4g9MOBMf4GJ4OAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"878ecaf6473743116b3109aa5e1deb2211411ef147d50d26dfd4806500805e27","last_reissued_at":"2026-05-18T02:49:11.414179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:11.414179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.3988","source_version":3,"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-18T02:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPjywfK/wgbz6Gz14zkIHUsZtARzeXS3XPbXcKdVRianAC0qkCAq8BkytLeT2qH/jTLn/0yB4mA0RW+3H9EHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:00:15.778282Z"},"content_sha256":"3a238ca13bda4afee98921fc915d342d7599bf49f8d2191baa044ab5e3e7ad1d","schema_version":"1.0","event_id":"sha256:3a238ca13bda4afee98921fc915d342d7599bf49f8d2191baa044ab5e3e7ad1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Q6HMV5SHG5BRC2ZRBGVF4HPLEI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CTL+FO Verification as Constraint Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrey Rybalchenko, Marc Brockschmidt, Tewodros A. Beyene","submitted_at":"2014-06-16T12:06:49Z","abstract_excerpt":"Expressing program correctness often requires relating program data throughout (different branches of) an execution. Such properties can be represented using CTL+FO, a logic that allows mixing temporal and first-order quantification. Verifying that a program satisfies a CTL+FO property is a challenging problem that requires both temporal and data reasoning. Temporal quantifiers require discovery of invariants and ranking functions, while first-order quantifiers demand instantiation techniques. In this paper, we present a constraint-based method for proving CTL+FO properties automatically. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3988","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWdsJNaNutwo8Y7nzzlwawPw/ogYOlomFIa3CUw2m+ppB3bGegzk8sO1YbAUeLBLOLvJ0epBsQTfkn0fuZxiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:00:15.778637Z"},"content_sha256":"fb3ff9e4d7e2550f7429acb21dcb49b908cf1d51fc637eeb5d2afb14cadc620f","schema_version":"1.0","event_id":"sha256:fb3ff9e4d7e2550f7429acb21dcb49b908cf1d51fc637eeb5d2afb14cadc620f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q6HMV5SHG5BRC2ZRBGVF4HPLEI/bundle.json","state_url":"https://pith.science/pith/Q6HMV5SHG5BRC2ZRBGVF4HPLEI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q6HMV5SHG5BRC2ZRBGVF4HPLEI/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-06-28T10:00:15Z","links":{"resolver":"https://pith.science/pith/Q6HMV5SHG5BRC2ZRBGVF4HPLEI","bundle":"https://pith.science/pith/Q6HMV5SHG5BRC2ZRBGVF4HPLEI/bundle.json","state":"https://pith.science/pith/Q6HMV5SHG5BRC2ZRBGVF4HPLEI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q6HMV5SHG5BRC2ZRBGVF4HPLEI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Q6HMV5SHG5BRC2ZRBGVF4HPLEI","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":"519e948457dbce4af27931ac6aaee23f14dd91b76ba8bb1c5fe4c34b7265aeab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-16T12:06:49Z","title_canon_sha256":"32edc939d079b3aa20032a99fe0aa640543e562a07d2c7599e2eac9471ac504d"},"schema_version":"1.0","source":{"id":"1406.3988","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3988","created_at":"2026-05-18T02:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3988v3","created_at":"2026-05-18T02:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3988","created_at":"2026-05-18T02:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"Q6HMV5SHG5BR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q6HMV5SHG5BRC2ZR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q6HMV5SH","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:fb3ff9e4d7e2550f7429acb21dcb49b908cf1d51fc637eeb5d2afb14cadc620f","target":"graph","created_at":"2026-05-18T02:49:11Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Expressing program correctness often requires relating program data throughout (different branches of) an execution. Such properties can be represented using CTL+FO, a logic that allows mixing temporal and first-order quantification. Verifying that a program satisfies a CTL+FO property is a challenging problem that requires both temporal and data reasoning. Temporal quantifiers require discovery of invariants and ranking functions, while first-order quantifiers demand instantiation techniques. In this paper, we present a constraint-based method for proving CTL+FO properties automatically. Our ","authors_text":"Andrey Rybalchenko, Marc Brockschmidt, Tewodros A. Beyene","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-16T12:06:49Z","title":"CTL+FO Verification as Constraint Solving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3988","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3a238ca13bda4afee98921fc915d342d7599bf49f8d2191baa044ab5e3e7ad1d","target":"record","created_at":"2026-05-18T02:49:11Z","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":"519e948457dbce4af27931ac6aaee23f14dd91b76ba8bb1c5fe4c34b7265aeab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-16T12:06:49Z","title_canon_sha256":"32edc939d079b3aa20032a99fe0aa640543e562a07d2c7599e2eac9471ac504d"},"schema_version":"1.0","source":{"id":"1406.3988","kind":"arxiv","version":3}},"canonical_sha256":"878ecaf6473743116b3109aa5e1deb2211411ef147d50d26dfd4806500805e27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"878ecaf6473743116b3109aa5e1deb2211411ef147d50d26dfd4806500805e27","first_computed_at":"2026-05-18T02:49:11.414179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:11.414179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jBNhHj9zLsqRfY4AawZ4KtBgAYY5uPAvrXOnNI28XAEByXKVToDHndM3oPsCT4D6yLYRvCE4g9MOBMf4GJ4OAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:11.414582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3988","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a238ca13bda4afee98921fc915d342d7599bf49f8d2191baa044ab5e3e7ad1d","sha256:fb3ff9e4d7e2550f7429acb21dcb49b908cf1d51fc637eeb5d2afb14cadc620f"],"state_sha256":"638793449b730456a99e30bdc727c15d8d56fec0356a39fa03fb77b89ad137b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQbLPP542grbMVN4UzQtKSIrMqMnQEDgghe1t4G1xiGKoe6iZ7qhHXdOtd530FUBA0hdbL74sl+BuQz9NxvkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T10:00:15.780481Z","bundle_sha256":"2209eeced573b96cf3418ed11593d4190e66a449739acd2e4c0aa4df6e911f67"}}