{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BSR6EWHJ6ZN4XE6MDCWSXKIPT6","short_pith_number":"pith:BSR6EWHJ","schema_version":"1.0","canonical_sha256":"0ca3e258e9f65bcb93cc18ad2ba90f9fa7cc3d91784aec41d6473b79adfa50dd","source":{"kind":"arxiv","id":"1607.07547","version":1},"attestation_state":"computed","paper":{"title":"Latency-Optimal Uplink Scheduling Policy in Training-based Large-Scale Antenna Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kwang Soon Kim, Kyung Jun Choi","submitted_at":"2016-07-26T05:43:09Z","abstract_excerpt":"In this paper, an uplink scheduling policy problem to minimize the network latency, defined as the air-time to serve all of users with a quality-of-service (QoS), under an energy constraint is considered in a training-based large-scale antenna systems (LSAS) employing a simple linear receiver. An optimal algorithm providing the exact latency-optimal uplink scheduling policy is proposed with a polynomial-time complexity. Via numerical simulations, it is shown that the proposed scheduling policy can provide several times lower network latency over the conventional ones in realistic environments."},"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":"1607.07547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-26T05:43:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6e4a6e4b3feb6ef3f44508d82c856a11d0db1c56fc004d1048e7e62594eed170","abstract_canon_sha256":"9adbe4ab832575e732a425ba5a233ccd8abe666db557ac66312c377e2a3467cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:28.282620Z","signature_b64":"ctIqOB56FAa81VY73xQtB/KvQ4NrvX63y/YFDIU1a+UkYU7TXwacSCqSmQNRJVXnOwbuZS8PouoO45aHT8LKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ca3e258e9f65bcb93cc18ad2ba90f9fa7cc3d91784aec41d6473b79adfa50dd","last_reissued_at":"2026-05-18T01:10:28.282017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:28.282017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Latency-Optimal Uplink Scheduling Policy in Training-based Large-Scale Antenna Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kwang Soon Kim, Kyung Jun Choi","submitted_at":"2016-07-26T05:43:09Z","abstract_excerpt":"In this paper, an uplink scheduling policy problem to minimize the network latency, defined as the air-time to serve all of users with a quality-of-service (QoS), under an energy constraint is considered in a training-based large-scale antenna systems (LSAS) employing a simple linear receiver. An optimal algorithm providing the exact latency-optimal uplink scheduling policy is proposed with a polynomial-time complexity. Via numerical simulations, it is shown that the proposed scheduling policy can provide several times lower network latency over the conventional ones in realistic environments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07547","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":"1607.07547","created_at":"2026-05-18T01:10:28.282130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07547v1","created_at":"2026-05-18T01:10:28.282130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07547","created_at":"2026-05-18T01:10:28.282130+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSR6EWHJ6ZN4","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSR6EWHJ6ZN4XE6M","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSR6EWHJ","created_at":"2026-05-18T12:30:09.641336+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/BSR6EWHJ6ZN4XE6MDCWSXKIPT6","json":"https://pith.science/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6.json","graph_json":"https://pith.science/api/pith-number/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/graph.json","events_json":"https://pith.science/api/pith-number/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/events.json","paper":"https://pith.science/paper/BSR6EWHJ"},"agent_actions":{"view_html":"https://pith.science/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6","download_json":"https://pith.science/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6.json","view_paper":"https://pith.science/paper/BSR6EWHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07547&json=true","fetch_graph":"https://pith.science/api/pith-number/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/graph.json","fetch_events":"https://pith.science/api/pith-number/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/action/storage_attestation","attest_author":"https://pith.science/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/action/author_attestation","sign_citation":"https://pith.science/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/action/citation_signature","submit_replication":"https://pith.science/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/action/replication_record"}},"created_at":"2026-05-18T01:10:28.282130+00:00","updated_at":"2026-05-18T01:10:28.282130+00:00"}