{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WFGRLWRYK3CHSA5CAUYBLAT7PF","short_pith_number":"pith:WFGRLWRY","schema_version":"1.0","canonical_sha256":"b14d15da3856c47903a2053015827f795499eeff63dd87646993588aeb665d18","source":{"kind":"arxiv","id":"1607.02014","version":2},"attestation_state":"computed","paper":{"title":"Computationally Efficient Covert Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mayank Bakshi, Qiaosheng Zhang, Sidharth Jaggi","submitted_at":"2016-07-07T13:49:43Z","abstract_excerpt":"In this paper, we design the first computationally efficient codes for simultaneously reliable and covert communication over Binary Symmetric Channels (BSCs). Our setting is as follows: a transmitter Alice wishes to potentially reliably transmit a message to a receiver Bob, while ensuring that the transmission taking place is covert with respect to an eavesdropper Willie (who hears Alice's transmission over a noisier BSC). Prior works show that Alice can reliably and covertly transmit O(\\sqrt{n}) bits over n channel uses without any shared secret between Alice and Bob. One drawback of prior wo"},"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":"1607.02014","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T13:49:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"916bce943605ae16527d0dcebd265584cb6c7e8e522abacdf2d9ce7228cf566d","abstract_canon_sha256":"5ed2cce7e40faccc8855f3654c825fb6971569d8af46f07df40a00b46dc38e80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:48.449102Z","signature_b64":"Klv6wfKqo3kULXycuzKtX8G26+GeW+L18slk+CxxgS7Tu2LZwxzs/oMO3ZgOwpoeNj7xyiDbeZOA3ZP8EYx4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b14d15da3856c47903a2053015827f795499eeff63dd87646993588aeb665d18","last_reissued_at":"2026-05-18T00:13:48.448237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:48.448237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computationally Efficient Covert Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mayank Bakshi, Qiaosheng Zhang, Sidharth Jaggi","submitted_at":"2016-07-07T13:49:43Z","abstract_excerpt":"In this paper, we design the first computationally efficient codes for simultaneously reliable and covert communication over Binary Symmetric Channels (BSCs). Our setting is as follows: a transmitter Alice wishes to potentially reliably transmit a message to a receiver Bob, while ensuring that the transmission taking place is covert with respect to an eavesdropper Willie (who hears Alice's transmission over a noisier BSC). Prior works show that Alice can reliably and covertly transmit O(\\sqrt{n}) bits over n channel uses without any shared secret between Alice and Bob. One drawback of prior wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02014","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":"1607.02014","created_at":"2026-05-18T00:13:48.448356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02014v2","created_at":"2026-05-18T00:13:48.448356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02014","created_at":"2026-05-18T00:13:48.448356+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFGRLWRYK3CH","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFGRLWRYK3CHSA5C","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFGRLWRY","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF","json":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF.json","graph_json":"https://pith.science/api/pith-number/WFGRLWRYK3CHSA5CAUYBLAT7PF/graph.json","events_json":"https://pith.science/api/pith-number/WFGRLWRYK3CHSA5CAUYBLAT7PF/events.json","paper":"https://pith.science/paper/WFGRLWRY"},"agent_actions":{"view_html":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF","download_json":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF.json","view_paper":"https://pith.science/paper/WFGRLWRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02014&json=true","fetch_graph":"https://pith.science/api/pith-number/WFGRLWRYK3CHSA5CAUYBLAT7PF/graph.json","fetch_events":"https://pith.science/api/pith-number/WFGRLWRYK3CHSA5CAUYBLAT7PF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF/action/storage_attestation","attest_author":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF/action/author_attestation","sign_citation":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF/action/citation_signature","submit_replication":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF/action/replication_record"}},"created_at":"2026-05-18T00:13:48.448356+00:00","updated_at":"2026-05-18T00:13:48.448356+00:00"}