{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:AT3ZNIYX6XHZBSN3C4M7RTQCX3","short_pith_number":"pith:AT3ZNIYX","canonical_record":{"source":{"id":"2107.01093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2021-07-02T14:14:21Z","cross_cats_sorted":[],"title_canon_sha256":"791c7ca6ba5020308b5f9119a9910a0cdaa6dd07083c8ab8f78d1e4096ceed88","abstract_canon_sha256":"acf17bebc044e0cd090a863e1f58ae10a989bdb783b590089d109b7a9962ae3a"},"schema_version":"1.0"},"canonical_sha256":"04f796a317f5cf90c9bb1719f8ce02bed1ad2071aecea2be21455dd4ad9af974","source":{"kind":"arxiv","id":"2107.01093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.01093","created_at":"2026-07-05T02:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"2107.01093v1","created_at":"2026-07-05T02:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.01093","created_at":"2026-07-05T02:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"AT3ZNIYX6XHZ","created_at":"2026-07-05T02:54:37Z"},{"alias_kind":"pith_short_16","alias_value":"AT3ZNIYX6XHZBSN3","created_at":"2026-07-05T02:54:37Z"},{"alias_kind":"pith_short_8","alias_value":"AT3ZNIYX","created_at":"2026-07-05T02:54:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:AT3ZNIYX6XHZBSN3C4M7RTQCX3","target":"record","payload":{"canonical_record":{"source":{"id":"2107.01093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2021-07-02T14:14:21Z","cross_cats_sorted":[],"title_canon_sha256":"791c7ca6ba5020308b5f9119a9910a0cdaa6dd07083c8ab8f78d1e4096ceed88","abstract_canon_sha256":"acf17bebc044e0cd090a863e1f58ae10a989bdb783b590089d109b7a9962ae3a"},"schema_version":"1.0"},"canonical_sha256":"04f796a317f5cf90c9bb1719f8ce02bed1ad2071aecea2be21455dd4ad9af974","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:37.026292Z","signature_b64":"Rczob05PTX+95kjYVp2Og3DvTF2MBq7/8eSRUs2KZYHIslIow6alrIN6YfwbAKmywKTv4J9uCktCI7tltBLYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04f796a317f5cf90c9bb1719f8ce02bed1ad2071aecea2be21455dd4ad9af974","last_reissued_at":"2026-07-05T02:54:37.025884Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:37.025884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.01093","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-05T02:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/30VAoh4Y+dLoFdek/7QBXL5uJ3pV5y/2I+QwR7yIUdJuAe95twoKt6LOfh32fN63C7bgwdtMz3bfrPwXRNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:55:07.100761Z"},"content_sha256":"5ba793331a148a3245142b202b06169f21b822877f392006d8770ce0e99e792a","schema_version":"1.0","event_id":"sha256:5ba793331a148a3245142b202b06169f21b822877f392006d8770ce0e99e792a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:AT3ZNIYX6XHZBSN3C4M7RTQCX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Checking C++ Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Felipe R. Monteiro, Lucas C. Cordeiro, Mikhail R. Gadelha","submitted_at":"2021-07-02T14:14:21Z","abstract_excerpt":"In the last three decades, memory safety issues in system programming languages such as C or C++ have been one of the significant sources of security vulnerabilities. However, there exist only a few attempts with limited success to cope with the complexity of C++ program verification. Here we describe and evaluate a novel verification approach based on bounded model checking (BMC) and satisfiability modulo theories (SMT) to verify C++ programs formally. Our verification approach analyzes bounded C++ programs by encoding into SMT various sophisticated features that the C++ programming language "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.01093","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/2107.01093/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-05T02:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EaupGxfa4YkYkHzfRHe8AYI1ccUdYfduWVvZpvlhUH5ptJYusA0RCdGuJpc4FFIB+Tn21RQOc1t+kcl3baI2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:55:07.101322Z"},"content_sha256":"39d39f0f706b084802806010aa44fe8dd7e92ac93967203ffd83eb283a16e0bd","schema_version":"1.0","event_id":"sha256:39d39f0f706b084802806010aa44fe8dd7e92ac93967203ffd83eb283a16e0bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3/bundle.json","state_url":"https://pith.science/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3/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-08-04T08:55:07Z","links":{"resolver":"https://pith.science/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3","bundle":"https://pith.science/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3/bundle.json","state":"https://pith.science/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AT3ZNIYX6XHZBSN3C4M7RTQCX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:AT3ZNIYX6XHZBSN3C4M7RTQCX3","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":"acf17bebc044e0cd090a863e1f58ae10a989bdb783b590089d109b7a9962ae3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2021-07-02T14:14:21Z","title_canon_sha256":"791c7ca6ba5020308b5f9119a9910a0cdaa6dd07083c8ab8f78d1e4096ceed88"},"schema_version":"1.0","source":{"id":"2107.01093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.01093","created_at":"2026-07-05T02:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"2107.01093v1","created_at":"2026-07-05T02:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.01093","created_at":"2026-07-05T02:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"AT3ZNIYX6XHZ","created_at":"2026-07-05T02:54:37Z"},{"alias_kind":"pith_short_16","alias_value":"AT3ZNIYX6XHZBSN3","created_at":"2026-07-05T02:54:37Z"},{"alias_kind":"pith_short_8","alias_value":"AT3ZNIYX","created_at":"2026-07-05T02:54:37Z"}],"graph_snapshots":[{"event_id":"sha256:39d39f0f706b084802806010aa44fe8dd7e92ac93967203ffd83eb283a16e0bd","target":"graph","created_at":"2026-07-05T02:54:37Z","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/2107.01093/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the last three decades, memory safety issues in system programming languages such as C or C++ have been one of the significant sources of security vulnerabilities. However, there exist only a few attempts with limited success to cope with the complexity of C++ program verification. Here we describe and evaluate a novel verification approach based on bounded model checking (BMC) and satisfiability modulo theories (SMT) to verify C++ programs formally. Our verification approach analyzes bounded C++ programs by encoding into SMT various sophisticated features that the C++ programming language ","authors_text":"Felipe R. Monteiro, Lucas C. Cordeiro, Mikhail R. Gadelha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2021-07-02T14:14:21Z","title":"Model Checking C++ Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.01093","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:5ba793331a148a3245142b202b06169f21b822877f392006d8770ce0e99e792a","target":"record","created_at":"2026-07-05T02:54:37Z","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":"acf17bebc044e0cd090a863e1f58ae10a989bdb783b590089d109b7a9962ae3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2021-07-02T14:14:21Z","title_canon_sha256":"791c7ca6ba5020308b5f9119a9910a0cdaa6dd07083c8ab8f78d1e4096ceed88"},"schema_version":"1.0","source":{"id":"2107.01093","kind":"arxiv","version":1}},"canonical_sha256":"04f796a317f5cf90c9bb1719f8ce02bed1ad2071aecea2be21455dd4ad9af974","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04f796a317f5cf90c9bb1719f8ce02bed1ad2071aecea2be21455dd4ad9af974","first_computed_at":"2026-07-05T02:54:37.025884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:54:37.025884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rczob05PTX+95kjYVp2Og3DvTF2MBq7/8eSRUs2KZYHIslIow6alrIN6YfwbAKmywKTv4J9uCktCI7tltBLYBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:54:37.026292Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.01093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ba793331a148a3245142b202b06169f21b822877f392006d8770ce0e99e792a","sha256:39d39f0f706b084802806010aa44fe8dd7e92ac93967203ffd83eb283a16e0bd"],"state_sha256":"007a4a1c5bc5f868364e3f59a2eb77472cf4c3dca63f19a5b618989546757c6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PoRbQ0rI3Awa4u7OVI/Tx2ROdaRvxZ1YqOhPNfVienz61fKYz+MrbffXlgyLxxHXoIunoS7Vb8ZTj3gk1keSCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T08:55:07.105552Z","bundle_sha256":"773a0fe94f3d67c1b50ff4d753f6d674a6bb3eb0fae212e2460075f155f5c25e"}}