{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:3KERZOUIABMBFCFSLK54MSE7ZX","short_pith_number":"pith:3KERZOUI","canonical_record":{"source":{"id":"cs/0611029","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2006-11-07T00:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"0b0a59aae1eca52189d40aa099dbcc6dd51bb51d3910cb02491dfecdb3ae3155","abstract_canon_sha256":"3b45796e8300b2314c43c677f2fe03db853aa934e14e03edd00e9e49ae2d2c7c"},"schema_version":"1.0"},"canonical_sha256":"da891cba8800581288b25abbc6489fcde38f390709597583eb4acf258ca0f1a9","source":{"kind":"arxiv","id":"cs/0611029","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0611029","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0611029v3","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0611029","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"3KERZOUIABMB","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"3KERZOUIABMBFCFS","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"3KERZOUI","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:3KERZOUIABMBFCFSLK54MSE7ZX","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0611029","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2006-11-07T00:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"0b0a59aae1eca52189d40aa099dbcc6dd51bb51d3910cb02491dfecdb3ae3155","abstract_canon_sha256":"3b45796e8300b2314c43c677f2fe03db853aa934e14e03edd00e9e49ae2d2c7c"},"schema_version":"1.0"},"canonical_sha256":"da891cba8800581288b25abbc6489fcde38f390709597583eb4acf258ca0f1a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.289520Z","signature_b64":"afE1FyLn6U03b0MpzjUmBVFljeCCQmM/kF5PfQo8FUCUXlrIkL9vUffShr1Q3Pj3aSKHIh5+D4qrszVF40EABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da891cba8800581288b25abbc6489fcde38f390709597583eb4acf258ca0f1a9","last_reissued_at":"2026-05-18T00:53:03.288985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.288985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0611029","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-18T00:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E9k2HN56E8ueXfmb38ugXQ+WUPpg2bpV81bN2429h4e8VlUNrOalgGDrMMdOanAOZpb+ojCGCk9K0uyZxYXyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:03:53.990267Z"},"content_sha256":"5de17cf74bffe244568c8dab7ad5f1b5ec3825822d8862e09ebde6a30ff81a1c","schema_version":"1.0","event_id":"sha256:5de17cf74bffe244568c8dab7ad5f1b5ec3825822d8862e09ebde6a30ff81a1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:3KERZOUIABMBFCFSLK54MSE7ZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Encodings of Bounded LTL Model Checking","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Armin Biere, Keijo Heljanko, Timo Latvala, Tommi Junttila, Viktor Schuppan","submitted_at":"2006-11-07T00:07:26Z","abstract_excerpt":"We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthermore, we show how the encodings can be extended to LTL with past operators (PLTL). The generalised encoding is still of linear size, but cannot detect minimal length counterexamples. By using the virtual unrolling technique minimal length counterexamples can be captured, however, the size of the encoding is quadratic in the specification. We also extend virtual unrolling to Buchi automata, enabling them to accept minimal leng"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0611029","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-18T00:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jw2c9GiywrTSaPmaTqtCl3tBIAwASxoEXult2Dmkoy5rRe21j3Yik+ngqUJUy5EChXPJywjDOhSYR4jYXbQLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:03:53.990626Z"},"content_sha256":"50dff940ebbb535e6b943461a98c91411a7ae0137fa964f917f431b4de988057","schema_version":"1.0","event_id":"sha256:50dff940ebbb535e6b943461a98c91411a7ae0137fa964f917f431b4de988057"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KERZOUIABMBFCFSLK54MSE7ZX/bundle.json","state_url":"https://pith.science/pith/3KERZOUIABMBFCFSLK54MSE7ZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KERZOUIABMBFCFSLK54MSE7ZX/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-03T16:03:53Z","links":{"resolver":"https://pith.science/pith/3KERZOUIABMBFCFSLK54MSE7ZX","bundle":"https://pith.science/pith/3KERZOUIABMBFCFSLK54MSE7ZX/bundle.json","state":"https://pith.science/pith/3KERZOUIABMBFCFSLK54MSE7ZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KERZOUIABMBFCFSLK54MSE7ZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:3KERZOUIABMBFCFSLK54MSE7ZX","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":"3b45796e8300b2314c43c677f2fe03db853aa934e14e03edd00e9e49ae2d2c7c","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2006-11-07T00:07:26Z","title_canon_sha256":"0b0a59aae1eca52189d40aa099dbcc6dd51bb51d3910cb02491dfecdb3ae3155"},"schema_version":"1.0","source":{"id":"cs/0611029","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0611029","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0611029v3","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0611029","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"3KERZOUIABMB","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"3KERZOUIABMBFCFS","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"3KERZOUI","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:50dff940ebbb535e6b943461a98c91411a7ae0137fa964f917f431b4de988057","target":"graph","created_at":"2026-05-18T00:53:03Z","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 consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthermore, we show how the encodings can be extended to LTL with past operators (PLTL). The generalised encoding is still of linear size, but cannot detect minimal length counterexamples. By using the virtual unrolling technique minimal length counterexamples can be captured, however, the size of the encoding is quadratic in the specification. We also extend virtual unrolling to Buchi automata, enabling them to accept minimal leng","authors_text":"Armin Biere, Keijo Heljanko, Timo Latvala, Tommi Junttila, Viktor Schuppan","cross_cats":[],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2006-11-07T00:07:26Z","title":"Linear Encodings of Bounded LTL Model Checking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0611029","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:5de17cf74bffe244568c8dab7ad5f1b5ec3825822d8862e09ebde6a30ff81a1c","target":"record","created_at":"2026-05-18T00:53:03Z","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":"3b45796e8300b2314c43c677f2fe03db853aa934e14e03edd00e9e49ae2d2c7c","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2006-11-07T00:07:26Z","title_canon_sha256":"0b0a59aae1eca52189d40aa099dbcc6dd51bb51d3910cb02491dfecdb3ae3155"},"schema_version":"1.0","source":{"id":"cs/0611029","kind":"arxiv","version":3}},"canonical_sha256":"da891cba8800581288b25abbc6489fcde38f390709597583eb4acf258ca0f1a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da891cba8800581288b25abbc6489fcde38f390709597583eb4acf258ca0f1a9","first_computed_at":"2026-05-18T00:53:03.288985Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:03.288985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"afE1FyLn6U03b0MpzjUmBVFljeCCQmM/kF5PfQo8FUCUXlrIkL9vUffShr1Q3Pj3aSKHIh5+D4qrszVF40EABA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:03.289520Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0611029","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5de17cf74bffe244568c8dab7ad5f1b5ec3825822d8862e09ebde6a30ff81a1c","sha256:50dff940ebbb535e6b943461a98c91411a7ae0137fa964f917f431b4de988057"],"state_sha256":"e458b7f4a024fe7617d2ca4a9c01c8cf592172855889ea82aa12b0d9d3ebe88d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XiQo6xlU1pTDCPv4noWFwm501PumO4bbiZqA5DdCF4/Im/5kL1agQYumrkTyxSzVP6qYPi4NibXMES/SZTSGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:03:53.992798Z","bundle_sha256":"652e2e14272b3ef1b152fd8a5dad2b13f2a9a625a96455c6a5206e850c87e6a1"}}