{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KEVGAD5LNJ46YEAWTAIT4ILBF4","short_pith_number":"pith:KEVGAD5L","schema_version":"1.0","canonical_sha256":"512a600fab6a79ec101698113e21612f2ce305a4c359f24c3a10cb9617ae16d1","source":{"kind":"arxiv","id":"1509.01806","version":1},"attestation_state":"computed","paper":{"title":"Channel Detection in Coded Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav, Nir Weinberger","submitted_at":"2015-09-06T13:07:03Z","abstract_excerpt":"We consider the problem of block-coded communication, where in each block, the channel law belongs to one of two disjoint sets. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to detect the set which contains the prevailing channel. We begin with the simplified case where each of the sets is a singleton. For any given code, we derive the optimum detection/decoding rule in the sense of the best trade-off among the probabilities of decoding error, false alarm, and misdetection, and also introduce sub-optimal detection/decoding rules w"},"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":"1509.01806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-06T13:07:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8b6e696a031b612ed1e2b9ddf72b5a7d4b2188445d32655c396fd265682105e0","abstract_canon_sha256":"ab733e980fa8f0d2babebc6f0ad4b557e2ab44fde874aa06a812b45efb1b4eaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:50.503414Z","signature_b64":"X/qz2OF2GQRyWgN191tNmYDi/VglFon/esc0n4UdVbwiNyffyY7eMpmqBPz9r8fgBuT/qerpSIO0frZzy3FkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"512a600fab6a79ec101698113e21612f2ce305a4c359f24c3a10cb9617ae16d1","last_reissued_at":"2026-05-18T01:33:50.502768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:50.502768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Channel Detection in Coded Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav, Nir Weinberger","submitted_at":"2015-09-06T13:07:03Z","abstract_excerpt":"We consider the problem of block-coded communication, where in each block, the channel law belongs to one of two disjoint sets. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to detect the set which contains the prevailing channel. We begin with the simplified case where each of the sets is a singleton. For any given code, we derive the optimum detection/decoding rule in the sense of the best trade-off among the probabilities of decoding error, false alarm, and misdetection, and also introduce sub-optimal detection/decoding rules w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01806","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":"1509.01806","created_at":"2026-05-18T01:33:50.502855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01806v1","created_at":"2026-05-18T01:33:50.502855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01806","created_at":"2026-05-18T01:33:50.502855+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEVGAD5LNJ46","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEVGAD5LNJ46YEAW","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEVGAD5L","created_at":"2026-05-18T12:29:27.538025+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/KEVGAD5LNJ46YEAWTAIT4ILBF4","json":"https://pith.science/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4.json","graph_json":"https://pith.science/api/pith-number/KEVGAD5LNJ46YEAWTAIT4ILBF4/graph.json","events_json":"https://pith.science/api/pith-number/KEVGAD5LNJ46YEAWTAIT4ILBF4/events.json","paper":"https://pith.science/paper/KEVGAD5L"},"agent_actions":{"view_html":"https://pith.science/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4","download_json":"https://pith.science/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4.json","view_paper":"https://pith.science/paper/KEVGAD5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01806&json=true","fetch_graph":"https://pith.science/api/pith-number/KEVGAD5LNJ46YEAWTAIT4ILBF4/graph.json","fetch_events":"https://pith.science/api/pith-number/KEVGAD5LNJ46YEAWTAIT4ILBF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4/action/storage_attestation","attest_author":"https://pith.science/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4/action/author_attestation","sign_citation":"https://pith.science/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4/action/citation_signature","submit_replication":"https://pith.science/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4/action/replication_record"}},"created_at":"2026-05-18T01:33:50.502855+00:00","updated_at":"2026-05-18T01:33:50.502855+00:00"}