{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BSR6EWHJ6ZN4XE6MDCWSXKIPT6","short_pith_number":"pith:BSR6EWHJ","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"},"canonical_sha256":"0ca3e258e9f65bcb93cc18ad2ba90f9fa7cc3d91784aec41d6473b79adfa50dd","source":{"kind":"arxiv","id":"1607.07547","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BSR6EWHJ6ZN4XE6MDCWSXKIPT6","target":"record","payload":{"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"},"canonical_sha256":"0ca3e258e9f65bcb93cc18ad2ba90f9fa7cc3d91784aec41d6473b79adfa50dd","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"},"source_kind":"arxiv","source_id":"1607.07547","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-18T01:10:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uiuTdW/YnwRWbgOEt6zKTdNP0cmIq/FTlK/8F91ViJKxHv7xPflVTWH8YGGg22EHWjjY49fphIN2a1An8DiLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:28:30.751401Z"},"content_sha256":"9b92ce74c7fef1ff1ab9ce5968bdabedb6deadb0003d74852789a486dfe2b25f","schema_version":"1.0","event_id":"sha256:9b92ce74c7fef1ff1ab9ce5968bdabedb6deadb0003d74852789a486dfe2b25f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BSR6EWHJ6ZN4XE6MDCWSXKIPT6","target":"graph","payload":{"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"},"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-18T01:10:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sAIs7f3sMYQoyLKbZewO7rZha17kjMtaT3njve6Q7J3U2sqGY0jEHiDuxzjNDAweRy3fHsC61FFIcUV9dvkxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:28:30.751830Z"},"content_sha256":"d5f2320040406a401204902b725a097db3cf585cce37528cae243050a228f7f3","schema_version":"1.0","event_id":"sha256:d5f2320040406a401204902b725a097db3cf585cce37528cae243050a228f7f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/bundle.json","state_url":"https://pith.science/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/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-05-30T14:28:30Z","links":{"resolver":"https://pith.science/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6","bundle":"https://pith.science/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/bundle.json","state":"https://pith.science/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BSR6EWHJ6ZN4XE6MDCWSXKIPT6/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvuTtEO/sXnkpqCNFAl0u3OhRBF8vxzb5PYB/g4AHD862770IJllU/welPtv0zcAeWiUGYghTdnedN0DsRW8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:28:30.754619Z","bundle_sha256":"45f2df22dddaa76e0b9cad2c838e7c86a947ed698c6ab9fb4b60aab151e978b9"}}