{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BSR6EWHJ6ZN4XE6MDCWSXKIPT6","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":"9adbe4ab832575e732a425ba5a233ccd8abe666db557ac66312c377e2a3467cd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-26T05:43:09Z","title_canon_sha256":"6e4a6e4b3feb6ef3f44508d82c856a11d0db1c56fc004d1048e7e62594eed170"},"schema_version":"1.0","source":{"id":"1607.07547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07547","created_at":"2026-05-18T01:10:28Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07547v1","created_at":"2026-05-18T01:10:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07547","created_at":"2026-05-18T01:10:28Z"},{"alias_kind":"pith_short_12","alias_value":"BSR6EWHJ6ZN4","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BSR6EWHJ6ZN4XE6M","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BSR6EWHJ","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:d5f2320040406a401204902b725a097db3cf585cce37528cae243050a228f7f3","target":"graph","created_at":"2026-05-18T01:10:28Z","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, 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.","authors_text":"Kwang Soon Kim, Kyung Jun Choi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-26T05:43:09Z","title":"Latency-Optimal Uplink Scheduling Policy in Training-based Large-Scale Antenna Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07547","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:9b92ce74c7fef1ff1ab9ce5968bdabedb6deadb0003d74852789a486dfe2b25f","target":"record","created_at":"2026-05-18T01:10:28Z","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":"9adbe4ab832575e732a425ba5a233ccd8abe666db557ac66312c377e2a3467cd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-26T05:43:09Z","title_canon_sha256":"6e4a6e4b3feb6ef3f44508d82c856a11d0db1c56fc004d1048e7e62594eed170"},"schema_version":"1.0","source":{"id":"1607.07547","kind":"arxiv","version":1}},"canonical_sha256":"0ca3e258e9f65bcb93cc18ad2ba90f9fa7cc3d91784aec41d6473b79adfa50dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ca3e258e9f65bcb93cc18ad2ba90f9fa7cc3d91784aec41d6473b79adfa50dd","first_computed_at":"2026-05-18T01:10:28.282017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:28.282017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ctIqOB56FAa81VY73xQtB/KvQ4NrvX63y/YFDIU1a+UkYU7TXwacSCqSmQNRJVXnOwbuZS8PouoO45aHT8LKDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:28.282620Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b92ce74c7fef1ff1ab9ce5968bdabedb6deadb0003d74852789a486dfe2b25f","sha256:d5f2320040406a401204902b725a097db3cf585cce37528cae243050a228f7f3"],"state_sha256":"7677ce793c916253505e3d6218f1c63a116cb7b71b2b1bc49270923b4999ad95"}