{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KRGRGG7VL6RU2NW7R4GD54HTWB","short_pith_number":"pith:KRGRGG7V","schema_version":"1.0","canonical_sha256":"544d131bf55fa34d36df8f0c3ef0f3b07819c01bbdff4a0171de72b6e1230e0c","source":{"kind":"arxiv","id":"1704.09012","version":1},"attestation_state":"computed","paper":{"title":"A robust parallel algorithm for combinatorial compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NA","authors_text":"Florian Wechsung, Jared Tanner, Rodrigo Mendoza-Smith","submitted_at":"2017-04-28T17:17:07Z","abstract_excerpt":"In previous work two of the authors have shown that a vector $x \\in \\mathbb{R}^n$ with at most $k < n$ nonzeros can be recovered from an expander sketch $Ax$ in $\\mathcal{O}(\\mathrm{nnz}(A)\\log k)$ operations via the Parallel-$\\ell_0$ decoding algorithm, where $\\mathrm{nnz}(A)$ denotes the number of nonzero entries in $A \\in \\mathbb{R}^{m \\times n}$. In this paper we present the Robust-$\\ell_0$ decoding algorithm, which robustifies Parallel-$\\ell_0$ when the sketch $Ax$ is corrupted by additive noise. This robustness is achieved by approximating the asymptotic posterior distribution of values "},"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":"1704.09012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-28T17:17:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9318dec4e4b6e5eb2adbbbb471a288856ea3dbc2a091833f3b5559a0fc485166","abstract_canon_sha256":"6653284e8f3cffc3579a154a546bd8ab6fd1c91d25719ff578e1de0fd1a14f73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:30.647557Z","signature_b64":"tc6MBOrQfeiSHZ4OsIBo48HQFiQzrleaKfMO0Y3dP63RhbH/MgG8tD/QZRG1PqfdT/fZb5YrGQvuR/2IF96wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"544d131bf55fa34d36df8f0c3ef0f3b07819c01bbdff4a0171de72b6e1230e0c","last_reissued_at":"2026-05-18T00:19:30.646861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:30.646861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A robust parallel algorithm for combinatorial compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.NA","authors_text":"Florian Wechsung, Jared Tanner, Rodrigo Mendoza-Smith","submitted_at":"2017-04-28T17:17:07Z","abstract_excerpt":"In previous work two of the authors have shown that a vector $x \\in \\mathbb{R}^n$ with at most $k < n$ nonzeros can be recovered from an expander sketch $Ax$ in $\\mathcal{O}(\\mathrm{nnz}(A)\\log k)$ operations via the Parallel-$\\ell_0$ decoding algorithm, where $\\mathrm{nnz}(A)$ denotes the number of nonzero entries in $A \\in \\mathbb{R}^{m \\times n}$. In this paper we present the Robust-$\\ell_0$ decoding algorithm, which robustifies Parallel-$\\ell_0$ when the sketch $Ax$ is corrupted by additive noise. This robustness is achieved by approximating the asymptotic posterior distribution of values "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.09012","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":"1704.09012","created_at":"2026-05-18T00:19:30.646970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.09012v1","created_at":"2026-05-18T00:19:30.646970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.09012","created_at":"2026-05-18T00:19:30.646970+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRGRGG7VL6RU","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRGRGG7VL6RU2NW7","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRGRGG7V","created_at":"2026-05-18T12:31:28.150371+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/KRGRGG7VL6RU2NW7R4GD54HTWB","json":"https://pith.science/pith/KRGRGG7VL6RU2NW7R4GD54HTWB.json","graph_json":"https://pith.science/api/pith-number/KRGRGG7VL6RU2NW7R4GD54HTWB/graph.json","events_json":"https://pith.science/api/pith-number/KRGRGG7VL6RU2NW7R4GD54HTWB/events.json","paper":"https://pith.science/paper/KRGRGG7V"},"agent_actions":{"view_html":"https://pith.science/pith/KRGRGG7VL6RU2NW7R4GD54HTWB","download_json":"https://pith.science/pith/KRGRGG7VL6RU2NW7R4GD54HTWB.json","view_paper":"https://pith.science/paper/KRGRGG7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.09012&json=true","fetch_graph":"https://pith.science/api/pith-number/KRGRGG7VL6RU2NW7R4GD54HTWB/graph.json","fetch_events":"https://pith.science/api/pith-number/KRGRGG7VL6RU2NW7R4GD54HTWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRGRGG7VL6RU2NW7R4GD54HTWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRGRGG7VL6RU2NW7R4GD54HTWB/action/storage_attestation","attest_author":"https://pith.science/pith/KRGRGG7VL6RU2NW7R4GD54HTWB/action/author_attestation","sign_citation":"https://pith.science/pith/KRGRGG7VL6RU2NW7R4GD54HTWB/action/citation_signature","submit_replication":"https://pith.science/pith/KRGRGG7VL6RU2NW7R4GD54HTWB/action/replication_record"}},"created_at":"2026-05-18T00:19:30.646970+00:00","updated_at":"2026-05-18T00:19:30.646970+00:00"}