{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WBDQBSTVKLVP7MSMGP74MPPG7B","short_pith_number":"pith:WBDQBSTV","canonical_record":{"source":{"id":"1811.03176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-07T22:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"a62cab9c405e3fc9a144eb64a5b7bde83ff32c4944541ba7a1318f08dcf73c1b","abstract_canon_sha256":"e77c7dc3a0a35e0dc3dae5bb5b36b46290e16a3774ef17524d78436b1f27819e"},"schema_version":"1.0"},"canonical_sha256":"b04700ca7552eaffb24c33ffc63de6f858bc9e65e1eafc24ee9a405821561abb","source":{"kind":"arxiv","id":"1811.03176","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03176","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03176v1","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03176","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"pith_short_12","alias_value":"WBDQBSTVKLVP","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WBDQBSTVKLVP7MSM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WBDQBSTV","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WBDQBSTVKLVP7MSMGP74MPPG7B","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-07T22:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"a62cab9c405e3fc9a144eb64a5b7bde83ff32c4944541ba7a1318f08dcf73c1b","abstract_canon_sha256":"e77c7dc3a0a35e0dc3dae5bb5b36b46290e16a3774ef17524d78436b1f27819e"},"schema_version":"1.0"},"canonical_sha256":"b04700ca7552eaffb24c33ffc63de6f858bc9e65e1eafc24ee9a405821561abb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:18.920853Z","signature_b64":"zypCVPl4p/VPDBINmPpxigHnQUWqJW9Qc3cQ6BuGmSIZoG1FDI479aSDlxrSgpb3gttHmBx8+DJ/gXaXHpAKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b04700ca7552eaffb24c33ffc63de6f858bc9e65e1eafc24ee9a405821561abb","last_reissued_at":"2026-05-18T00:01:18.920257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:18.920257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03176","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-18T00:01:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UnDvDr/SArWdXmrzG7lVjKJEs7e799h3bBsXf4Whnr78btCPGv3aEBx0Fr1ePCR7GvlIAoTD8vsuRgf/VPEqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:02:28.729235Z"},"content_sha256":"d9fc6ca82564ba182df13c3016ee808e85fa84a2a1c7f2908b8c923626fc7d1e","schema_version":"1.0","event_id":"sha256:d9fc6ca82564ba182df13c3016ee808e85fa84a2a1c7f2908b8c923626fc7d1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WBDQBSTVKLVP7MSMGP74MPPG7B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SAT-based Explicit LTLf Satisfiability Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Geguang Pu, Jianwen Li, Kristin Y. Rozier, Moshe Y. Vardi, Yueling Zhang","submitted_at":"2018-11-07T22:58:46Z","abstract_excerpt":"We present here a SAT-based framework for LTLf (Linear Temporal Logic on Finite Traces) satisfiability checking. We use propositional SAT-solving techniques to construct a transition system for the input LTLf formula; satisfiability checking is then reduced to a path-search problem over this transition system. Furthermore, we introduce CDLSC (Conflict-Driven LTLf Satisfiability Checking), a novel algorithm that leverages information produced by propositional SAT solvers from both satisfiability and unsatisfiability results. Experimental evaluations show that CDLSC outperforms all other existin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03176","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-18T00:01:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ps+dz8Zkeddu9fYqSTrC8UI+H3YDY2olO+y/eAfFE5rzSTwjj1D/ldPs3f7Nz6RcxItPpLqvqbJFA5eAbe38Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:02:28.729589Z"},"content_sha256":"1fb0f3fa8357013ac7fb9c981e752cbe7a1b083b3801028e7202a215e494d685","schema_version":"1.0","event_id":"sha256:1fb0f3fa8357013ac7fb9c981e752cbe7a1b083b3801028e7202a215e494d685"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBDQBSTVKLVP7MSMGP74MPPG7B/bundle.json","state_url":"https://pith.science/pith/WBDQBSTVKLVP7MSMGP74MPPG7B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBDQBSTVKLVP7MSMGP74MPPG7B/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-01T17:02:28Z","links":{"resolver":"https://pith.science/pith/WBDQBSTVKLVP7MSMGP74MPPG7B","bundle":"https://pith.science/pith/WBDQBSTVKLVP7MSMGP74MPPG7B/bundle.json","state":"https://pith.science/pith/WBDQBSTVKLVP7MSMGP74MPPG7B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBDQBSTVKLVP7MSMGP74MPPG7B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WBDQBSTVKLVP7MSMGP74MPPG7B","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":"e77c7dc3a0a35e0dc3dae5bb5b36b46290e16a3774ef17524d78436b1f27819e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-07T22:58:46Z","title_canon_sha256":"a62cab9c405e3fc9a144eb64a5b7bde83ff32c4944541ba7a1318f08dcf73c1b"},"schema_version":"1.0","source":{"id":"1811.03176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03176","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03176v1","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03176","created_at":"2026-05-18T00:01:18Z"},{"alias_kind":"pith_short_12","alias_value":"WBDQBSTVKLVP","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WBDQBSTVKLVP7MSM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WBDQBSTV","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:1fb0f3fa8357013ac7fb9c981e752cbe7a1b083b3801028e7202a215e494d685","target":"graph","created_at":"2026-05-18T00:01:18Z","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":"We present here a SAT-based framework for LTLf (Linear Temporal Logic on Finite Traces) satisfiability checking. We use propositional SAT-solving techniques to construct a transition system for the input LTLf formula; satisfiability checking is then reduced to a path-search problem over this transition system. Furthermore, we introduce CDLSC (Conflict-Driven LTLf Satisfiability Checking), a novel algorithm that leverages information produced by propositional SAT solvers from both satisfiability and unsatisfiability results. Experimental evaluations show that CDLSC outperforms all other existin","authors_text":"Geguang Pu, Jianwen Li, Kristin Y. Rozier, Moshe Y. Vardi, Yueling Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-07T22:58:46Z","title":"SAT-based Explicit LTLf Satisfiability Checking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03176","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:d9fc6ca82564ba182df13c3016ee808e85fa84a2a1c7f2908b8c923626fc7d1e","target":"record","created_at":"2026-05-18T00:01:18Z","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":"e77c7dc3a0a35e0dc3dae5bb5b36b46290e16a3774ef17524d78436b1f27819e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-07T22:58:46Z","title_canon_sha256":"a62cab9c405e3fc9a144eb64a5b7bde83ff32c4944541ba7a1318f08dcf73c1b"},"schema_version":"1.0","source":{"id":"1811.03176","kind":"arxiv","version":1}},"canonical_sha256":"b04700ca7552eaffb24c33ffc63de6f858bc9e65e1eafc24ee9a405821561abb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b04700ca7552eaffb24c33ffc63de6f858bc9e65e1eafc24ee9a405821561abb","first_computed_at":"2026-05-18T00:01:18.920257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:18.920257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zypCVPl4p/VPDBINmPpxigHnQUWqJW9Qc3cQ6BuGmSIZoG1FDI479aSDlxrSgpb3gttHmBx8+DJ/gXaXHpAKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:18.920853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9fc6ca82564ba182df13c3016ee808e85fa84a2a1c7f2908b8c923626fc7d1e","sha256:1fb0f3fa8357013ac7fb9c981e752cbe7a1b083b3801028e7202a215e494d685"],"state_sha256":"5cfb6e541dc32c14088c5f5dfc0c695fa2a311dca3fae998d74dcc4821414ae8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NW/5Gh8+X/ik0z1in2WPbaNNc9NyzvYhANv5rcXAo3zy78bxWOc/mPunKByIyOhbxPfCifjUtlgceoJG36c1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:02:28.731438Z","bundle_sha256":"3a8448d6fbc266688479492d2fba73371e9b1c10474990d77f9d3e52812cecc3"}}