{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NP5L3JROYLTOSPJURUCWYHKQ3R","short_pith_number":"pith:NP5L3JRO","canonical_record":{"source":{"id":"1904.12168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-27T15:38:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6c908c2bf9957145dd1b4429fba8aed711a5192a53738c490803f494a26fd603","abstract_canon_sha256":"96504b1809260beb8e2636cd2d013ceb3786a982455c0c93bf8862d99c35b955"},"schema_version":"1.0"},"canonical_sha256":"6bfabda62ec2e6e93d348d056c1d50dc472415ab3e2db5afc48ba61a747487c5","source":{"kind":"arxiv","id":"1904.12168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12168","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12168v1","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12168","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"pith_short_12","alias_value":"NP5L3JROYLTO","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NP5L3JROYLTOSPJU","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NP5L3JRO","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NP5L3JROYLTOSPJURUCWYHKQ3R","target":"record","payload":{"canonical_record":{"source":{"id":"1904.12168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-27T15:38:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6c908c2bf9957145dd1b4429fba8aed711a5192a53738c490803f494a26fd603","abstract_canon_sha256":"96504b1809260beb8e2636cd2d013ceb3786a982455c0c93bf8862d99c35b955"},"schema_version":"1.0"},"canonical_sha256":"6bfabda62ec2e6e93d348d056c1d50dc472415ab3e2db5afc48ba61a747487c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:38.774736Z","signature_b64":"K6KzSLtfpBTWcNY8N3MYytWOnTSPdnEPLpNRGisSBm0C/kMbwSfDvOrG5kncstcqJbE2k4t2dYJAN/Po35DpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bfabda62ec2e6e93d348d056c1d50dc472415ab3e2db5afc48ba61a747487c5","last_reissued_at":"2026-05-17T23:47:38.774227Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:38.774227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.12168","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:47:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kRouJZS2qOGLJlcEER0f7koeUEDq/JaqVuDrMFVMBVRmUIUZ70kvmnL82im5uxS6yRXzEIHFZ5Z3NSovbUvBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:35:06.576334Z"},"content_sha256":"d038ea6746ac5d86abe9a4e26b8a8b91b5543ece566f6f3f6dba8fcf3e89464c","schema_version":"1.0","event_id":"sha256:d038ea6746ac5d86abe9a4e26b8a8b91b5543ece566f6f3f6dba8fcf3e89464c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NP5L3JROYLTOSPJURUCWYHKQ3R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning-based Rate Adaptation for Uplink Massive MIMO Networks with Cooperative Data-Assisted Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kaibin Huang, Rui Wang, Yang Li, Yifan Chen, Zezhong Zhang","submitted_at":"2019-04-27T15:38:47Z","abstract_excerpt":"In this paper, the uplink adaptation for massive multiple-input-multiple-output (MIMO) networks without the knowledge of user density is considered. Specifically, a novel cooperative uplink transmission and detection scheme is first proposed for massive MIMO networks, where each uplink frame is divided into a number of data blocks with independent coding schemes and the following blocks are decoded based on previously detected data blocks in both service and neighboring cells. The asymptotic signal-to-interference-plus-noise ratio (SINR) of the proposed scheme is then derived, and the distribu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12168","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:47:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQ8gNvZ3HuQ6v6gZPueFqHLVwShVJjXocQMQNJaYmvSK+RpVTe519XwdOnnextCti7v+XfJnVccdWFle5h0mBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:35:06.577073Z"},"content_sha256":"e1e55d8de88cb1032ebcc0a4bac9a567726d8be0f8ebc37aa1aa2de9a38d737e","schema_version":"1.0","event_id":"sha256:e1e55d8de88cb1032ebcc0a4bac9a567726d8be0f8ebc37aa1aa2de9a38d737e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NP5L3JROYLTOSPJURUCWYHKQ3R/bundle.json","state_url":"https://pith.science/pith/NP5L3JROYLTOSPJURUCWYHKQ3R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NP5L3JROYLTOSPJURUCWYHKQ3R/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-01T00:35:06Z","links":{"resolver":"https://pith.science/pith/NP5L3JROYLTOSPJURUCWYHKQ3R","bundle":"https://pith.science/pith/NP5L3JROYLTOSPJURUCWYHKQ3R/bundle.json","state":"https://pith.science/pith/NP5L3JROYLTOSPJURUCWYHKQ3R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NP5L3JROYLTOSPJURUCWYHKQ3R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NP5L3JROYLTOSPJURUCWYHKQ3R","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":"96504b1809260beb8e2636cd2d013ceb3786a982455c0c93bf8862d99c35b955","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-27T15:38:47Z","title_canon_sha256":"6c908c2bf9957145dd1b4429fba8aed711a5192a53738c490803f494a26fd603"},"schema_version":"1.0","source":{"id":"1904.12168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12168","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12168v1","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12168","created_at":"2026-05-17T23:47:38Z"},{"alias_kind":"pith_short_12","alias_value":"NP5L3JROYLTO","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NP5L3JROYLTOSPJU","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NP5L3JRO","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:e1e55d8de88cb1032ebcc0a4bac9a567726d8be0f8ebc37aa1aa2de9a38d737e","target":"graph","created_at":"2026-05-17T23:47:38Z","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":"In this paper, the uplink adaptation for massive multiple-input-multiple-output (MIMO) networks without the knowledge of user density is considered. Specifically, a novel cooperative uplink transmission and detection scheme is first proposed for massive MIMO networks, where each uplink frame is divided into a number of data blocks with independent coding schemes and the following blocks are decoded based on previously detected data blocks in both service and neighboring cells. The asymptotic signal-to-interference-plus-noise ratio (SINR) of the proposed scheme is then derived, and the distribu","authors_text":"Kaibin Huang, Rui Wang, Yang Li, Yifan Chen, Zezhong Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-27T15:38:47Z","title":"Learning-based Rate Adaptation for Uplink Massive MIMO Networks with Cooperative Data-Assisted Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12168","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:d038ea6746ac5d86abe9a4e26b8a8b91b5543ece566f6f3f6dba8fcf3e89464c","target":"record","created_at":"2026-05-17T23:47:38Z","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":"96504b1809260beb8e2636cd2d013ceb3786a982455c0c93bf8862d99c35b955","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-27T15:38:47Z","title_canon_sha256":"6c908c2bf9957145dd1b4429fba8aed711a5192a53738c490803f494a26fd603"},"schema_version":"1.0","source":{"id":"1904.12168","kind":"arxiv","version":1}},"canonical_sha256":"6bfabda62ec2e6e93d348d056c1d50dc472415ab3e2db5afc48ba61a747487c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bfabda62ec2e6e93d348d056c1d50dc472415ab3e2db5afc48ba61a747487c5","first_computed_at":"2026-05-17T23:47:38.774227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:38.774227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K6KzSLtfpBTWcNY8N3MYytWOnTSPdnEPLpNRGisSBm0C/kMbwSfDvOrG5kncstcqJbE2k4t2dYJAN/Po35DpAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:38.774736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d038ea6746ac5d86abe9a4e26b8a8b91b5543ece566f6f3f6dba8fcf3e89464c","sha256:e1e55d8de88cb1032ebcc0a4bac9a567726d8be0f8ebc37aa1aa2de9a38d737e"],"state_sha256":"92800455b40fb234a7e614549ba2b2b9867b8408c64eb2dce2a673c33380d493"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"42xtEAqUcYlW/hJhoAtIBZXr2dvtQNzCwb3wz+GCQDbniyBqPMSI0COQ+AOnwUT0YkRj7iGX2GuO8zSP33l5Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:35:06.581105Z","bundle_sha256":"17340d2863be5f3f823189e2d194d132e100cbe26ce485088984369da3dbbf0f"}}