{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V76ESHEWZBEGZLJ3VGC2OEAG5Q","short_pith_number":"pith:V76ESHEW","canonical_record":{"source":{"id":"1702.06381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-21T13:51:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d92c6de724c3428b4e0bd88c4ddafe0f83e3d99cf5cf40856f27dc3a868df05","abstract_canon_sha256":"a0563bfc1f259c9cc7918fc7e7f9d5ef8f838f07d39935b3ca696f161aa11464"},"schema_version":"1.0"},"canonical_sha256":"affc491c96c8486cad3ba985a71006ec1299792ece1f304b15e5e42f07337bae","source":{"kind":"arxiv","id":"1702.06381","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06381","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06381v1","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06381","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"V76ESHEWZBEG","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V76ESHEWZBEGZLJ3","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V76ESHEW","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V76ESHEWZBEGZLJ3VGC2OEAG5Q","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-21T13:51:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d92c6de724c3428b4e0bd88c4ddafe0f83e3d99cf5cf40856f27dc3a868df05","abstract_canon_sha256":"a0563bfc1f259c9cc7918fc7e7f9d5ef8f838f07d39935b3ca696f161aa11464"},"schema_version":"1.0"},"canonical_sha256":"affc491c96c8486cad3ba985a71006ec1299792ece1f304b15e5e42f07337bae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:14.293292Z","signature_b64":"c322krtM+EoqkB3IfQbkyvAGBkj0E/1ygcppaTdOAezWO13y5pcF/ELDKu8xfG6St9240SuG0nu1+EtNMA7qBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"affc491c96c8486cad3ba985a71006ec1299792ece1f304b15e5e42f07337bae","last_reissued_at":"2026-05-18T00:50:14.292768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:14.292768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06381","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-18T00:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m5BWXCpQA4X5dheXkrmkDW0MI0XaPjt1ahriOgSgCxdr0oPlNCDo1LTQwYTgdHjYNoqmSzRCrooSuu3NxnCyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:32:59.966104Z"},"content_sha256":"922939b203ab75cd6a8e2247ab434cf24c70deff79efbbb61fcf8b8e6425a708","schema_version":"1.0","event_id":"sha256:922939b203ab75cd6a8e2247ab434cf24c70deff79efbbb61fcf8b8e6425a708"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V76ESHEWZBEGZLJ3VGC2OEAG5Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressive Channel Estimation and Multi-user Detection in C-RAN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qi He, Shaoqian Li, Tony Q.S. Quek, Zhi Chen","submitted_at":"2017-02-21T13:51:43Z","abstract_excerpt":"This paper considers the channel estimation (CE) and multi-user detection (MUD) problems in cloud radio access network (C-RAN). Assuming that active users are sparse in the network, we solve CE and MUD problems with compressed sensing (CS) technology to greatly reduce the long identification pilot overhead. A mixed L{2,1}-regularization functional for extended sparse group-sparsity recovery is proposed to exploit the inherently sparse property existing both in user activities and remote radio heads (RRHs) that active users are attached to. Empirical and theoretical guidelines are provided to h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06381","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-18T00:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qfq3VgpuMUM876AQ2Kj/XUBIGzAoj96eiaByA08bG99pKlwklu6S5MVmxwkemqmcUsREGxQ+X5v/dyqqotlKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:32:59.966764Z"},"content_sha256":"9e6a467d1178387256d548766ca17d7cddf922369ca64238f8d69dde1cbc806e","schema_version":"1.0","event_id":"sha256:9e6a467d1178387256d548766ca17d7cddf922369ca64238f8d69dde1cbc806e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V76ESHEWZBEGZLJ3VGC2OEAG5Q/bundle.json","state_url":"https://pith.science/pith/V76ESHEWZBEGZLJ3VGC2OEAG5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V76ESHEWZBEGZLJ3VGC2OEAG5Q/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-02T14:32:59Z","links":{"resolver":"https://pith.science/pith/V76ESHEWZBEGZLJ3VGC2OEAG5Q","bundle":"https://pith.science/pith/V76ESHEWZBEGZLJ3VGC2OEAG5Q/bundle.json","state":"https://pith.science/pith/V76ESHEWZBEGZLJ3VGC2OEAG5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V76ESHEWZBEGZLJ3VGC2OEAG5Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V76ESHEWZBEGZLJ3VGC2OEAG5Q","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":"a0563bfc1f259c9cc7918fc7e7f9d5ef8f838f07d39935b3ca696f161aa11464","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-21T13:51:43Z","title_canon_sha256":"1d92c6de724c3428b4e0bd88c4ddafe0f83e3d99cf5cf40856f27dc3a868df05"},"schema_version":"1.0","source":{"id":"1702.06381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06381","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06381v1","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06381","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"V76ESHEWZBEG","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V76ESHEWZBEGZLJ3","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V76ESHEW","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:9e6a467d1178387256d548766ca17d7cddf922369ca64238f8d69dde1cbc806e","target":"graph","created_at":"2026-05-18T00:50:14Z","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 considers the channel estimation (CE) and multi-user detection (MUD) problems in cloud radio access network (C-RAN). Assuming that active users are sparse in the network, we solve CE and MUD problems with compressed sensing (CS) technology to greatly reduce the long identification pilot overhead. A mixed L{2,1}-regularization functional for extended sparse group-sparsity recovery is proposed to exploit the inherently sparse property existing both in user activities and remote radio heads (RRHs) that active users are attached to. Empirical and theoretical guidelines are provided to h","authors_text":"Qi He, Shaoqian Li, Tony Q.S. Quek, Zhi Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-21T13:51:43Z","title":"Compressive Channel Estimation and Multi-user Detection in C-RAN"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06381","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:922939b203ab75cd6a8e2247ab434cf24c70deff79efbbb61fcf8b8e6425a708","target":"record","created_at":"2026-05-18T00:50:14Z","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":"a0563bfc1f259c9cc7918fc7e7f9d5ef8f838f07d39935b3ca696f161aa11464","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-21T13:51:43Z","title_canon_sha256":"1d92c6de724c3428b4e0bd88c4ddafe0f83e3d99cf5cf40856f27dc3a868df05"},"schema_version":"1.0","source":{"id":"1702.06381","kind":"arxiv","version":1}},"canonical_sha256":"affc491c96c8486cad3ba985a71006ec1299792ece1f304b15e5e42f07337bae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"affc491c96c8486cad3ba985a71006ec1299792ece1f304b15e5e42f07337bae","first_computed_at":"2026-05-18T00:50:14.292768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:14.292768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c322krtM+EoqkB3IfQbkyvAGBkj0E/1ygcppaTdOAezWO13y5pcF/ELDKu8xfG6St9240SuG0nu1+EtNMA7qBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:14.293292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:922939b203ab75cd6a8e2247ab434cf24c70deff79efbbb61fcf8b8e6425a708","sha256:9e6a467d1178387256d548766ca17d7cddf922369ca64238f8d69dde1cbc806e"],"state_sha256":"56f6e31625634ccdcdc161ac2d07d6e227ca0adb9dfe65d812bda2fd9dd940ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"icnkWgfxWH3WbiYE+zdSyge1jiIDgo3Cwvl/s7NnPN90p6Mzd/r2TMhf6Q4Dqvurg6tIExpsf7NoFMrzXXr7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:32:59.970054Z","bundle_sha256":"28320b4bc6d3981641b3b225b4e1af9877d1f662e5e25e4d4ab26f9b2194dd4e"}}