{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5I5WIOIA3KPFBNDOHHF3J6IKAT","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":"9ebaf1f63a2f17a3ad135e583bc3c45ef6632d8ac4dacbe012ae8588e1998ba0","cross_cats_sorted":["cs.CG","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-05T02:59:25Z","title_canon_sha256":"939da84b7ff51d00527189219269f580c214c16902ad591fca2e2d5e148e14b9"},"schema_version":"1.0","source":{"id":"1504.01076","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01076","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01076v1","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01076","created_at":"2026-05-18T02:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"5I5WIOIA3KPF","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5I5WIOIA3KPFBNDO","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5I5WIOIA","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:1d519ea9c796ecfd8d3fc331805dd35861f5e1002bd9a7587720b91df11701bb","target":"graph","created_at":"2026-05-18T02:19:35Z","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 initiate the study of trade-offs between sparsity and the number of measurements in sparse recovery schemes for generic norms. Specifically, for a norm $\\|\\cdot\\|$, sparsity parameter $k$, approximation factor $K>0$, and probability of failure $P>0$, we ask: what is the minimal value of $m$ so that there is a distribution over $m \\times n$ matrices $A$ with the property that for any $x$, given $Ax$, we can recover a $k$-sparse approximation to $x$ in the given norm with probability at least $1-P$? We give a partial answer to this problem, by showing that for norms that admit efficient linea","authors_text":"Arturs Backurs, David P. Woodruff, Eric Price, Ilya Razenshteyn, Piotr Indyk","cross_cats":["cs.CG","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-05T02:59:25Z","title":"Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01076","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:cfc2f8f7613e313d7ea2590d6fe25fd7f371c185dbaf1d41297f26ec7df9393d","target":"record","created_at":"2026-05-18T02:19:35Z","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":"9ebaf1f63a2f17a3ad135e583bc3c45ef6632d8ac4dacbe012ae8588e1998ba0","cross_cats_sorted":["cs.CG","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-05T02:59:25Z","title_canon_sha256":"939da84b7ff51d00527189219269f580c214c16902ad591fca2e2d5e148e14b9"},"schema_version":"1.0","source":{"id":"1504.01076","kind":"arxiv","version":1}},"canonical_sha256":"ea3b643900da9e50b46e39cbb4f90a04fc6f6001b2dd6573e147db2ae9c7ab48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea3b643900da9e50b46e39cbb4f90a04fc6f6001b2dd6573e147db2ae9c7ab48","first_computed_at":"2026-05-18T02:19:35.210834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:35.210834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4E4Q8UxC+OV3K+Ni4Nvkf66wyGCHPhxsYuHTh72wzKx/i33J8QOwBDUBUUYN51O0cXFSv4lYRjAmmXZxkjAZCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:35.211439Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01076","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfc2f8f7613e313d7ea2590d6fe25fd7f371c185dbaf1d41297f26ec7df9393d","sha256:1d519ea9c796ecfd8d3fc331805dd35861f5e1002bd9a7587720b91df11701bb"],"state_sha256":"b6831a402068bd8ea14586811f31818c5f867ce5cf867e90b68287459e5174cb"}