{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SVPCN5TJU7TOJD4VS7MUJNZDXU","short_pith_number":"pith:SVPCN5TJ","canonical_record":{"source":{"id":"1401.5677","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-22T14:10:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ab0af23df351631d683aa926ed796aff8142e0744d00b28051cf761755c5722d","abstract_canon_sha256":"562177bff7188b7577f5735ca28a590c1d92f734bca430851cbb3927d251a83b"},"schema_version":"1.0"},"canonical_sha256":"955e26f669a7e6e48f9597d944b723bd31e87b28ddb3d0427589e406e2e7404f","source":{"kind":"arxiv","id":"1401.5677","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5677","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5677v2","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5677","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"SVPCN5TJU7TO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SVPCN5TJU7TOJD4V","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SVPCN5TJ","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SVPCN5TJU7TOJD4VS7MUJNZDXU","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5677","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-22T14:10:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ab0af23df351631d683aa926ed796aff8142e0744d00b28051cf761755c5722d","abstract_canon_sha256":"562177bff7188b7577f5735ca28a590c1d92f734bca430851cbb3927d251a83b"},"schema_version":"1.0"},"canonical_sha256":"955e26f669a7e6e48f9597d944b723bd31e87b28ddb3d0427589e406e2e7404f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:57.869891Z","signature_b64":"TZpGfgH9nMHVqKCLag0Krmn63sPsWlo1cSHOR4scmOF1feHj7m7Si6x9sUwFz1cR4neu3yjo4jaWBfBgR4rECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"955e26f669a7e6e48f9597d944b723bd31e87b28ddb3d0427589e406e2e7404f","last_reissued_at":"2026-05-18T02:52:57.869366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:57.869366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5677","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:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Amkya28KTZ4ovsy7Jl/YBPhZV7DqOq8zudU4NU1bC7Vc6pFbYzC21fnwdCca20eFLrszi1U/UQvs18DTIBVDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:42:41.179121Z"},"content_sha256":"f6e7e85be9dafbcf33fab7719205073c9102a34d613bdea2b8480f4e3a009b16","schema_version":"1.0","event_id":"sha256:f6e7e85be9dafbcf33fab7719205073c9102a34d613bdea2b8480f4e3a009b16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SVPCN5TJU7TOJD4VS7MUJNZDXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast LTL Satisfiability Checking by SAT Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LO","authors_text":"Geguang Pu, Jianwen Li, Jifeng He, Lijun Zhang, Moshe Y. Vardi","submitted_at":"2014-01-22T14:10:04Z","abstract_excerpt":"Satisfiability checking for Linear Temporal Logic (LTL) is a fundamental step in checking for possible errors in LTL assertions. Extant LTL satisfiability checkers use a variety of different search procedures. With the sole exception of LTL satisfiability checking based on bounded model checking, which does not provide a complete decision procedure, LTL satisfiability checkers have not taken advantage of the remarkable progress over the past 20 years in Boolean satisfiability solving. In this paper, we propose a new LTL satisfiability-checking framework that is accelerated using a Boolean SAT "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5677","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:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sayN//KhbGWJbkq647zVEtwgvLDE+565n2d0cpYMR4EnKwKu7gho8hyP6DZGhPdV29/mgZrO/egSNWVX7xWpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:42:41.179483Z"},"content_sha256":"f6871ba0a0abc5ee02cf7ec313b3fc549ef183661342aa240cbc4f3112dd055a","schema_version":"1.0","event_id":"sha256:f6871ba0a0abc5ee02cf7ec313b3fc549ef183661342aa240cbc4f3112dd055a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVPCN5TJU7TOJD4VS7MUJNZDXU/bundle.json","state_url":"https://pith.science/pith/SVPCN5TJU7TOJD4VS7MUJNZDXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVPCN5TJU7TOJD4VS7MUJNZDXU/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-26T20:42:41Z","links":{"resolver":"https://pith.science/pith/SVPCN5TJU7TOJD4VS7MUJNZDXU","bundle":"https://pith.science/pith/SVPCN5TJU7TOJD4VS7MUJNZDXU/bundle.json","state":"https://pith.science/pith/SVPCN5TJU7TOJD4VS7MUJNZDXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVPCN5TJU7TOJD4VS7MUJNZDXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SVPCN5TJU7TOJD4VS7MUJNZDXU","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":"562177bff7188b7577f5735ca28a590c1d92f734bca430851cbb3927d251a83b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-22T14:10:04Z","title_canon_sha256":"ab0af23df351631d683aa926ed796aff8142e0744d00b28051cf761755c5722d"},"schema_version":"1.0","source":{"id":"1401.5677","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5677","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5677v2","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5677","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"SVPCN5TJU7TO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SVPCN5TJU7TOJD4V","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SVPCN5TJ","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:f6871ba0a0abc5ee02cf7ec313b3fc549ef183661342aa240cbc4f3112dd055a","target":"graph","created_at":"2026-05-18T02:52:57Z","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":"Satisfiability checking for Linear Temporal Logic (LTL) is a fundamental step in checking for possible errors in LTL assertions. Extant LTL satisfiability checkers use a variety of different search procedures. With the sole exception of LTL satisfiability checking based on bounded model checking, which does not provide a complete decision procedure, LTL satisfiability checkers have not taken advantage of the remarkable progress over the past 20 years in Boolean satisfiability solving. In this paper, we propose a new LTL satisfiability-checking framework that is accelerated using a Boolean SAT ","authors_text":"Geguang Pu, Jianwen Li, Jifeng He, Lijun Zhang, Moshe Y. Vardi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-22T14:10:04Z","title":"Fast LTL Satisfiability Checking by SAT Solvers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5677","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:f6e7e85be9dafbcf33fab7719205073c9102a34d613bdea2b8480f4e3a009b16","target":"record","created_at":"2026-05-18T02:52:57Z","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":"562177bff7188b7577f5735ca28a590c1d92f734bca430851cbb3927d251a83b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-22T14:10:04Z","title_canon_sha256":"ab0af23df351631d683aa926ed796aff8142e0744d00b28051cf761755c5722d"},"schema_version":"1.0","source":{"id":"1401.5677","kind":"arxiv","version":2}},"canonical_sha256":"955e26f669a7e6e48f9597d944b723bd31e87b28ddb3d0427589e406e2e7404f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"955e26f669a7e6e48f9597d944b723bd31e87b28ddb3d0427589e406e2e7404f","first_computed_at":"2026-05-18T02:52:57.869366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:57.869366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TZpGfgH9nMHVqKCLag0Krmn63sPsWlo1cSHOR4scmOF1feHj7m7Si6x9sUwFz1cR4neu3yjo4jaWBfBgR4rECA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:57.869891Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5677","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6e7e85be9dafbcf33fab7719205073c9102a34d613bdea2b8480f4e3a009b16","sha256:f6871ba0a0abc5ee02cf7ec313b3fc549ef183661342aa240cbc4f3112dd055a"],"state_sha256":"276a8ccd3ee57d33bf50aaa249e3d67ed7e3e64947aabf3432e2ddde007391c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OuNxwZnAH0K1D2fwfBWjosljQsk+FbJBYRjti/U1sfNQZTwDvKehBYbAIHbsCpoChzdO/+39zBJRDrP7Tvz1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:42:41.181452Z","bundle_sha256":"0f6e01fa9075a02db7e87058316298fda692002f785c2b11454103b1bf138cef"}}