{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5BSP77PMTKDK6FOLGSY4EJ47AH","short_pith_number":"pith:5BSP77PM","schema_version":"1.0","canonical_sha256":"e864fffdec9a86af15cb34b1c2279f01ca8bcd5056889a244f37de78b7c766eb","source":{"kind":"arxiv","id":"1804.08428","version":1},"attestation_state":"computed","paper":{"title":"Robust User Scheduling with COST 2100 Channel Model for Massive MIMO Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alister G. Burr, Katsuyuki Haneda Kanapathippillai Cumanan, Manijeh Bashar","submitted_at":"2018-04-20T09:11:41Z","abstract_excerpt":"This paper considers a Massive multiple-input multiple-output (MIMO) network, where the base station (BS) with a large number of antennas communicates with a smaller number of users. The signals are transmitted using frequency division duplex (FDD) mode. The problem of user scheduling with reduced overhead of channel estimation in the uplink of Massive MIMO systems has been investigated. We consider the COST 2100 channel model. In this paper, we first propose a new user selection algorithm based on knowledge of the geometry of the service area and of location of clusters, without having full c"},"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":"1804.08428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-20T09:11:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ed72463d89e624d291f05ba02879564b382bc4c8c025583e906c9ce95b8b86c7","abstract_canon_sha256":"19a0ccdc8206460679a98133a534cd203401ff94f4e4b950c45ad03bf36e17b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:48.380000Z","signature_b64":"llnyyC1weOXKnePYIwsSBeXUhIlIHSiCLYIja16ZrPukzwp8Yp82qw4T0mXSoawkbRi96pwu75qecmSYY70NCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e864fffdec9a86af15cb34b1c2279f01ca8bcd5056889a244f37de78b7c766eb","last_reissued_at":"2026-05-18T00:17:48.379309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:48.379309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust User Scheduling with COST 2100 Channel Model for Massive MIMO Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alister G. Burr, Katsuyuki Haneda Kanapathippillai Cumanan, Manijeh Bashar","submitted_at":"2018-04-20T09:11:41Z","abstract_excerpt":"This paper considers a Massive multiple-input multiple-output (MIMO) network, where the base station (BS) with a large number of antennas communicates with a smaller number of users. The signals are transmitted using frequency division duplex (FDD) mode. The problem of user scheduling with reduced overhead of channel estimation in the uplink of Massive MIMO systems has been investigated. We consider the COST 2100 channel model. In this paper, we first propose a new user selection algorithm based on knowledge of the geometry of the service area and of location of clusters, without having full c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08428","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":"1804.08428","created_at":"2026-05-18T00:17:48.379419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08428v1","created_at":"2026-05-18T00:17:48.379419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08428","created_at":"2026-05-18T00:17:48.379419+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BSP77PMTKDK","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BSP77PMTKDK6FOL","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BSP77PM","created_at":"2026-05-18T12:32:08.215937+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/5BSP77PMTKDK6FOLGSY4EJ47AH","json":"https://pith.science/pith/5BSP77PMTKDK6FOLGSY4EJ47AH.json","graph_json":"https://pith.science/api/pith-number/5BSP77PMTKDK6FOLGSY4EJ47AH/graph.json","events_json":"https://pith.science/api/pith-number/5BSP77PMTKDK6FOLGSY4EJ47AH/events.json","paper":"https://pith.science/paper/5BSP77PM"},"agent_actions":{"view_html":"https://pith.science/pith/5BSP77PMTKDK6FOLGSY4EJ47AH","download_json":"https://pith.science/pith/5BSP77PMTKDK6FOLGSY4EJ47AH.json","view_paper":"https://pith.science/paper/5BSP77PM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08428&json=true","fetch_graph":"https://pith.science/api/pith-number/5BSP77PMTKDK6FOLGSY4EJ47AH/graph.json","fetch_events":"https://pith.science/api/pith-number/5BSP77PMTKDK6FOLGSY4EJ47AH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BSP77PMTKDK6FOLGSY4EJ47AH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BSP77PMTKDK6FOLGSY4EJ47AH/action/storage_attestation","attest_author":"https://pith.science/pith/5BSP77PMTKDK6FOLGSY4EJ47AH/action/author_attestation","sign_citation":"https://pith.science/pith/5BSP77PMTKDK6FOLGSY4EJ47AH/action/citation_signature","submit_replication":"https://pith.science/pith/5BSP77PMTKDK6FOLGSY4EJ47AH/action/replication_record"}},"created_at":"2026-05-18T00:17:48.379419+00:00","updated_at":"2026-05-18T00:17:48.379419+00:00"}