{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7UEUNVUY57V2H2QH5LF4HFGGTO","short_pith_number":"pith:7UEUNVUY","schema_version":"1.0","canonical_sha256":"fd0946d698efeba3ea07eacbc394c69bb29cf10945c610a762df2589e02e6036","source":{"kind":"arxiv","id":"1906.06675","version":1},"attestation_state":"computed","paper":{"title":"Covert Communication Over a Compound Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Hossein Yassaee, Sadaf Salehkalaibar, Vincent Y. F. Tan","submitted_at":"2019-06-16T12:59:07Z","abstract_excerpt":"In this paper, we consider fundamental communication limits over a compound channel. Covert communication in the information-theoretic context has been primarily concerned with fundamental limits when the transmitter wishes to communicate to legitimate receiver(s) while ensuring that the communication is not detected by an adversary. This paper, however, considers an alternative, and no less important, setting in which the object to be masked is the state of the compound channel. Such a communication model has applications in the prevention of malicious parties seeking to jam the communication"},"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":"1906.06675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-16T12:59:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a1cd7512246b8c12c01a5a6727a31fe36798497be264f56412dfdf4172fa5007","abstract_canon_sha256":"a2d247789ba5520d1d0d190e901e5b796ec45ce5e6944a86546afbd1e3eedbf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:12.976645Z","signature_b64":"M+HaI2RG4EJ7RpPvub+n0LduC72OuFC9m8qomrgDhCuLp595LRzU9tYqZcSDF8DBHIsvYYgktOYk+QEPqXVgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd0946d698efeba3ea07eacbc394c69bb29cf10945c610a762df2589e02e6036","last_reissued_at":"2026-05-17T23:43:12.976188Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:12.976188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covert Communication Over a Compound Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Hossein Yassaee, Sadaf Salehkalaibar, Vincent Y. F. Tan","submitted_at":"2019-06-16T12:59:07Z","abstract_excerpt":"In this paper, we consider fundamental communication limits over a compound channel. Covert communication in the information-theoretic context has been primarily concerned with fundamental limits when the transmitter wishes to communicate to legitimate receiver(s) while ensuring that the communication is not detected by an adversary. This paper, however, considers an alternative, and no less important, setting in which the object to be masked is the state of the compound channel. Such a communication model has applications in the prevention of malicious parties seeking to jam the communication"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06675","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.06675","created_at":"2026-05-17T23:43:12.976269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.06675v1","created_at":"2026-05-17T23:43:12.976269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06675","created_at":"2026-05-17T23:43:12.976269+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UEUNVUY57V2","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UEUNVUY57V2H2QH","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UEUNVUY","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.13122","citing_title":"Conflict-Aware Robust Design for Covert Wireless Communications","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7UEUNVUY57V2H2QH5LF4HFGGTO","json":"https://pith.science/pith/7UEUNVUY57V2H2QH5LF4HFGGTO.json","graph_json":"https://pith.science/api/pith-number/7UEUNVUY57V2H2QH5LF4HFGGTO/graph.json","events_json":"https://pith.science/api/pith-number/7UEUNVUY57V2H2QH5LF4HFGGTO/events.json","paper":"https://pith.science/paper/7UEUNVUY"},"agent_actions":{"view_html":"https://pith.science/pith/7UEUNVUY57V2H2QH5LF4HFGGTO","download_json":"https://pith.science/pith/7UEUNVUY57V2H2QH5LF4HFGGTO.json","view_paper":"https://pith.science/paper/7UEUNVUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.06675&json=true","fetch_graph":"https://pith.science/api/pith-number/7UEUNVUY57V2H2QH5LF4HFGGTO/graph.json","fetch_events":"https://pith.science/api/pith-number/7UEUNVUY57V2H2QH5LF4HFGGTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UEUNVUY57V2H2QH5LF4HFGGTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UEUNVUY57V2H2QH5LF4HFGGTO/action/storage_attestation","attest_author":"https://pith.science/pith/7UEUNVUY57V2H2QH5LF4HFGGTO/action/author_attestation","sign_citation":"https://pith.science/pith/7UEUNVUY57V2H2QH5LF4HFGGTO/action/citation_signature","submit_replication":"https://pith.science/pith/7UEUNVUY57V2H2QH5LF4HFGGTO/action/replication_record"}},"created_at":"2026-05-17T23:43:12.976269+00:00","updated_at":"2026-05-17T23:43:12.976269+00:00"}