{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UAZISXOAEWU3237XRKWZJFH4ZO","short_pith_number":"pith:UAZISXOA","canonical_record":{"source":{"id":"1903.11270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-27T07:19:59Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"2be81611594cf9fbace63197d99515434d466b123415d0c4fe9d4288726fdf5e","abstract_canon_sha256":"aec0fdf442849f94075b68c64fa2b644ad022bcf57c0745f9d886074c1b442be"},"schema_version":"1.0"},"canonical_sha256":"a032895dc025a9bd6ff78aad9494fccb8ccad0ffdbf7bcc7b94667050dadee47","source":{"kind":"arxiv","id":"1903.11270","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11270","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11270v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11270","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"UAZISXOAEWU3","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UAZISXOAEWU3237X","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UAZISXOA","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UAZISXOAEWU3237XRKWZJFH4ZO","target":"record","payload":{"canonical_record":{"source":{"id":"1903.11270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-27T07:19:59Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"2be81611594cf9fbace63197d99515434d466b123415d0c4fe9d4288726fdf5e","abstract_canon_sha256":"aec0fdf442849f94075b68c64fa2b644ad022bcf57c0745f9d886074c1b442be"},"schema_version":"1.0"},"canonical_sha256":"a032895dc025a9bd6ff78aad9494fccb8ccad0ffdbf7bcc7b94667050dadee47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:03.707270Z","signature_b64":"L7UKrd9+WL1iV+9XelEjcjCFvlV5xoVBg1++hdWim98oAORmeFYaz0qFbctiXejurOU+QCz/P8vfdmYsUJ4iCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a032895dc025a9bd6ff78aad9494fccb8ccad0ffdbf7bcc7b94667050dadee47","last_reissued_at":"2026-05-17T23:50:03.706631Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:03.706631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.11270","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:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ty9/zBHqxKUKa6/WwdNCw5/tWnO2kRU+ymvwRVWWWLA8arcSDfoTq77xP3ot4s9FPmPsAM0ibQjFnTnUD/VBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:37:35.795098Z"},"content_sha256":"f0ad13fc98868e15da4c09791caa83ea8b9ba4dd3c9f2613ff8b6d6910bb7fd6","schema_version":"1.0","event_id":"sha256:f0ad13fc98868e15da4c09791caa83ea8b9ba4dd3c9f2613ff8b6d6910bb7fd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UAZISXOAEWU3237XRKWZJFH4ZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling Algorithms for 5G Networks with Mid-haul Capacity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.NI","authors_text":"Abhishek Sinha, Matthew Andrews, Prasanth Ananth","submitted_at":"2019-03-27T07:19:59Z","abstract_excerpt":"We consider a virtualized RAN architecture for 5G networks where the Remote Units are connected to a central unit via a mid-haul. To support high data rates, the midhaul is realized with a Passive Optical Network (PON). In this architecture, the data are stored at the central unit until the scheduler decides to transmit it through the mid-haul to an appropriate remote unit, and then over the air at the same slot. We study an optimal scheduling problem that arises in this context. This problem has two key features. First, multiple cells must be scheduled simultaneously for efficient operation. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11270","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:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IkWiWofKTaTuizsoeme+Ug8mfoW781uNDFWO7CliY/hpWnwBXkIYtVZK44sNVLKHjgmem3SJHsydt6y5wBX4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:37:35.795841Z"},"content_sha256":"1e6b2a0391632c3512eb090c9e2e57957887d0e90c34d701f0608f8eb279e10c","schema_version":"1.0","event_id":"sha256:1e6b2a0391632c3512eb090c9e2e57957887d0e90c34d701f0608f8eb279e10c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UAZISXOAEWU3237XRKWZJFH4ZO/bundle.json","state_url":"https://pith.science/pith/UAZISXOAEWU3237XRKWZJFH4ZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UAZISXOAEWU3237XRKWZJFH4ZO/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-01T04:37:35Z","links":{"resolver":"https://pith.science/pith/UAZISXOAEWU3237XRKWZJFH4ZO","bundle":"https://pith.science/pith/UAZISXOAEWU3237XRKWZJFH4ZO/bundle.json","state":"https://pith.science/pith/UAZISXOAEWU3237XRKWZJFH4ZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UAZISXOAEWU3237XRKWZJFH4ZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UAZISXOAEWU3237XRKWZJFH4ZO","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":"aec0fdf442849f94075b68c64fa2b644ad022bcf57c0745f9d886074c1b442be","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-27T07:19:59Z","title_canon_sha256":"2be81611594cf9fbace63197d99515434d466b123415d0c4fe9d4288726fdf5e"},"schema_version":"1.0","source":{"id":"1903.11270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11270","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11270v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11270","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"UAZISXOAEWU3","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UAZISXOAEWU3237X","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UAZISXOA","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:1e6b2a0391632c3512eb090c9e2e57957887d0e90c34d701f0608f8eb279e10c","target":"graph","created_at":"2026-05-17T23:50:03Z","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 consider a virtualized RAN architecture for 5G networks where the Remote Units are connected to a central unit via a mid-haul. To support high data rates, the midhaul is realized with a Passive Optical Network (PON). In this architecture, the data are stored at the central unit until the scheduler decides to transmit it through the mid-haul to an appropriate remote unit, and then over the air at the same slot. We study an optimal scheduling problem that arises in this context. This problem has two key features. First, multiple cells must be scheduled simultaneously for efficient operation. ","authors_text":"Abhishek Sinha, Matthew Andrews, Prasanth Ananth","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-27T07:19:59Z","title":"Scheduling Algorithms for 5G Networks with Mid-haul Capacity Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11270","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:f0ad13fc98868e15da4c09791caa83ea8b9ba4dd3c9f2613ff8b6d6910bb7fd6","target":"record","created_at":"2026-05-17T23:50:03Z","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":"aec0fdf442849f94075b68c64fa2b644ad022bcf57c0745f9d886074c1b442be","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-27T07:19:59Z","title_canon_sha256":"2be81611594cf9fbace63197d99515434d466b123415d0c4fe9d4288726fdf5e"},"schema_version":"1.0","source":{"id":"1903.11270","kind":"arxiv","version":1}},"canonical_sha256":"a032895dc025a9bd6ff78aad9494fccb8ccad0ffdbf7bcc7b94667050dadee47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a032895dc025a9bd6ff78aad9494fccb8ccad0ffdbf7bcc7b94667050dadee47","first_computed_at":"2026-05-17T23:50:03.706631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:03.706631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L7UKrd9+WL1iV+9XelEjcjCFvlV5xoVBg1++hdWim98oAORmeFYaz0qFbctiXejurOU+QCz/P8vfdmYsUJ4iCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:03.707270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0ad13fc98868e15da4c09791caa83ea8b9ba4dd3c9f2613ff8b6d6910bb7fd6","sha256:1e6b2a0391632c3512eb090c9e2e57957887d0e90c34d701f0608f8eb279e10c"],"state_sha256":"623e6d3735a6149670c5d543cf0174db916bdd7bde378e198f07e32a89a11f84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q8OxdE1Ivv6Vlu8LZLaIJ1OyB/N49TYrLba51BK1wEm9svleRkCLICykVqoT7kHM7CRdNQrN3YlAW3uSgfZsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:37:35.799863Z","bundle_sha256":"5d77029d3d500214d9b7b53978c5dd7219e049ccefac6e76c3e92a88c86ef957"}}