{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DMJFAJOSCRDJS5CIERZJ7QEVFT","short_pith_number":"pith:DMJFAJOS","schema_version":"1.0","canonical_sha256":"1b125025d2144699744824729fc0952cffe7e781e923829189be6914a7b9f5ff","source":{"kind":"arxiv","id":"1707.04088","version":3},"attestation_state":"computed","paper":{"title":"Robust Geometry-Based User Scheduling for Large MIMO Systems Under Realistic Channel Conditions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alister G. Burr, Dick Maryopi, Kanapathippillai Cumanan, Katsuyuki Haneda, Manijeh Bashar","submitted_at":"2017-07-13T12:24:58Z","abstract_excerpt":"The problem of user scheduling with reduced overhead of channel estimation in the uplink of Massive multiple-input multiple-output (MIMO) systems has been considered. A geometry-based stochastic channel model (GSCM), called the COST 2100 channel model has been used for realistic analysis of channels. In this paper, we propose a new user selection algorithm based on knowledge of the geometry of the service area and location of clusters, without having full channel state information (CSI) at the base station (BS). The multi-user link correlation in the GSCMs arises from the common clusters in th"},"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":"1707.04088","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T12:24:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f15f75a4fd5e08511bd565c732b6ec3e682d52e7d28cf753a2082c5b5c9ca4cc","abstract_canon_sha256":"e59881ca5f7870afd2429ccd951e3a72d7f4d7a7e44945889487e7e7fa325720"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:43.295411Z","signature_b64":"ZHQYSw5lHZ4JaL2F9FRPD23vtNidUEEug7iElHGYopKTvKkCeqobx/rVWeUJCZyrIcrhUSSm/WaocSxNCu0bDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b125025d2144699744824729fc0952cffe7e781e923829189be6914a7b9f5ff","last_reissued_at":"2026-05-18T00:17:43.294618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:43.294618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Geometry-Based User Scheduling for Large MIMO Systems Under Realistic Channel Conditions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alister G. Burr, Dick Maryopi, Kanapathippillai Cumanan, Katsuyuki Haneda, Manijeh Bashar","submitted_at":"2017-07-13T12:24:58Z","abstract_excerpt":"The problem of user scheduling with reduced overhead of channel estimation in the uplink of Massive multiple-input multiple-output (MIMO) systems has been considered. A geometry-based stochastic channel model (GSCM), called the COST 2100 channel model has been used for realistic analysis of channels. In this paper, we propose a new user selection algorithm based on knowledge of the geometry of the service area and location of clusters, without having full channel state information (CSI) at the base station (BS). The multi-user link correlation in the GSCMs arises from the common clusters in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04088","kind":"arxiv","version":3},"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":"1707.04088","created_at":"2026-05-18T00:17:43.294754+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04088v3","created_at":"2026-05-18T00:17:43.294754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04088","created_at":"2026-05-18T00:17:43.294754+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMJFAJOSCRDJ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMJFAJOSCRDJS5CI","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMJFAJOS","created_at":"2026-05-18T12:31:12.930513+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/DMJFAJOSCRDJS5CIERZJ7QEVFT","json":"https://pith.science/pith/DMJFAJOSCRDJS5CIERZJ7QEVFT.json","graph_json":"https://pith.science/api/pith-number/DMJFAJOSCRDJS5CIERZJ7QEVFT/graph.json","events_json":"https://pith.science/api/pith-number/DMJFAJOSCRDJS5CIERZJ7QEVFT/events.json","paper":"https://pith.science/paper/DMJFAJOS"},"agent_actions":{"view_html":"https://pith.science/pith/DMJFAJOSCRDJS5CIERZJ7QEVFT","download_json":"https://pith.science/pith/DMJFAJOSCRDJS5CIERZJ7QEVFT.json","view_paper":"https://pith.science/paper/DMJFAJOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04088&json=true","fetch_graph":"https://pith.science/api/pith-number/DMJFAJOSCRDJS5CIERZJ7QEVFT/graph.json","fetch_events":"https://pith.science/api/pith-number/DMJFAJOSCRDJS5CIERZJ7QEVFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMJFAJOSCRDJS5CIERZJ7QEVFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMJFAJOSCRDJS5CIERZJ7QEVFT/action/storage_attestation","attest_author":"https://pith.science/pith/DMJFAJOSCRDJS5CIERZJ7QEVFT/action/author_attestation","sign_citation":"https://pith.science/pith/DMJFAJOSCRDJS5CIERZJ7QEVFT/action/citation_signature","submit_replication":"https://pith.science/pith/DMJFAJOSCRDJS5CIERZJ7QEVFT/action/replication_record"}},"created_at":"2026-05-18T00:17:43.294754+00:00","updated_at":"2026-05-18T00:17:43.294754+00:00"}