{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HXDJS64EQRFTILISDXDS2PHE6R","short_pith_number":"pith:HXDJS64E","canonical_record":{"source":{"id":"1802.07332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-20T21:23:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6f51a59359cf1131e986369e7e66ab85f558a9fbcde4ee7ec73b70abc6875461","abstract_canon_sha256":"7866fd538733911a9fafdf4813355fb048f459246ebf75be4cf855e89ba49767"},"schema_version":"1.0"},"canonical_sha256":"3dc6997b84844b342d121dc72d3ce4f46dc81fcb628179e3d6ef7bbf7381900c","source":{"kind":"arxiv","id":"1802.07332","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07332","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07332v2","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07332","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"pith_short_12","alias_value":"HXDJS64EQRFT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HXDJS64EQRFTILIS","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HXDJS64E","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HXDJS64EQRFTILISDXDS2PHE6R","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-20T21:23:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6f51a59359cf1131e986369e7e66ab85f558a9fbcde4ee7ec73b70abc6875461","abstract_canon_sha256":"7866fd538733911a9fafdf4813355fb048f459246ebf75be4cf855e89ba49767"},"schema_version":"1.0"},"canonical_sha256":"3dc6997b84844b342d121dc72d3ce4f46dc81fcb628179e3d6ef7bbf7381900c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:30.653084Z","signature_b64":"GclKhVuRanZg1kjBt+/WyQHHTa7ZMMPgjPMze3rMqWHLTdZC5+CZz3Mj+yYfA9rGJR3XeA0llrYQTnsPzzqoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dc6997b84844b342d121dc72d3ce4f46dc81fcb628179e3d6ef7bbf7381900c","last_reissued_at":"2026-05-18T00:00:30.652540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:30.652540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07332","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:00:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+y3mZc8826SmpZfTi1ey5dw03Y34EfQqdDbaJiXke183/5WWM4J4NCcz1/NqftsxSZ3yNUSJnBiC5V+uHcq9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:30:44.540721Z"},"content_sha256":"b0afc1ddc8024828b9b32ac0e4f75039df056245554f966042781f62ac443d99","schema_version":"1.0","event_id":"sha256:b0afc1ddc8024828b9b32ac0e4f75039df056245554f966042781f62ac443d99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HXDJS64EQRFTILISDXDS2PHE6R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexey Frolov, Andrey Turlikov, Anton Glebov, Kirill Andreev, Nikolay Matveev","submitted_at":"2018-02-20T21:23:28Z","abstract_excerpt":"We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted ALOHA (IRSA) scheme is investigated and achievability bounds are derived. The main difference of this scheme in comparison to IRSA is as follows: any collisions of order up to T can be resolved with some probability of error introduced by noise. In order to optimize the parameters of the scheme we combine the density evolution method (DE) proposed by G. Liva and a finite length random coding bound for the Gaussian MAC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07332","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:00:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZ5DEL/3ExmqrDe4oSorHSBS3bKV9uRKtwjI2iM1/vG95cDJ3so7mDDPO/Ji0RZ+ddbtPtHxA7fHv178xCUrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:30:44.541058Z"},"content_sha256":"403ab1b7e707bc33313287e351b83af471580bfd218df49aa78567b57707a02e","schema_version":"1.0","event_id":"sha256:403ab1b7e707bc33313287e351b83af471580bfd218df49aa78567b57707a02e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXDJS64EQRFTILISDXDS2PHE6R/bundle.json","state_url":"https://pith.science/pith/HXDJS64EQRFTILISDXDS2PHE6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXDJS64EQRFTILISDXDS2PHE6R/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-06-29T17:30:44Z","links":{"resolver":"https://pith.science/pith/HXDJS64EQRFTILISDXDS2PHE6R","bundle":"https://pith.science/pith/HXDJS64EQRFTILISDXDS2PHE6R/bundle.json","state":"https://pith.science/pith/HXDJS64EQRFTILISDXDS2PHE6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXDJS64EQRFTILISDXDS2PHE6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HXDJS64EQRFTILISDXDS2PHE6R","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":"7866fd538733911a9fafdf4813355fb048f459246ebf75be4cf855e89ba49767","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-20T21:23:28Z","title_canon_sha256":"6f51a59359cf1131e986369e7e66ab85f558a9fbcde4ee7ec73b70abc6875461"},"schema_version":"1.0","source":{"id":"1802.07332","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07332","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07332v2","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07332","created_at":"2026-05-18T00:00:30Z"},{"alias_kind":"pith_short_12","alias_value":"HXDJS64EQRFT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HXDJS64EQRFTILIS","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HXDJS64E","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:403ab1b7e707bc33313287e351b83af471580bfd218df49aa78567b57707a02e","target":"graph","created_at":"2026-05-18T00:00:30Z","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":"We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted ALOHA (IRSA) scheme is investigated and achievability bounds are derived. The main difference of this scheme in comparison to IRSA is as follows: any collisions of order up to T can be resolved with some probability of error introduced by noise. In order to optimize the parameters of the scheme we combine the density evolution method (DE) proposed by G. Liva and a finite length random coding bound for the Gaussian MAC","authors_text":"Alexey Frolov, Andrey Turlikov, Anton Glebov, Kirill Andreev, Nikolay Matveev","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-20T21:23:28Z","title":"Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07332","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:b0afc1ddc8024828b9b32ac0e4f75039df056245554f966042781f62ac443d99","target":"record","created_at":"2026-05-18T00:00:30Z","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":"7866fd538733911a9fafdf4813355fb048f459246ebf75be4cf855e89ba49767","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-20T21:23:28Z","title_canon_sha256":"6f51a59359cf1131e986369e7e66ab85f558a9fbcde4ee7ec73b70abc6875461"},"schema_version":"1.0","source":{"id":"1802.07332","kind":"arxiv","version":2}},"canonical_sha256":"3dc6997b84844b342d121dc72d3ce4f46dc81fcb628179e3d6ef7bbf7381900c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dc6997b84844b342d121dc72d3ce4f46dc81fcb628179e3d6ef7bbf7381900c","first_computed_at":"2026-05-18T00:00:30.652540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:30.652540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GclKhVuRanZg1kjBt+/WyQHHTa7ZMMPgjPMze3rMqWHLTdZC5+CZz3Mj+yYfA9rGJR3XeA0llrYQTnsPzzqoDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:30.653084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07332","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0afc1ddc8024828b9b32ac0e4f75039df056245554f966042781f62ac443d99","sha256:403ab1b7e707bc33313287e351b83af471580bfd218df49aa78567b57707a02e"],"state_sha256":"fac8091cb0e69f212c571bb1453a83087752b15777a10d7701b6174eb9eccdfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ORwZf+pqCqZrtZHttXywQfz1y8iSfV2z7xtL6KGwfVEkypua05XKPrb7MtT/LC77v3wt0c1bF0448ICeykhfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T17:30:44.543218Z","bundle_sha256":"3780225cf6dd62635450a5cac1e342b2bdbe9fd9d9fd3a3b462a51ef0bd19dae"}}