{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QFYIPUPB2REZYKFRMUFFSWG4WU","short_pith_number":"pith:QFYIPUPB","canonical_record":{"source":{"id":"1901.07719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T04:31:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"79d2e85cae261b7097e33e2358d901d78dcd04570e2a622aaa823223ee31bb16","abstract_canon_sha256":"e5bf02e59e3bf1928e136ca72f5e2b980abd1a49a2f91f6925163825f04452df"},"schema_version":"1.0"},"canonical_sha256":"817087d1e1d4499c28b1650a5958dcb537207490fb4e1f5559e07162cd88ce3e","source":{"kind":"arxiv","id":"1901.07719","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07719","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07719v1","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07719","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"pith_short_12","alias_value":"QFYIPUPB2REZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QFYIPUPB2REZYKFR","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QFYIPUPB","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QFYIPUPB2REZYKFRMUFFSWG4WU","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T04:31:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"79d2e85cae261b7097e33e2358d901d78dcd04570e2a622aaa823223ee31bb16","abstract_canon_sha256":"e5bf02e59e3bf1928e136ca72f5e2b980abd1a49a2f91f6925163825f04452df"},"schema_version":"1.0"},"canonical_sha256":"817087d1e1d4499c28b1650a5958dcb537207490fb4e1f5559e07162cd88ce3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:41.719614Z","signature_b64":"ild4tQ4UPI/8G0I6O4Rjkt+RqF3YUs7gf7+kXsGT3ZtcofD5kxXWWp5SCym9j8fWTskInUTVI+mkfgWUSaRNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"817087d1e1d4499c28b1650a5958dcb537207490fb4e1f5559e07162cd88ce3e","last_reissued_at":"2026-05-17T23:55:41.719052Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:41.719052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07719","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:55:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/CA0Zw4M2msDtwUQAOZE7A3IkXXUqPu8EIXBE4sFXRsbhj8c3JtlV1T4E32k1ocCuI6F66maJsQKG/R/BV9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:35:12.272039Z"},"content_sha256":"09ce93e887927676e402cee00d754a30524f69e467b2287a9b9369741bbdabdf","schema_version":"1.0","event_id":"sha256:09ce93e887927676e402cee00d754a30524f69e467b2287a9b9369741bbdabdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QFYIPUPB2REZYKFRMUFFSWG4WU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elza Erkip, Farhad Shirani, Shahram Shahsavari","submitted_at":"2019-01-23T04:31:07Z","abstract_excerpt":"In the conventional information theoretic analysis of multiterminal communication scenarios, it is often assumed that all of the distributed terminals use the communication channel simultaneously. However, in practical wireless communication systems - due to restricted computation complexity at network terminals - a limited number of users can be activated either in uplink or downlink simultaneously. This necessitates the design of a scheduler which determines the set of active users at each time-slot. A well designed scheduler maximizes the average system utility subject to a set of fairness "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07719","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:55:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xYfg8AE+oTYea+77n+PkzziJ9KwYYqM5G7N3LXRHWWTzcjvj+k9rJig78GZRAZJj84jsSlnLiPwlsb/VLdITCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:35:12.272784Z"},"content_sha256":"f868bc91a9c76ffeaa211d80716a134b830b8dc2e6f95c9a8a77adad29fc8056","schema_version":"1.0","event_id":"sha256:f868bc91a9c76ffeaa211d80716a134b830b8dc2e6f95c9a8a77adad29fc8056"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU/bundle.json","state_url":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFYIPUPB2REZYKFRMUFFSWG4WU/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-10T23:35:12Z","links":{"resolver":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU","bundle":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU/bundle.json","state":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFYIPUPB2REZYKFRMUFFSWG4WU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QFYIPUPB2REZYKFRMUFFSWG4WU","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":"e5bf02e59e3bf1928e136ca72f5e2b980abd1a49a2f91f6925163825f04452df","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T04:31:07Z","title_canon_sha256":"79d2e85cae261b7097e33e2358d901d78dcd04570e2a622aaa823223ee31bb16"},"schema_version":"1.0","source":{"id":"1901.07719","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07719","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07719v1","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07719","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"pith_short_12","alias_value":"QFYIPUPB2REZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QFYIPUPB2REZYKFR","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QFYIPUPB","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:f868bc91a9c76ffeaa211d80716a134b830b8dc2e6f95c9a8a77adad29fc8056","target":"graph","created_at":"2026-05-17T23:55:41Z","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 the conventional information theoretic analysis of multiterminal communication scenarios, it is often assumed that all of the distributed terminals use the communication channel simultaneously. However, in practical wireless communication systems - due to restricted computation complexity at network terminals - a limited number of users can be activated either in uplink or downlink simultaneously. This necessitates the design of a scheduler which determines the set of active users at each time-slot. A well designed scheduler maximizes the average system utility subject to a set of fairness ","authors_text":"Elza Erkip, Farhad Shirani, Shahram Shahsavari","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T04:31:07Z","title":"On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07719","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:09ce93e887927676e402cee00d754a30524f69e467b2287a9b9369741bbdabdf","target":"record","created_at":"2026-05-17T23:55:41Z","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":"e5bf02e59e3bf1928e136ca72f5e2b980abd1a49a2f91f6925163825f04452df","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T04:31:07Z","title_canon_sha256":"79d2e85cae261b7097e33e2358d901d78dcd04570e2a622aaa823223ee31bb16"},"schema_version":"1.0","source":{"id":"1901.07719","kind":"arxiv","version":1}},"canonical_sha256":"817087d1e1d4499c28b1650a5958dcb537207490fb4e1f5559e07162cd88ce3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"817087d1e1d4499c28b1650a5958dcb537207490fb4e1f5559e07162cd88ce3e","first_computed_at":"2026-05-17T23:55:41.719052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:41.719052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ild4tQ4UPI/8G0I6O4Rjkt+RqF3YUs7gf7+kXsGT3ZtcofD5kxXWWp5SCym9j8fWTskInUTVI+mkfgWUSaRNBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:41.719614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07719","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09ce93e887927676e402cee00d754a30524f69e467b2287a9b9369741bbdabdf","sha256:f868bc91a9c76ffeaa211d80716a134b830b8dc2e6f95c9a8a77adad29fc8056"],"state_sha256":"93f316f762f8ce817ec753e608094a97095ddfe41cddb243956e14b21d97cf31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jzQbaOnMgmXTSAbjd0IQXVSeIR5MBV4oHyShy2pKDB+XommBsaHa1wH0/O5SlUpIOX5WsB4+zHseGhZctOrRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:35:12.276877Z","bundle_sha256":"87d15f8a375f5aebe9e4f0bb291f1727fdf3bfdd35366e779f266af4d3d7f700"}}