{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LYMDF6EDWZ7KJL6MDT5QFGBFUJ","short_pith_number":"pith:LYMDF6ED","canonical_record":{"source":{"id":"1711.02056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-06T18:02:02Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"de9345da97d512de3a15f82273004a2f3f0e7b04a53f13190154c5dc90e8b95c","abstract_canon_sha256":"29f801b21eca7ae872f12ac3e8ce841680c113ee1ecee11ce5476fdc5387a34b"},"schema_version":"1.0"},"canonical_sha256":"5e1832f883b67ea4afcc1cfb029825a27bd9438d88a934e2a0e103179a95e5cb","source":{"kind":"arxiv","id":"1711.02056","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02056","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02056v2","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02056","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"LYMDF6EDWZ7K","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LYMDF6EDWZ7KJL6M","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LYMDF6ED","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LYMDF6EDWZ7KJL6MDT5QFGBFUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-06T18:02:02Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"de9345da97d512de3a15f82273004a2f3f0e7b04a53f13190154c5dc90e8b95c","abstract_canon_sha256":"29f801b21eca7ae872f12ac3e8ce841680c113ee1ecee11ce5476fdc5387a34b"},"schema_version":"1.0"},"canonical_sha256":"5e1832f883b67ea4afcc1cfb029825a27bd9438d88a934e2a0e103179a95e5cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:16.171083Z","signature_b64":"XLWwa6gLxyqjts6YSov35h2wIY8neQC+H4U1tNvzZvHTiTN3b01gfiIkI384Teew8H2YhZaoq30uAeEGhy9eAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e1832f883b67ea4afcc1cfb029825a27bd9438d88a934e2a0e103179a95e5cb","last_reissued_at":"2026-05-18T00:14:16.170489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:16.170489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02056","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:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TC7m7KWFfMBXaP219l6n+3+MG5WjcMOlQhgoxCs8aqn2f5WpFiKE7p1ucES4MTSW8Mk38rVFcwmpEylA3inFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:28:06.537617Z"},"content_sha256":"425b2e16def645d6d18052b6ef237887688659601b688600cba49c1125976e96","schema_version":"1.0","event_id":"sha256:425b2e16def645d6d18052b6ef237887688659601b688600cba49c1125976e96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LYMDF6EDWZ7KJL6MDT5QFGBFUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput Maximization for Delay-Sensitive Random Access Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Derya Malak, Howard Huang, Jeffrey G. Andrews","submitted_at":"2017-11-06T18:02:02Z","abstract_excerpt":"Future 5G cellular networks supporting ultra-reliable, low-latency communications (URLLC) could employ random access communication to reduce the overhead compared to scheduled access techniques used in 4G networks. We consider a wireless communication system where multiple devices transmit payloads of a given fixed size in a random access fashion over shared radio resources to a common receiver. We allow retransmissions and assume Chase combining at the receiver. The radio resources are partitioned in the time and frequency dimensions, and we determine the optimal partition granularity to maxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02056","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:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7q7rcvMrrcesQL0pIsOaHbInLYzt0tcXuUeZUf+l+iuAepbBE80hp1EFb527xrYa75BjqsoDhXojcXXYnlf+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:28:06.538362Z"},"content_sha256":"f28bccc68d4644d1772a210a981708cce6cf588e150922066a11bf0171e53f3e","schema_version":"1.0","event_id":"sha256:f28bccc68d4644d1772a210a981708cce6cf588e150922066a11bf0171e53f3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LYMDF6EDWZ7KJL6MDT5QFGBFUJ/bundle.json","state_url":"https://pith.science/pith/LYMDF6EDWZ7KJL6MDT5QFGBFUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LYMDF6EDWZ7KJL6MDT5QFGBFUJ/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-10T13:28:06Z","links":{"resolver":"https://pith.science/pith/LYMDF6EDWZ7KJL6MDT5QFGBFUJ","bundle":"https://pith.science/pith/LYMDF6EDWZ7KJL6MDT5QFGBFUJ/bundle.json","state":"https://pith.science/pith/LYMDF6EDWZ7KJL6MDT5QFGBFUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LYMDF6EDWZ7KJL6MDT5QFGBFUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LYMDF6EDWZ7KJL6MDT5QFGBFUJ","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":"29f801b21eca7ae872f12ac3e8ce841680c113ee1ecee11ce5476fdc5387a34b","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-06T18:02:02Z","title_canon_sha256":"de9345da97d512de3a15f82273004a2f3f0e7b04a53f13190154c5dc90e8b95c"},"schema_version":"1.0","source":{"id":"1711.02056","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02056","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02056v2","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02056","created_at":"2026-05-18T00:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"LYMDF6EDWZ7K","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LYMDF6EDWZ7KJL6M","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LYMDF6ED","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:f28bccc68d4644d1772a210a981708cce6cf588e150922066a11bf0171e53f3e","target":"graph","created_at":"2026-05-18T00:14:16Z","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":"Future 5G cellular networks supporting ultra-reliable, low-latency communications (URLLC) could employ random access communication to reduce the overhead compared to scheduled access techniques used in 4G networks. We consider a wireless communication system where multiple devices transmit payloads of a given fixed size in a random access fashion over shared radio resources to a common receiver. We allow retransmissions and assume Chase combining at the receiver. The radio resources are partitioned in the time and frequency dimensions, and we determine the optimal partition granularity to maxi","authors_text":"Derya Malak, Howard Huang, Jeffrey G. Andrews","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-06T18:02:02Z","title":"Throughput Maximization for Delay-Sensitive Random Access Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02056","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:425b2e16def645d6d18052b6ef237887688659601b688600cba49c1125976e96","target":"record","created_at":"2026-05-18T00:14:16Z","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":"29f801b21eca7ae872f12ac3e8ce841680c113ee1ecee11ce5476fdc5387a34b","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-06T18:02:02Z","title_canon_sha256":"de9345da97d512de3a15f82273004a2f3f0e7b04a53f13190154c5dc90e8b95c"},"schema_version":"1.0","source":{"id":"1711.02056","kind":"arxiv","version":2}},"canonical_sha256":"5e1832f883b67ea4afcc1cfb029825a27bd9438d88a934e2a0e103179a95e5cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e1832f883b67ea4afcc1cfb029825a27bd9438d88a934e2a0e103179a95e5cb","first_computed_at":"2026-05-18T00:14:16.170489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:16.170489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XLWwa6gLxyqjts6YSov35h2wIY8neQC+H4U1tNvzZvHTiTN3b01gfiIkI384Teew8H2YhZaoq30uAeEGhy9eAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:16.171083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02056","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:425b2e16def645d6d18052b6ef237887688659601b688600cba49c1125976e96","sha256:f28bccc68d4644d1772a210a981708cce6cf588e150922066a11bf0171e53f3e"],"state_sha256":"3427b3cdd3aed8126197ca48625e4779296419b5d5d05ad7482ac75f2f2f96fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pTR75JQ3AAsIcgrf4kwArZXpGLZ3AXJeMD1ucNAI4vJDbh2tbUzb++62ahs/0WFol9Zh0Ym0wzazjuTi5pYUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:28:06.542834Z","bundle_sha256":"cd9a0a98d5ed69a2a3625d7ffdd1b0e8ed21cdcc7c40d2a201f1ec9c30e71c6a"}}