{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:JIGHHJGVHZYLTKFFYBGYBLI3NQ","short_pith_number":"pith:JIGHHJGV","canonical_record":{"source":{"id":"2005.13134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-05-27T02:41:30Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"17a5d510c55c962e07e74ca79ca436ec8dbf418385f2a142f9a3fd1b341ae0b6","abstract_canon_sha256":"656cb7c386cf340525809084adcc0954aecbea9a1c514f0b9a125b90675927d1"},"schema_version":"1.0"},"canonical_sha256":"4a0c73a4d53e70b9a8a5c04d80ad1b6c0d65db93d8862d2a1a228b580e9be737","source":{"kind":"arxiv","id":"2005.13134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.13134","created_at":"2026-07-05T01:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"2005.13134v1","created_at":"2026-07-05T01:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.13134","created_at":"2026-07-05T01:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"JIGHHJGVHZYL","created_at":"2026-07-05T01:06:13Z"},{"alias_kind":"pith_short_16","alias_value":"JIGHHJGVHZYLTKFF","created_at":"2026-07-05T01:06:13Z"},{"alias_kind":"pith_short_8","alias_value":"JIGHHJGV","created_at":"2026-07-05T01:06:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:JIGHHJGVHZYLTKFFYBGYBLI3NQ","target":"record","payload":{"canonical_record":{"source":{"id":"2005.13134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-05-27T02:41:30Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"17a5d510c55c962e07e74ca79ca436ec8dbf418385f2a142f9a3fd1b341ae0b6","abstract_canon_sha256":"656cb7c386cf340525809084adcc0954aecbea9a1c514f0b9a125b90675927d1"},"schema_version":"1.0"},"canonical_sha256":"4a0c73a4d53e70b9a8a5c04d80ad1b6c0d65db93d8862d2a1a228b580e9be737","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:06:13.199160Z","signature_b64":"YHcBu7VEfJ3vZyXiOE4g3KiE1nnMs9VmBjsf4esoomjPaEwIi84MAsHLHakSitIlbcLJKm95ZXlfGXFBXWHkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a0c73a4d53e70b9a8a5c04d80ad1b6c0d65db93d8862d2a1a228b580e9be737","last_reissued_at":"2026-07-05T01:06:13.198763Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:06:13.198763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.13134","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-07-05T01:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"toa14gZ47OYt7NrAAfcFjAPpkfgRSsSnIXwLjk8I4puFJ40o21yCr27cPbJfORayRvDEHbNVuz8j1oDQvGyXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:48:30.650965Z"},"content_sha256":"8c946c24d8bdae3377479a06894475b84d95937a7ac0e7f37d2511a9c073efc3","schema_version":"1.0","event_id":"sha256:8c946c24d8bdae3377479a06894475b84d95937a7ac0e7f37d2511a9c073efc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:JIGHHJGVHZYLTKFFYBGYBLI3NQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Precoding in Massive MIMO: A Deep Learning Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Geoffrey Ye Li, Junchao Shi, Wenjin Wang, Xinping Yi, Xiqi Gao","submitted_at":"2020-05-27T02:41:30Z","abstract_excerpt":"In this paper, we consider massive multiple-input-multiple-output (MIMO) communication systems with a uniform planar array (UPA) at the base station (BS) and investigate the downlink precoding with imperfect channel state information (CSI). By exploiting both instantaneous and statistical CSI, we aim to design precoding vectors to maximize the ergodic rate (e.g., sum rate, minimum rate and etc.) subject to a total transmit power constraint. To maximize an upper bound of the ergodic rate, we leverage the corresponding Lagrangian formulation and identify the structural characteristics of the opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.13134","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.13134/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fs3uE7O51y/XibzidKwkK8nLwMXXnarxHFr8ps0Z/+y840mEN1mCvooztD8XTZtu/+dHoa7uD+caUyQI2MBVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:48:30.651850Z"},"content_sha256":"8e74b302ab1a9f795ca9a86eb87c987e7a164fab924dfe4fbf0395be4f72f1e9","schema_version":"1.0","event_id":"sha256:8e74b302ab1a9f795ca9a86eb87c987e7a164fab924dfe4fbf0395be4f72f1e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JIGHHJGVHZYLTKFFYBGYBLI3NQ/bundle.json","state_url":"https://pith.science/pith/JIGHHJGVHZYLTKFFYBGYBLI3NQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JIGHHJGVHZYLTKFFYBGYBLI3NQ/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-08-10T12:48:30Z","links":{"resolver":"https://pith.science/pith/JIGHHJGVHZYLTKFFYBGYBLI3NQ","bundle":"https://pith.science/pith/JIGHHJGVHZYLTKFFYBGYBLI3NQ/bundle.json","state":"https://pith.science/pith/JIGHHJGVHZYLTKFFYBGYBLI3NQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JIGHHJGVHZYLTKFFYBGYBLI3NQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:JIGHHJGVHZYLTKFFYBGYBLI3NQ","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":"656cb7c386cf340525809084adcc0954aecbea9a1c514f0b9a125b90675927d1","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-05-27T02:41:30Z","title_canon_sha256":"17a5d510c55c962e07e74ca79ca436ec8dbf418385f2a142f9a3fd1b341ae0b6"},"schema_version":"1.0","source":{"id":"2005.13134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.13134","created_at":"2026-07-05T01:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"2005.13134v1","created_at":"2026-07-05T01:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.13134","created_at":"2026-07-05T01:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"JIGHHJGVHZYL","created_at":"2026-07-05T01:06:13Z"},{"alias_kind":"pith_short_16","alias_value":"JIGHHJGVHZYLTKFF","created_at":"2026-07-05T01:06:13Z"},{"alias_kind":"pith_short_8","alias_value":"JIGHHJGV","created_at":"2026-07-05T01:06:13Z"}],"graph_snapshots":[{"event_id":"sha256:8e74b302ab1a9f795ca9a86eb87c987e7a164fab924dfe4fbf0395be4f72f1e9","target":"graph","created_at":"2026-07-05T01:06:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.13134/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider massive multiple-input-multiple-output (MIMO) communication systems with a uniform planar array (UPA) at the base station (BS) and investigate the downlink precoding with imperfect channel state information (CSI). By exploiting both instantaneous and statistical CSI, we aim to design precoding vectors to maximize the ergodic rate (e.g., sum rate, minimum rate and etc.) subject to a total transmit power constraint. To maximize an upper bound of the ergodic rate, we leverage the corresponding Lagrangian formulation and identify the structural characteristics of the opt","authors_text":"Geoffrey Ye Li, Junchao Shi, Wenjin Wang, Xinping Yi, Xiqi Gao","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-05-27T02:41:30Z","title":"Robust Precoding in Massive MIMO: A Deep Learning Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.13134","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:8c946c24d8bdae3377479a06894475b84d95937a7ac0e7f37d2511a9c073efc3","target":"record","created_at":"2026-07-05T01:06:13Z","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":"656cb7c386cf340525809084adcc0954aecbea9a1c514f0b9a125b90675927d1","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-05-27T02:41:30Z","title_canon_sha256":"17a5d510c55c962e07e74ca79ca436ec8dbf418385f2a142f9a3fd1b341ae0b6"},"schema_version":"1.0","source":{"id":"2005.13134","kind":"arxiv","version":1}},"canonical_sha256":"4a0c73a4d53e70b9a8a5c04d80ad1b6c0d65db93d8862d2a1a228b580e9be737","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a0c73a4d53e70b9a8a5c04d80ad1b6c0d65db93d8862d2a1a228b580e9be737","first_computed_at":"2026-07-05T01:06:13.198763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:06:13.198763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YHcBu7VEfJ3vZyXiOE4g3KiE1nnMs9VmBjsf4esoomjPaEwIi84MAsHLHakSitIlbcLJKm95ZXlfGXFBXWHkBA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:06:13.199160Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.13134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c946c24d8bdae3377479a06894475b84d95937a7ac0e7f37d2511a9c073efc3","sha256:8e74b302ab1a9f795ca9a86eb87c987e7a164fab924dfe4fbf0395be4f72f1e9"],"state_sha256":"6288ada63d167c536b552c67a009738289441eb69dd2a6a61ad237140d01ee2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rVB559iA5GUI9/mCdbqvdUZpeeUwBf/WUqhLZQupmO1GTHJ4dWkqo0y8jiqQFTH41EvxM6I82XaRlYxVgcPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T12:48:30.659811Z","bundle_sha256":"f1ab6a65c0455663a4b66b0e9eda55d74cf963a4c1e62bf614229dd73a634d6d"}}