{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:5OK5XQOKCFBUK244DIHAJBUIFD","short_pith_number":"pith:5OK5XQOK","canonical_record":{"source":{"id":"2302.02384","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2023-02-05T14:03:39Z","cross_cats_sorted":["cs.LO","cs.PL"],"title_canon_sha256":"3301f3a88ebdb1ba8134d670e8c883bfc3353d2a30e4c8cb4e66061ff4ad11f7","abstract_canon_sha256":"b1b38a9d982226c6a1b2e21d8851b5d3e6a0131d1e95b3f0bdc5ca63f5f8174c"},"schema_version":"1.0"},"canonical_sha256":"eb95dbc1ca1143456b9c1a0e04868828ef2a7a6ff8468aa7ecd518ce8b4f8663","source":{"kind":"arxiv","id":"2302.02384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.02384","created_at":"2026-07-05T05:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"2302.02384v1","created_at":"2026-07-05T05:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02384","created_at":"2026-07-05T05:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"5OK5XQOKCFBU","created_at":"2026-07-05T05:38:52Z"},{"alias_kind":"pith_short_16","alias_value":"5OK5XQOKCFBUK244","created_at":"2026-07-05T05:38:52Z"},{"alias_kind":"pith_short_8","alias_value":"5OK5XQOK","created_at":"2026-07-05T05:38:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:5OK5XQOKCFBUK244DIHAJBUIFD","target":"record","payload":{"canonical_record":{"source":{"id":"2302.02384","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2023-02-05T14:03:39Z","cross_cats_sorted":["cs.LO","cs.PL"],"title_canon_sha256":"3301f3a88ebdb1ba8134d670e8c883bfc3353d2a30e4c8cb4e66061ff4ad11f7","abstract_canon_sha256":"b1b38a9d982226c6a1b2e21d8851b5d3e6a0131d1e95b3f0bdc5ca63f5f8174c"},"schema_version":"1.0"},"canonical_sha256":"eb95dbc1ca1143456b9c1a0e04868828ef2a7a6ff8468aa7ecd518ce8b4f8663","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:52.813382Z","signature_b64":"lpXJd4OS6sK6PdClGRaJbo3Tvsz7dC2qNgVkgL3FCUOSvVfd1VS1xBTPSHHk90lOKTLB7bevPCuI5sI3G7ZQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb95dbc1ca1143456b9c1a0e04868828ef2a7a6ff8468aa7ecd518ce8b4f8663","last_reissued_at":"2026-07-05T05:38:52.812875Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:52.812875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.02384","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-07-05T05:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YBeZdkCKLBcmuuCmAOLzzfdd9O+UWSbhXWf63+824CN8c5netUDcQVZheKsDaKqffPoFpbCNYfJzLpyrg29HCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T11:11:14.603570Z"},"content_sha256":"967e748687585be0213942386780d5fdb7ec104329b9ff42558b0fee176ae404","schema_version":"1.0","event_id":"sha256:967e748687585be0213942386780d5fdb7ec104329b9ff42558b0fee176ae404"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:5OK5XQOKCFBUK244DIHAJBUIFD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CBMC: The C Bounded Model Checker","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","cs.PL"],"primary_cat":"cs.SE","authors_text":"Daniel Kroening, Michael Tautschnig, Peter Schrammel","submitted_at":"2023-02-05T14:03:39Z","abstract_excerpt":"The C Bounded Model Checker (CBMC) demonstrates the violation of assertions in C programs, or proves safety of the assertions under a given bound. CBMC implements a bit-precise translation of an input C program, annotated with assertions and with loops unrolled to a given depth, into a formula. If the formula is satisfiable, then an execution leading to a violated assertion exists. CBMC is one of the most successful software verification tools. Its main advantages are its precision, robustness and simplicity. CBMC is shipped as part of several Linux distributions. It has been used by thousands"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02384","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.02384/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AazUkXwx1E2jRyevY+7wynM8EXJ3h9fePlbLwO2DCGlKo2WQWa/YU1BUVFfVekk5NkJssw41IFTEavxIUvhlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T11:11:14.603945Z"},"content_sha256":"9056c99b41a075bcbc7549e15aec4bbf936b3086e432737abbf7cf9ccb31d2a6","schema_version":"1.0","event_id":"sha256:9056c99b41a075bcbc7549e15aec4bbf936b3086e432737abbf7cf9ccb31d2a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD/bundle.json","state_url":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OK5XQOKCFBUK244DIHAJBUIFD/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-07-06T11:11:14Z","links":{"resolver":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD","bundle":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD/bundle.json","state":"https://pith.science/pith/5OK5XQOKCFBUK244DIHAJBUIFD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OK5XQOKCFBUK244DIHAJBUIFD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:5OK5XQOKCFBUK244DIHAJBUIFD","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":"b1b38a9d982226c6a1b2e21d8851b5d3e6a0131d1e95b3f0bdc5ca63f5f8174c","cross_cats_sorted":["cs.LO","cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2023-02-05T14:03:39Z","title_canon_sha256":"3301f3a88ebdb1ba8134d670e8c883bfc3353d2a30e4c8cb4e66061ff4ad11f7"},"schema_version":"1.0","source":{"id":"2302.02384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.02384","created_at":"2026-07-05T05:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"2302.02384v1","created_at":"2026-07-05T05:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02384","created_at":"2026-07-05T05:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"5OK5XQOKCFBU","created_at":"2026-07-05T05:38:52Z"},{"alias_kind":"pith_short_16","alias_value":"5OK5XQOKCFBUK244","created_at":"2026-07-05T05:38:52Z"},{"alias_kind":"pith_short_8","alias_value":"5OK5XQOK","created_at":"2026-07-05T05:38:52Z"}],"graph_snapshots":[{"event_id":"sha256:9056c99b41a075bcbc7549e15aec4bbf936b3086e432737abbf7cf9ccb31d2a6","target":"graph","created_at":"2026-07-05T05:38:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2302.02384/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The C Bounded Model Checker (CBMC) demonstrates the violation of assertions in C programs, or proves safety of the assertions under a given bound. CBMC implements a bit-precise translation of an input C program, annotated with assertions and with loops unrolled to a given depth, into a formula. If the formula is satisfiable, then an execution leading to a violated assertion exists. CBMC is one of the most successful software verification tools. Its main advantages are its precision, robustness and simplicity. CBMC is shipped as part of several Linux distributions. It has been used by thousands","authors_text":"Daniel Kroening, Michael Tautschnig, Peter Schrammel","cross_cats":["cs.LO","cs.PL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2023-02-05T14:03:39Z","title":"CBMC: The C Bounded Model Checker"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02384","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:967e748687585be0213942386780d5fdb7ec104329b9ff42558b0fee176ae404","target":"record","created_at":"2026-07-05T05:38:52Z","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":"b1b38a9d982226c6a1b2e21d8851b5d3e6a0131d1e95b3f0bdc5ca63f5f8174c","cross_cats_sorted":["cs.LO","cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2023-02-05T14:03:39Z","title_canon_sha256":"3301f3a88ebdb1ba8134d670e8c883bfc3353d2a30e4c8cb4e66061ff4ad11f7"},"schema_version":"1.0","source":{"id":"2302.02384","kind":"arxiv","version":1}},"canonical_sha256":"eb95dbc1ca1143456b9c1a0e04868828ef2a7a6ff8468aa7ecd518ce8b4f8663","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb95dbc1ca1143456b9c1a0e04868828ef2a7a6ff8468aa7ecd518ce8b4f8663","first_computed_at":"2026-07-05T05:38:52.812875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:38:52.812875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lpXJd4OS6sK6PdClGRaJbo3Tvsz7dC2qNgVkgL3FCUOSvVfd1VS1xBTPSHHk90lOKTLB7bevPCuI5sI3G7ZQBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:38:52.813382Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.02384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:967e748687585be0213942386780d5fdb7ec104329b9ff42558b0fee176ae404","sha256:9056c99b41a075bcbc7549e15aec4bbf936b3086e432737abbf7cf9ccb31d2a6"],"state_sha256":"b12f695259cc1ae480750e244ab6d42342a5742c3c12eaeb728dea41d0e482df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fowdu4MNlwmBOHMSWtqX4shDos13lv1CpLrQEqFclIbYCjzoqhBpIVR0h/Ddeb21jZPG4QploH34RkW3OZ1iDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T11:11:14.605905Z","bundle_sha256":"3c927e5901e56298b69b73e39ccff374c082f7f9d9861a538706e06622c75237"}}