{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QFYIPUPB2REZYKFRMUFFSWG4WU","short_pith_number":"pith:QFYIPUPB","schema_version":"1.0","canonical_sha256":"817087d1e1d4499c28b1650a5958dcb537207490fb4e1f5559e07162cd88ce3e","source":{"kind":"arxiv","id":"1901.07719","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.07719","created_at":"2026-05-17T23:55:41.719119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07719v1","created_at":"2026-05-17T23:55:41.719119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07719","created_at":"2026-05-17T23:55:41.719119+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFYIPUPB2REZ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFYIPUPB2REZYKFR","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFYIPUPB","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU","json":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU.json","graph_json":"https://pith.science/api/pith-number/QFYIPUPB2REZYKFRMUFFSWG4WU/graph.json","events_json":"https://pith.science/api/pith-number/QFYIPUPB2REZYKFRMUFFSWG4WU/events.json","paper":"https://pith.science/paper/QFYIPUPB"},"agent_actions":{"view_html":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU","download_json":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU.json","view_paper":"https://pith.science/paper/QFYIPUPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07719&json=true","fetch_graph":"https://pith.science/api/pith-number/QFYIPUPB2REZYKFRMUFFSWG4WU/graph.json","fetch_events":"https://pith.science/api/pith-number/QFYIPUPB2REZYKFRMUFFSWG4WU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU/action/storage_attestation","attest_author":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU/action/author_attestation","sign_citation":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU/action/citation_signature","submit_replication":"https://pith.science/pith/QFYIPUPB2REZYKFRMUFFSWG4WU/action/replication_record"}},"created_at":"2026-05-17T23:55:41.719119+00:00","updated_at":"2026-05-17T23:55:41.719119+00:00"}