{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MUHGI6XNKNOHA7ZMLEHPUTK5WR","short_pith_number":"pith:MUHGI6XN","canonical_record":{"source":{"id":"1304.6693","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-24T18:34:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"43b20bdd076f6b6862dfb413d715ea547c4696e243212d575292093a0a82a702","abstract_canon_sha256":"569b2b2ef4a8bc4272d213245cf59aa39bbe8291dc53fa5005cccfd92dfbe052"},"schema_version":"1.0"},"canonical_sha256":"650e647aed535c707f2c590efa4d5db45f466683ed7912da12106352f6f1ebb9","source":{"kind":"arxiv","id":"1304.6693","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6693","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6693v2","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6693","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"MUHGI6XNKNOH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MUHGI6XNKNOHA7ZM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MUHGI6XN","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MUHGI6XNKNOHA7ZMLEHPUTK5WR","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6693","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-24T18:34:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"43b20bdd076f6b6862dfb413d715ea547c4696e243212d575292093a0a82a702","abstract_canon_sha256":"569b2b2ef4a8bc4272d213245cf59aa39bbe8291dc53fa5005cccfd92dfbe052"},"schema_version":"1.0"},"canonical_sha256":"650e647aed535c707f2c590efa4d5db45f466683ed7912da12106352f6f1ebb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:18.737859Z","signature_b64":"YXk71EOuigyTcEEkQZzgoMLmKHWK6O2VXxiB8DwZYo5zBLUxe+7oIElvfmFe/LG1TPTaC8y4vqHjbJ5dxDzzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"650e647aed535c707f2c590efa4d5db45f466683ed7912da12106352f6f1ebb9","last_reissued_at":"2026-05-18T01:11:18.737327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:18.737327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6693","source_version":2,"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:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gAl19UPYIklCUi/5kk/ubGG1jxA9BMWiHSmhEzpqJ+B7JRKc+oaCVWOIrpShhZQml7yLAoqKagb2aYL+J1XqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:02:43.720155Z"},"content_sha256":"656e78a0a735bb674ff4ceadeddf9edc73e00c6cc3086577b45fc7c22b743995","schema_version":"1.0","event_id":"sha256:656e78a0a735bb674ff4ceadeddf9edc73e00c6cc3086577b45fc7c22b743995"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MUHGI6XNKNOHA7ZMLEHPUTK5WR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reliable Deniable Communication: Hiding Messages in Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mayank Bakshi, Pak Hou Che, Sidharth Jaggi","submitted_at":"2013-04-24T18:34:28Z","abstract_excerpt":"A transmitter Alice may wish to reliably transmit a message to a receiver Bob over a binary symmetric channel (BSC), while simultaneously ensuring that her transmission is deniable from an eavesdropper Willie. That is, if Willie listening to Alice's transmissions over a \"significantly noisier\" BSC than the one to Bob, he should be unable to estimate even whether Alice is transmitting. We consider two scenarios. In our first scenario, we assume that the channel transition probability from Alice to Bob and Willie is perfectly known to all parties. Here, even when Alice's (potential) communicatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6693","kind":"arxiv","version":2},"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:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2h6GXn0K1qex2lSK168/gXpUZvFHd+kdjE7YpNF/30t35MddZjtvMR5a5wDEogbLlpMpH66EH/nFmBa/fWhQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:02:43.720880Z"},"content_sha256":"0b6b775d896b40b9ab0fe144dcc535d74194831e90680bf61ba5141349c429c1","schema_version":"1.0","event_id":"sha256:0b6b775d896b40b9ab0fe144dcc535d74194831e90680bf61ba5141349c429c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR/bundle.json","state_url":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR/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-25T14:02:43Z","links":{"resolver":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR","bundle":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR/bundle.json","state":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MUHGI6XNKNOHA7ZMLEHPUTK5WR","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":"569b2b2ef4a8bc4272d213245cf59aa39bbe8291dc53fa5005cccfd92dfbe052","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-24T18:34:28Z","title_canon_sha256":"43b20bdd076f6b6862dfb413d715ea547c4696e243212d575292093a0a82a702"},"schema_version":"1.0","source":{"id":"1304.6693","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6693","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6693v2","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6693","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"MUHGI6XNKNOH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MUHGI6XNKNOHA7ZM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MUHGI6XN","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:0b6b775d896b40b9ab0fe144dcc535d74194831e90680bf61ba5141349c429c1","target":"graph","created_at":"2026-05-18T01:11:18Z","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":"A transmitter Alice may wish to reliably transmit a message to a receiver Bob over a binary symmetric channel (BSC), while simultaneously ensuring that her transmission is deniable from an eavesdropper Willie. That is, if Willie listening to Alice's transmissions over a \"significantly noisier\" BSC than the one to Bob, he should be unable to estimate even whether Alice is transmitting. We consider two scenarios. In our first scenario, we assume that the channel transition probability from Alice to Bob and Willie is perfectly known to all parties. Here, even when Alice's (potential) communicatio","authors_text":"Mayank Bakshi, Pak Hou Che, Sidharth Jaggi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-24T18:34:28Z","title":"Reliable Deniable Communication: Hiding Messages in Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6693","kind":"arxiv","version":2},"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:656e78a0a735bb674ff4ceadeddf9edc73e00c6cc3086577b45fc7c22b743995","target":"record","created_at":"2026-05-18T01:11:18Z","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":"569b2b2ef4a8bc4272d213245cf59aa39bbe8291dc53fa5005cccfd92dfbe052","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-24T18:34:28Z","title_canon_sha256":"43b20bdd076f6b6862dfb413d715ea547c4696e243212d575292093a0a82a702"},"schema_version":"1.0","source":{"id":"1304.6693","kind":"arxiv","version":2}},"canonical_sha256":"650e647aed535c707f2c590efa4d5db45f466683ed7912da12106352f6f1ebb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"650e647aed535c707f2c590efa4d5db45f466683ed7912da12106352f6f1ebb9","first_computed_at":"2026-05-18T01:11:18.737327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:18.737327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YXk71EOuigyTcEEkQZzgoMLmKHWK6O2VXxiB8DwZYo5zBLUxe+7oIElvfmFe/LG1TPTaC8y4vqHjbJ5dxDzzDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:18.737859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6693","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:656e78a0a735bb674ff4ceadeddf9edc73e00c6cc3086577b45fc7c22b743995","sha256:0b6b775d896b40b9ab0fe144dcc535d74194831e90680bf61ba5141349c429c1"],"state_sha256":"5ba4de224000e3225ade316ac7808009a4c243e469ac01362df9e32bc00ef066"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdsqRLcAUipsEV1o9LeU089hz4OR5JjR/QxqUpxOFTqNwd6a7jFbtnCij6omDqJRdF1EVybpMoU4xFlGpJoQBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:02:43.724622Z","bundle_sha256":"6f2568e965462b6fcfb54d30723fa66545458875534ae0db1d6842da5322f76c"}}