{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MUHGI6XNKNOHA7ZMLEHPUTK5WR","short_pith_number":"pith:MUHGI6XN","schema_version":"1.0","canonical_sha256":"650e647aed535c707f2c590efa4d5db45f466683ed7912da12106352f6f1ebb9","source":{"kind":"arxiv","id":"1304.6693","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.6693","created_at":"2026-05-18T01:11:18.737409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6693v2","created_at":"2026-05-18T01:11:18.737409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6693","created_at":"2026-05-18T01:11:18.737409+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUHGI6XNKNOH","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUHGI6XNKNOHA7ZM","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUHGI6XN","created_at":"2026-05-18T12:27:52.871228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.04228","citing_title":"Fundamental limits of quantum-secure covert communication over bosonic channels","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR","json":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR.json","graph_json":"https://pith.science/api/pith-number/MUHGI6XNKNOHA7ZMLEHPUTK5WR/graph.json","events_json":"https://pith.science/api/pith-number/MUHGI6XNKNOHA7ZMLEHPUTK5WR/events.json","paper":"https://pith.science/paper/MUHGI6XN"},"agent_actions":{"view_html":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR","download_json":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR.json","view_paper":"https://pith.science/paper/MUHGI6XN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6693&json=true","fetch_graph":"https://pith.science/api/pith-number/MUHGI6XNKNOHA7ZMLEHPUTK5WR/graph.json","fetch_events":"https://pith.science/api/pith-number/MUHGI6XNKNOHA7ZMLEHPUTK5WR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR/action/storage_attestation","attest_author":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR/action/author_attestation","sign_citation":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR/action/citation_signature","submit_replication":"https://pith.science/pith/MUHGI6XNKNOHA7ZMLEHPUTK5WR/action/replication_record"}},"created_at":"2026-05-18T01:11:18.737409+00:00","updated_at":"2026-05-18T01:11:18.737409+00:00"}