{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LMRNL3MNK2YTFDM2I4OMHGNURV","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":"2bd7c007d4f20286586ee6cc1dcf60bf3894891cf5f4602265710836a2214b1c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T19:06:37Z","title_canon_sha256":"1d0740aef3dfc9d08f0afd408d25ff06909f9c6e799c989751e0dedabc89caf7"},"schema_version":"1.0","source":{"id":"1701.08783","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08783","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08783v4","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08783","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"LMRNL3MNK2YT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LMRNL3MNK2YTFDM2","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LMRNL3MN","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:994f56f7af1b678f6c48c80f6b359dcbe0c0af363f4304c8a85b76e404e9b400","target":"graph","created_at":"2026-05-18T00:09:47Z","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":"In this paper, the trade-off between the number of transmissions (or burstiness) $K_n=e^{n\\nu}$ of a user, the asynchronism level $A_n=e^{n\\alpha}$ in a slotted strongly asynchronous channel, and the ability to distinguish $M_n=e^{nR}$ messages per transmission with vanishingly error probability is investigated in the asymptotic regime as blocklength $n$ goes to infinity. The receiver must locate and decode, with vanishing error probability in $n$, all of the transmitted messages. Achievability and converse bounds on the trade-off among $(R,\\alpha,\\nu)$ is derived. For cases where $\\nu=0$ and ","authors_text":"Daniela Tuninetti, Natasha Devroye, Sara Shahi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T19:06:37Z","title":"On the Capacity of the Slotted Strongly Asynchronous Channel with a Bursty User"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08783","kind":"arxiv","version":4},"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:b72684e31273bee336dd211096af4d68b4d2827764eef709104c2e76d4dadd11","target":"record","created_at":"2026-05-18T00:09:47Z","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":"2bd7c007d4f20286586ee6cc1dcf60bf3894891cf5f4602265710836a2214b1c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T19:06:37Z","title_canon_sha256":"1d0740aef3dfc9d08f0afd408d25ff06909f9c6e799c989751e0dedabc89caf7"},"schema_version":"1.0","source":{"id":"1701.08783","kind":"arxiv","version":4}},"canonical_sha256":"5b22d5ed8d56b1328d9a471cc399b48d79bafe25a68f6c314f249e119d1f2068","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b22d5ed8d56b1328d9a471cc399b48d79bafe25a68f6c314f249e119d1f2068","first_computed_at":"2026-05-18T00:09:47.943518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:47.943518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TjbhBT569XmX+mX7BEDk+YVvXslctvjACpKzn3P9VTfd3oCrRorkYTc+EeXgiLulvGxIA64XiaQb8AAvO9KdAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:47.944116Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08783","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b72684e31273bee336dd211096af4d68b4d2827764eef709104c2e76d4dadd11","sha256:994f56f7af1b678f6c48c80f6b359dcbe0c0af363f4304c8a85b76e404e9b400"],"state_sha256":"d5b8cb191b3fd891933dce8652ca1cd08e49c70cb93bdea23f258ebf209a357d"}