{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OVTP2AZWME6KZRL6QNFOFYECZZ","short_pith_number":"pith:OVTP2AZW","canonical_record":{"source":{"id":"1802.04174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-12T16:43:06Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"7e749a55d48174d5725b69fbcb7cf49cbd410db5b116252113b7ec43b6df4af7","abstract_canon_sha256":"13fa3c758f086d037e7e5bfcc8bae2ccdb8c7a1fa43393f4f061d21e839dd060"},"schema_version":"1.0"},"canonical_sha256":"7566fd0336613cacc57e834ae2e082ce41317e79b36f497ae78e506c6dc2ea57","source":{"kind":"arxiv","id":"1802.04174","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04174","created_at":"2026-05-18T00:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04174v1","created_at":"2026-05-18T00:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04174","created_at":"2026-05-18T00:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"OVTP2AZWME6K","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OVTP2AZWME6KZRL6","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OVTP2AZW","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OVTP2AZWME6KZRL6QNFOFYECZZ","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-12T16:43:06Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"7e749a55d48174d5725b69fbcb7cf49cbd410db5b116252113b7ec43b6df4af7","abstract_canon_sha256":"13fa3c758f086d037e7e5bfcc8bae2ccdb8c7a1fa43393f4f061d21e839dd060"},"schema_version":"1.0"},"canonical_sha256":"7566fd0336613cacc57e834ae2e082ce41317e79b36f497ae78e506c6dc2ea57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:27.083643Z","signature_b64":"g/nIIIaZFUItLzoD5ynNwfka9dsSP/GDXpnSvsxyWM/hpk4v7Yyt8k1GyeLVfnlAx4BTIup2UxtZT96L5Y39CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7566fd0336613cacc57e834ae2e082ce41317e79b36f497ae78e506c6dc2ea57","last_reissued_at":"2026-05-18T00:23:27.083017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:27.083017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04174","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:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27pK3unK69DCAoFcHu+pTx6WW5rJuOur4stgeBX71SyEbFX2IncmwGxI2VfLXfTk0AQ13FvM7ECiQebw2ydRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:38:21.097169Z"},"content_sha256":"e3b4b23accae85895111c45e2d8e29bbd22c9360f25337ec7494c06906c2809d","schema_version":"1.0","event_id":"sha256:e3b4b23accae85895111c45e2d8e29bbd22c9360f25337ec7494c06906c2809d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OVTP2AZWME6KZRL6QNFOFYECZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unbounded Software Model Checking with Incremental SAT-Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.SC","authors_text":"Carsten Sinz, Marko Kleine B\\\"uning, Tomas Balyo","submitted_at":"2018-02-12T16:43:06Z","abstract_excerpt":"This paper describes a novel unbounded software model checking approach to find errors in programs written in the C language based on incremental SAT-solving. Instead of using the traditional assumption based API to incremental SAT solvers we use the DimSpec format that is used in SAT based automated planning. A DimSpec formula consists of four CNF formulas representing the initial, goal and intermediate states and the relations between each pair of neighboring states of a transition system. We present a new tool called LLUMC which encodes the presence of certain errors in a C program into a D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04174","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:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JbuX5Ggn5AoLB7ic+FH86Yh3oAArNMXVScPsPqs6ihIQkv1jzbg9CaY/2rcDb2x5pqG6S4oDN9S2XObZxoAHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:38:21.097519Z"},"content_sha256":"b5dd6277e70c07ffd8f329e5ec9f57e2d65653b9bffecd7034fa5ec6fadf3366","schema_version":"1.0","event_id":"sha256:b5dd6277e70c07ffd8f329e5ec9f57e2d65653b9bffecd7034fa5ec6fadf3366"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVTP2AZWME6KZRL6QNFOFYECZZ/bundle.json","state_url":"https://pith.science/pith/OVTP2AZWME6KZRL6QNFOFYECZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVTP2AZWME6KZRL6QNFOFYECZZ/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-20T08:38:21Z","links":{"resolver":"https://pith.science/pith/OVTP2AZWME6KZRL6QNFOFYECZZ","bundle":"https://pith.science/pith/OVTP2AZWME6KZRL6QNFOFYECZZ/bundle.json","state":"https://pith.science/pith/OVTP2AZWME6KZRL6QNFOFYECZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVTP2AZWME6KZRL6QNFOFYECZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OVTP2AZWME6KZRL6QNFOFYECZZ","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":"13fa3c758f086d037e7e5bfcc8bae2ccdb8c7a1fa43393f4f061d21e839dd060","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-12T16:43:06Z","title_canon_sha256":"7e749a55d48174d5725b69fbcb7cf49cbd410db5b116252113b7ec43b6df4af7"},"schema_version":"1.0","source":{"id":"1802.04174","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04174","created_at":"2026-05-18T00:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04174v1","created_at":"2026-05-18T00:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04174","created_at":"2026-05-18T00:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"OVTP2AZWME6K","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OVTP2AZWME6KZRL6","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OVTP2AZW","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:b5dd6277e70c07ffd8f329e5ec9f57e2d65653b9bffecd7034fa5ec6fadf3366","target":"graph","created_at":"2026-05-18T00:23:27Z","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 describes a novel unbounded software model checking approach to find errors in programs written in the C language based on incremental SAT-solving. Instead of using the traditional assumption based API to incremental SAT solvers we use the DimSpec format that is used in SAT based automated planning. A DimSpec formula consists of four CNF formulas representing the initial, goal and intermediate states and the relations between each pair of neighboring states of a transition system. We present a new tool called LLUMC which encodes the presence of certain errors in a C program into a D","authors_text":"Carsten Sinz, Marko Kleine B\\\"uning, Tomas Balyo","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-12T16:43:06Z","title":"Unbounded Software Model Checking with Incremental SAT-Solving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04174","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:e3b4b23accae85895111c45e2d8e29bbd22c9360f25337ec7494c06906c2809d","target":"record","created_at":"2026-05-18T00:23:27Z","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":"13fa3c758f086d037e7e5bfcc8bae2ccdb8c7a1fa43393f4f061d21e839dd060","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-12T16:43:06Z","title_canon_sha256":"7e749a55d48174d5725b69fbcb7cf49cbd410db5b116252113b7ec43b6df4af7"},"schema_version":"1.0","source":{"id":"1802.04174","kind":"arxiv","version":1}},"canonical_sha256":"7566fd0336613cacc57e834ae2e082ce41317e79b36f497ae78e506c6dc2ea57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7566fd0336613cacc57e834ae2e082ce41317e79b36f497ae78e506c6dc2ea57","first_computed_at":"2026-05-18T00:23:27.083017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:27.083017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g/nIIIaZFUItLzoD5ynNwfka9dsSP/GDXpnSvsxyWM/hpk4v7Yyt8k1GyeLVfnlAx4BTIup2UxtZT96L5Y39CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:27.083643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04174","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3b4b23accae85895111c45e2d8e29bbd22c9360f25337ec7494c06906c2809d","sha256:b5dd6277e70c07ffd8f329e5ec9f57e2d65653b9bffecd7034fa5ec6fadf3366"],"state_sha256":"63f50fd56d5565ab2c53025463d7785923a7c4197b9c834434f625b3bf87273d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aOf03VxkfYfwJtdovWT+EYKNCQXpWDzeYiBd8bDT1CgTgS7w+0+4rvKdfH1Hpv/uxntq0L7ULETgqNqM4qohAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:38:21.099310Z","bundle_sha256":"33d17b9085f21b73a46b9273dce0a3e623bc571e855a6bf03510ded72d4a9e32"}}