{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VSGRCCY72ARN3S2GMBOL5TMN4M","short_pith_number":"pith:VSGRCCY7","canonical_record":{"source":{"id":"1106.0365","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2011-06-02T05:20:14Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ef55706dcab07ee2a24c128da6b8e6db24f3ce4e0b33b29d7f328ed358c57140","abstract_canon_sha256":"76137c575e51c36fc42b9729a5982203a255af36e67ebc0c1b413f287a4cba3f"},"schema_version":"1.0"},"canonical_sha256":"ac8d110b1fd022ddcb46605cbecd8de3015780ccf1b0141ddb4ce1fd76c8a931","source":{"kind":"arxiv","id":"1106.0365","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0365","created_at":"2026-05-18T04:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0365v2","created_at":"2026-05-18T04:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0365","created_at":"2026-05-18T04:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"VSGRCCY72ARN","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VSGRCCY72ARN3S2G","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VSGRCCY7","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VSGRCCY72ARN3S2GMBOL5TMN4M","target":"record","payload":{"canonical_record":{"source":{"id":"1106.0365","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2011-06-02T05:20:14Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ef55706dcab07ee2a24c128da6b8e6db24f3ce4e0b33b29d7f328ed358c57140","abstract_canon_sha256":"76137c575e51c36fc42b9729a5982203a255af36e67ebc0c1b413f287a4cba3f"},"schema_version":"1.0"},"canonical_sha256":"ac8d110b1fd022ddcb46605cbecd8de3015780ccf1b0141ddb4ce1fd76c8a931","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:49.348080Z","signature_b64":"5DQygTs/A5ANqNiv+9mqUQFUIKurwaFW8GaKdcU3vaD5YLgY7cUE3kz41KaNKoKNGNTw8sKmWBADxA4DtIn+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac8d110b1fd022ddcb46605cbecd8de3015780ccf1b0141ddb4ce1fd76c8a931","last_reissued_at":"2026-05-18T04:20:49.347500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:49.347500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.0365","source_version":2,"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-18T04:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nmBKWpWnlEcivXrO9BlnHugxvnZTZPJOqt7V9n/5j2VT2hBORSabnH+oa6HqcV1N3ACoirVlvKmE3dYheJYDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:14:57.939408Z"},"content_sha256":"3a2d44eab1498ddc0f5ceb6ba7592599932674c273cfa716cb4d36cd4a0589c0","schema_version":"1.0","event_id":"sha256:3a2d44eab1498ddc0f5ceb6ba7592599932674c273cfa716cb4d36cd4a0589c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VSGRCCY72ARN3S2GMBOL5TMN4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Sparse Recovery","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Eric Price, Khanh Do Ba, Piotr Indyk","submitted_at":"2011-06-02T05:20:14Z","abstract_excerpt":"We consider the following k-sparse recovery problem: design an m x n matrix A, such that for any signal x, given Ax we can efficiently recover x' satisfying\n  ||x-x'||_1 <= C min_{k-sparse} x\"} ||x-x\"||_1.\n  It is known that there exist matrices A with this property that have only O(k log (n/k)) rows.\n  In this paper we show that this bound is tight. Our bound holds even for the more general /randomized/ version of the problem, where A is a random variable and the recovery algorithm is required to work for any fixed x with constant probability (over A)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0365","kind":"arxiv","version":2},"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-18T04:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/n1Mot/Itm1GRBrkDECTPxZPv7kG2XA1CJp74FrtMrZVNpaF9D8fHdWrGEBhjMUlLq+LnSFOmpZm7TwNgurDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:14:57.940101Z"},"content_sha256":"254f1803018d56843c4e0a7512866e421c53286c71785c3fc008b331925f9443","schema_version":"1.0","event_id":"sha256:254f1803018d56843c4e0a7512866e421c53286c71785c3fc008b331925f9443"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSGRCCY72ARN3S2GMBOL5TMN4M/bundle.json","state_url":"https://pith.science/pith/VSGRCCY72ARN3S2GMBOL5TMN4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSGRCCY72ARN3S2GMBOL5TMN4M/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-10T00:14:57Z","links":{"resolver":"https://pith.science/pith/VSGRCCY72ARN3S2GMBOL5TMN4M","bundle":"https://pith.science/pith/VSGRCCY72ARN3S2GMBOL5TMN4M/bundle.json","state":"https://pith.science/pith/VSGRCCY72ARN3S2GMBOL5TMN4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSGRCCY72ARN3S2GMBOL5TMN4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VSGRCCY72ARN3S2GMBOL5TMN4M","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":"76137c575e51c36fc42b9729a5982203a255af36e67ebc0c1b413f287a4cba3f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2011-06-02T05:20:14Z","title_canon_sha256":"ef55706dcab07ee2a24c128da6b8e6db24f3ce4e0b33b29d7f328ed358c57140"},"schema_version":"1.0","source":{"id":"1106.0365","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0365","created_at":"2026-05-18T04:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0365v2","created_at":"2026-05-18T04:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0365","created_at":"2026-05-18T04:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"VSGRCCY72ARN","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VSGRCCY72ARN3S2G","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VSGRCCY7","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:254f1803018d56843c4e0a7512866e421c53286c71785c3fc008b331925f9443","target":"graph","created_at":"2026-05-18T04:20:49Z","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 consider the following k-sparse recovery problem: design an m x n matrix A, such that for any signal x, given Ax we can efficiently recover x' satisfying\n  ||x-x'||_1 <= C min_{k-sparse} x\"} ||x-x\"||_1.\n  It is known that there exist matrices A with this property that have only O(k log (n/k)) rows.\n  In this paper we show that this bound is tight. Our bound holds even for the more general /randomized/ version of the problem, where A is a random variable and the recovery algorithm is required to work for any fixed x with constant probability (over A).","authors_text":"David P. Woodruff, Eric Price, Khanh Do Ba, Piotr Indyk","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2011-06-02T05:20:14Z","title":"Lower Bounds for Sparse Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0365","kind":"arxiv","version":2},"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:3a2d44eab1498ddc0f5ceb6ba7592599932674c273cfa716cb4d36cd4a0589c0","target":"record","created_at":"2026-05-18T04:20:49Z","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":"76137c575e51c36fc42b9729a5982203a255af36e67ebc0c1b413f287a4cba3f","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2011-06-02T05:20:14Z","title_canon_sha256":"ef55706dcab07ee2a24c128da6b8e6db24f3ce4e0b33b29d7f328ed358c57140"},"schema_version":"1.0","source":{"id":"1106.0365","kind":"arxiv","version":2}},"canonical_sha256":"ac8d110b1fd022ddcb46605cbecd8de3015780ccf1b0141ddb4ce1fd76c8a931","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac8d110b1fd022ddcb46605cbecd8de3015780ccf1b0141ddb4ce1fd76c8a931","first_computed_at":"2026-05-18T04:20:49.347500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:49.347500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5DQygTs/A5ANqNiv+9mqUQFUIKurwaFW8GaKdcU3vaD5YLgY7cUE3kz41KaNKoKNGNTw8sKmWBADxA4DtIn+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:49.348080Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0365","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a2d44eab1498ddc0f5ceb6ba7592599932674c273cfa716cb4d36cd4a0589c0","sha256:254f1803018d56843c4e0a7512866e421c53286c71785c3fc008b331925f9443"],"state_sha256":"9320622d0b6172a5635bbb607285f6a802d21c4c4c5c09ae43e1db1240e3c254"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GhbXt/cJKcXY1hAwyAiwh3TXm9LLlouHBswVZl5ekVYb9khpQ7tJiZ2dKrCNIArse0PvEGr5IiKgCjrtaN8pAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T00:14:57.943855Z","bundle_sha256":"8adb1fbd152cb7af9e4d59d61e2fd1b85b67a2fafced71262167a4361e9dde63"}}