{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EHUH7R73JKTFWUDGG375XDN6M3","short_pith_number":"pith:EHUH7R73","schema_version":"1.0","canonical_sha256":"21e87fc7fb4aa65b506636ffdb8dbe66d810fc666327d53f4d2ff05e0233e3cb","source":{"kind":"arxiv","id":"1205.3317","version":1},"attestation_state":"computed","paper":{"title":"Spatially-Coupled Random Access on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Enrico Paolini, Gianluigi Liva, Marco Chiani, Michael Lentmaier","submitted_at":"2012-05-15T10:39:06Z","abstract_excerpt":"In this paper we investigate the effect of spatial coupling applied to the recently-proposed coded slotted ALOHA (CSA) random access protocol. Thanks to the bridge between the graphical model describing the iterative interference cancelation process of CSA over the random access frame and the erasure recovery process of low-density parity-check (LDPC) codes over the binary erasure channel (BEC), we propose an access protocol which is inspired by the convolutional LDPC code construction. The proposed protocol exploits the terminations of its graphical model to achieve the spatial coupling effec"},"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":"1205.3317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-15T10:39:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cc2cb8473acf1b29323b45fb23a279f58e19f11182e9ef7e72d3fe3e4cd69c17","abstract_canon_sha256":"3650d2e843fd7f30bf8a78dcc03f429e149b9403485a133e8cf6f50ce7ec5b98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:18.225133Z","signature_b64":"7VQxGauH3D+bXYOLjYHQ9Ptk+usEPw+4zGpYj/KLX0Bu/RPl3TE3Onm5ayF4Q9ga8+AzZb/iBnD3znMEXSAUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21e87fc7fb4aa65b506636ffdb8dbe66d810fc666327d53f4d2ff05e0233e3cb","last_reissued_at":"2026-05-18T00:58:18.224463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:18.224463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatially-Coupled Random Access on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Enrico Paolini, Gianluigi Liva, Marco Chiani, Michael Lentmaier","submitted_at":"2012-05-15T10:39:06Z","abstract_excerpt":"In this paper we investigate the effect of spatial coupling applied to the recently-proposed coded slotted ALOHA (CSA) random access protocol. Thanks to the bridge between the graphical model describing the iterative interference cancelation process of CSA over the random access frame and the erasure recovery process of low-density parity-check (LDPC) codes over the binary erasure channel (BEC), we propose an access protocol which is inspired by the convolutional LDPC code construction. The proposed protocol exploits the terminations of its graphical model to achieve the spatial coupling effec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3317","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":"1205.3317","created_at":"2026-05-18T00:58:18.224574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.3317v1","created_at":"2026-05-18T00:58:18.224574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3317","created_at":"2026-05-18T00:58:18.224574+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/EHUH7R73JKTFWUDGG375XDN6M3","json":"https://pith.science/pith/EHUH7R73JKTFWUDGG375XDN6M3.json","graph_json":"https://pith.science/api/pith-number/EHUH7R73JKTFWUDGG375XDN6M3/graph.json","events_json":"https://pith.science/api/pith-number/EHUH7R73JKTFWUDGG375XDN6M3/events.json","paper":"https://pith.science/paper/EHUH7R73"},"agent_actions":{"view_html":"https://pith.science/pith/EHUH7R73JKTFWUDGG375XDN6M3","download_json":"https://pith.science/pith/EHUH7R73JKTFWUDGG375XDN6M3.json","view_paper":"https://pith.science/paper/EHUH7R73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.3317&json=true","fetch_graph":"https://pith.science/api/pith-number/EHUH7R73JKTFWUDGG375XDN6M3/graph.json","fetch_events":"https://pith.science/api/pith-number/EHUH7R73JKTFWUDGG375XDN6M3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHUH7R73JKTFWUDGG375XDN6M3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHUH7R73JKTFWUDGG375XDN6M3/action/storage_attestation","attest_author":"https://pith.science/pith/EHUH7R73JKTFWUDGG375XDN6M3/action/author_attestation","sign_citation":"https://pith.science/pith/EHUH7R73JKTFWUDGG375XDN6M3/action/citation_signature","submit_replication":"https://pith.science/pith/EHUH7R73JKTFWUDGG375XDN6M3/action/replication_record"}},"created_at":"2026-05-18T00:58:18.224574+00:00","updated_at":"2026-05-18T00:58:18.224574+00:00"}