{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:76Z7TJU3OYCYKEVTRXHEFYEJHJ","short_pith_number":"pith:76Z7TJU3","canonical_record":{"source":{"id":"1503.08778","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-30T18:27:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0215b1f82f06f8a379112bef04b1bd3d1e9adc74e27fa3d4b2ebb4a53a1740af","abstract_canon_sha256":"09f1d2deec6457d815e917a36b23cdb9d46d51c195b3b19796f5af7eeb3fb4c8"},"schema_version":"1.0"},"canonical_sha256":"ffb3f9a69b76058512b38dce42e0893a418d137b7b1de01b6579fc9a3be54af2","source":{"kind":"arxiv","id":"1503.08778","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08778","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08778v3","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08778","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"76Z7TJU3OYCY","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"76Z7TJU3OYCYKEVT","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"76Z7TJU3","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:76Z7TJU3OYCYKEVTRXHEFYEJHJ","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08778","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-30T18:27:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0215b1f82f06f8a379112bef04b1bd3d1e9adc74e27fa3d4b2ebb4a53a1740af","abstract_canon_sha256":"09f1d2deec6457d815e917a36b23cdb9d46d51c195b3b19796f5af7eeb3fb4c8"},"schema_version":"1.0"},"canonical_sha256":"ffb3f9a69b76058512b38dce42e0893a418d137b7b1de01b6579fc9a3be54af2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:50.851803Z","signature_b64":"tWrFoviTHXn6BtjmzobJ9W3yjxYtKswNwDsijecQmQFFxVHJDryUhSl7DMuCFl8PJCz3P8SULudmVbdx5XMJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffb3f9a69b76058512b38dce42e0893a418d137b7b1de01b6579fc9a3be54af2","last_reissued_at":"2026-05-18T00:57:50.851186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:50.851186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08778","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RcWQhR2eXYbS/VLNiy4zDeFsor1YzNA868IzskTGcqE2l/rMD9GB4YTqckvzdXBsml9g+xBF0bZCdSqpPEkIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:47:53.329188Z"},"content_sha256":"3d5f4cff853976f4940ce5ec16b37006234f6b553c65f58dfe1d44014c0b3656","schema_version":"1.0","event_id":"sha256:3d5f4cff853976f4940ce5ec16b37006234f6b553c65f58dfe1d44014c0b3656"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:76Z7TJU3OYCYKEVTRXHEFYEJHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covert Communication over Noisy Channels: A Resolvability Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Matthieu R. Bloch","submitted_at":"2015-03-30T18:27:44Z","abstract_excerpt":"We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals through another discrete memoryless channel. We develop a coding scheme based on the principle of channel resolvability, which generalizes and extends prior work in several directions. First, it shows that, irrespective of the quality of the channels, it is possible to communicate on the order of $\\sqrt{n}$ reliable and covert bits over $n$ channel uses if t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08778","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"opi9P/h+zTXE9plwzgihdge3PFu+nGquYlWFYWGy7MF7aBr8+oioOQepncdoX3PDTiVxGlO1ui/0XqKqopriBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:47:53.329802Z"},"content_sha256":"438e2a1e54957a23c248923eff298cae83cf18bdbafc08ee54df59f3fc0acc67","schema_version":"1.0","event_id":"sha256:438e2a1e54957a23c248923eff298cae83cf18bdbafc08ee54df59f3fc0acc67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76Z7TJU3OYCYKEVTRXHEFYEJHJ/bundle.json","state_url":"https://pith.science/pith/76Z7TJU3OYCYKEVTRXHEFYEJHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76Z7TJU3OYCYKEVTRXHEFYEJHJ/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-06T00:47:53Z","links":{"resolver":"https://pith.science/pith/76Z7TJU3OYCYKEVTRXHEFYEJHJ","bundle":"https://pith.science/pith/76Z7TJU3OYCYKEVTRXHEFYEJHJ/bundle.json","state":"https://pith.science/pith/76Z7TJU3OYCYKEVTRXHEFYEJHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76Z7TJU3OYCYKEVTRXHEFYEJHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:76Z7TJU3OYCYKEVTRXHEFYEJHJ","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":"09f1d2deec6457d815e917a36b23cdb9d46d51c195b3b19796f5af7eeb3fb4c8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-30T18:27:44Z","title_canon_sha256":"0215b1f82f06f8a379112bef04b1bd3d1e9adc74e27fa3d4b2ebb4a53a1740af"},"schema_version":"1.0","source":{"id":"1503.08778","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08778","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08778v3","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08778","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"76Z7TJU3OYCY","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"76Z7TJU3OYCYKEVT","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"76Z7TJU3","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:438e2a1e54957a23c248923eff298cae83cf18bdbafc08ee54df59f3fc0acc67","target":"graph","created_at":"2026-05-18T00:57:50Z","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":"We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals through another discrete memoryless channel. We develop a coding scheme based on the principle of channel resolvability, which generalizes and extends prior work in several directions. First, it shows that, irrespective of the quality of the channels, it is possible to communicate on the order of $\\sqrt{n}$ reliable and covert bits over $n$ channel uses if t","authors_text":"Matthieu R. Bloch","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-30T18:27:44Z","title":"Covert Communication over Noisy Channels: A Resolvability Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08778","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:3d5f4cff853976f4940ce5ec16b37006234f6b553c65f58dfe1d44014c0b3656","target":"record","created_at":"2026-05-18T00:57:50Z","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":"09f1d2deec6457d815e917a36b23cdb9d46d51c195b3b19796f5af7eeb3fb4c8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-30T18:27:44Z","title_canon_sha256":"0215b1f82f06f8a379112bef04b1bd3d1e9adc74e27fa3d4b2ebb4a53a1740af"},"schema_version":"1.0","source":{"id":"1503.08778","kind":"arxiv","version":3}},"canonical_sha256":"ffb3f9a69b76058512b38dce42e0893a418d137b7b1de01b6579fc9a3be54af2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffb3f9a69b76058512b38dce42e0893a418d137b7b1de01b6579fc9a3be54af2","first_computed_at":"2026-05-18T00:57:50.851186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:50.851186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tWrFoviTHXn6BtjmzobJ9W3yjxYtKswNwDsijecQmQFFxVHJDryUhSl7DMuCFl8PJCz3P8SULudmVbdx5XMJCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:50.851803Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08778","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d5f4cff853976f4940ce5ec16b37006234f6b553c65f58dfe1d44014c0b3656","sha256:438e2a1e54957a23c248923eff298cae83cf18bdbafc08ee54df59f3fc0acc67"],"state_sha256":"7266d7aea03140c34be3fbf550e5d617741866020248c87e7dcf3043ab5d46d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tinE9LtMZ/XjduL4J5+ghUAObnH8XYduV+jgMargkn84zqSXLF/6QqLVPEz/Csv1N7WUAQ+/cHbWBmav8JDoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T00:47:53.333045Z","bundle_sha256":"65285f8bfccad1221844edc7e4aa09e9442e4acf6dfcdaba017e256c6e2671c4"}}