{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:K3TO4CLINPEIDKIZ7K6REF2RXM","short_pith_number":"pith:K3TO4CLI","canonical_record":{"source":{"id":"1607.04456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-15T11:04:37Z","cross_cats_sorted":[],"title_canon_sha256":"b8507904c8684dffba8def71a1b7cb1594ebae49c41a117af4949225b78e4a40","abstract_canon_sha256":"54a701054a739a0de4435c2554aeaf80f461e3c358d5436bb94d630bf69edb32"},"schema_version":"1.0"},"canonical_sha256":"56e6ee09686bc881a919fabd121751bb2ab49730a60bd98406ef99fb5f62d1c6","source":{"kind":"arxiv","id":"1607.04456","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04456","created_at":"2026-05-18T01:11:01Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04456v1","created_at":"2026-05-18T01:11:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04456","created_at":"2026-05-18T01:11:01Z"},{"alias_kind":"pith_short_12","alias_value":"K3TO4CLINPEI","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K3TO4CLINPEIDKIZ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K3TO4CLI","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:K3TO4CLINPEIDKIZ7K6REF2RXM","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-15T11:04:37Z","cross_cats_sorted":[],"title_canon_sha256":"b8507904c8684dffba8def71a1b7cb1594ebae49c41a117af4949225b78e4a40","abstract_canon_sha256":"54a701054a739a0de4435c2554aeaf80f461e3c358d5436bb94d630bf69edb32"},"schema_version":"1.0"},"canonical_sha256":"56e6ee09686bc881a919fabd121751bb2ab49730a60bd98406ef99fb5f62d1c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:01.184976Z","signature_b64":"CbWJ5W/UkTrNcCxwFvcFnAod9WzJ2PTMbYZmUPBFMDHBruRYw3o4Ohvlualgq1upoqJc2bis/XbT5qKUvxHqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56e6ee09686bc881a919fabd121751bb2ab49730a60bd98406ef99fb5f62d1c6","last_reissued_at":"2026-05-18T01:11:01.184481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:01.184481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04456","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-18T01:11:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZWcspAAYdXt0sKkNGn27V9er5k6SuL7B8cKRENi7/4Wdi2s7HQPsDmX05jtPU81JXFVOyFqIt+ByVCYwBZGkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:51:22.079413Z"},"content_sha256":"a17357034625d327c50dd5dc97350083888450c813136dcc64b2e4519936bd62","schema_version":"1.0","event_id":"sha256:a17357034625d327c50dd5dc97350083888450c813136dcc64b2e4519936bd62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:K3TO4CLINPEIDKIZ7K6REF2RXM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient CTL Verification via Horn Constraints Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrey Rybalchenko (Microsoft Research, Cambridge, Corneliu Popeea (CQSE GmbH, Germany), Munich, Tewodros A. Beyene (fortiss GmbH, UK)","submitted_at":"2016-07-15T11:04:37Z","abstract_excerpt":"The use of temporal logics has long been recognised as a fundamental approach to the formal specification and verification of reactive systems. In this paper, we take on the problem of automatically verifying a temporal property, given by a CTL formula, for a given (possibly infinite-state) program. We propose a method based on encoding the problem as a set of Horn constraints. The method takes a program, modeled as a transition system, and a property given by a CTL formula as input. It first generates a set of forall-exists quantified Horn constraints and well-foundedness constraints by explo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04456","kind":"arxiv","version":1},"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-18T01:11:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vZ901ZwhuOZ6GQvGjiz527Yv5E/9rikjK9QWxu6rLefYXmmqFLqP0yC1U43TNfpfjy3nxGqvsP6+9bnOQ9UJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:51:22.079760Z"},"content_sha256":"259083f9a219a07f7d54ffa33ea1f4e620715fda407e2132d80c988d04fcb72e","schema_version":"1.0","event_id":"sha256:259083f9a219a07f7d54ffa33ea1f4e620715fda407e2132d80c988d04fcb72e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K3TO4CLINPEIDKIZ7K6REF2RXM/bundle.json","state_url":"https://pith.science/pith/K3TO4CLINPEIDKIZ7K6REF2RXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K3TO4CLINPEIDKIZ7K6REF2RXM/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-28T22:51:22Z","links":{"resolver":"https://pith.science/pith/K3TO4CLINPEIDKIZ7K6REF2RXM","bundle":"https://pith.science/pith/K3TO4CLINPEIDKIZ7K6REF2RXM/bundle.json","state":"https://pith.science/pith/K3TO4CLINPEIDKIZ7K6REF2RXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K3TO4CLINPEIDKIZ7K6REF2RXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K3TO4CLINPEIDKIZ7K6REF2RXM","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":"54a701054a739a0de4435c2554aeaf80f461e3c358d5436bb94d630bf69edb32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-15T11:04:37Z","title_canon_sha256":"b8507904c8684dffba8def71a1b7cb1594ebae49c41a117af4949225b78e4a40"},"schema_version":"1.0","source":{"id":"1607.04456","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04456","created_at":"2026-05-18T01:11:01Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04456v1","created_at":"2026-05-18T01:11:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04456","created_at":"2026-05-18T01:11:01Z"},{"alias_kind":"pith_short_12","alias_value":"K3TO4CLINPEI","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K3TO4CLINPEIDKIZ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K3TO4CLI","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:259083f9a219a07f7d54ffa33ea1f4e620715fda407e2132d80c988d04fcb72e","target":"graph","created_at":"2026-05-18T01:11:01Z","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":"The use of temporal logics has long been recognised as a fundamental approach to the formal specification and verification of reactive systems. In this paper, we take on the problem of automatically verifying a temporal property, given by a CTL formula, for a given (possibly infinite-state) program. We propose a method based on encoding the problem as a set of Horn constraints. The method takes a program, modeled as a transition system, and a property given by a CTL formula as input. It first generates a set of forall-exists quantified Horn constraints and well-foundedness constraints by explo","authors_text":"Andrey Rybalchenko (Microsoft Research, Cambridge, Corneliu Popeea (CQSE GmbH, Germany), Munich, Tewodros A. Beyene (fortiss GmbH, UK)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-15T11:04:37Z","title":"Efficient CTL Verification via Horn Constraints Solving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04456","kind":"arxiv","version":1},"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:a17357034625d327c50dd5dc97350083888450c813136dcc64b2e4519936bd62","target":"record","created_at":"2026-05-18T01:11:01Z","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":"54a701054a739a0de4435c2554aeaf80f461e3c358d5436bb94d630bf69edb32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-15T11:04:37Z","title_canon_sha256":"b8507904c8684dffba8def71a1b7cb1594ebae49c41a117af4949225b78e4a40"},"schema_version":"1.0","source":{"id":"1607.04456","kind":"arxiv","version":1}},"canonical_sha256":"56e6ee09686bc881a919fabd121751bb2ab49730a60bd98406ef99fb5f62d1c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56e6ee09686bc881a919fabd121751bb2ab49730a60bd98406ef99fb5f62d1c6","first_computed_at":"2026-05-18T01:11:01.184481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:01.184481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CbWJ5W/UkTrNcCxwFvcFnAod9WzJ2PTMbYZmUPBFMDHBruRYw3o4Ohvlualgq1upoqJc2bis/XbT5qKUvxHqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:01.184976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04456","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a17357034625d327c50dd5dc97350083888450c813136dcc64b2e4519936bd62","sha256:259083f9a219a07f7d54ffa33ea1f4e620715fda407e2132d80c988d04fcb72e"],"state_sha256":"4a5abff019317178051e42f294e2eb2f033fa599bcd3edc3fca122094ee60267"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VtvSRiwqW8pYdEVwuzSqe1p6FiQzjGpU+YTK+cSP1fj5Oj0l0TCbLaCt/l6aTLSkRXzfIYMxSQ07JEPK7MWwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:51:22.081760Z","bundle_sha256":"2bbb09b6b6eef0c224754c8928eef1b49b668e4a0868d94514f62bba2dbe9308"}}