{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MB2C2HP73UTYVUMKILTP37IPWV","short_pith_number":"pith:MB2C2HP7","canonical_record":{"source":{"id":"1511.07536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-24T01:52:04Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"54f78e099dcef94dbb75eb8accddd5d62d4907191d4c009f1adc44bf685952d6","abstract_canon_sha256":"5f2dfba72fc432b26dc053c34e20ab611963a3547d0cc40b5308755733223082"},"schema_version":"1.0"},"canonical_sha256":"60742d1dffdd278ad18a42e6fdfd0fb56700afaaac26f9596f675cb76aecdceb","source":{"kind":"arxiv","id":"1511.07536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07536","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07536v1","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07536","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"pith_short_12","alias_value":"MB2C2HP73UTY","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MB2C2HP73UTYVUMK","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MB2C2HP7","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MB2C2HP73UTYVUMKILTP37IPWV","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-24T01:52:04Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"54f78e099dcef94dbb75eb8accddd5d62d4907191d4c009f1adc44bf685952d6","abstract_canon_sha256":"5f2dfba72fc432b26dc053c34e20ab611963a3547d0cc40b5308755733223082"},"schema_version":"1.0"},"canonical_sha256":"60742d1dffdd278ad18a42e6fdfd0fb56700afaaac26f9596f675cb76aecdceb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:04.489861Z","signature_b64":"vg+D4TR1YizxydTX2N4JR6mZUHo0iNa1ycsemXcc/eYgJ/MaAyJDR4PoNYWsVxGnqEIElaRkMYUS12ZdLzBoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60742d1dffdd278ad18a42e6fdfd0fb56700afaaac26f9596f675cb76aecdceb","last_reissued_at":"2026-05-18T01:26:04.489358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:04.489358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07536","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-18T01:26:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7UjXhPVtvVGjWqPc3ubP30qdHYT0LaKIwnuw/FN9b3UAdQqcNm46Zw36fxhCXYub50Znk+exBQySbrmCGCBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:54:55.122961Z"},"content_sha256":"a6a8eb13772f562b621b4f9ea89d8658ad5febb427b3f6bad3f12ceedc2338a8","schema_version":"1.0","event_id":"sha256:a6a8eb13772f562b621b4f9ea89d8658ad5febb427b3f6bad3f12ceedc2338a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MB2C2HP73UTYVUMKILTP37IPWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Symbolic Logic with Concrete Bounds for Cryptographic Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LO","authors_text":"Anupam Datta, Arnab Roy, John C. Mitchell, Joseph Y. Halpern, Shayak Sen","submitted_at":"2015-11-24T01:52:04Z","abstract_excerpt":"We present a formal logic for quantitative reasoning about security properties of network protocols. The system allows us to derive concrete security bounds that can be used to choose key lengths and other security parameters. We provide axioms for reasoning about digital signatures and random nonces, with security properties based on the concrete security of signature schemes and pseudorandom number generators (PRG). The formal logic supports first-order reasoning and reasoning about protocol invariants, taking concrete security bounds into account. Proofs constructed in our logic also provid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07536","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-18T01:26:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3RFiA4sYk2dqhkcygELiza9rSeNAeRDP3SiMSgL+Ld1FjO9G9WBUrOJGYdQ7DQ/88IkHWkIReUDLleLaiqoRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:54:55.123303Z"},"content_sha256":"5ba054d9544950819a31963449ec2cd23f67c94dc813065a130a414d5a2a10cc","schema_version":"1.0","event_id":"sha256:5ba054d9544950819a31963449ec2cd23f67c94dc813065a130a414d5a2a10cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MB2C2HP73UTYVUMKILTP37IPWV/bundle.json","state_url":"https://pith.science/pith/MB2C2HP73UTYVUMKILTP37IPWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MB2C2HP73UTYVUMKILTP37IPWV/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-05-28T14:54:55Z","links":{"resolver":"https://pith.science/pith/MB2C2HP73UTYVUMKILTP37IPWV","bundle":"https://pith.science/pith/MB2C2HP73UTYVUMKILTP37IPWV/bundle.json","state":"https://pith.science/pith/MB2C2HP73UTYVUMKILTP37IPWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MB2C2HP73UTYVUMKILTP37IPWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MB2C2HP73UTYVUMKILTP37IPWV","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":"5f2dfba72fc432b26dc053c34e20ab611963a3547d0cc40b5308755733223082","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-24T01:52:04Z","title_canon_sha256":"54f78e099dcef94dbb75eb8accddd5d62d4907191d4c009f1adc44bf685952d6"},"schema_version":"1.0","source":{"id":"1511.07536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07536","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07536v1","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07536","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"pith_short_12","alias_value":"MB2C2HP73UTY","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MB2C2HP73UTYVUMK","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MB2C2HP7","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:5ba054d9544950819a31963449ec2cd23f67c94dc813065a130a414d5a2a10cc","target":"graph","created_at":"2026-05-18T01:26:04Z","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 present a formal logic for quantitative reasoning about security properties of network protocols. The system allows us to derive concrete security bounds that can be used to choose key lengths and other security parameters. We provide axioms for reasoning about digital signatures and random nonces, with security properties based on the concrete security of signature schemes and pseudorandom number generators (PRG). The formal logic supports first-order reasoning and reasoning about protocol invariants, taking concrete security bounds into account. Proofs constructed in our logic also provid","authors_text":"Anupam Datta, Arnab Roy, John C. Mitchell, Joseph Y. Halpern, Shayak Sen","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-24T01:52:04Z","title":"A Symbolic Logic with Concrete Bounds for Cryptographic Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07536","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:a6a8eb13772f562b621b4f9ea89d8658ad5febb427b3f6bad3f12ceedc2338a8","target":"record","created_at":"2026-05-18T01:26:04Z","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":"5f2dfba72fc432b26dc053c34e20ab611963a3547d0cc40b5308755733223082","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-24T01:52:04Z","title_canon_sha256":"54f78e099dcef94dbb75eb8accddd5d62d4907191d4c009f1adc44bf685952d6"},"schema_version":"1.0","source":{"id":"1511.07536","kind":"arxiv","version":1}},"canonical_sha256":"60742d1dffdd278ad18a42e6fdfd0fb56700afaaac26f9596f675cb76aecdceb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60742d1dffdd278ad18a42e6fdfd0fb56700afaaac26f9596f675cb76aecdceb","first_computed_at":"2026-05-18T01:26:04.489358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:04.489358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vg+D4TR1YizxydTX2N4JR6mZUHo0iNa1ycsemXcc/eYgJ/MaAyJDR4PoNYWsVxGnqEIElaRkMYUS12ZdLzBoBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:04.489861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6a8eb13772f562b621b4f9ea89d8658ad5febb427b3f6bad3f12ceedc2338a8","sha256:5ba054d9544950819a31963449ec2cd23f67c94dc813065a130a414d5a2a10cc"],"state_sha256":"ebb23d29bd7a897bc278a428e0389b084e33139937027643cdf042e1c98c2339"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWh7rnDx1ju8mrbzl2wZ+8eOdyLboViXl/zhGntdTnNCrRTzk5ZwR57s9HsZto3LDjWQqXNfm2Ho4lzseB7VCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:54:55.125468Z","bundle_sha256":"c2301078d8a6039e86b71479eddb58473a31485825716965f94006ee2f907690"}}