{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EN5N772IDHPGNSCGHVI33Z3YWM","short_pith_number":"pith:EN5N772I","canonical_record":{"source":{"id":"1907.01865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-03T11:55:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0cca788630ca2cb44b6a6d817f32329220a69334a7ff7419d969fcf94cf3af81","abstract_canon_sha256":"58712633b0bbb01a488322a14d7e8cbe2c03bca7478a682d298054e8f4c2a4fa"},"schema_version":"1.0"},"canonical_sha256":"237adfff4819de66c8463d51bde778b302a349025f1f450137bf9083e9cca1ee","source":{"kind":"arxiv","id":"1907.01865","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01865","created_at":"2026-05-17T23:41:34Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01865v1","created_at":"2026-05-17T23:41:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01865","created_at":"2026-05-17T23:41:34Z"},{"alias_kind":"pith_short_12","alias_value":"EN5N772IDHPG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EN5N772IDHPGNSCG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EN5N772I","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EN5N772IDHPGNSCGHVI33Z3YWM","target":"record","payload":{"canonical_record":{"source":{"id":"1907.01865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-03T11:55:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0cca788630ca2cb44b6a6d817f32329220a69334a7ff7419d969fcf94cf3af81","abstract_canon_sha256":"58712633b0bbb01a488322a14d7e8cbe2c03bca7478a682d298054e8f4c2a4fa"},"schema_version":"1.0"},"canonical_sha256":"237adfff4819de66c8463d51bde778b302a349025f1f450137bf9083e9cca1ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:34.748739Z","signature_b64":"MsQsfIuhR+AVhMHDQLRW8yaBDWdZcV9tgkqqr+KHpScs6zWY0+Yx5fraBWQKm2xtqnVwej2ifHvyNUWMXBrpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"237adfff4819de66c8463d51bde778b302a349025f1f450137bf9083e9cca1ee","last_reissued_at":"2026-05-17T23:41:34.748006Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:34.748006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.01865","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-17T23:41:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXNNkrZXvsgsDe/Ja2hsjJBeSvala+7FoysjQjwj3uqMQuJeMNny6oVRUA9ObSoP7ibM750ZYQixJBCBhsl6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:36:59.533450Z"},"content_sha256":"270c210d0a8d829585da2d1c3eaba8bdf2070fb9dd43714fa20ab76742f1cfb5","schema_version":"1.0","event_id":"sha256:270c210d0a8d829585da2d1c3eaba8bdf2070fb9dd43714fa20ab76742f1cfb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EN5N772IDHPGNSCGHVI33Z3YWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evaluation of Low Complexity Massive MIMO Techniques Under Realistic Channel Conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Alister G. Burr, Kanapathippillai Cumanan, Katsuyuki Haneda, Manijeh Bashar, Mehdi M. Molu, Mohsen Khalily, Pei Xiao","submitted_at":"2019-07-03T11:55:35Z","abstract_excerpt":"A low complexity massive multiple-input multiple-output (MIMO) technique is studied with a geometry-based stochastic channel model, called COST 2100 model. We propose to exploit the discrete-time Fourier transform of the antenna correlation function to perform user scheduling. The proposed algorithm relies on a trade off between the number of occupied bins of the eigenvalue spectrum of the channel covariance matrix for each user and spectral overlap among the selected users. We next show that linear precoding design can be performed based only on the channel correlation matrix. The proposed sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01865","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-17T23:41:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/6cZ/hApQIIlayoR1Yqh5zUuSgt6H3z1CRoD2GRTv1swBkUMFc6JDr0ESS/6q0FdJ2hNrFOK8ehpPGy+EKdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:36:59.534145Z"},"content_sha256":"75f7df308d2c41352b27bf7653ac28721eb15508ae34aab028e2d37194059d10","schema_version":"1.0","event_id":"sha256:75f7df308d2c41352b27bf7653ac28721eb15508ae34aab028e2d37194059d10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EN5N772IDHPGNSCGHVI33Z3YWM/bundle.json","state_url":"https://pith.science/pith/EN5N772IDHPGNSCGHVI33Z3YWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EN5N772IDHPGNSCGHVI33Z3YWM/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-26T02:36:59Z","links":{"resolver":"https://pith.science/pith/EN5N772IDHPGNSCGHVI33Z3YWM","bundle":"https://pith.science/pith/EN5N772IDHPGNSCGHVI33Z3YWM/bundle.json","state":"https://pith.science/pith/EN5N772IDHPGNSCGHVI33Z3YWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EN5N772IDHPGNSCGHVI33Z3YWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EN5N772IDHPGNSCGHVI33Z3YWM","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":"58712633b0bbb01a488322a14d7e8cbe2c03bca7478a682d298054e8f4c2a4fa","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-03T11:55:35Z","title_canon_sha256":"0cca788630ca2cb44b6a6d817f32329220a69334a7ff7419d969fcf94cf3af81"},"schema_version":"1.0","source":{"id":"1907.01865","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01865","created_at":"2026-05-17T23:41:34Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01865v1","created_at":"2026-05-17T23:41:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01865","created_at":"2026-05-17T23:41:34Z"},{"alias_kind":"pith_short_12","alias_value":"EN5N772IDHPG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EN5N772IDHPGNSCG","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EN5N772I","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:75f7df308d2c41352b27bf7653ac28721eb15508ae34aab028e2d37194059d10","target":"graph","created_at":"2026-05-17T23:41:34Z","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":"A low complexity massive multiple-input multiple-output (MIMO) technique is studied with a geometry-based stochastic channel model, called COST 2100 model. We propose to exploit the discrete-time Fourier transform of the antenna correlation function to perform user scheduling. The proposed algorithm relies on a trade off between the number of occupied bins of the eigenvalue spectrum of the channel covariance matrix for each user and spectral overlap among the selected users. We next show that linear precoding design can be performed based only on the channel correlation matrix. The proposed sc","authors_text":"Alister G. Burr, Kanapathippillai Cumanan, Katsuyuki Haneda, Manijeh Bashar, Mehdi M. Molu, Mohsen Khalily, Pei Xiao","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-03T11:55:35Z","title":"Evaluation of Low Complexity Massive MIMO Techniques Under Realistic Channel Conditions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01865","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:270c210d0a8d829585da2d1c3eaba8bdf2070fb9dd43714fa20ab76742f1cfb5","target":"record","created_at":"2026-05-17T23:41:34Z","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":"58712633b0bbb01a488322a14d7e8cbe2c03bca7478a682d298054e8f4c2a4fa","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-03T11:55:35Z","title_canon_sha256":"0cca788630ca2cb44b6a6d817f32329220a69334a7ff7419d969fcf94cf3af81"},"schema_version":"1.0","source":{"id":"1907.01865","kind":"arxiv","version":1}},"canonical_sha256":"237adfff4819de66c8463d51bde778b302a349025f1f450137bf9083e9cca1ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"237adfff4819de66c8463d51bde778b302a349025f1f450137bf9083e9cca1ee","first_computed_at":"2026-05-17T23:41:34.748006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:34.748006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MsQsfIuhR+AVhMHDQLRW8yaBDWdZcV9tgkqqr+KHpScs6zWY0+Yx5fraBWQKm2xtqnVwej2ifHvyNUWMXBrpAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:34.748739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01865","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:270c210d0a8d829585da2d1c3eaba8bdf2070fb9dd43714fa20ab76742f1cfb5","sha256:75f7df308d2c41352b27bf7653ac28721eb15508ae34aab028e2d37194059d10"],"state_sha256":"6c432cc1677dc1113d8c24d5c7b262b4b0fc6b3586ff697baf2c649919a9093d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XSZtyrdhd0nxM7Zf2vFb8mGZ/fMjBPYvDvOyi552zeyNqeE+z9+qx0MlFhrbB0Q3I3IwxkP6Sq1IiErZloi9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:36:59.537595Z","bundle_sha256":"21c222d05999b80242d922fa8c4e8a50840312c2d887d4132eae2b31948a7148"}}