{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VQR7X3UHWJEK5CPL7RSGRP6IVQ","short_pith_number":"pith:VQR7X3UH","canonical_record":{"source":{"id":"1312.6532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-12-23T12:05:34Z","cross_cats_sorted":[],"title_canon_sha256":"0132673760b0cf07c3904843b4ed762626d668c32a72bd4851ef421908998f82","abstract_canon_sha256":"10f06ed4c38068efa1d123c66ec1231a7a91218f238869ca3e6aa6b1c363451b"},"schema_version":"1.0"},"canonical_sha256":"ac23fbee87b248ae89ebfc6468bfc8ac101db4cb830b02d7cddb1ee7d3081fb8","source":{"kind":"arxiv","id":"1312.6532","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6532","created_at":"2026-05-18T03:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6532v1","created_at":"2026-05-18T03:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6532","created_at":"2026-05-18T03:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"VQR7X3UHWJEK","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VQR7X3UHWJEK5CPL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VQR7X3UH","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VQR7X3UHWJEK5CPL7RSGRP6IVQ","target":"record","payload":{"canonical_record":{"source":{"id":"1312.6532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-12-23T12:05:34Z","cross_cats_sorted":[],"title_canon_sha256":"0132673760b0cf07c3904843b4ed762626d668c32a72bd4851ef421908998f82","abstract_canon_sha256":"10f06ed4c38068efa1d123c66ec1231a7a91218f238869ca3e6aa6b1c363451b"},"schema_version":"1.0"},"canonical_sha256":"ac23fbee87b248ae89ebfc6468bfc8ac101db4cb830b02d7cddb1ee7d3081fb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:58.001205Z","signature_b64":"2imwOFmFRdfxT3MP9ikFABiEK50PbSuyvKtBQmak5lHBVGQ+kGhJVgunlRB3nOFym58xQn3fNCiHg7pHqdrPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac23fbee87b248ae89ebfc6468bfc8ac101db4cb830b02d7cddb1ee7d3081fb8","last_reissued_at":"2026-05-18T03:03:58.000471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:58.000471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.6532","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-18T03:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TaHQCrHdU/CTBNaKcP5ZMfgKn2nWUMLkQt38D9ce/IEG/uA9/pdaX+4g28e5MEKFqvDxJ19BFWhkXrAN21zfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:21:01.678004Z"},"content_sha256":"88de8f5ff331406cda020b8c46015a8b5e83c96c46f2417a04626ec952a3f1a7","schema_version":"1.0","event_id":"sha256:88de8f5ff331406cda020b8c46015a8b5e83c96c46f2417a04626ec952a3f1a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VQR7X3UHWJEK5CPL7RSGRP6IVQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Andrew D. Gordon, David A. Naumann, Fran\\c{c}ois Dupressoir, Jan J\\\"urjens","submitted_at":"2013-12-23T12:05:34Z","abstract_excerpt":"We describe how to verify security properties of C code for cryptographic protocols by using a general-purpose verifier. We prove security theorems in the symbolic model of cryptography. Our techniques include: use of ghost state to attach formal algebraic terms to concrete byte arrays and to detect collisions when two distinct terms map to the same byte array; decoration of a crypto API with contracts based on symbolic terms; and expression of the attacker model in terms of C programs. We rely on the general-purpose verifier VCC; we guide VCC to prove security simply by writing suitable heade"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6532","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-18T03:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kL+adaZaO3pgrHXHuvupLFp2kqJp0CIcOK2MQyKKD7K7NXCBZ8szteJ9ZcZ15kZZPqDS6utDZs7cIzY7JS5dDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:21:01.678403Z"},"content_sha256":"69b0cf541996ca77e6e8875a70f8f6ba0821f9e28488eb516788a61f2276243f","schema_version":"1.0","event_id":"sha256:69b0cf541996ca77e6e8875a70f8f6ba0821f9e28488eb516788a61f2276243f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ/bundle.json","state_url":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ/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-05T19:21:01Z","links":{"resolver":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ","bundle":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ/bundle.json","state":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VQR7X3UHWJEK5CPL7RSGRP6IVQ","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":"10f06ed4c38068efa1d123c66ec1231a7a91218f238869ca3e6aa6b1c363451b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-12-23T12:05:34Z","title_canon_sha256":"0132673760b0cf07c3904843b4ed762626d668c32a72bd4851ef421908998f82"},"schema_version":"1.0","source":{"id":"1312.6532","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6532","created_at":"2026-05-18T03:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6532v1","created_at":"2026-05-18T03:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6532","created_at":"2026-05-18T03:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"VQR7X3UHWJEK","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VQR7X3UHWJEK5CPL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VQR7X3UH","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:69b0cf541996ca77e6e8875a70f8f6ba0821f9e28488eb516788a61f2276243f","target":"graph","created_at":"2026-05-18T03:03:58Z","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 describe how to verify security properties of C code for cryptographic protocols by using a general-purpose verifier. We prove security theorems in the symbolic model of cryptography. Our techniques include: use of ghost state to attach formal algebraic terms to concrete byte arrays and to detect collisions when two distinct terms map to the same byte array; decoration of a crypto API with contracts based on symbolic terms; and expression of the attacker model in terms of C programs. We rely on the general-purpose verifier VCC; we guide VCC to prove security simply by writing suitable heade","authors_text":"Andrew D. Gordon, David A. Naumann, Fran\\c{c}ois Dupressoir, Jan J\\\"urjens","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-12-23T12:05:34Z","title":"Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6532","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:88de8f5ff331406cda020b8c46015a8b5e83c96c46f2417a04626ec952a3f1a7","target":"record","created_at":"2026-05-18T03:03:58Z","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":"10f06ed4c38068efa1d123c66ec1231a7a91218f238869ca3e6aa6b1c363451b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-12-23T12:05:34Z","title_canon_sha256":"0132673760b0cf07c3904843b4ed762626d668c32a72bd4851ef421908998f82"},"schema_version":"1.0","source":{"id":"1312.6532","kind":"arxiv","version":1}},"canonical_sha256":"ac23fbee87b248ae89ebfc6468bfc8ac101db4cb830b02d7cddb1ee7d3081fb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac23fbee87b248ae89ebfc6468bfc8ac101db4cb830b02d7cddb1ee7d3081fb8","first_computed_at":"2026-05-18T03:03:58.000471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:58.000471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2imwOFmFRdfxT3MP9ikFABiEK50PbSuyvKtBQmak5lHBVGQ+kGhJVgunlRB3nOFym58xQn3fNCiHg7pHqdrPDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:58.001205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6532","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88de8f5ff331406cda020b8c46015a8b5e83c96c46f2417a04626ec952a3f1a7","sha256:69b0cf541996ca77e6e8875a70f8f6ba0821f9e28488eb516788a61f2276243f"],"state_sha256":"e8e75b8f1ceaf1a3336a7a946b42ee6ae3a4ad05d9de3b3496eb90adb83c387f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wIKSmVSl/eO/eYXwBXlCjkvgt4Ld/UQQ9gWhzzaJwn4QJOKGnDR+w+9/qHyrgsqtHL2fQPVziu+a82EhcLWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:21:01.680827Z","bundle_sha256":"71f4e350fc40b63c15159c1712480f14c2ca072ccc25c3d1e18701f13ab40f31"}}