{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WQFY42T35LSOJEGHOQAXWJXWZD","short_pith_number":"pith:WQFY42T3","canonical_record":{"source":{"id":"1901.02111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-08T00:16:38Z","cross_cats_sorted":[],"title_canon_sha256":"efd38b9d557274e595a8998e8385db0ba8a7d833e7d92131d4a7f9f2cf3b8352","abstract_canon_sha256":"5d25c630cfa40e2ce314843a7d239fc83c13c91ffbfb2a707d7a58d46944c3d0"},"schema_version":"1.0"},"canonical_sha256":"b40b8e6a7beae4e490c774017b26f6c8c2f49f26831d22502a3e0fe77f27154f","source":{"kind":"arxiv","id":"1901.02111","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02111","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02111v1","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02111","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"WQFY42T35LSO","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WQFY42T35LSOJEGH","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WQFY42T3","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WQFY42T35LSOJEGHOQAXWJXWZD","target":"record","payload":{"canonical_record":{"source":{"id":"1901.02111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-08T00:16:38Z","cross_cats_sorted":[],"title_canon_sha256":"efd38b9d557274e595a8998e8385db0ba8a7d833e7d92131d4a7f9f2cf3b8352","abstract_canon_sha256":"5d25c630cfa40e2ce314843a7d239fc83c13c91ffbfb2a707d7a58d46944c3d0"},"schema_version":"1.0"},"canonical_sha256":"b40b8e6a7beae4e490c774017b26f6c8c2f49f26831d22502a3e0fe77f27154f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:43.977441Z","signature_b64":"TkeO/v/bxpcydUfk9yNkwx3NxKRs46Ohm0/Yq2EUmUMnrBgCMbSLGt7IlB0ENBTLz9myTvzLoiLW1y/XvvzoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b40b8e6a7beae4e490c774017b26f6c8c2f49f26831d22502a3e0fe77f27154f","last_reissued_at":"2026-05-17T23:56:43.977035Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:43.977035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.02111","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:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ijUG6ScCSb4KlyGbflvJK8OVP1h4S9s5CozIb4rERnF8CB/rqkdlnMTDahpsq5dEweXboxSkd+cCV5c8r2wnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:45:11.869045Z"},"content_sha256":"9bade0581ac015f9d980a62900f1c56d91b2c710ffebfcb9ad58e49a13cfb249","schema_version":"1.0","event_id":"sha256:9bade0581ac015f9d980a62900f1c56d91b2c710ffebfcb9ad58e49a13cfb249"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WQFY42T35LSOJEGHOQAXWJXWZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling for VoLTE: Resource Allocation Optimization and Low-Complexity Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Andrew W. Eckford, Maryam Mohseni, Raviraj S. Adve, S. Alireza Banani","submitted_at":"2019-01-08T00:16:38Z","abstract_excerpt":"We consider scheduling and resource allocation in long-term evolution (LTE) networks across voice over LTE (VoLTE) and best-effort data users. The difference between these two is that VoLTE users get scheduling priority to receive their required quality of service. As we show, strict priority causes data services to suffer. We propose new scheduling and resource allocation algorithms to maximize the sum- or proportional fair (PF) throughout amongst data users while meeting VoLTE demands. Essentially, we use VoLTE as an example application with both a guaranteed bit-rate and strict application-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02111","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:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCYaZ+rHllbXOz46LdBB0fd/cSTMQRPr5Wd5ZDuUgOutKlwT3opHWeP1EuvEyadEn4ve8mWe3R0TkK1I0yOBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:45:11.869400Z"},"content_sha256":"893c696b50aca6eff9dee2c39100a6ea5d947d6bcb4ae246f90eecf9f2782891","schema_version":"1.0","event_id":"sha256:893c696b50aca6eff9dee2c39100a6ea5d947d6bcb4ae246f90eecf9f2782891"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQFY42T35LSOJEGHOQAXWJXWZD/bundle.json","state_url":"https://pith.science/pith/WQFY42T35LSOJEGHOQAXWJXWZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQFY42T35LSOJEGHOQAXWJXWZD/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-25T09:45:11Z","links":{"resolver":"https://pith.science/pith/WQFY42T35LSOJEGHOQAXWJXWZD","bundle":"https://pith.science/pith/WQFY42T35LSOJEGHOQAXWJXWZD/bundle.json","state":"https://pith.science/pith/WQFY42T35LSOJEGHOQAXWJXWZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQFY42T35LSOJEGHOQAXWJXWZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WQFY42T35LSOJEGHOQAXWJXWZD","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":"5d25c630cfa40e2ce314843a7d239fc83c13c91ffbfb2a707d7a58d46944c3d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-08T00:16:38Z","title_canon_sha256":"efd38b9d557274e595a8998e8385db0ba8a7d833e7d92131d4a7f9f2cf3b8352"},"schema_version":"1.0","source":{"id":"1901.02111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02111","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02111v1","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02111","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"WQFY42T35LSO","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WQFY42T35LSOJEGH","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WQFY42T3","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:893c696b50aca6eff9dee2c39100a6ea5d947d6bcb4ae246f90eecf9f2782891","target":"graph","created_at":"2026-05-17T23:56:43Z","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 scheduling and resource allocation in long-term evolution (LTE) networks across voice over LTE (VoLTE) and best-effort data users. The difference between these two is that VoLTE users get scheduling priority to receive their required quality of service. As we show, strict priority causes data services to suffer. We propose new scheduling and resource allocation algorithms to maximize the sum- or proportional fair (PF) throughout amongst data users while meeting VoLTE demands. Essentially, we use VoLTE as an example application with both a guaranteed bit-rate and strict application-","authors_text":"Andrew W. Eckford, Maryam Mohseni, Raviraj S. Adve, S. Alireza Banani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-08T00:16:38Z","title":"Scheduling for VoLTE: Resource Allocation Optimization and Low-Complexity Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02111","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:9bade0581ac015f9d980a62900f1c56d91b2c710ffebfcb9ad58e49a13cfb249","target":"record","created_at":"2026-05-17T23:56:43Z","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":"5d25c630cfa40e2ce314843a7d239fc83c13c91ffbfb2a707d7a58d46944c3d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-08T00:16:38Z","title_canon_sha256":"efd38b9d557274e595a8998e8385db0ba8a7d833e7d92131d4a7f9f2cf3b8352"},"schema_version":"1.0","source":{"id":"1901.02111","kind":"arxiv","version":1}},"canonical_sha256":"b40b8e6a7beae4e490c774017b26f6c8c2f49f26831d22502a3e0fe77f27154f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b40b8e6a7beae4e490c774017b26f6c8c2f49f26831d22502a3e0fe77f27154f","first_computed_at":"2026-05-17T23:56:43.977035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:43.977035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TkeO/v/bxpcydUfk9yNkwx3NxKRs46Ohm0/Yq2EUmUMnrBgCMbSLGt7IlB0ENBTLz9myTvzLoiLW1y/XvvzoCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:43.977441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bade0581ac015f9d980a62900f1c56d91b2c710ffebfcb9ad58e49a13cfb249","sha256:893c696b50aca6eff9dee2c39100a6ea5d947d6bcb4ae246f90eecf9f2782891"],"state_sha256":"716073db4876a2ebe12b7c84be1b69d426d83bd2e96df7ffa7d7a314440ab285"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65fjUYxF5JzBd3MKa9w8cqtVMDDK9PFgm5nParK4FD0794nVIFKvZP8giHGAlSidCgLKzM8UdQ1wK7pyBYA0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T09:45:11.871689Z","bundle_sha256":"0dc928d10c8b611337f1bc774794c39cc57d27c737113886a7fc2b08c2fc373f"}}