{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5TITLHACY4APQUXHQM7NAXSJST","short_pith_number":"pith:5TITLHAC","schema_version":"1.0","canonical_sha256":"ecd1359c02c700f852e7833ed05e4994d1180d07dd51b861882e9a1d6cfee969","source":{"kind":"arxiv","id":"1405.4127","version":2},"attestation_state":"computed","paper":{"title":"Coded Random Access: Applying Codes on Graphs to Design Random Access Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Cedomir Stefanovic, Enrico Paolini, Gianluigi Liva, Petar Popovski","submitted_at":"2014-05-16T10:58:45Z","abstract_excerpt":"The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model, where slots containing collided packets are considered as waste. However, if the common receiver (e.g., base station) is capable to store the collision slots and use them in a transmission recovery process based on successive interference cancellation, the design space for access protocols is radically expanded. We present the paradigm of coded random access,"},"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":"1405.4127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-16T10:58:45Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d17a490e34cf99d69874bed5583a2c34dbca7c7ac2e9420f8c712ea1afdcb797","abstract_canon_sha256":"3d53d5432dff645d93cf1a7f9351b4c79bbd3b214b6a288e6da79dfb785da1d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:08.607011Z","signature_b64":"1r+xETz+YcidX408HOsABqGt+Ot+6RCmRAYXLyFru/VLn8g0E6X4AgtkMlwgofhK7tgrFeK8+qaHyMm2MqDSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecd1359c02c700f852e7833ed05e4994d1180d07dd51b861882e9a1d6cfee969","last_reissued_at":"2026-05-18T00:41:08.606361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:08.606361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded Random Access: Applying Codes on Graphs to Design Random Access Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Cedomir Stefanovic, Enrico Paolini, Gianluigi Liva, Petar Popovski","submitted_at":"2014-05-16T10:58:45Z","abstract_excerpt":"The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model, where slots containing collided packets are considered as waste. However, if the common receiver (e.g., base station) is capable to store the collision slots and use them in a transmission recovery process based on successive interference cancellation, the design space for access protocols is radically expanded. We present the paradigm of coded random access,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4127","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":"1405.4127","created_at":"2026-05-18T00:41:08.606437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.4127v2","created_at":"2026-05-18T00:41:08.606437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4127","created_at":"2026-05-18T00:41:08.606437+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TITLHACY4AP","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TITLHACY4APQUXH","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TITLHAC","created_at":"2026-05-18T12:28:16.859392+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/5TITLHACY4APQUXHQM7NAXSJST","json":"https://pith.science/pith/5TITLHACY4APQUXHQM7NAXSJST.json","graph_json":"https://pith.science/api/pith-number/5TITLHACY4APQUXHQM7NAXSJST/graph.json","events_json":"https://pith.science/api/pith-number/5TITLHACY4APQUXHQM7NAXSJST/events.json","paper":"https://pith.science/paper/5TITLHAC"},"agent_actions":{"view_html":"https://pith.science/pith/5TITLHACY4APQUXHQM7NAXSJST","download_json":"https://pith.science/pith/5TITLHACY4APQUXHQM7NAXSJST.json","view_paper":"https://pith.science/paper/5TITLHAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.4127&json=true","fetch_graph":"https://pith.science/api/pith-number/5TITLHACY4APQUXHQM7NAXSJST/graph.json","fetch_events":"https://pith.science/api/pith-number/5TITLHACY4APQUXHQM7NAXSJST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TITLHACY4APQUXHQM7NAXSJST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TITLHACY4APQUXHQM7NAXSJST/action/storage_attestation","attest_author":"https://pith.science/pith/5TITLHACY4APQUXHQM7NAXSJST/action/author_attestation","sign_citation":"https://pith.science/pith/5TITLHACY4APQUXHQM7NAXSJST/action/citation_signature","submit_replication":"https://pith.science/pith/5TITLHACY4APQUXHQM7NAXSJST/action/replication_record"}},"created_at":"2026-05-18T00:41:08.606437+00:00","updated_at":"2026-05-18T00:41:08.606437+00:00"}