{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4BMJW7R3FUFSTUQ4Y4W5OQKST5","short_pith_number":"pith:4BMJW7R3","canonical_record":{"source":{"id":"1205.0946","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-04T12:57:00Z","cross_cats_sorted":[],"title_canon_sha256":"74e87bd8578b3ebb87eda5aa8e283046d1c11ff778d1690ae479146febfc1a38","abstract_canon_sha256":"9ddad80745e2cc7dfd187595457c3a9d2af9b0d2ba5d1ac67ee42f7d71acbe29"},"schema_version":"1.0"},"canonical_sha256":"e0589b7e3b2d0b29d21cc72dd741529f655542877c283db64edf5b48925a380b","source":{"kind":"arxiv","id":"1205.0946","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0946","created_at":"2026-05-18T02:59:30Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0946v2","created_at":"2026-05-18T02:59:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0946","created_at":"2026-05-18T02:59:30Z"},{"alias_kind":"pith_short_12","alias_value":"4BMJW7R3FUFS","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4BMJW7R3FUFSTUQ4","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4BMJW7R3","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4BMJW7R3FUFSTUQ4Y4W5OQKST5","target":"record","payload":{"canonical_record":{"source":{"id":"1205.0946","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-04T12:57:00Z","cross_cats_sorted":[],"title_canon_sha256":"74e87bd8578b3ebb87eda5aa8e283046d1c11ff778d1690ae479146febfc1a38","abstract_canon_sha256":"9ddad80745e2cc7dfd187595457c3a9d2af9b0d2ba5d1ac67ee42f7d71acbe29"},"schema_version":"1.0"},"canonical_sha256":"e0589b7e3b2d0b29d21cc72dd741529f655542877c283db64edf5b48925a380b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:30.767215Z","signature_b64":"3hntCoZ2WA1SAlvxsBaVEf+yRlT9PcYV98Jrh/Xg19Uqu4AwdElenpSKozcx53OUnxC7ZQR64XPEa9MdnhaaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0589b7e3b2d0b29d21cc72dd741529f655542877c283db64edf5b48925a380b","last_reissued_at":"2026-05-18T02:59:30.766338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:30.766338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.0946","source_version":2,"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:59:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6GmJlwEE7lAfG1dkgdgRCak/7208UE9Z7sayANk/vdf4VOUywrJnIYZza4M+wHnC5vEF5f6J4eN5NJIA2P/rBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:52:43.257638Z"},"content_sha256":"1f22efc098c58e45c3187fef886e59acb12a51efdc27cd775fc64695209c3ff5","schema_version":"1.0","event_id":"sha256:1f22efc098c58e45c3187fef886e59acb12a51efdc27cd775fc64695209c3ff5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4BMJW7R3FUFSTUQ4Y4W5OQKST5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constraint LTL Satisfiability Checking without Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Achille Frigeri, Angelo Morzenti, Marcello M. Bersani, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro","submitted_at":"2012-05-04T12:57:00Z","abstract_excerpt":"This paper introduces a novel technique to decide the satisfiability of formulae written in the language of Linear Temporal Logic with Both future and past operators and atomic formulae belonging to constraint system D (CLTLB(D) for short). The technique is based on the concept of bounded satisfiability, and hinges on an encoding of CLTLB(D) formulae into QF-EUD, the theory of quantifier-free equality and uninterpreted functions combined with D. Similarly to standard LTL, where bounded model-checking and SAT-solvers can be used as an alternative to automata-theoretic approaches to model-checki"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0946","kind":"arxiv","version":2},"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:59:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+L95jK3jcU+INfxdDfHnZgR4z4G8/9hr6pABiBsQfBNjPMU6arDEGDVy7LWV0rcEJHgDw7SJ4HExVVoq6O4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:52:43.257988Z"},"content_sha256":"145069fd98a7421f8e181cafad1139bd3d40070462dfc58ba735ce46d7ea5b11","schema_version":"1.0","event_id":"sha256:145069fd98a7421f8e181cafad1139bd3d40070462dfc58ba735ce46d7ea5b11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5/bundle.json","state_url":"https://pith.science/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5/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-04T12:52:43Z","links":{"resolver":"https://pith.science/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5","bundle":"https://pith.science/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5/bundle.json","state":"https://pith.science/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BMJW7R3FUFSTUQ4Y4W5OQKST5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4BMJW7R3FUFSTUQ4Y4W5OQKST5","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":"9ddad80745e2cc7dfd187595457c3a9d2af9b0d2ba5d1ac67ee42f7d71acbe29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-04T12:57:00Z","title_canon_sha256":"74e87bd8578b3ebb87eda5aa8e283046d1c11ff778d1690ae479146febfc1a38"},"schema_version":"1.0","source":{"id":"1205.0946","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0946","created_at":"2026-05-18T02:59:30Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0946v2","created_at":"2026-05-18T02:59:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0946","created_at":"2026-05-18T02:59:30Z"},{"alias_kind":"pith_short_12","alias_value":"4BMJW7R3FUFS","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4BMJW7R3FUFSTUQ4","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4BMJW7R3","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:145069fd98a7421f8e181cafad1139bd3d40070462dfc58ba735ce46d7ea5b11","target":"graph","created_at":"2026-05-18T02:59:30Z","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":"This paper introduces a novel technique to decide the satisfiability of formulae written in the language of Linear Temporal Logic with Both future and past operators and atomic formulae belonging to constraint system D (CLTLB(D) for short). The technique is based on the concept of bounded satisfiability, and hinges on an encoding of CLTLB(D) formulae into QF-EUD, the theory of quantifier-free equality and uninterpreted functions combined with D. Similarly to standard LTL, where bounded model-checking and SAT-solvers can be used as an alternative to automata-theoretic approaches to model-checki","authors_text":"Achille Frigeri, Angelo Morzenti, Marcello M. Bersani, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-04T12:57:00Z","title":"Constraint LTL Satisfiability Checking without Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0946","kind":"arxiv","version":2},"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:1f22efc098c58e45c3187fef886e59acb12a51efdc27cd775fc64695209c3ff5","target":"record","created_at":"2026-05-18T02:59:30Z","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":"9ddad80745e2cc7dfd187595457c3a9d2af9b0d2ba5d1ac67ee42f7d71acbe29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-05-04T12:57:00Z","title_canon_sha256":"74e87bd8578b3ebb87eda5aa8e283046d1c11ff778d1690ae479146febfc1a38"},"schema_version":"1.0","source":{"id":"1205.0946","kind":"arxiv","version":2}},"canonical_sha256":"e0589b7e3b2d0b29d21cc72dd741529f655542877c283db64edf5b48925a380b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0589b7e3b2d0b29d21cc72dd741529f655542877c283db64edf5b48925a380b","first_computed_at":"2026-05-18T02:59:30.766338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:30.766338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3hntCoZ2WA1SAlvxsBaVEf+yRlT9PcYV98Jrh/Xg19Uqu4AwdElenpSKozcx53OUnxC7ZQR64XPEa9MdnhaaDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:30.767215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0946","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f22efc098c58e45c3187fef886e59acb12a51efdc27cd775fc64695209c3ff5","sha256:145069fd98a7421f8e181cafad1139bd3d40070462dfc58ba735ce46d7ea5b11"],"state_sha256":"76e1160f24df3745a77e2d0166086fb076fde3e5a245172b5a347a2e876e0105"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjrCNTSz8/KqhGIpZ1lJPys78r+3xhKMXlk77GTNJc5FLAM90y8Vbbl7NlN/auCbXSSidf2EjIVkf5LLNe0SCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:52:43.260036Z","bundle_sha256":"06d9e0011b907388bd393e610b51f8510afd2e92a4bc83ffde25f10f14470d12"}}