{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LYC7RABXK34LGI6WGVDOODMRI4","short_pith_number":"pith:LYC7RABX","canonical_record":{"source":{"id":"1808.09556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-28T22:16:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dcebd5fac65b6524f4866c8fe32cddac4900bf0e0da8b795e5653a560b44c964","abstract_canon_sha256":"3396ef27f9eda9a6aec96cd0cff58b541f437fa278c4ee3905faf99a11fde3bc"},"schema_version":"1.0"},"canonical_sha256":"5e05f8803756f8b323d63546e70d91473646c8b4ae3bccbb5f358f31d5e1e489","source":{"kind":"arxiv","id":"1808.09556","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09556","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09556v1","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09556","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"pith_short_12","alias_value":"LYC7RABXK34L","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LYC7RABXK34LGI6W","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LYC7RABX","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LYC7RABXK34LGI6WGVDOODMRI4","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-28T22:16:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dcebd5fac65b6524f4866c8fe32cddac4900bf0e0da8b795e5653a560b44c964","abstract_canon_sha256":"3396ef27f9eda9a6aec96cd0cff58b541f437fa278c4ee3905faf99a11fde3bc"},"schema_version":"1.0"},"canonical_sha256":"5e05f8803756f8b323d63546e70d91473646c8b4ae3bccbb5f358f31d5e1e489","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:55.208457Z","signature_b64":"Wp8Y2f0nU7DHsc/cHR62Bz4HwKntoV4djiZMvWxlu1h5KlbU4d1cc9qaOvNpqmxERlui6D6hA8JsQCR95ZqhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e05f8803756f8b323d63546e70d91473646c8b4ae3bccbb5f358f31d5e1e489","last_reissued_at":"2026-05-18T00:06:55.207813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:55.207813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09556","source_version":1,"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:06:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6tiRXunjaUIyhBhWnh3h2tDBm1qPDSv4ueMhDsvoYsAFhkObtm4Q56TlWVj7VQRn3zTFpCQhYCFxt7bEdC27Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:42:09.630600Z"},"content_sha256":"fbd403336c444321cf99d45f3ecbd8042f3e75018ef3ff32455acce9e104ff71","schema_version":"1.0","event_id":"sha256:fbd403336c444321cf99d45f3ecbd8042f3e75018ef3ff32455acce9e104ff71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LYC7RABXK34LGI6WGVDOODMRI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Embedding Covert Information in Broadcast Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Keerthi Suria Kumar Arumugam, Matthieu R. Bloch","submitted_at":"2018-08-28T22:16:47Z","abstract_excerpt":"We analyze a two-receiver binary-input discrete memoryless broadcast channel, in which the transmitter communicates a common message simultaneously to both receivers and a covert message to only one of them. The unintended recipient of the covert message is treated as an adversary who attempts to detect the covert transmission. This model captures the problem of embedding covert messages in an innocent codebook and generalizes previous covert communication models in which the innocent behavior corresponds to the absence of communication between legitimate users. We identify the exact asymptoti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09556","kind":"arxiv","version":1},"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:06:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kZtkCU4fHaUgOjvg3yPF3YXRVdbMVEfL1IFY5HsYTi0Tjsb9l3FerWkBv/VjxNNLJT49NYd7BQ5OwEKbndBYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:42:09.630941Z"},"content_sha256":"f256d8e0ab4fc414a91e96b35de30603d58db2f0d6f474310ab248ec94d865bd","schema_version":"1.0","event_id":"sha256:f256d8e0ab4fc414a91e96b35de30603d58db2f0d6f474310ab248ec94d865bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LYC7RABXK34LGI6WGVDOODMRI4/bundle.json","state_url":"https://pith.science/pith/LYC7RABXK34LGI6WGVDOODMRI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LYC7RABXK34LGI6WGVDOODMRI4/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-02T22:42:09Z","links":{"resolver":"https://pith.science/pith/LYC7RABXK34LGI6WGVDOODMRI4","bundle":"https://pith.science/pith/LYC7RABXK34LGI6WGVDOODMRI4/bundle.json","state":"https://pith.science/pith/LYC7RABXK34LGI6WGVDOODMRI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LYC7RABXK34LGI6WGVDOODMRI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LYC7RABXK34LGI6WGVDOODMRI4","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":"3396ef27f9eda9a6aec96cd0cff58b541f437fa278c4ee3905faf99a11fde3bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-28T22:16:47Z","title_canon_sha256":"dcebd5fac65b6524f4866c8fe32cddac4900bf0e0da8b795e5653a560b44c964"},"schema_version":"1.0","source":{"id":"1808.09556","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09556","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09556v1","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09556","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"pith_short_12","alias_value":"LYC7RABXK34L","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LYC7RABXK34LGI6W","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LYC7RABX","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:f256d8e0ab4fc414a91e96b35de30603d58db2f0d6f474310ab248ec94d865bd","target":"graph","created_at":"2026-05-18T00:06:55Z","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 analyze a two-receiver binary-input discrete memoryless broadcast channel, in which the transmitter communicates a common message simultaneously to both receivers and a covert message to only one of them. The unintended recipient of the covert message is treated as an adversary who attempts to detect the covert transmission. This model captures the problem of embedding covert messages in an innocent codebook and generalizes previous covert communication models in which the innocent behavior corresponds to the absence of communication between legitimate users. We identify the exact asymptoti","authors_text":"Keerthi Suria Kumar Arumugam, Matthieu R. Bloch","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-28T22:16:47Z","title":"Embedding Covert Information in Broadcast Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09556","kind":"arxiv","version":1},"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:fbd403336c444321cf99d45f3ecbd8042f3e75018ef3ff32455acce9e104ff71","target":"record","created_at":"2026-05-18T00:06:55Z","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":"3396ef27f9eda9a6aec96cd0cff58b541f437fa278c4ee3905faf99a11fde3bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-28T22:16:47Z","title_canon_sha256":"dcebd5fac65b6524f4866c8fe32cddac4900bf0e0da8b795e5653a560b44c964"},"schema_version":"1.0","source":{"id":"1808.09556","kind":"arxiv","version":1}},"canonical_sha256":"5e05f8803756f8b323d63546e70d91473646c8b4ae3bccbb5f358f31d5e1e489","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e05f8803756f8b323d63546e70d91473646c8b4ae3bccbb5f358f31d5e1e489","first_computed_at":"2026-05-18T00:06:55.207813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:55.207813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wp8Y2f0nU7DHsc/cHR62Bz4HwKntoV4djiZMvWxlu1h5KlbU4d1cc9qaOvNpqmxERlui6D6hA8JsQCR95ZqhCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:55.208457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09556","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbd403336c444321cf99d45f3ecbd8042f3e75018ef3ff32455acce9e104ff71","sha256:f256d8e0ab4fc414a91e96b35de30603d58db2f0d6f474310ab248ec94d865bd"],"state_sha256":"4639cd6535037ccdda756574a24b341be664c6d4ceb032ca2c37cf40d7e9f2e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kMO2Fv9fBvrI4SoDn9PSU48qKn+d5UE6wLCgyN/mV5Ucy+ZX27JvgLoTMx9p/f7ERUxtT01R876g4n6CkQEoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:42:09.632916Z","bundle_sha256":"7b10d5cd4f57851b4dc13b04213b9032737ff79cab10d691a3050086e5c1cabf"}}