{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FERY7R6QTBREGCGEVRZGZACQKV","short_pith_number":"pith:FERY7R6Q","canonical_record":{"source":{"id":"1308.4572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-21T13:37:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"84e3fbf204ed637d5600bd786acb6880e02a5b7af70cdbbad4a6c5c38a235de2","abstract_canon_sha256":"65bba39756a282fc5ee260e002346e8e6aeeaf9e12323e8b335094d52298a342"},"schema_version":"1.0"},"canonical_sha256":"29238fc7d098624308c4ac726c8050556833d3d190f90e942ac2050e66138adc","source":{"kind":"arxiv","id":"1308.4572","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4572","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4572v1","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4572","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"FERY7R6QTBRE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FERY7R6QTBREGCGE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FERY7R6Q","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FERY7R6QTBREGCGEVRZGZACQKV","target":"record","payload":{"canonical_record":{"source":{"id":"1308.4572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-21T13:37:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"84e3fbf204ed637d5600bd786acb6880e02a5b7af70cdbbad4a6c5c38a235de2","abstract_canon_sha256":"65bba39756a282fc5ee260e002346e8e6aeeaf9e12323e8b335094d52298a342"},"schema_version":"1.0"},"canonical_sha256":"29238fc7d098624308c4ac726c8050556833d3d190f90e942ac2050e66138adc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:21.616549Z","signature_b64":"3km0kfamLVnUcjPp9ApZSAxepsE8amizcQ0BIbPzcpTUdKenB46tkJVLIYnEXmGj3VI9rvpBfn8aRg6qjK7HBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29238fc7d098624308c4ac726c8050556833d3d190f90e942ac2050e66138adc","last_reissued_at":"2026-05-18T03:15:21.615739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:21.615739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.4572","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-18T03:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5N+nbt9lFUI2Yi+Bxv336WYYomaqaHBOt2KvjH/MU6zX2snzd6NmzVChy33J2NAS4Nyv6cRnQnJhZ6d3ZaMqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:17:42.240979Z"},"content_sha256":"9bb0c83b8705477fe73bb8260b94877e8694e488f8cead9d3fa1b06beb202188","schema_version":"1.0","event_id":"sha256:9bb0c83b8705477fe73bb8260b94877e8694e488f8cead9d3fa1b06beb202188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FERY7R6QTBREGCGEVRZGZACQKV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Codeword or noise? Exact random coding exponents for slotted asynchronism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2013-08-21T13:37:33Z","abstract_excerpt":"We consider the problem of slotted asynchronous coded communication, where in each time frame (slot), the transmitter is either silent or transmits a codeword from a given (randomly selected) codebook. The task of the decoder is to decide whether transmission has taken place, and if so, to decode the message. 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. For this detection/decoding rule, we then derive single-letter characterizations of the exact exponential rates of these three probabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4572","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-18T03:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qGfWMFs0Xqn83oAaCg2TV98cI34cNvPxAuGe8ecJg75BUBqd4Dwa35NJCjU1SO5E1+2fB/eQF/zbVC7FIjw7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:17:42.241338Z"},"content_sha256":"a4312263f707166ecc1cd4f9da5263aa92ceb9aaf6017f8ee7f246bedb305721","schema_version":"1.0","event_id":"sha256:a4312263f707166ecc1cd4f9da5263aa92ceb9aaf6017f8ee7f246bedb305721"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FERY7R6QTBREGCGEVRZGZACQKV/bundle.json","state_url":"https://pith.science/pith/FERY7R6QTBREGCGEVRZGZACQKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FERY7R6QTBREGCGEVRZGZACQKV/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-05-28T02:17:42Z","links":{"resolver":"https://pith.science/pith/FERY7R6QTBREGCGEVRZGZACQKV","bundle":"https://pith.science/pith/FERY7R6QTBREGCGEVRZGZACQKV/bundle.json","state":"https://pith.science/pith/FERY7R6QTBREGCGEVRZGZACQKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FERY7R6QTBREGCGEVRZGZACQKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FERY7R6QTBREGCGEVRZGZACQKV","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":"65bba39756a282fc5ee260e002346e8e6aeeaf9e12323e8b335094d52298a342","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-21T13:37:33Z","title_canon_sha256":"84e3fbf204ed637d5600bd786acb6880e02a5b7af70cdbbad4a6c5c38a235de2"},"schema_version":"1.0","source":{"id":"1308.4572","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4572","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4572v1","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4572","created_at":"2026-05-18T03:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"FERY7R6QTBRE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FERY7R6QTBREGCGE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FERY7R6Q","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:a4312263f707166ecc1cd4f9da5263aa92ceb9aaf6017f8ee7f246bedb305721","target":"graph","created_at":"2026-05-18T03:15:21Z","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 slotted asynchronous coded communication, where in each time frame (slot), the transmitter is either silent or transmits a codeword from a given (randomly selected) codebook. The task of the decoder is to decide whether transmission has taken place, and if so, to decode the message. 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. For this detection/decoding rule, we then derive single-letter characterizations of the exact exponential rates of these three probabi","authors_text":"Neri Merhav","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-21T13:37:33Z","title":"Codeword or noise? Exact random coding exponents for slotted asynchronism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4572","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:9bb0c83b8705477fe73bb8260b94877e8694e488f8cead9d3fa1b06beb202188","target":"record","created_at":"2026-05-18T03:15:21Z","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":"65bba39756a282fc5ee260e002346e8e6aeeaf9e12323e8b335094d52298a342","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-21T13:37:33Z","title_canon_sha256":"84e3fbf204ed637d5600bd786acb6880e02a5b7af70cdbbad4a6c5c38a235de2"},"schema_version":"1.0","source":{"id":"1308.4572","kind":"arxiv","version":1}},"canonical_sha256":"29238fc7d098624308c4ac726c8050556833d3d190f90e942ac2050e66138adc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29238fc7d098624308c4ac726c8050556833d3d190f90e942ac2050e66138adc","first_computed_at":"2026-05-18T03:15:21.615739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:21.615739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3km0kfamLVnUcjPp9ApZSAxepsE8amizcQ0BIbPzcpTUdKenB46tkJVLIYnEXmGj3VI9rvpBfn8aRg6qjK7HBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:21.616549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4572","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bb0c83b8705477fe73bb8260b94877e8694e488f8cead9d3fa1b06beb202188","sha256:a4312263f707166ecc1cd4f9da5263aa92ceb9aaf6017f8ee7f246bedb305721"],"state_sha256":"2ab8661ccdcd843036cb115ec76115691c05f9dad3b2d925d170bfc7a0fd9bdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3LTIKQcarZ9JNuoquQufUo94+plJZPmtqBnCP2Pa9RG/iP/Q4csnxRpmTVb2yWVR1Ixjj01VB+rWDj2URSfQCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:17:42.243265Z","bundle_sha256":"4333b2787cb425a5be48377c9bbfc4ee068ca2ca723451ed86aaa78c28524303"}}