{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KRGRGG7VL6RU2NW7R4GD54HTWB","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":"6653284e8f3cffc3579a154a546bd8ab6fd1c91d25719ff578e1de0fd1a14f73","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-28T17:17:07Z","title_canon_sha256":"9318dec4e4b6e5eb2adbbbb471a288856ea3dbc2a091833f3b5559a0fc485166"},"schema_version":"1.0","source":{"id":"1704.09012","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.09012","created_at":"2026-05-18T00:19:30Z"},{"alias_kind":"arxiv_version","alias_value":"1704.09012v1","created_at":"2026-05-18T00:19:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.09012","created_at":"2026-05-18T00:19:30Z"},{"alias_kind":"pith_short_12","alias_value":"KRGRGG7VL6RU","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KRGRGG7VL6RU2NW7","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KRGRGG7V","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:641035af723de7efd6d0d035b02227bfe56c6d94e96a3ec54af7e8917d633683","target":"graph","created_at":"2026-05-18T00:19:30Z","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 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 ","authors_text":"Florian Wechsung, Jared Tanner, Rodrigo Mendoza-Smith","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-28T17:17:07Z","title":"A robust parallel algorithm for combinatorial compressed sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.09012","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:6e56d9e2692647ad64a2eb87c5ec43465cb100fa711b8596a94e97fc7242845b","target":"record","created_at":"2026-05-18T00:19:30Z","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":"6653284e8f3cffc3579a154a546bd8ab6fd1c91d25719ff578e1de0fd1a14f73","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-04-28T17:17:07Z","title_canon_sha256":"9318dec4e4b6e5eb2adbbbb471a288856ea3dbc2a091833f3b5559a0fc485166"},"schema_version":"1.0","source":{"id":"1704.09012","kind":"arxiv","version":1}},"canonical_sha256":"544d131bf55fa34d36df8f0c3ef0f3b07819c01bbdff4a0171de72b6e1230e0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"544d131bf55fa34d36df8f0c3ef0f3b07819c01bbdff4a0171de72b6e1230e0c","first_computed_at":"2026-05-18T00:19:30.646861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:30.646861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tc6MBOrQfeiSHZ4OsIBo48HQFiQzrleaKfMO0Y3dP63RhbH/MgG8tD/QZRG1PqfdT/fZb5YrGQvuR/2IF96wCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:30.647557Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.09012","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e56d9e2692647ad64a2eb87c5ec43465cb100fa711b8596a94e97fc7242845b","sha256:641035af723de7efd6d0d035b02227bfe56c6d94e96a3ec54af7e8917d633683"],"state_sha256":"feaa2c1e3c404fe1cb943e362efe3c14d110598262b89b11711eafc62268e045"}