{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QWOCJQ2FYZBMTSIBUQSX3FU2VR","short_pith_number":"pith:QWOCJQ2F","canonical_record":{"source":{"id":"1801.03557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-10T21:24:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4a3be5316a0551e2dd529f566bb2657eacbab10e8b891d8666534a354cbf3f16","abstract_canon_sha256":"64ffb5421ca6abab7903afbf352a2b6049146b836d81a93ea9b2eaf79e90dc1a"},"schema_version":"1.0"},"canonical_sha256":"859c24c345c642c9c901a4257d969aac410114f7a45d540a28b77b5cb37923be","source":{"kind":"arxiv","id":"1801.03557","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03557","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03557v1","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03557","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"QWOCJQ2FYZBM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QWOCJQ2FYZBMTSIB","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QWOCJQ2F","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QWOCJQ2FYZBMTSIBUQSX3FU2VR","target":"record","payload":{"canonical_record":{"source":{"id":"1801.03557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-10T21:24:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4a3be5316a0551e2dd529f566bb2657eacbab10e8b891d8666534a354cbf3f16","abstract_canon_sha256":"64ffb5421ca6abab7903afbf352a2b6049146b836d81a93ea9b2eaf79e90dc1a"},"schema_version":"1.0"},"canonical_sha256":"859c24c345c642c9c901a4257d969aac410114f7a45d540a28b77b5cb37923be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:13.938514Z","signature_b64":"oLJz/NTzDRdzBJKff0CAujV1933odhjN0SYBsvzexVuwyUSvNdwgwURrsiNUtBgse6tO2+U5eUELzpRY/l+WAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"859c24c345c642c9c901a4257d969aac410114f7a45d540a28b77b5cb37923be","last_reissued_at":"2026-05-18T00:26:13.937885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:13.937885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.03557","source_version":1,"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:26:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHTOzPy45gu+ngSx4f/uG0AuJrjVicg6uVIXH6Dj7Azab9PaxzNTcnk7grnj7FjCrqTpL/Jd+p9AbAuxYGBvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:06:21.943191Z"},"content_sha256":"8f31691d157b1ab4cc6fa2e3860d34226b8c1e4b77e13315eb3ce3f02f5f59c9","schema_version":"1.0","event_id":"sha256:8f31691d157b1ab4cc6fa2e3860d34226b8c1e4b77e13315eb3ce3f02f5f59c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QWOCJQ2FYZBMTSIBUQSX3FU2VR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rate Selection and Power Adaptation using Maximal Ratio Combining for the Random Access Gaussian Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arman Hasanzadeh, Jean-Francois Chamberland, Krishna Narayanan","submitted_at":"2018-01-10T21:24:08Z","abstract_excerpt":"With the emergence of machine-driven communi- cation, there is a renewed interest in the design of random multiple access schemes for networks with large number of active devices. Many of the recently proposed access paradigms are enhancements to slotted ALOHA. One of the popular schemes, irregular repetition slotted ALOHA (IRSA), is based on an analogy between multiple access with successive interference cancellation and message-passing decoding on bipartite graphs. Most of the results on IRSA and its variants focus on the collision channel and they ignore physical limitations such as transmi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03557","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"},"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:26:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uugkc/lsugJXPE0pZ1m/YRr3GRbZw55MOlnxnb2t/39pVvvUmdQlnvQPhHUoiznGo3UO8H+5jBoR6FE0xuqIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:06:21.943767Z"},"content_sha256":"5674f11e0dea9ae977dbbf5ef9cd683b7d99286378089ee6620bbc2d600ffb1f","schema_version":"1.0","event_id":"sha256:5674f11e0dea9ae977dbbf5ef9cd683b7d99286378089ee6620bbc2d600ffb1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWOCJQ2FYZBMTSIBUQSX3FU2VR/bundle.json","state_url":"https://pith.science/pith/QWOCJQ2FYZBMTSIBUQSX3FU2VR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWOCJQ2FYZBMTSIBUQSX3FU2VR/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-06T03:06:21Z","links":{"resolver":"https://pith.science/pith/QWOCJQ2FYZBMTSIBUQSX3FU2VR","bundle":"https://pith.science/pith/QWOCJQ2FYZBMTSIBUQSX3FU2VR/bundle.json","state":"https://pith.science/pith/QWOCJQ2FYZBMTSIBUQSX3FU2VR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWOCJQ2FYZBMTSIBUQSX3FU2VR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QWOCJQ2FYZBMTSIBUQSX3FU2VR","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":"64ffb5421ca6abab7903afbf352a2b6049146b836d81a93ea9b2eaf79e90dc1a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-10T21:24:08Z","title_canon_sha256":"4a3be5316a0551e2dd529f566bb2657eacbab10e8b891d8666534a354cbf3f16"},"schema_version":"1.0","source":{"id":"1801.03557","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03557","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03557v1","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03557","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"QWOCJQ2FYZBM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QWOCJQ2FYZBMTSIB","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QWOCJQ2F","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:5674f11e0dea9ae977dbbf5ef9cd683b7d99286378089ee6620bbc2d600ffb1f","target":"graph","created_at":"2026-05-18T00:26:13Z","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":"With the emergence of machine-driven communi- cation, there is a renewed interest in the design of random multiple access schemes for networks with large number of active devices. Many of the recently proposed access paradigms are enhancements to slotted ALOHA. One of the popular schemes, irregular repetition slotted ALOHA (IRSA), is based on an analogy between multiple access with successive interference cancellation and message-passing decoding on bipartite graphs. Most of the results on IRSA and its variants focus on the collision channel and they ignore physical limitations such as transmi","authors_text":"Arman Hasanzadeh, Jean-Francois Chamberland, Krishna Narayanan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-10T21:24:08Z","title":"Rate Selection and Power Adaptation using Maximal Ratio Combining for the Random Access Gaussian Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03557","kind":"arxiv","version":1},"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:8f31691d157b1ab4cc6fa2e3860d34226b8c1e4b77e13315eb3ce3f02f5f59c9","target":"record","created_at":"2026-05-18T00:26:13Z","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":"64ffb5421ca6abab7903afbf352a2b6049146b836d81a93ea9b2eaf79e90dc1a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-10T21:24:08Z","title_canon_sha256":"4a3be5316a0551e2dd529f566bb2657eacbab10e8b891d8666534a354cbf3f16"},"schema_version":"1.0","source":{"id":"1801.03557","kind":"arxiv","version":1}},"canonical_sha256":"859c24c345c642c9c901a4257d969aac410114f7a45d540a28b77b5cb37923be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"859c24c345c642c9c901a4257d969aac410114f7a45d540a28b77b5cb37923be","first_computed_at":"2026-05-18T00:26:13.937885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:13.937885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oLJz/NTzDRdzBJKff0CAujV1933odhjN0SYBsvzexVuwyUSvNdwgwURrsiNUtBgse6tO2+U5eUELzpRY/l+WAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:13.938514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03557","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f31691d157b1ab4cc6fa2e3860d34226b8c1e4b77e13315eb3ce3f02f5f59c9","sha256:5674f11e0dea9ae977dbbf5ef9cd683b7d99286378089ee6620bbc2d600ffb1f"],"state_sha256":"8c3ebe822a9881e7bf66dffdc4f844865dc77080309283c40f5c9115059aa9c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Q3pVDu+gIrvpdU1wbTD51YfM7vOU1FYqMrB7z00BHL/By0Bw942Poncbygk4mvrSj9w6lLJN+kyJ4zDPZORBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T03:06:21.946927Z","bundle_sha256":"eac5cfbaeef66487286a1a6b4e28b5ecd582faf618e94e1472890539bc30af32"}}