{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IEHHUP452BIIOKR2UQG7G2QPIF","short_pith_number":"pith:IEHHUP45","canonical_record":{"source":{"id":"1506.00899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-02T14:34:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"657476a33e067d32a05c06fb8db7a73bb580126a39d9b280640b457e2a385b81","abstract_canon_sha256":"4c6f17c7f3b1f234b7deb2cc5500aa5df149f3dc5c374e01231079c2365e9080"},"schema_version":"1.0"},"canonical_sha256":"410e7a3f9dd050872a3aa40df36a0f415ee2a14f51a11d0573d8252824b6092f","source":{"kind":"arxiv","id":"1506.00899","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00899","created_at":"2026-05-18T01:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00899v1","created_at":"2026-05-18T01:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00899","created_at":"2026-05-18T01:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"IEHHUP452BII","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IEHHUP452BIIOKR2","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IEHHUP45","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IEHHUP452BIIOKR2UQG7G2QPIF","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-02T14:34:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"657476a33e067d32a05c06fb8db7a73bb580126a39d9b280640b457e2a385b81","abstract_canon_sha256":"4c6f17c7f3b1f234b7deb2cc5500aa5df149f3dc5c374e01231079c2365e9080"},"schema_version":"1.0"},"canonical_sha256":"410e7a3f9dd050872a3aa40df36a0f415ee2a14f51a11d0573d8252824b6092f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:55.474756Z","signature_b64":"dXRQF3u1dz+Ns7vdf+CS/8R0LNhemfGyw3Yd63g/wGwc1dkChMdMCDhLYvmBSi2QZKQPcBYldkTBDiTfB674DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"410e7a3f9dd050872a3aa40df36a0f415ee2a14f51a11d0573d8252824b6092f","last_reissued_at":"2026-05-18T01:28:55.474058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:55.474058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00899","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-18T01:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TLsXBtJAoruBqn8vwYAYJ70EFlvMotSMg0HFmqWPgyxgisLBimz+aOymdxxBLEaG3FjKY/hqv874B9yYxpLpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:51:17.679789Z"},"content_sha256":"a3452e1c7482a6a02dffde457d8a6b507e994d806b27917e42e7f7bf6704a4bc","schema_version":"1.0","event_id":"sha256:a3452e1c7482a6a02dffde457d8a6b507e994d806b27917e42e7f7bf6704a4bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IEHHUP452BIIOKR2UQG7G2QPIF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressive Sensing with Prior Support Quality Information and Application to Massive MIMO Channel Estimation with Temporal Correlation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Vincent K. N. Lau, Xiongbin Rao","submitted_at":"2015-06-02T14:34:01Z","abstract_excerpt":"In this paper, we consider the problem of compressive sensing (CS) recovery with a prior support and the prior support quality information available. Different from classical works which exploit prior support blindly, we shall propose novel CS recovery algorithms to exploit the prior support adaptively based on the quality information. We analyze the distortion bound of the recovered signal from the proposed algorithm and we show that a better quality prior support can lead to better CS recovery performance. We also show that the proposed algorithm would converge in $\\mathcal{O}\\left(\\log\\mbox"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00899","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-18T01:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZzTJH0rSfLxv69ASu0IGNXK6FEfN6dM7n1/Vu/v8lqG818d0ySwF3bad2/mci70n82yAAYF0AJvuOldqQnNZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:51:17.680550Z"},"content_sha256":"ab7aca4f5c79f296b2d39922655ce21849070173d5524cfd94390ee5dccea087","schema_version":"1.0","event_id":"sha256:ab7aca4f5c79f296b2d39922655ce21849070173d5524cfd94390ee5dccea087"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEHHUP452BIIOKR2UQG7G2QPIF/bundle.json","state_url":"https://pith.science/pith/IEHHUP452BIIOKR2UQG7G2QPIF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEHHUP452BIIOKR2UQG7G2QPIF/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-11T19:51:17Z","links":{"resolver":"https://pith.science/pith/IEHHUP452BIIOKR2UQG7G2QPIF","bundle":"https://pith.science/pith/IEHHUP452BIIOKR2UQG7G2QPIF/bundle.json","state":"https://pith.science/pith/IEHHUP452BIIOKR2UQG7G2QPIF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEHHUP452BIIOKR2UQG7G2QPIF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IEHHUP452BIIOKR2UQG7G2QPIF","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":"4c6f17c7f3b1f234b7deb2cc5500aa5df149f3dc5c374e01231079c2365e9080","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-02T14:34:01Z","title_canon_sha256":"657476a33e067d32a05c06fb8db7a73bb580126a39d9b280640b457e2a385b81"},"schema_version":"1.0","source":{"id":"1506.00899","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00899","created_at":"2026-05-18T01:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00899v1","created_at":"2026-05-18T01:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00899","created_at":"2026-05-18T01:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"IEHHUP452BII","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IEHHUP452BIIOKR2","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IEHHUP45","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:ab7aca4f5c79f296b2d39922655ce21849070173d5524cfd94390ee5dccea087","target":"graph","created_at":"2026-05-18T01:28:55Z","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, we consider the problem of compressive sensing (CS) recovery with a prior support and the prior support quality information available. Different from classical works which exploit prior support blindly, we shall propose novel CS recovery algorithms to exploit the prior support adaptively based on the quality information. We analyze the distortion bound of the recovered signal from the proposed algorithm and we show that a better quality prior support can lead to better CS recovery performance. We also show that the proposed algorithm would converge in $\\mathcal{O}\\left(\\log\\mbox","authors_text":"Vincent K. N. Lau, Xiongbin Rao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-02T14:34:01Z","title":"Compressive Sensing with Prior Support Quality Information and Application to Massive MIMO Channel Estimation with Temporal Correlation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00899","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:a3452e1c7482a6a02dffde457d8a6b507e994d806b27917e42e7f7bf6704a4bc","target":"record","created_at":"2026-05-18T01:28:55Z","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":"4c6f17c7f3b1f234b7deb2cc5500aa5df149f3dc5c374e01231079c2365e9080","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-02T14:34:01Z","title_canon_sha256":"657476a33e067d32a05c06fb8db7a73bb580126a39d9b280640b457e2a385b81"},"schema_version":"1.0","source":{"id":"1506.00899","kind":"arxiv","version":1}},"canonical_sha256":"410e7a3f9dd050872a3aa40df36a0f415ee2a14f51a11d0573d8252824b6092f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"410e7a3f9dd050872a3aa40df36a0f415ee2a14f51a11d0573d8252824b6092f","first_computed_at":"2026-05-18T01:28:55.474058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:55.474058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dXRQF3u1dz+Ns7vdf+CS/8R0LNhemfGyw3Yd63g/wGwc1dkChMdMCDhLYvmBSi2QZKQPcBYldkTBDiTfB674DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:55.474756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00899","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3452e1c7482a6a02dffde457d8a6b507e994d806b27917e42e7f7bf6704a4bc","sha256:ab7aca4f5c79f296b2d39922655ce21849070173d5524cfd94390ee5dccea087"],"state_sha256":"fb760bc08e4bfe558e1faac650b8c75ec5b24af8f7121e9db52b4e4b380e44a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WbIaE7bzTNwa0XhOQPxVRtH9GI7Z2LpfxCQmMaQM86WxbrOoefcC80QaUZgtrue2/aj0QJJg5yNGwgXxDvsODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T19:51:17.685083Z","bundle_sha256":"361bc0a0023184ebc78e5aafbb6f47789114bb73be2f3c351415678bd70608ec"}}