{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TRNPLHMPAITV6QSDOHI4S5CUT3","short_pith_number":"pith:TRNPLHMP","canonical_record":{"source":{"id":"1812.06905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-17T17:26:16Z","cross_cats_sorted":["cs.AI","math.IT","stat.ML"],"title_canon_sha256":"4e144730352794c72260a9c965aae9c7b2eb978eed77834c6b26183523aded15","abstract_canon_sha256":"b524cbd9f9b0f5f12bd138ea4fcc611a0b78d51ce3c3df12efd136ed8d4cacef"},"schema_version":"1.0"},"canonical_sha256":"9c5af59d8f02275f424371d1c974549efbed094a56af0155c3c43fd8891b31ee","source":{"kind":"arxiv","id":"1812.06905","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06905","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06905v1","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06905","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"TRNPLHMPAITV","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TRNPLHMPAITV6QSD","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TRNPLHMP","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TRNPLHMPAITV6QSDOHI4S5CUT3","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-17T17:26:16Z","cross_cats_sorted":["cs.AI","math.IT","stat.ML"],"title_canon_sha256":"4e144730352794c72260a9c965aae9c7b2eb978eed77834c6b26183523aded15","abstract_canon_sha256":"b524cbd9f9b0f5f12bd138ea4fcc611a0b78d51ce3c3df12efd136ed8d4cacef"},"schema_version":"1.0"},"canonical_sha256":"9c5af59d8f02275f424371d1c974549efbed094a56af0155c3c43fd8891b31ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:09.123484Z","signature_b64":"6b2xDkRzJSGSVT/GZ1kBEz3+3pGf9d06gLuYDXq4lqXrZxOdrCM6rvtT4NLp935AN2Brb74o/aj/cd0Hfnx1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c5af59d8f02275f424371d1c974549efbed094a56af0155c3c43fd8891b31ee","last_reissued_at":"2026-05-17T23:58:09.122856Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:09.122856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06905","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:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBQecUTyxIrWBg3pfqgvewcQ8TbjD/uQnlfmWzikXZmH6wHS07s+hnuK3PPtqz6N/Mmwb7n7K7cRpIFimYEHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:31:58.619243Z"},"content_sha256":"53fd9ecb00c0cf25a96b8eb6f0749589ebdc328a07e5813ff1ceb5b4024cfd6d","schema_version":"1.0","event_id":"sha256:53fd9ecb00c0cf25a96b8eb6f0749589ebdc328a07e5813ff1ceb5b4024cfd6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TRNPLHMPAITV6QSDOHI4S5CUT3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"User Association and Load Balancing for Massive MIMO through Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Alessio Zappone, Luca Sanguinetti, Merouane Debbah","submitted_at":"2018-12-17T17:26:16Z","abstract_excerpt":"This work investigates the use of deep learning to perform user cell association for sum-rate maximization in Massive MIMO networks. It is shown how a deep neural network can be trained to approach the optimal association rule with a much more limited computational complexity, thus enabling to update the association rule in real-time, on the basis of the mobility patterns of users. In particular, the proposed neural network design requires as input only the users' geographical positions. Numerical results show that it guarantees the same performance of traditional optimization-oriented methods"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06905","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:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MOFmQ6YR5UwabKuRt8EnTROHPrec0OmtVykXNxLdKDuadPMpKsz0VlPsib+hdf+la1Nc35otYXk5jH0z4pilAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:31:58.619629Z"},"content_sha256":"ec2777aa9af052496823021be4822c355232e69d2a64fe827120036fa29e7a67","schema_version":"1.0","event_id":"sha256:ec2777aa9af052496823021be4822c355232e69d2a64fe827120036fa29e7a67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRNPLHMPAITV6QSDOHI4S5CUT3/bundle.json","state_url":"https://pith.science/pith/TRNPLHMPAITV6QSDOHI4S5CUT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRNPLHMPAITV6QSDOHI4S5CUT3/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-06-02T07:31:58Z","links":{"resolver":"https://pith.science/pith/TRNPLHMPAITV6QSDOHI4S5CUT3","bundle":"https://pith.science/pith/TRNPLHMPAITV6QSDOHI4S5CUT3/bundle.json","state":"https://pith.science/pith/TRNPLHMPAITV6QSDOHI4S5CUT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRNPLHMPAITV6QSDOHI4S5CUT3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TRNPLHMPAITV6QSDOHI4S5CUT3","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":"b524cbd9f9b0f5f12bd138ea4fcc611a0b78d51ce3c3df12efd136ed8d4cacef","cross_cats_sorted":["cs.AI","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-17T17:26:16Z","title_canon_sha256":"4e144730352794c72260a9c965aae9c7b2eb978eed77834c6b26183523aded15"},"schema_version":"1.0","source":{"id":"1812.06905","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06905","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06905v1","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06905","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"TRNPLHMPAITV","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TRNPLHMPAITV6QSD","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TRNPLHMP","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:ec2777aa9af052496823021be4822c355232e69d2a64fe827120036fa29e7a67","target":"graph","created_at":"2026-05-17T23:58:09Z","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":"This work investigates the use of deep learning to perform user cell association for sum-rate maximization in Massive MIMO networks. It is shown how a deep neural network can be trained to approach the optimal association rule with a much more limited computational complexity, thus enabling to update the association rule in real-time, on the basis of the mobility patterns of users. In particular, the proposed neural network design requires as input only the users' geographical positions. Numerical results show that it guarantees the same performance of traditional optimization-oriented methods","authors_text":"Alessio Zappone, Luca Sanguinetti, Merouane Debbah","cross_cats":["cs.AI","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-17T17:26:16Z","title":"User Association and Load Balancing for Massive MIMO through Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06905","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:53fd9ecb00c0cf25a96b8eb6f0749589ebdc328a07e5813ff1ceb5b4024cfd6d","target":"record","created_at":"2026-05-17T23:58:09Z","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":"b524cbd9f9b0f5f12bd138ea4fcc611a0b78d51ce3c3df12efd136ed8d4cacef","cross_cats_sorted":["cs.AI","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-17T17:26:16Z","title_canon_sha256":"4e144730352794c72260a9c965aae9c7b2eb978eed77834c6b26183523aded15"},"schema_version":"1.0","source":{"id":"1812.06905","kind":"arxiv","version":1}},"canonical_sha256":"9c5af59d8f02275f424371d1c974549efbed094a56af0155c3c43fd8891b31ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c5af59d8f02275f424371d1c974549efbed094a56af0155c3c43fd8891b31ee","first_computed_at":"2026-05-17T23:58:09.122856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:09.122856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6b2xDkRzJSGSVT/GZ1kBEz3+3pGf9d06gLuYDXq4lqXrZxOdrCM6rvtT4NLp935AN2Brb74o/aj/cd0Hfnx1Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:09.123484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06905","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53fd9ecb00c0cf25a96b8eb6f0749589ebdc328a07e5813ff1ceb5b4024cfd6d","sha256:ec2777aa9af052496823021be4822c355232e69d2a64fe827120036fa29e7a67"],"state_sha256":"a8ffa17c3f1c2babec5a5de82fadb6037d55371cff2b8420c26ce3d068acc917"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FfanYnL1k/RixawGjgmF9BjWLuz7VbEKIsDRCDugiwYwBDtwM8L7C+VMudn9cc8/hKMgli+HtqtDHUG2XPCsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:31:58.622085Z","bundle_sha256":"d760ef1b98812fe4a76f0618558f87aff884a4c240127fb87406691c917d8027"}}