{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EKHN7JTLC4YIAAXXMRYT6VIFZ5","short_pith_number":"pith:EKHN7JTL","schema_version":"1.0","canonical_sha256":"228edfa66b17308002f764713f5505cf673f772d8dec3209ce44d4ec5505928c","source":{"kind":"arxiv","id":"1807.08478","version":1},"attestation_state":"computed","paper":{"title":"Batch Sparse Recovery, or How to Leverage the Average Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, Eric Price, Lior Kamma, Robert Krauthgamer","submitted_at":"2018-07-23T08:31:23Z","abstract_excerpt":"We introduce a \\emph{batch} version of sparse recovery, where the goal is to report a sequence of vectors $A_1',\\ldots,A_m' \\in \\mathbb{R}^n$ that estimate unknown signals $A_1,\\ldots,A_m \\in \\mathbb{R}^n$ using a few linear measurements, each involving exactly one signal vector, under an assumption of \\emph{average sparsity}. More precisely, we want to have \\newline\n  $(1) \\;\\;\\; \\sum_{j \\in [m]}{\\|A_j- A_j'\\|_p^p} \\le C \\cdot \\min \\Big\\{ \\sum_{j \\in [m]}{\\|A_j - A_j^*\\|_p^p} \\Big\\}$\n  for predetermined constants $C \\ge 1$ and $p$, where the minimum is over all $A_1^*,\\ldots,A_m^*\\in\\mathbb{R"},"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":"1807.08478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T08:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"22f86b0440ff4c96b2a69d99f209392dbb5bba15bc2390b17b223a73df40d3b9","abstract_canon_sha256":"7264286fbc8a199a981af8e17e06017a977e4e8d0634f260908726eaf7b06173"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:07.882061Z","signature_b64":"7OHNt6r8sl6APzbZFfYwBxunh+gLHzUpJ9BMSXENkZE/9DL3517G2jeGPD2NrzmCAX8BDwN2rr343fXdbTr0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"228edfa66b17308002f764713f5505cf673f772d8dec3209ce44d4ec5505928c","last_reissued_at":"2026-05-18T00:10:07.881487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:07.881487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Batch Sparse Recovery, or How to Leverage the Average Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandr Andoni, Eric Price, Lior Kamma, Robert Krauthgamer","submitted_at":"2018-07-23T08:31:23Z","abstract_excerpt":"We introduce a \\emph{batch} version of sparse recovery, where the goal is to report a sequence of vectors $A_1',\\ldots,A_m' \\in \\mathbb{R}^n$ that estimate unknown signals $A_1,\\ldots,A_m \\in \\mathbb{R}^n$ using a few linear measurements, each involving exactly one signal vector, under an assumption of \\emph{average sparsity}. More precisely, we want to have \\newline\n  $(1) \\;\\;\\; \\sum_{j \\in [m]}{\\|A_j- A_j'\\|_p^p} \\le C \\cdot \\min \\Big\\{ \\sum_{j \\in [m]}{\\|A_j - A_j^*\\|_p^p} \\Big\\}$\n  for predetermined constants $C \\ge 1$ and $p$, where the minimum is over all $A_1^*,\\ldots,A_m^*\\in\\mathbb{R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08478","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":"1807.08478","created_at":"2026-05-18T00:10:07.881564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08478v1","created_at":"2026-05-18T00:10:07.881564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08478","created_at":"2026-05-18T00:10:07.881564+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKHN7JTLC4YI","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKHN7JTLC4YIAAXX","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKHN7JTL","created_at":"2026-05-18T12:32:22.470017+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/EKHN7JTLC4YIAAXXMRYT6VIFZ5","json":"https://pith.science/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5.json","graph_json":"https://pith.science/api/pith-number/EKHN7JTLC4YIAAXXMRYT6VIFZ5/graph.json","events_json":"https://pith.science/api/pith-number/EKHN7JTLC4YIAAXXMRYT6VIFZ5/events.json","paper":"https://pith.science/paper/EKHN7JTL"},"agent_actions":{"view_html":"https://pith.science/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5","download_json":"https://pith.science/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5.json","view_paper":"https://pith.science/paper/EKHN7JTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08478&json=true","fetch_graph":"https://pith.science/api/pith-number/EKHN7JTLC4YIAAXXMRYT6VIFZ5/graph.json","fetch_events":"https://pith.science/api/pith-number/EKHN7JTLC4YIAAXXMRYT6VIFZ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5/action/storage_attestation","attest_author":"https://pith.science/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5/action/author_attestation","sign_citation":"https://pith.science/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5/action/citation_signature","submit_replication":"https://pith.science/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5/action/replication_record"}},"created_at":"2026-05-18T00:10:07.881564+00:00","updated_at":"2026-05-18T00:10:07.881564+00:00"}