{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5TITLHACY4APQUXHQM7NAXSJST","short_pith_number":"pith:5TITLHAC","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"},"canonical_sha256":"ecd1359c02c700f852e7833ed05e4994d1180d07dd51b861882e9a1d6cfee969","source":{"kind":"arxiv","id":"1405.4127","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4127","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4127v2","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4127","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"5TITLHACY4AP","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5TITLHACY4APQUXH","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5TITLHAC","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5TITLHACY4APQUXHQM7NAXSJST","target":"record","payload":{"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"},"canonical_sha256":"ecd1359c02c700f852e7833ed05e4994d1180d07dd51b861882e9a1d6cfee969","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"},"source_kind":"arxiv","source_id":"1405.4127","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"El81j6f4CmU0lvHlfCXh8U4P0kOWh9tsWEGlkTDkNqCiIEks7o4/JpVoH8gskvJ/6CaLkFyKUgXWUP3HvI5EAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:11:43.750619Z"},"content_sha256":"a171d7ba2109ce522ed81c1d7ef3f23969311ebb2009121fbdfc191bf93b8614","schema_version":"1.0","event_id":"sha256:a171d7ba2109ce522ed81c1d7ef3f23969311ebb2009121fbdfc191bf93b8614"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5TITLHACY4APQUXHQM7NAXSJST","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eu1ANMWl7e6vB3+BoYIczexnqdbQ41KvBc5pkkuTwp91QeiP+o2PmTT3OLdkZLzzW+hlI18J625mRmK4zxX6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:11:43.751303Z"},"content_sha256":"2215af0b3b82a2a24c50e5979dff4df732c8aaaed8db09234e644de84c941880","schema_version":"1.0","event_id":"sha256:2215af0b3b82a2a24c50e5979dff4df732c8aaaed8db09234e644de84c941880"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TITLHACY4APQUXHQM7NAXSJST/bundle.json","state_url":"https://pith.science/pith/5TITLHACY4APQUXHQM7NAXSJST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TITLHACY4APQUXHQM7NAXSJST/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T16:11:43Z","links":{"resolver":"https://pith.science/pith/5TITLHACY4APQUXHQM7NAXSJST","bundle":"https://pith.science/pith/5TITLHACY4APQUXHQM7NAXSJST/bundle.json","state":"https://pith.science/pith/5TITLHACY4APQUXHQM7NAXSJST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TITLHACY4APQUXHQM7NAXSJST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5TITLHACY4APQUXHQM7NAXSJST","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":"3d53d5432dff645d93cf1a7f9351b4c79bbd3b214b6a288e6da79dfb785da1d5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-16T10:58:45Z","title_canon_sha256":"d17a490e34cf99d69874bed5583a2c34dbca7c7ac2e9420f8c712ea1afdcb797"},"schema_version":"1.0","source":{"id":"1405.4127","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4127","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4127v2","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4127","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"5TITLHACY4AP","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5TITLHACY4APQUXH","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5TITLHAC","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:2215af0b3b82a2a24c50e5979dff4df732c8aaaed8db09234e644de84c941880","target":"graph","created_at":"2026-05-18T00:41:08Z","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":"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,","authors_text":"Cedomir Stefanovic, Enrico Paolini, Gianluigi Liva, Petar Popovski","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-16T10:58:45Z","title":"Coded Random Access: Applying Codes on Graphs to Design Random Access Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4127","kind":"arxiv","version":2},"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:a171d7ba2109ce522ed81c1d7ef3f23969311ebb2009121fbdfc191bf93b8614","target":"record","created_at":"2026-05-18T00:41:08Z","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":"3d53d5432dff645d93cf1a7f9351b4c79bbd3b214b6a288e6da79dfb785da1d5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-16T10:58:45Z","title_canon_sha256":"d17a490e34cf99d69874bed5583a2c34dbca7c7ac2e9420f8c712ea1afdcb797"},"schema_version":"1.0","source":{"id":"1405.4127","kind":"arxiv","version":2}},"canonical_sha256":"ecd1359c02c700f852e7833ed05e4994d1180d07dd51b861882e9a1d6cfee969","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecd1359c02c700f852e7833ed05e4994d1180d07dd51b861882e9a1d6cfee969","first_computed_at":"2026-05-18T00:41:08.606361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:08.606361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1r+xETz+YcidX408HOsABqGt+Ot+6RCmRAYXLyFru/VLn8g0E6X4AgtkMlwgofhK7tgrFeK8+qaHyMm2MqDSBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:08.607011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4127","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a171d7ba2109ce522ed81c1d7ef3f23969311ebb2009121fbdfc191bf93b8614","sha256:2215af0b3b82a2a24c50e5979dff4df732c8aaaed8db09234e644de84c941880"],"state_sha256":"eaba5942c3aeea60311e4968aea359bc1e3a78cc92964e94c597f47cfcfe9470"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xOVdLpKGBVtC1UlfA+z7RFD56JAHgIejC3k4g6if7sHfemocvgcxdhi0JboWixe9rYmrSqLF6p+NKS3CEMpjAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:11:43.755218Z","bundle_sha256":"61c17a0ad797464535d4a3c772774280706a0f8e2f35a54432082d2aa11f7122"}}