{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LMRNL3MNK2YTFDM2I4OMHGNURV","short_pith_number":"pith:LMRNL3MN","schema_version":"1.0","canonical_sha256":"5b22d5ed8d56b1328d9a471cc399b48d79bafe25a68f6c314f249e119d1f2068","source":{"kind":"arxiv","id":"1701.08783","version":4},"attestation_state":"computed","paper":{"title":"On the Capacity of the Slotted Strongly Asynchronous Channel with a Bursty User","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Natasha Devroye, Sara Shahi","submitted_at":"2017-01-30T19:06:37Z","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 "},"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":"1701.08783","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-30T19:06:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d0740aef3dfc9d08f0afd408d25ff06909f9c6e799c989751e0dedabc89caf7","abstract_canon_sha256":"2bd7c007d4f20286586ee6cc1dcf60bf3894891cf5f4602265710836a2214b1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:47.944116Z","signature_b64":"TjbhBT569XmX+mX7BEDk+YVvXslctvjACpKzn3P9VTfd3oCrRorkYTc+EeXgiLulvGxIA64XiaQb8AAvO9KdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b22d5ed8d56b1328d9a471cc399b48d79bafe25a68f6c314f249e119d1f2068","last_reissued_at":"2026-05-18T00:09:47.943518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:47.943518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Capacity of the Slotted Strongly Asynchronous Channel with a Bursty User","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Natasha Devroye, Sara Shahi","submitted_at":"2017-01-30T19:06:37Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08783","kind":"arxiv","version":4},"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":"1701.08783","created_at":"2026-05-18T00:09:47.943608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08783v4","created_at":"2026-05-18T00:09:47.943608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08783","created_at":"2026-05-18T00:09:47.943608+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMRNL3MNK2YT","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMRNL3MNK2YTFDM2","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMRNL3MN","created_at":"2026-05-18T12:31:28.150371+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/LMRNL3MNK2YTFDM2I4OMHGNURV","json":"https://pith.science/pith/LMRNL3MNK2YTFDM2I4OMHGNURV.json","graph_json":"https://pith.science/api/pith-number/LMRNL3MNK2YTFDM2I4OMHGNURV/graph.json","events_json":"https://pith.science/api/pith-number/LMRNL3MNK2YTFDM2I4OMHGNURV/events.json","paper":"https://pith.science/paper/LMRNL3MN"},"agent_actions":{"view_html":"https://pith.science/pith/LMRNL3MNK2YTFDM2I4OMHGNURV","download_json":"https://pith.science/pith/LMRNL3MNK2YTFDM2I4OMHGNURV.json","view_paper":"https://pith.science/paper/LMRNL3MN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08783&json=true","fetch_graph":"https://pith.science/api/pith-number/LMRNL3MNK2YTFDM2I4OMHGNURV/graph.json","fetch_events":"https://pith.science/api/pith-number/LMRNL3MNK2YTFDM2I4OMHGNURV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMRNL3MNK2YTFDM2I4OMHGNURV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMRNL3MNK2YTFDM2I4OMHGNURV/action/storage_attestation","attest_author":"https://pith.science/pith/LMRNL3MNK2YTFDM2I4OMHGNURV/action/author_attestation","sign_citation":"https://pith.science/pith/LMRNL3MNK2YTFDM2I4OMHGNURV/action/citation_signature","submit_replication":"https://pith.science/pith/LMRNL3MNK2YTFDM2I4OMHGNURV/action/replication_record"}},"created_at":"2026-05-18T00:09:47.943608+00:00","updated_at":"2026-05-18T00:09:47.943608+00:00"}