{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ETIUXO7LMZUTVMGL2AZRMOVOUH","short_pith_number":"pith:ETIUXO7L","schema_version":"1.0","canonical_sha256":"24d14bbbeb66693ab0cbd033163aaea1c0a1a4b51763e8b887be427c35767032","source":{"kind":"arxiv","id":"1606.03242","version":2},"attestation_state":"computed","paper":{"title":"On Frame Asynchronous Coded Slotted ALOHA: Asymptotic, Finite Length, and Delay Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Erik Sandgren, Fredrik Br\\\"annstr\\\"om","submitted_at":"2016-06-10T09:26:05Z","abstract_excerpt":"We consider a frame asynchronous coded slotted ALOHA (FA-CSA) system for uncoordinated multiple access, where users join the system on a slot-by-slot basis according to a Poisson random process and, in contrast to standard frame synchronous CSA (FS-CSA), users are not frame-synchronized. We analyze the performance of FA-CSA in terms of packet loss rate and delay. In particular, we derive the (approximate) density evolution that characterizes the asymptotic performance of FA-CSA when the frame length goes to infinity. We show that, if the receiver can monitor the system before anyone starts tra"},"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":"1606.03242","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-10T09:26:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4d5f3cf36818660079f443f292509a7656853726d3fce30dd79470606d6d0951","abstract_canon_sha256":"d7b432c2775ac4a16207588eea58568b58da51f7d29a0be78c57107c67e0a284"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:37.829858Z","signature_b64":"B+NccmCdd1bZ23txp0ZHgfFBgG4rjwr2K7vyNScwRZZzvy1NQfz+r45aLVburzR9Q9uEvkWMtAFii48lUojeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24d14bbbeb66693ab0cbd033163aaea1c0a1a4b51763e8b887be427c35767032","last_reissued_at":"2026-05-18T00:56:37.829141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:37.829141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Frame Asynchronous Coded Slotted ALOHA: Asymptotic, Finite Length, and Delay Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Erik Sandgren, Fredrik Br\\\"annstr\\\"om","submitted_at":"2016-06-10T09:26:05Z","abstract_excerpt":"We consider a frame asynchronous coded slotted ALOHA (FA-CSA) system for uncoordinated multiple access, where users join the system on a slot-by-slot basis according to a Poisson random process and, in contrast to standard frame synchronous CSA (FS-CSA), users are not frame-synchronized. We analyze the performance of FA-CSA in terms of packet loss rate and delay. In particular, we derive the (approximate) density evolution that characterizes the asymptotic performance of FA-CSA when the frame length goes to infinity. We show that, if the receiver can monitor the system before anyone starts tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03242","kind":"arxiv","version":2},"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":"1606.03242","created_at":"2026-05-18T00:56:37.829258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03242v2","created_at":"2026-05-18T00:56:37.829258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03242","created_at":"2026-05-18T00:56:37.829258+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETIUXO7LMZUT","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETIUXO7LMZUTVMGL","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETIUXO7L","created_at":"2026-05-18T12:30:15.759754+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/ETIUXO7LMZUTVMGL2AZRMOVOUH","json":"https://pith.science/pith/ETIUXO7LMZUTVMGL2AZRMOVOUH.json","graph_json":"https://pith.science/api/pith-number/ETIUXO7LMZUTVMGL2AZRMOVOUH/graph.json","events_json":"https://pith.science/api/pith-number/ETIUXO7LMZUTVMGL2AZRMOVOUH/events.json","paper":"https://pith.science/paper/ETIUXO7L"},"agent_actions":{"view_html":"https://pith.science/pith/ETIUXO7LMZUTVMGL2AZRMOVOUH","download_json":"https://pith.science/pith/ETIUXO7LMZUTVMGL2AZRMOVOUH.json","view_paper":"https://pith.science/paper/ETIUXO7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03242&json=true","fetch_graph":"https://pith.science/api/pith-number/ETIUXO7LMZUTVMGL2AZRMOVOUH/graph.json","fetch_events":"https://pith.science/api/pith-number/ETIUXO7LMZUTVMGL2AZRMOVOUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETIUXO7LMZUTVMGL2AZRMOVOUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETIUXO7LMZUTVMGL2AZRMOVOUH/action/storage_attestation","attest_author":"https://pith.science/pith/ETIUXO7LMZUTVMGL2AZRMOVOUH/action/author_attestation","sign_citation":"https://pith.science/pith/ETIUXO7LMZUTVMGL2AZRMOVOUH/action/citation_signature","submit_replication":"https://pith.science/pith/ETIUXO7LMZUTVMGL2AZRMOVOUH/action/replication_record"}},"created_at":"2026-05-18T00:56:37.829258+00:00","updated_at":"2026-05-18T00:56:37.829258+00:00"}