{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IVGBILT7ZA4YSI6VDN3L62TFU5","short_pith_number":"pith:IVGBILT7","canonical_record":{"source":{"id":"1601.06676","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-25T17:02:38Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"0c29dc9dcb39d0febfbf0250132082042fa8174d6c836dfc91de8415ff83c0c5","abstract_canon_sha256":"29130062d718916374528e60e4bceb9745e894fb58f6ad9fc0b9380b7104e1bd"},"schema_version":"1.0"},"canonical_sha256":"454c142e7fc8398923d51b76bf6a65a747698fb0cceac4618b1be3adf75f67e2","source":{"kind":"arxiv","id":"1601.06676","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06676","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06676v3","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06676","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"IVGBILT7ZA4Y","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IVGBILT7ZA4YSI6V","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IVGBILT7","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IVGBILT7ZA4YSI6VDN3L62TFU5","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06676","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-25T17:02:38Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"0c29dc9dcb39d0febfbf0250132082042fa8174d6c836dfc91de8415ff83c0c5","abstract_canon_sha256":"29130062d718916374528e60e4bceb9745e894fb58f6ad9fc0b9380b7104e1bd"},"schema_version":"1.0"},"canonical_sha256":"454c142e7fc8398923d51b76bf6a65a747698fb0cceac4618b1be3adf75f67e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:33.862104Z","signature_b64":"FqhwR/VpTdWVa6/R4J20Hb3Kj8SisPV/nU9Qq8Mw2OAWJhhmLmssXTLbNMpJq7vo511vWDQSROCrtgN/P/H1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"454c142e7fc8398923d51b76bf6a65a747698fb0cceac4618b1be3adf75f67e2","last_reissued_at":"2026-05-18T00:44:33.861620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:33.861620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06676","source_version":3,"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:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MbiX3n6+do+Ee4BUDQmuyANsL7ka3zW/UC1tTuGIuiIfnqGdSzoRxf5XB64+ytu3MDM3FLXObz1oq4RMQogCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:46:49.205539Z"},"content_sha256":"5384801a5b7bcb0fb792792a4334dfa51c12de7fb8f2d4bef789235cf8217866","schema_version":"1.0","event_id":"sha256:5384801a5b7bcb0fb792792a4334dfa51c12de7fb8f2d4bef789235cf8217866"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IVGBILT7ZA4YSI6VDN3L62TFU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Plausible Deniability over Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Mayank Bakshi, Vinod Prabhakaran","submitted_at":"2016-01-25T17:02:38Z","abstract_excerpt":"In this paper, we introduce the notion of Plausible Deniability in an information theoretic framework. We consider a scenario where an entity that eavesdrops through a broadcast channel summons one of the parties in a communication protocol to reveal their message (or signal vector). It is desirable that the summoned party have enough freedom to produce a fake output that is likely plausible given the eavesdropper's observation. We examine three variants of this problem -- Message Deniability, Transmitter Deniability, and Receiver Deniability. In the first setting, the message sender is summon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06676","kind":"arxiv","version":3},"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:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYB0QDZuAJuFmeFnmhElfvuje2U48dohbx+jMaT94dJA9RMkc1P5z8Ic7W9VTfdFLEqB4zELpYFkb9kcvxiHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:46:49.206005Z"},"content_sha256":"ac6595bb3714f58bb4b8e7a69c689a9db86ea2fadf234c8b035cbc17e51fa111","schema_version":"1.0","event_id":"sha256:ac6595bb3714f58bb4b8e7a69c689a9db86ea2fadf234c8b035cbc17e51fa111"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVGBILT7ZA4YSI6VDN3L62TFU5/bundle.json","state_url":"https://pith.science/pith/IVGBILT7ZA4YSI6VDN3L62TFU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVGBILT7ZA4YSI6VDN3L62TFU5/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-23T17:46:49Z","links":{"resolver":"https://pith.science/pith/IVGBILT7ZA4YSI6VDN3L62TFU5","bundle":"https://pith.science/pith/IVGBILT7ZA4YSI6VDN3L62TFU5/bundle.json","state":"https://pith.science/pith/IVGBILT7ZA4YSI6VDN3L62TFU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVGBILT7ZA4YSI6VDN3L62TFU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IVGBILT7ZA4YSI6VDN3L62TFU5","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":"29130062d718916374528e60e4bceb9745e894fb58f6ad9fc0b9380b7104e1bd","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-25T17:02:38Z","title_canon_sha256":"0c29dc9dcb39d0febfbf0250132082042fa8174d6c836dfc91de8415ff83c0c5"},"schema_version":"1.0","source":{"id":"1601.06676","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06676","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06676v3","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06676","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"IVGBILT7ZA4Y","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IVGBILT7ZA4YSI6V","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IVGBILT7","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:ac6595bb3714f58bb4b8e7a69c689a9db86ea2fadf234c8b035cbc17e51fa111","target":"graph","created_at":"2026-05-18T00:44:33Z","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":"In this paper, we introduce the notion of Plausible Deniability in an information theoretic framework. We consider a scenario where an entity that eavesdrops through a broadcast channel summons one of the parties in a communication protocol to reveal their message (or signal vector). It is desirable that the summoned party have enough freedom to produce a fake output that is likely plausible given the eavesdropper's observation. We examine three variants of this problem -- Message Deniability, Transmitter Deniability, and Receiver Deniability. In the first setting, the message sender is summon","authors_text":"Mayank Bakshi, Vinod Prabhakaran","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-25T17:02:38Z","title":"Plausible Deniability over Broadcast Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06676","kind":"arxiv","version":3},"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:5384801a5b7bcb0fb792792a4334dfa51c12de7fb8f2d4bef789235cf8217866","target":"record","created_at":"2026-05-18T00:44:33Z","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":"29130062d718916374528e60e4bceb9745e894fb58f6ad9fc0b9380b7104e1bd","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-25T17:02:38Z","title_canon_sha256":"0c29dc9dcb39d0febfbf0250132082042fa8174d6c836dfc91de8415ff83c0c5"},"schema_version":"1.0","source":{"id":"1601.06676","kind":"arxiv","version":3}},"canonical_sha256":"454c142e7fc8398923d51b76bf6a65a747698fb0cceac4618b1be3adf75f67e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"454c142e7fc8398923d51b76bf6a65a747698fb0cceac4618b1be3adf75f67e2","first_computed_at":"2026-05-18T00:44:33.861620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:33.861620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FqhwR/VpTdWVa6/R4J20Hb3Kj8SisPV/nU9Qq8Mw2OAWJhhmLmssXTLbNMpJq7vo511vWDQSROCrtgN/P/H1Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:33.862104Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06676","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5384801a5b7bcb0fb792792a4334dfa51c12de7fb8f2d4bef789235cf8217866","sha256:ac6595bb3714f58bb4b8e7a69c689a9db86ea2fadf234c8b035cbc17e51fa111"],"state_sha256":"05d1bb2ca0d282a8e30a7de2d660d20fb6f010a448d82255acac1da7b5a77557"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/GZCecJA97InRmmsT1pSMDiefppvbrXsbuv080Z5pG5M4h3xt3RMlmkKwn7vUjRnlZkW0TsOO8SNdh9mcIdpBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:46:49.208577Z","bundle_sha256":"b732cf8c3b85fe6a54b105073cb6054d80563667adb69ad88aefcf345bb0fa28"}}