{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HOLIGQUYBAA34BX6JMFAWD2CH7","short_pith_number":"pith:HOLIGQUY","canonical_record":{"source":{"id":"1904.06839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-04-15T04:51:04Z","cross_cats_sorted":[],"title_canon_sha256":"a9c17dca47e65dd671f7e44974abbfa992aa83a87725290cb0174e3ac1809bb0","abstract_canon_sha256":"3e4b0aa4154d1f28171b494285a030a17bc4965ecb64295bd3cb4ea57f6c6722"},"schema_version":"1.0"},"canonical_sha256":"3b968342980801be06fe4b0a0b0f423fe918d289bd42775db33ed70894f0e110","source":{"kind":"arxiv","id":"1904.06839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06839","created_at":"2026-05-17T23:48:36Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06839v1","created_at":"2026-05-17T23:48:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06839","created_at":"2026-05-17T23:48:36Z"},{"alias_kind":"pith_short_12","alias_value":"HOLIGQUYBAA3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HOLIGQUYBAA34BX6","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HOLIGQUY","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HOLIGQUYBAA34BX6JMFAWD2CH7","target":"record","payload":{"canonical_record":{"source":{"id":"1904.06839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-04-15T04:51:04Z","cross_cats_sorted":[],"title_canon_sha256":"a9c17dca47e65dd671f7e44974abbfa992aa83a87725290cb0174e3ac1809bb0","abstract_canon_sha256":"3e4b0aa4154d1f28171b494285a030a17bc4965ecb64295bd3cb4ea57f6c6722"},"schema_version":"1.0"},"canonical_sha256":"3b968342980801be06fe4b0a0b0f423fe918d289bd42775db33ed70894f0e110","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:36.026156Z","signature_b64":"nBfAxpnkWvKY6qPHeC4fPraSVCcRAThlTYjZTG98rOEdq0Ap3512q8+oz9WecoqHV82pGhiMJY7dhOxii1GKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b968342980801be06fe4b0a0b0f423fe918d289bd42775db33ed70894f0e110","last_reissued_at":"2026-05-17T23:48:36.025420Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:36.025420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.06839","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-17T23:48:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XSgFY4XS1Jt40KkdUuIhR76fIQzckCw2Q9xIV3qXgcQRIfd42T/iOhlPLU/yJMAqVSi1Q41V8n6h+xxByxtnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:07:32.081983Z"},"content_sha256":"3f3d91e45e1b25627c7f2d57fad82930cf22afaa979ad1ac83a2c1885edcbe55","schema_version":"1.0","event_id":"sha256:3f3d91e45e1b25627c7f2d57fad82930cf22afaa979ad1ac83a2c1885edcbe55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HOLIGQUYBAA34BX6JMFAWD2CH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimizing Uplink Delay in Delay-Sensitive 5G CRAN platforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Ali Ataie, Babak H. Khalaj, Borna Kanaanian","submitted_at":"2019-04-15T04:51:04Z","abstract_excerpt":"In this paper, we consider the problem of minimizing the uplink delays of users in a 5G cellular network. Such cellular network is based on a Cloud Radio Access Network (CRAN) architecture with limited fronthaul capacity, where our goal is to minimize delays of all users through an optimal resource allocation. Earlier works minimize average delay of each user assuming same transmit power for all users. Combining Pareto optimization and Markov Decision Process (MDP), we show that every desired balance in the trade-off among infinite-horizon average-reward delays, is achievable by minimizing a p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06839","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-17T23:48:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F372g2/inK1FQHOnAu7jTNTcXlJzOe7E3SC1aDEpmJYd+WKOnlMaTB8+ojQEwhwWx9gzjB/zpZM9tekHkZh3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:07:32.082341Z"},"content_sha256":"dc215127e0e635e09a56d6d5c9644cd520a8e437c02fe09a5bf2b6efe8e5f04a","schema_version":"1.0","event_id":"sha256:dc215127e0e635e09a56d6d5c9644cd520a8e437c02fe09a5bf2b6efe8e5f04a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOLIGQUYBAA34BX6JMFAWD2CH7/bundle.json","state_url":"https://pith.science/pith/HOLIGQUYBAA34BX6JMFAWD2CH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOLIGQUYBAA34BX6JMFAWD2CH7/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-28T04:07:32Z","links":{"resolver":"https://pith.science/pith/HOLIGQUYBAA34BX6JMFAWD2CH7","bundle":"https://pith.science/pith/HOLIGQUYBAA34BX6JMFAWD2CH7/bundle.json","state":"https://pith.science/pith/HOLIGQUYBAA34BX6JMFAWD2CH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOLIGQUYBAA34BX6JMFAWD2CH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HOLIGQUYBAA34BX6JMFAWD2CH7","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":"3e4b0aa4154d1f28171b494285a030a17bc4965ecb64295bd3cb4ea57f6c6722","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-04-15T04:51:04Z","title_canon_sha256":"a9c17dca47e65dd671f7e44974abbfa992aa83a87725290cb0174e3ac1809bb0"},"schema_version":"1.0","source":{"id":"1904.06839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06839","created_at":"2026-05-17T23:48:36Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06839v1","created_at":"2026-05-17T23:48:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06839","created_at":"2026-05-17T23:48:36Z"},{"alias_kind":"pith_short_12","alias_value":"HOLIGQUYBAA3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HOLIGQUYBAA34BX6","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HOLIGQUY","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:dc215127e0e635e09a56d6d5c9644cd520a8e437c02fe09a5bf2b6efe8e5f04a","target":"graph","created_at":"2026-05-17T23:48:36Z","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":"In this paper, we consider the problem of minimizing the uplink delays of users in a 5G cellular network. Such cellular network is based on a Cloud Radio Access Network (CRAN) architecture with limited fronthaul capacity, where our goal is to minimize delays of all users through an optimal resource allocation. Earlier works minimize average delay of each user assuming same transmit power for all users. Combining Pareto optimization and Markov Decision Process (MDP), we show that every desired balance in the trade-off among infinite-horizon average-reward delays, is achievable by minimizing a p","authors_text":"Ali Ataie, Babak H. Khalaj, Borna Kanaanian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-04-15T04:51:04Z","title":"Minimizing Uplink Delay in Delay-Sensitive 5G CRAN platforms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06839","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:3f3d91e45e1b25627c7f2d57fad82930cf22afaa979ad1ac83a2c1885edcbe55","target":"record","created_at":"2026-05-17T23:48:36Z","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":"3e4b0aa4154d1f28171b494285a030a17bc4965ecb64295bd3cb4ea57f6c6722","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-04-15T04:51:04Z","title_canon_sha256":"a9c17dca47e65dd671f7e44974abbfa992aa83a87725290cb0174e3ac1809bb0"},"schema_version":"1.0","source":{"id":"1904.06839","kind":"arxiv","version":1}},"canonical_sha256":"3b968342980801be06fe4b0a0b0f423fe918d289bd42775db33ed70894f0e110","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b968342980801be06fe4b0a0b0f423fe918d289bd42775db33ed70894f0e110","first_computed_at":"2026-05-17T23:48:36.025420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:36.025420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nBfAxpnkWvKY6qPHeC4fPraSVCcRAThlTYjZTG98rOEdq0Ap3512q8+oz9WecoqHV82pGhiMJY7dhOxii1GKDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:36.026156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.06839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f3d91e45e1b25627c7f2d57fad82930cf22afaa979ad1ac83a2c1885edcbe55","sha256:dc215127e0e635e09a56d6d5c9644cd520a8e437c02fe09a5bf2b6efe8e5f04a"],"state_sha256":"0c55c01680e85754b2c81d2b2fd76d3dae32f1cf44df1146f123f5c1969dc9f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+bBnLMWSlfFHfBclGui9setRfvANPsKNNaAUsbnwmYXLt0IjH116UTpJvG9rqPWt50UVsP71CcTECjuyxuC0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:07:32.084310Z","bundle_sha256":"401fc36711d718775dba3c8145d336f336b96ee84d4f0a6c47ba73b314cb0b26"}}