{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3RHF3Q5EN6HFM4T54YL3CCYQKF","short_pith_number":"pith:3RHF3Q5E","canonical_record":{"source":{"id":"2009.09406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-09-20T10:39:29Z","cross_cats_sorted":[],"title_canon_sha256":"260be1a4ab799b601ada1637c9dad11648c6743e543ebbe705b74f9be9cf0f11","abstract_canon_sha256":"4d8c7df9259f73c1adc186e919655d8d9dadee1fb4ccd5af2db0052156c55a7e"},"schema_version":"1.0"},"canonical_sha256":"dc4e5dc3a46f8e56727de617b10b10516a0fb96f19580bed37e3ff89c6d7a242","source":{"kind":"arxiv","id":"2009.09406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.09406","created_at":"2026-07-05T01:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"2009.09406v1","created_at":"2026-07-05T01:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.09406","created_at":"2026-07-05T01:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"3RHF3Q5EN6HF","created_at":"2026-07-05T01:36:37Z"},{"alias_kind":"pith_short_16","alias_value":"3RHF3Q5EN6HFM4T5","created_at":"2026-07-05T01:36:37Z"},{"alias_kind":"pith_short_8","alias_value":"3RHF3Q5E","created_at":"2026-07-05T01:36:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3RHF3Q5EN6HFM4T54YL3CCYQKF","target":"record","payload":{"canonical_record":{"source":{"id":"2009.09406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-09-20T10:39:29Z","cross_cats_sorted":[],"title_canon_sha256":"260be1a4ab799b601ada1637c9dad11648c6743e543ebbe705b74f9be9cf0f11","abstract_canon_sha256":"4d8c7df9259f73c1adc186e919655d8d9dadee1fb4ccd5af2db0052156c55a7e"},"schema_version":"1.0"},"canonical_sha256":"dc4e5dc3a46f8e56727de617b10b10516a0fb96f19580bed37e3ff89c6d7a242","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:36:37.641994Z","signature_b64":"C1sqqVls4A7miEDk1N0ziFpW+xsW6NuVRWb3d0lbARpCKB+gSxuYrK4V6KbpwCviLA4hKoBR+z+t+N47qEZsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc4e5dc3a46f8e56727de617b10b10516a0fb96f19580bed37e3ff89c6d7a242","last_reissued_at":"2026-07-05T01:36:37.641467Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:36:37.641467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.09406","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:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M8PdCyZdneHWVvwRTb7NbqFRWyFsg5W0NFCirMwAutSLENa9TC/pCVVbQX6CJWxswSkCwSl3vDnxIxx3WkA8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:37:20.996325Z"},"content_sha256":"20d8829c530464fb95bcbbe46bb07a6fdbc24e841317d647f9165cfbdd7de26b","schema_version":"1.0","event_id":"sha256:20d8829c530464fb95bcbbe46bb07a6fdbc24e841317d647f9165cfbdd7de26b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3RHF3Q5EN6HFM4T54YL3CCYQKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning-Based Massive Beamforming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Qingjiang Shi, Shengjie Zhao, Siyuan Lu","submitted_at":"2020-09-20T10:39:29Z","abstract_excerpt":"Developing resource allocation algorithms with strong real-time and high efficiency has been an imperative topic in wireless networks. Conventional optimization-based iterative resource allocation algorithms often suffer from slow convergence, especially for massive multiple-input-multiple-output (MIMO) beamforming problems. This paper studies learning-based efficient massive beamforming methods for multi-user MIMO networks. The considered massive beamforming problem is challenging in two aspects. First, the beamforming matrix to be learned is quite high-dimensional in case with a massive numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.09406","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/2009.09406/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:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SrxZmsPE46Hl40xXkcyVlCWGUxfqV9/ej9XkNYg584ego7NggkprJOSQbpS0UsAgCJRJE8ORXe8A/IAWfku0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:37:20.996695Z"},"content_sha256":"52589e5413e91528cf8a36d7926894a16ca9820322e066441c2b30e02c346ad7","schema_version":"1.0","event_id":"sha256:52589e5413e91528cf8a36d7926894a16ca9820322e066441c2b30e02c346ad7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RHF3Q5EN6HFM4T54YL3CCYQKF/bundle.json","state_url":"https://pith.science/pith/3RHF3Q5EN6HFM4T54YL3CCYQKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RHF3Q5EN6HFM4T54YL3CCYQKF/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-03T15:37:20Z","links":{"resolver":"https://pith.science/pith/3RHF3Q5EN6HFM4T54YL3CCYQKF","bundle":"https://pith.science/pith/3RHF3Q5EN6HFM4T54YL3CCYQKF/bundle.json","state":"https://pith.science/pith/3RHF3Q5EN6HFM4T54YL3CCYQKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RHF3Q5EN6HFM4T54YL3CCYQKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3RHF3Q5EN6HFM4T54YL3CCYQKF","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":"4d8c7df9259f73c1adc186e919655d8d9dadee1fb4ccd5af2db0052156c55a7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-09-20T10:39:29Z","title_canon_sha256":"260be1a4ab799b601ada1637c9dad11648c6743e543ebbe705b74f9be9cf0f11"},"schema_version":"1.0","source":{"id":"2009.09406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.09406","created_at":"2026-07-05T01:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"2009.09406v1","created_at":"2026-07-05T01:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.09406","created_at":"2026-07-05T01:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"3RHF3Q5EN6HF","created_at":"2026-07-05T01:36:37Z"},{"alias_kind":"pith_short_16","alias_value":"3RHF3Q5EN6HFM4T5","created_at":"2026-07-05T01:36:37Z"},{"alias_kind":"pith_short_8","alias_value":"3RHF3Q5E","created_at":"2026-07-05T01:36:37Z"}],"graph_snapshots":[{"event_id":"sha256:52589e5413e91528cf8a36d7926894a16ca9820322e066441c2b30e02c346ad7","target":"graph","created_at":"2026-07-05T01:36:37Z","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/2009.09406/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Developing resource allocation algorithms with strong real-time and high efficiency has been an imperative topic in wireless networks. Conventional optimization-based iterative resource allocation algorithms often suffer from slow convergence, especially for massive multiple-input-multiple-output (MIMO) beamforming problems. This paper studies learning-based efficient massive beamforming methods for multi-user MIMO networks. The considered massive beamforming problem is challenging in two aspects. First, the beamforming matrix to be learned is quite high-dimensional in case with a massive numb","authors_text":"Qingjiang Shi, Shengjie Zhao, Siyuan Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-09-20T10:39:29Z","title":"Learning-Based Massive Beamforming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.09406","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:20d8829c530464fb95bcbbe46bb07a6fdbc24e841317d647f9165cfbdd7de26b","target":"record","created_at":"2026-07-05T01:36:37Z","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":"4d8c7df9259f73c1adc186e919655d8d9dadee1fb4ccd5af2db0052156c55a7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-09-20T10:39:29Z","title_canon_sha256":"260be1a4ab799b601ada1637c9dad11648c6743e543ebbe705b74f9be9cf0f11"},"schema_version":"1.0","source":{"id":"2009.09406","kind":"arxiv","version":1}},"canonical_sha256":"dc4e5dc3a46f8e56727de617b10b10516a0fb96f19580bed37e3ff89c6d7a242","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc4e5dc3a46f8e56727de617b10b10516a0fb96f19580bed37e3ff89c6d7a242","first_computed_at":"2026-07-05T01:36:37.641467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:36:37.641467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C1sqqVls4A7miEDk1N0ziFpW+xsW6NuVRWb3d0lbARpCKB+gSxuYrK4V6KbpwCviLA4hKoBR+z+t+N47qEZsDw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:36:37.641994Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.09406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20d8829c530464fb95bcbbe46bb07a6fdbc24e841317d647f9165cfbdd7de26b","sha256:52589e5413e91528cf8a36d7926894a16ca9820322e066441c2b30e02c346ad7"],"state_sha256":"d2d34e7e5e2454b2096df2e8a4b7b1a93ed1811ab7c3017143496881b905225e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZbPA45W7yYG6qvs6xYVmw08KEd7GB7G8JPvLMx5RLqJXB2B9btKhxpW9MC2EmILHmF5GNZwZFKciwY0U0SaeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:37:20.999411Z","bundle_sha256":"cd48893588701b1cc00b2d6a220083034ec1cf8022f9cfe47cc882ee2f6da709"}}