{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KEVGAD5LNJ46YEAWTAIT4ILBF4","short_pith_number":"pith:KEVGAD5L","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"},"canonical_sha256":"512a600fab6a79ec101698113e21612f2ce305a4c359f24c3a10cb9617ae16d1","source":{"kind":"arxiv","id":"1509.01806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01806","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01806v1","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01806","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"pith_short_12","alias_value":"KEVGAD5LNJ46","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KEVGAD5LNJ46YEAW","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KEVGAD5L","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KEVGAD5LNJ46YEAWTAIT4ILBF4","target":"record","payload":{"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"},"canonical_sha256":"512a600fab6a79ec101698113e21612f2ce305a4c359f24c3a10cb9617ae16d1","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"},"source_kind":"arxiv","source_id":"1509.01806","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-18T01:33:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y+OvAgzcMFXNWM6tNRxDNOcN3CtSq0BAG06AZMnygmzZMD9yW6hj09KiqCmmWC6EMmbPgMU9C1q5TRDUNt3oBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:30:38.722383Z"},"content_sha256":"3bab40e06197ef7122685b52abe09b0e2c655ea079430369398b42893ba4b674","schema_version":"1.0","event_id":"sha256:3bab40e06197ef7122685b52abe09b0e2c655ea079430369398b42893ba4b674"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KEVGAD5LNJ46YEAWTAIT4ILBF4","target":"graph","payload":{"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"},"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-18T01:33:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4I4wB1D4Eehliig7/RRvrJTIhftMIyH6Nc1rE7ZfpNWBxlDPeOgxoYlIaRAMIApMJVv4VYCEmlnAkrHfdf8ACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:30:38.722741Z"},"content_sha256":"9803e2fd35ed6a56190120fa7ead4561c986b166925bdc86afb49c7871b07c83","schema_version":"1.0","event_id":"sha256:9803e2fd35ed6a56190120fa7ead4561c986b166925bdc86afb49c7871b07c83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4/bundle.json","state_url":"https://pith.science/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4/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-01T10:30:38Z","links":{"resolver":"https://pith.science/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4","bundle":"https://pith.science/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4/bundle.json","state":"https://pith.science/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEVGAD5LNJ46YEAWTAIT4ILBF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KEVGAD5LNJ46YEAWTAIT4ILBF4","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":"ab733e980fa8f0d2babebc6f0ad4b557e2ab44fde874aa06a812b45efb1b4eaf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-06T13:07:03Z","title_canon_sha256":"8b6e696a031b612ed1e2b9ddf72b5a7d4b2188445d32655c396fd265682105e0"},"schema_version":"1.0","source":{"id":"1509.01806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01806","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01806v1","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01806","created_at":"2026-05-18T01:33:50Z"},{"alias_kind":"pith_short_12","alias_value":"KEVGAD5LNJ46","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KEVGAD5LNJ46YEAW","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KEVGAD5L","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:9803e2fd35ed6a56190120fa7ead4561c986b166925bdc86afb49c7871b07c83","target":"graph","created_at":"2026-05-18T01:33: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 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","authors_text":"Neri Merhav, Nir Weinberger","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-06T13:07:03Z","title":"Channel Detection in Coded Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01806","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:3bab40e06197ef7122685b52abe09b0e2c655ea079430369398b42893ba4b674","target":"record","created_at":"2026-05-18T01:33: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":"ab733e980fa8f0d2babebc6f0ad4b557e2ab44fde874aa06a812b45efb1b4eaf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-06T13:07:03Z","title_canon_sha256":"8b6e696a031b612ed1e2b9ddf72b5a7d4b2188445d32655c396fd265682105e0"},"schema_version":"1.0","source":{"id":"1509.01806","kind":"arxiv","version":1}},"canonical_sha256":"512a600fab6a79ec101698113e21612f2ce305a4c359f24c3a10cb9617ae16d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"512a600fab6a79ec101698113e21612f2ce305a4c359f24c3a10cb9617ae16d1","first_computed_at":"2026-05-18T01:33:50.502768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:50.502768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X/qz2OF2GQRyWgN191tNmYDi/VglFon/esc0n4UdVbwiNyffyY7eMpmqBPz9r8fgBuT/qerpSIO0frZzy3FkDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:50.503414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bab40e06197ef7122685b52abe09b0e2c655ea079430369398b42893ba4b674","sha256:9803e2fd35ed6a56190120fa7ead4561c986b166925bdc86afb49c7871b07c83"],"state_sha256":"a4220857fa829122336367dac57b6096d5b084bf8e4a5698e77e591addc58a96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4EA8t+MAEX+oY5vVs6/0xY2jbdDGKWn7bCxROzX214kUmV+Ha9a4LEgKDvo0lnVA3lGnrBHbsYQjGouha2+6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:30:38.724727Z","bundle_sha256":"4add969b1e567b6b95f8be43e831f8ea3a58853810f743849944c08e658b6702"}}