{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:COZ6IFOPWKBPW7GDWRR6TNIRF5","short_pith_number":"pith:COZ6IFOP","canonical_record":{"source":{"id":"1502.03666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-12T14:08:27Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"6f8a5d3c2f544d28a61947c51caaac10b95f783da1f3f9303fe6ebbcb9fcc97b","abstract_canon_sha256":"a77484960643a9294a7a83789d8e175056f82ea956f63a249165bbd3c106d07a"},"schema_version":"1.0"},"canonical_sha256":"13b3e415cfb282fb7cc3b463e9b5112f48511d16632ad9f3d40e145d6801b23a","source":{"kind":"arxiv","id":"1502.03666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03666","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03666v1","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03666","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"COZ6IFOPWKBP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"COZ6IFOPWKBPW7GD","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"COZ6IFOP","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:COZ6IFOPWKBPW7GDWRR6TNIRF5","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-12T14:08:27Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"6f8a5d3c2f544d28a61947c51caaac10b95f783da1f3f9303fe6ebbcb9fcc97b","abstract_canon_sha256":"a77484960643a9294a7a83789d8e175056f82ea956f63a249165bbd3c106d07a"},"schema_version":"1.0"},"canonical_sha256":"13b3e415cfb282fb7cc3b463e9b5112f48511d16632ad9f3d40e145d6801b23a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.051996Z","signature_b64":"2sJM4z5ltjgj5tsMIPvn93FfYARlS+PwrRd+D636H3vM4TZTq1MxDMWPHVglxt1M25jVfKfdAPAr1liSggIYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13b3e415cfb282fb7cc3b463e9b5112f48511d16632ad9f3d40e145d6801b23a","last_reissued_at":"2026-05-18T00:57:51.051446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.051446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03666","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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dT0hiWVOleL+buLBPPaEqHNBY5cZJwBQC49lB//71KTeAnT3JCwKFgMVga+DiZPzsRhNYL/QuTkkTDlzDQOaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:31:01.920819Z"},"content_sha256":"79bc8308a957390e9cab89402338599bb1003e34852ed9f4a0a3ce23e897cdef","schema_version":"1.0","event_id":"sha256:79bc8308a957390e9cab89402338599bb1003e34852ed9f4a0a3ce23e897cdef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:COZ6IFOPWKBPW7GDWRR6TNIRF5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fundamental Limits of CDF-Based Scheduling: Throughput, Fairness, and Feedback Overhead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Bang Chul Jung, Hu Jin, Victor C. M. Leung","submitted_at":"2015-02-12T14:08:27Z","abstract_excerpt":"In this paper, we investigate fundamental performance limits of cumulative distribution function (CDF)-based scheduling (CS) in downlink cellular networks. CS is known as an efficient scheduling method that can assign different time fractions for users or, equivalently, satisfy different channel access ratio (CAR) requirements of users while exploiting multi-user diversity. We first mathematically analyze the throughput characteristics of CS in arbitrary fading statistics and data rate functions. It is shown that the throughput gain of CS increases as the CAR of a user decreases or the number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03666","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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V+Vjuq32IvRs/p2C39Ox71W1aJRuGjiyO5bu7+4+reH8ErTw1Wp8WAJeSegtF1bDLRAEDHfpTyq/EWJdkg40BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:31:01.921552Z"},"content_sha256":"38de7d343b832bc81a16084a4f43cda43b099115e459f7ce8a4a7308091f0f39","schema_version":"1.0","event_id":"sha256:38de7d343b832bc81a16084a4f43cda43b099115e459f7ce8a4a7308091f0f39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/COZ6IFOPWKBPW7GDWRR6TNIRF5/bundle.json","state_url":"https://pith.science/pith/COZ6IFOPWKBPW7GDWRR6TNIRF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/COZ6IFOPWKBPW7GDWRR6TNIRF5/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-10T22:31:01Z","links":{"resolver":"https://pith.science/pith/COZ6IFOPWKBPW7GDWRR6TNIRF5","bundle":"https://pith.science/pith/COZ6IFOPWKBPW7GDWRR6TNIRF5/bundle.json","state":"https://pith.science/pith/COZ6IFOPWKBPW7GDWRR6TNIRF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/COZ6IFOPWKBPW7GDWRR6TNIRF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:COZ6IFOPWKBPW7GDWRR6TNIRF5","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":"a77484960643a9294a7a83789d8e175056f82ea956f63a249165bbd3c106d07a","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-12T14:08:27Z","title_canon_sha256":"6f8a5d3c2f544d28a61947c51caaac10b95f783da1f3f9303fe6ebbcb9fcc97b"},"schema_version":"1.0","source":{"id":"1502.03666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03666","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03666v1","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03666","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"COZ6IFOPWKBP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"COZ6IFOPWKBPW7GD","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"COZ6IFOP","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:38de7d343b832bc81a16084a4f43cda43b099115e459f7ce8a4a7308091f0f39","target":"graph","created_at":"2026-05-18T00:57:51Z","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 investigate fundamental performance limits of cumulative distribution function (CDF)-based scheduling (CS) in downlink cellular networks. CS is known as an efficient scheduling method that can assign different time fractions for users or, equivalently, satisfy different channel access ratio (CAR) requirements of users while exploiting multi-user diversity. We first mathematically analyze the throughput characteristics of CS in arbitrary fading statistics and data rate functions. It is shown that the throughput gain of CS increases as the CAR of a user decreases or the number ","authors_text":"Bang Chul Jung, Hu Jin, Victor C. M. Leung","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-12T14:08:27Z","title":"Fundamental Limits of CDF-Based Scheduling: Throughput, Fairness, and Feedback Overhead"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03666","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:79bc8308a957390e9cab89402338599bb1003e34852ed9f4a0a3ce23e897cdef","target":"record","created_at":"2026-05-18T00:57:51Z","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":"a77484960643a9294a7a83789d8e175056f82ea956f63a249165bbd3c106d07a","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-12T14:08:27Z","title_canon_sha256":"6f8a5d3c2f544d28a61947c51caaac10b95f783da1f3f9303fe6ebbcb9fcc97b"},"schema_version":"1.0","source":{"id":"1502.03666","kind":"arxiv","version":1}},"canonical_sha256":"13b3e415cfb282fb7cc3b463e9b5112f48511d16632ad9f3d40e145d6801b23a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13b3e415cfb282fb7cc3b463e9b5112f48511d16632ad9f3d40e145d6801b23a","first_computed_at":"2026-05-18T00:57:51.051446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:51.051446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2sJM4z5ltjgj5tsMIPvn93FfYARlS+PwrRd+D636H3vM4TZTq1MxDMWPHVglxt1M25jVfKfdAPAr1liSggIYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:51.051996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79bc8308a957390e9cab89402338599bb1003e34852ed9f4a0a3ce23e897cdef","sha256:38de7d343b832bc81a16084a4f43cda43b099115e459f7ce8a4a7308091f0f39"],"state_sha256":"b10852fda3a372718d1fc5eb42cda772446428238324b9beaa0e122a24ff16d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E6E/9TjCO5PyQLNk7z9taNJCkPrhbfEFBE66xY3dBxImXHVQGao0PUTsTi6C7kp6/HjxiCZE1swSOKSxDdXRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:31:01.925733Z","bundle_sha256":"cde54988836d4b16fc543fc378fb66bf904ced601886a927c6aca029faf3517e"}}