{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FERY7R6QTBREGCGEVRZGZACQKV","short_pith_number":"pith:FERY7R6Q","schema_version":"1.0","canonical_sha256":"29238fc7d098624308c4ac726c8050556833d3d190f90e942ac2050e66138adc","source":{"kind":"arxiv","id":"1308.4572","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.4572","created_at":"2026-05-18T03:15:21.615875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4572v1","created_at":"2026-05-18T03:15:21.615875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4572","created_at":"2026-05-18T03:15:21.615875+00:00"},{"alias_kind":"pith_short_12","alias_value":"FERY7R6QTBRE","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FERY7R6QTBREGCGE","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FERY7R6Q","created_at":"2026-05-18T12:27:45.050594+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/FERY7R6QTBREGCGEVRZGZACQKV","json":"https://pith.science/pith/FERY7R6QTBREGCGEVRZGZACQKV.json","graph_json":"https://pith.science/api/pith-number/FERY7R6QTBREGCGEVRZGZACQKV/graph.json","events_json":"https://pith.science/api/pith-number/FERY7R6QTBREGCGEVRZGZACQKV/events.json","paper":"https://pith.science/paper/FERY7R6Q"},"agent_actions":{"view_html":"https://pith.science/pith/FERY7R6QTBREGCGEVRZGZACQKV","download_json":"https://pith.science/pith/FERY7R6QTBREGCGEVRZGZACQKV.json","view_paper":"https://pith.science/paper/FERY7R6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4572&json=true","fetch_graph":"https://pith.science/api/pith-number/FERY7R6QTBREGCGEVRZGZACQKV/graph.json","fetch_events":"https://pith.science/api/pith-number/FERY7R6QTBREGCGEVRZGZACQKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FERY7R6QTBREGCGEVRZGZACQKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FERY7R6QTBREGCGEVRZGZACQKV/action/storage_attestation","attest_author":"https://pith.science/pith/FERY7R6QTBREGCGEVRZGZACQKV/action/author_attestation","sign_citation":"https://pith.science/pith/FERY7R6QTBREGCGEVRZGZACQKV/action/citation_signature","submit_replication":"https://pith.science/pith/FERY7R6QTBREGCGEVRZGZACQKV/action/replication_record"}},"created_at":"2026-05-18T03:15:21.615875+00:00","updated_at":"2026-05-18T03:15:21.615875+00:00"}