{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WFGRLWRYK3CHSA5CAUYBLAT7PF","short_pith_number":"pith:WFGRLWRY","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"},"canonical_sha256":"b14d15da3856c47903a2053015827f795499eeff63dd87646993588aeb665d18","source":{"kind":"arxiv","id":"1607.02014","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02014","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02014v2","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02014","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"pith_short_12","alias_value":"WFGRLWRYK3CH","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WFGRLWRYK3CHSA5C","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WFGRLWRY","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WFGRLWRYK3CHSA5CAUYBLAT7PF","target":"record","payload":{"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"},"canonical_sha256":"b14d15da3856c47903a2053015827f795499eeff63dd87646993588aeb665d18","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"},"source_kind":"arxiv","source_id":"1607.02014","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-18T00:13:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iMgXR1HWHWDo7ZfSZDvO6CLHyTRan8pcgpFzRIhWKsrwNITxr/Lst6nImFAM36nAMsnkL6nIoQavg27VeAZrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:04:49.688841Z"},"content_sha256":"6c82e1f4d5c18ff840485d13deb629af2c3027f7d0e52246a43c9b139d5f1c7a","schema_version":"1.0","event_id":"sha256:6c82e1f4d5c18ff840485d13deb629af2c3027f7d0e52246a43c9b139d5f1c7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WFGRLWRYK3CHSA5CAUYBLAT7PF","target":"graph","payload":{"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"},"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:13:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nl8inD5ag2X1l56mmSmYe3enPxlIxkeHxe3dbDOB9Pm4NXnXwCl7UOLhTM8YN1eBNoo40bkH+d6jBUofu+MxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:04:49.689552Z"},"content_sha256":"866b070b0c751b37b8f09ae1441a43a47758edf65f0025535475b3b4af65aaf7","schema_version":"1.0","event_id":"sha256:866b070b0c751b37b8f09ae1441a43a47758edf65f0025535475b3b4af65aaf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF/bundle.json","state_url":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF/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-28T00:04:49Z","links":{"resolver":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF","bundle":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF/bundle.json","state":"https://pith.science/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WFGRLWRYK3CHSA5CAUYBLAT7PF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WFGRLWRYK3CHSA5CAUYBLAT7PF","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":"5ed2cce7e40faccc8855f3654c825fb6971569d8af46f07df40a00b46dc38e80","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T13:49:43Z","title_canon_sha256":"916bce943605ae16527d0dcebd265584cb6c7e8e522abacdf2d9ce7228cf566d"},"schema_version":"1.0","source":{"id":"1607.02014","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02014","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02014v2","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02014","created_at":"2026-05-18T00:13:48Z"},{"alias_kind":"pith_short_12","alias_value":"WFGRLWRYK3CH","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WFGRLWRYK3CHSA5C","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WFGRLWRY","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:866b070b0c751b37b8f09ae1441a43a47758edf65f0025535475b3b4af65aaf7","target":"graph","created_at":"2026-05-18T00:13:48Z","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 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","authors_text":"Mayank Bakshi, Qiaosheng Zhang, Sidharth Jaggi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T13:49:43Z","title":"Computationally Efficient Covert Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02014","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:6c82e1f4d5c18ff840485d13deb629af2c3027f7d0e52246a43c9b139d5f1c7a","target":"record","created_at":"2026-05-18T00:13:48Z","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":"5ed2cce7e40faccc8855f3654c825fb6971569d8af46f07df40a00b46dc38e80","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-07T13:49:43Z","title_canon_sha256":"916bce943605ae16527d0dcebd265584cb6c7e8e522abacdf2d9ce7228cf566d"},"schema_version":"1.0","source":{"id":"1607.02014","kind":"arxiv","version":2}},"canonical_sha256":"b14d15da3856c47903a2053015827f795499eeff63dd87646993588aeb665d18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b14d15da3856c47903a2053015827f795499eeff63dd87646993588aeb665d18","first_computed_at":"2026-05-18T00:13:48.448237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:48.448237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Klv6wfKqo3kULXycuzKtX8G26+GeW+L18slk+CxxgS7Tu2LZwxzs/oMO3ZgOwpoeNj7xyiDbeZOA3ZP8EYx4AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:48.449102Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02014","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c82e1f4d5c18ff840485d13deb629af2c3027f7d0e52246a43c9b139d5f1c7a","sha256:866b070b0c751b37b8f09ae1441a43a47758edf65f0025535475b3b4af65aaf7"],"state_sha256":"8cc9f830dac71dadb55b58c12deff589fd115c647aca3aa8ea36c06e77b74b25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CNVXd5sslYjTffgqLtJw+3F3SAFAT0ZFWNpobxX0NSEdc/CzD7QvUzl/6OSkOhpL16KWx+uj5SvB1TgU2qYrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:04:49.693063Z","bundle_sha256":"c8b0c16d7d59ef9a1f47dc93790befcc5eca3d4f12fc9d966cc47556285cf8e5"}}