{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6C6WCSFIMPQZ2BHLBICSPCLVEO","short_pith_number":"pith:6C6WCSFI","canonical_record":{"source":{"id":"1703.07020","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-21T00:50:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"26109a708457b37445143c47a7260950dd7347df57a9222c2efe6e7e860588ea","abstract_canon_sha256":"252366933939f599ae4c3c047dba35af96b66edf94dbae5b6ebb429112f951ba"},"schema_version":"1.0"},"canonical_sha256":"f0bd6148a863e19d04eb0a0527897523aedd411b70bfed3c4401725a5010b134","source":{"kind":"arxiv","id":"1703.07020","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07020","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07020v4","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07020","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"pith_short_12","alias_value":"6C6WCSFIMPQZ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6C6WCSFIMPQZ2BHL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6C6WCSFI","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6C6WCSFIMPQZ2BHLBICSPCLVEO","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07020","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-21T00:50:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"26109a708457b37445143c47a7260950dd7347df57a9222c2efe6e7e860588ea","abstract_canon_sha256":"252366933939f599ae4c3c047dba35af96b66edf94dbae5b6ebb429112f951ba"},"schema_version":"1.0"},"canonical_sha256":"f0bd6148a863e19d04eb0a0527897523aedd411b70bfed3c4401725a5010b134","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:00.238882Z","signature_b64":"WJQEFKLSi8LY+XxYeqXFula3aoLmkAg8IBHKoCCByMvVgEjXX1QxPB7rttjNXCJBOuh+D2Zfox03qHsh9pZ8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0bd6148a863e19d04eb0a0527897523aedd411b70bfed3c4401725a5010b134","last_reissued_at":"2026-05-18T00:46:00.238291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:00.238291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07020","source_version":4,"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-18T00:46:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iimVwd7r9QaImgj+xdrzRRDR3U22CnOQgV88r6ttZxL6nfkNJRBWFYQx/5uvERqSKUhhH6Fq/3u4qQXkfKl3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:52:47.720690Z"},"content_sha256":"f5a6dcb6ac6b5ce83d0316657a2adbbce48361960a6fbc560e47cabb2a26adb2","schema_version":"1.0","event_id":"sha256:f5a6dcb6ac6b5ce83d0316657a2adbbce48361960a6fbc560e47cabb2a26adb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6C6WCSFIMPQZ2BHLBICSPCLVEO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Message Passing Based Massive MIMO Channel Estimation by Exploiting Unknown Sparse Common Support with Dirichlet Process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chuanzong Zhang, Qinghua Guo, Zhengdao Yuan, Zhongyong Wang","submitted_at":"2017-03-21T00:50:58Z","abstract_excerpt":"This paper investigates the problem of estimating sparse channels in massive MIMO systems. Most wireless channels are sparse with large delay spread, while some channels can be observed having sparse common support (SCS) within a certain area of the antenna array, i.e., the antenna array can be grouped into several clusters according to the sparse supports of channels. The SCS property is attractive when it comes to the estimation of large number of channels in massive MIMO systems. Using the SCS of channels, one expects better performance, but the number of clusters and the elements for each "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07020","kind":"arxiv","version":4},"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-18T00:46:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WnnPpiALSAWus3AgT2Irw+wbPgKIWwbIOsIH0I+PIGRPMhiU8tNSMPHX31vp9pp+6vOfuMMbs6j67v0zuhI/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:52:47.721055Z"},"content_sha256":"29d1010ad21c2d6b3b59d0941aee21ffb72e640ae21642e8f7ae3e9654053bff","schema_version":"1.0","event_id":"sha256:29d1010ad21c2d6b3b59d0941aee21ffb72e640ae21642e8f7ae3e9654053bff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6C6WCSFIMPQZ2BHLBICSPCLVEO/bundle.json","state_url":"https://pith.science/pith/6C6WCSFIMPQZ2BHLBICSPCLVEO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6C6WCSFIMPQZ2BHLBICSPCLVEO/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-04T15:52:47Z","links":{"resolver":"https://pith.science/pith/6C6WCSFIMPQZ2BHLBICSPCLVEO","bundle":"https://pith.science/pith/6C6WCSFIMPQZ2BHLBICSPCLVEO/bundle.json","state":"https://pith.science/pith/6C6WCSFIMPQZ2BHLBICSPCLVEO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6C6WCSFIMPQZ2BHLBICSPCLVEO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6C6WCSFIMPQZ2BHLBICSPCLVEO","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":"252366933939f599ae4c3c047dba35af96b66edf94dbae5b6ebb429112f951ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-21T00:50:58Z","title_canon_sha256":"26109a708457b37445143c47a7260950dd7347df57a9222c2efe6e7e860588ea"},"schema_version":"1.0","source":{"id":"1703.07020","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07020","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07020v4","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07020","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"pith_short_12","alias_value":"6C6WCSFIMPQZ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6C6WCSFIMPQZ2BHL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6C6WCSFI","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:29d1010ad21c2d6b3b59d0941aee21ffb72e640ae21642e8f7ae3e9654053bff","target":"graph","created_at":"2026-05-18T00:46:00Z","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 paper investigates the problem of estimating sparse channels in massive MIMO systems. Most wireless channels are sparse with large delay spread, while some channels can be observed having sparse common support (SCS) within a certain area of the antenna array, i.e., the antenna array can be grouped into several clusters according to the sparse supports of channels. The SCS property is attractive when it comes to the estimation of large number of channels in massive MIMO systems. Using the SCS of channels, one expects better performance, but the number of clusters and the elements for each ","authors_text":"Chuanzong Zhang, Qinghua Guo, Zhengdao Yuan, Zhongyong Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-21T00:50:58Z","title":"Low-Complexity Message Passing Based Massive MIMO Channel Estimation by Exploiting Unknown Sparse Common Support with Dirichlet Process"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07020","kind":"arxiv","version":4},"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:f5a6dcb6ac6b5ce83d0316657a2adbbce48361960a6fbc560e47cabb2a26adb2","target":"record","created_at":"2026-05-18T00:46:00Z","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":"252366933939f599ae4c3c047dba35af96b66edf94dbae5b6ebb429112f951ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-21T00:50:58Z","title_canon_sha256":"26109a708457b37445143c47a7260950dd7347df57a9222c2efe6e7e860588ea"},"schema_version":"1.0","source":{"id":"1703.07020","kind":"arxiv","version":4}},"canonical_sha256":"f0bd6148a863e19d04eb0a0527897523aedd411b70bfed3c4401725a5010b134","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0bd6148a863e19d04eb0a0527897523aedd411b70bfed3c4401725a5010b134","first_computed_at":"2026-05-18T00:46:00.238291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:00.238291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WJQEFKLSi8LY+XxYeqXFula3aoLmkAg8IBHKoCCByMvVgEjXX1QxPB7rttjNXCJBOuh+D2Zfox03qHsh9pZ8Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:00.238882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07020","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5a6dcb6ac6b5ce83d0316657a2adbbce48361960a6fbc560e47cabb2a26adb2","sha256:29d1010ad21c2d6b3b59d0941aee21ffb72e640ae21642e8f7ae3e9654053bff"],"state_sha256":"6c0c033dd489bc12f097b5fdddcd9d2faa478c63597f19fd41b2b6c040457168"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sVRknjrNIPjBiMwSRU9CbX2+MbAgO/wFGV3wnAJvTlQnhh4tnUWa6ScjcmT9dorKrodotNeV273xaz/whgNLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:52:47.723073Z","bundle_sha256":"426758fd2dc31d5b09c9108ea83cc0618b40d0174f6254b93a32f425fa181e0f"}}