{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EKHN7JTLC4YIAAXXMRYT6VIFZ5","short_pith_number":"pith:EKHN7JTL","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"},"canonical_sha256":"228edfa66b17308002f764713f5505cf673f772d8dec3209ce44d4ec5505928c","source":{"kind":"arxiv","id":"1807.08478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08478","created_at":"2026-05-18T00:10:07Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08478v1","created_at":"2026-05-18T00:10:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08478","created_at":"2026-05-18T00:10:07Z"},{"alias_kind":"pith_short_12","alias_value":"EKHN7JTLC4YI","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EKHN7JTLC4YIAAXX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EKHN7JTL","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EKHN7JTLC4YIAAXXMRYT6VIFZ5","target":"record","payload":{"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"},"canonical_sha256":"228edfa66b17308002f764713f5505cf673f772d8dec3209ce44d4ec5505928c","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"},"source_kind":"arxiv","source_id":"1807.08478","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-18T00:10:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CnVcXKxRmeEAk+5Jx6NF9Bhh/uEDp0q1mFcx1bDfZ+fLdWKwFge8lSDrMXV9lItaGJdyvXw8E0vdwtdU2OMwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:04:39.589795Z"},"content_sha256":"67a1d96b601cb610feafe729eae2823bce58f249459b99a571a61b31f47e07e5","schema_version":"1.0","event_id":"sha256:67a1d96b601cb610feafe729eae2823bce58f249459b99a571a61b31f47e07e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EKHN7JTLC4YIAAXXMRYT6VIFZ5","target":"graph","payload":{"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"},"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-18T00:10:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/I2AeLJRiISbblsZ/GrTqUJ1v0/2FwiZgxysaNuQsIjv8phJfGn/5HvuYVRTMHlt5lcC1Tx4b0WXLBF7hW9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:04:39.590142Z"},"content_sha256":"f6ba64a413d0dbf75f660b6c8b25ecd5ec59390424e8da2b1fb898a7feae631c","schema_version":"1.0","event_id":"sha256:f6ba64a413d0dbf75f660b6c8b25ecd5ec59390424e8da2b1fb898a7feae631c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5/bundle.json","state_url":"https://pith.science/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5/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-03T17:04:39Z","links":{"resolver":"https://pith.science/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5","bundle":"https://pith.science/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5/bundle.json","state":"https://pith.science/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKHN7JTLC4YIAAXXMRYT6VIFZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EKHN7JTLC4YIAAXXMRYT6VIFZ5","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":"7264286fbc8a199a981af8e17e06017a977e4e8d0634f260908726eaf7b06173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T08:31:23Z","title_canon_sha256":"22f86b0440ff4c96b2a69d99f209392dbb5bba15bc2390b17b223a73df40d3b9"},"schema_version":"1.0","source":{"id":"1807.08478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08478","created_at":"2026-05-18T00:10:07Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08478v1","created_at":"2026-05-18T00:10:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08478","created_at":"2026-05-18T00:10:07Z"},{"alias_kind":"pith_short_12","alias_value":"EKHN7JTLC4YI","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EKHN7JTLC4YIAAXX","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EKHN7JTL","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:f6ba64a413d0dbf75f660b6c8b25ecd5ec59390424e8da2b1fb898a7feae631c","target":"graph","created_at":"2026-05-18T00:10:07Z","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":"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","authors_text":"Alexandr Andoni, Eric Price, Lior Kamma, Robert Krauthgamer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T08:31:23Z","title":"Batch Sparse Recovery, or How to Leverage the Average Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08478","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:67a1d96b601cb610feafe729eae2823bce58f249459b99a571a61b31f47e07e5","target":"record","created_at":"2026-05-18T00:10:07Z","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":"7264286fbc8a199a981af8e17e06017a977e4e8d0634f260908726eaf7b06173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T08:31:23Z","title_canon_sha256":"22f86b0440ff4c96b2a69d99f209392dbb5bba15bc2390b17b223a73df40d3b9"},"schema_version":"1.0","source":{"id":"1807.08478","kind":"arxiv","version":1}},"canonical_sha256":"228edfa66b17308002f764713f5505cf673f772d8dec3209ce44d4ec5505928c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"228edfa66b17308002f764713f5505cf673f772d8dec3209ce44d4ec5505928c","first_computed_at":"2026-05-18T00:10:07.881487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:07.881487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7OHNt6r8sl6APzbZFfYwBxunh+gLHzUpJ9BMSXENkZE/9DL3517G2jeGPD2NrzmCAX8BDwN2rr343fXdbTr0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:07.882061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67a1d96b601cb610feafe729eae2823bce58f249459b99a571a61b31f47e07e5","sha256:f6ba64a413d0dbf75f660b6c8b25ecd5ec59390424e8da2b1fb898a7feae631c"],"state_sha256":"f25823c494772cc6f16c5b090ab8615d6f2018c4aae824db618e129bcbf1b8e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DMtLAedgSzgwis0B1tlYG2uLwlF5aAQbB6SdR9usYhgYZw4sKerV5nCuLwUkh3V1m/Wz5FmRsf6OGeHzl6cOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:04:39.592217Z","bundle_sha256":"1b18298a2f8192ac23c0bafacb19eb8658290b6131a6d342a54aacbcffb03848"}}