{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CM4MFMXPC5BUY5HODWYOM5PCM3","short_pith_number":"pith:CM4MFMXP","schema_version":"1.0","canonical_sha256":"1338c2b2ef17434c74ee1db0e675e266d383cdf231ab17c842d4f2bc0fa35c3c","source":{"kind":"arxiv","id":"1509.04375","version":1},"attestation_state":"computed","paper":{"title":"Comment on \"Asymptotic Achievability of the Cram\\'{e}r-Rao Bound for Noisy Compressive Sampling\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behtash Babadi, Nicholas Kalouptsidis, Vahid Tarokh","submitted_at":"2015-09-15T02:18:04Z","abstract_excerpt":"In [1], we proved the asymptotic achievability of the Cram\\'{e}r-Rao bound in the compressive sensing setting in the linear sparsity regime. In the proof, we used an erroneous closed-form expression of $\\alpha \\sigma^2$ for the genie-aided Cram\\'{e}r-Rao bound $\\sigma^2 \\textrm{Tr} (\\mathbf{A}^*_\\mathcal{I} \\mathbf{A}_\\mathcal{I})^{-1}$ from Lemma 3.5, which appears in Eqs. (20) and (29). The proof, however, holds if one avoids replacing $\\sigma^2 \\textrm{Tr} (\\mathbf{A}^*_\\mathcal{I} \\mathbf{A}_\\mathcal{I})^{-1}$ by the expression of Lemma 3.5, and hence the claim of the Main Theorem stands t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1509.04375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-15T02:18:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"381b0f1d2c96bd1c5c78ef11f4579966b3401ca398e8ff0581f2796c2b55c4a9","abstract_canon_sha256":"c17a05e38d1a769f81e7524dc66ae5ed0bffc896b5278c1a9f2bcada74a5ac04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:07.335670Z","signature_b64":"8FslFKxxNhkmVsZsGxz0RxHs3NnIRdiXh5KMNkuIS7Jc3dU9Jsu3/Mgk29P6I9rBcywTePMRmUd60o+/E01kBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1338c2b2ef17434c74ee1db0e675e266d383cdf231ab17c842d4f2bc0fa35c3c","last_reissued_at":"2026-05-18T01:33:07.335106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:07.335106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comment on \"Asymptotic Achievability of the Cram\\'{e}r-Rao Bound for Noisy Compressive Sampling\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behtash Babadi, Nicholas Kalouptsidis, Vahid Tarokh","submitted_at":"2015-09-15T02:18:04Z","abstract_excerpt":"In [1], we proved the asymptotic achievability of the Cram\\'{e}r-Rao bound in the compressive sensing setting in the linear sparsity regime. In the proof, we used an erroneous closed-form expression of $\\alpha \\sigma^2$ for the genie-aided Cram\\'{e}r-Rao bound $\\sigma^2 \\textrm{Tr} (\\mathbf{A}^*_\\mathcal{I} \\mathbf{A}_\\mathcal{I})^{-1}$ from Lemma 3.5, which appears in Eqs. (20) and (29). The proof, however, holds if one avoids replacing $\\sigma^2 \\textrm{Tr} (\\mathbf{A}^*_\\mathcal{I} \\mathbf{A}_\\mathcal{I})^{-1}$ by the expression of Lemma 3.5, and hence the claim of the Main Theorem stands t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04375","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.04375","created_at":"2026-05-18T01:33:07.335191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04375v1","created_at":"2026-05-18T01:33:07.335191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04375","created_at":"2026-05-18T01:33:07.335191+00:00"},{"alias_kind":"pith_short_12","alias_value":"CM4MFMXPC5BU","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CM4MFMXPC5BUY5HO","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CM4MFMXP","created_at":"2026-05-18T12:29:17.054201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CM4MFMXPC5BUY5HODWYOM5PCM3","json":"https://pith.science/pith/CM4MFMXPC5BUY5HODWYOM5PCM3.json","graph_json":"https://pith.science/api/pith-number/CM4MFMXPC5BUY5HODWYOM5PCM3/graph.json","events_json":"https://pith.science/api/pith-number/CM4MFMXPC5BUY5HODWYOM5PCM3/events.json","paper":"https://pith.science/paper/CM4MFMXP"},"agent_actions":{"view_html":"https://pith.science/pith/CM4MFMXPC5BUY5HODWYOM5PCM3","download_json":"https://pith.science/pith/CM4MFMXPC5BUY5HODWYOM5PCM3.json","view_paper":"https://pith.science/paper/CM4MFMXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04375&json=true","fetch_graph":"https://pith.science/api/pith-number/CM4MFMXPC5BUY5HODWYOM5PCM3/graph.json","fetch_events":"https://pith.science/api/pith-number/CM4MFMXPC5BUY5HODWYOM5PCM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CM4MFMXPC5BUY5HODWYOM5PCM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CM4MFMXPC5BUY5HODWYOM5PCM3/action/storage_attestation","attest_author":"https://pith.science/pith/CM4MFMXPC5BUY5HODWYOM5PCM3/action/author_attestation","sign_citation":"https://pith.science/pith/CM4MFMXPC5BUY5HODWYOM5PCM3/action/citation_signature","submit_replication":"https://pith.science/pith/CM4MFMXPC5BUY5HODWYOM5PCM3/action/replication_record"}},"created_at":"2026-05-18T01:33:07.335191+00:00","updated_at":"2026-05-18T01:33:07.335191+00:00"}