{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LESDFM6BLWVB55ITYGY5DWVM7K","short_pith_number":"pith:LESDFM6B","canonical_record":{"source":{"id":"1011.5936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-26T23:12:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5bb4a871e8ea0239a3b12a619ee1c92fed3b18eddddc36efc7008e074bf75b1","abstract_canon_sha256":"c1a66ae2064a118f38579c47b078169e01aa797865e316dc6c2964da121399af"},"schema_version":"1.0"},"canonical_sha256":"592432b3c15daa1ef513c1b1d1daacfa9f7a81b11fcf3a4401c68e78a332d1d0","source":{"kind":"arxiv","id":"1011.5936","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5936","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5936v1","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5936","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"LESDFM6BLWVB","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LESDFM6BLWVB55IT","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LESDFM6B","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LESDFM6BLWVB55ITYGY5DWVM7K","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-26T23:12:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5bb4a871e8ea0239a3b12a619ee1c92fed3b18eddddc36efc7008e074bf75b1","abstract_canon_sha256":"c1a66ae2064a118f38579c47b078169e01aa797865e316dc6c2964da121399af"},"schema_version":"1.0"},"canonical_sha256":"592432b3c15daa1ef513c1b1d1daacfa9f7a81b11fcf3a4401c68e78a332d1d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:37.876290Z","signature_b64":"Tx0y3UWNsRm3tFnBmrAL7KEKCWwHCEV7pl4SudGKPS37Poc/ItJXq6plR/a5XKMuNeA1K9JJWWiD5tS1c9FgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"592432b3c15daa1ef513c1b1d1daacfa9f7a81b11fcf3a4401c68e78a332d1d0","last_reissued_at":"2026-05-18T04:34:37.875623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:37.875623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5936","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-18T04:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xyKEKsj0v8tQnCHy62qKOwYI9vMa2hWDvOPQmRtIQCRtHlE8DnBcnuAQt/bk9913LispSmnyn8m6JSihsIwTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:40:00.792496Z"},"content_sha256":"8ef1a29f82571c5eb55116bc97d6a71f4e9050ed8fa2447b73b4ded9d2ec40bf","schema_version":"1.0","event_id":"sha256:8ef1a29f82571c5eb55116bc97d6a71f4e9050ed8fa2447b73b4ded9d2ec40bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LESDFM6BLWVB55ITYGY5DWVM7K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Performance of Sparse Recovery via L_p-minimization (0<=p <=1)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ao Tang, Meng Wang, Weiyu Xu","submitted_at":"2010-11-26T23:12:24Z","abstract_excerpt":"It is known that a high-dimensional sparse vector x* in R^n can be recovered from low-dimensional measurements y= A^{m*n} x* (m<n) . In this paper, we investigate the recovering ability of l_p-minimization (0<=p<=1) as p varies, where l_p-minimization returns a vector with the least l_p ``norm'' among all the vectors x satisfying Ax=y. Besides analyzing the performance of strong recovery where l_p-minimization needs to recover all the sparse vectors up to certain sparsity, we also for the first time analyze the performance of ``weak'' recovery of l_p-minimization (0<=p<1) where the aim is to r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5936","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-18T04:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pYoyWSms7tdiZA8igoeKzpLdF9NiDOREDwFq/Hi8EYrLwQ0C7jXwWtIKRab4L6zFPunnqo5qAGqzbKq6hu1BDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:40:00.792849Z"},"content_sha256":"4ffcda02d8ad13483cb22e8ecdc426d46be97b256a01a25cc84041b88acfda0e","schema_version":"1.0","event_id":"sha256:4ffcda02d8ad13483cb22e8ecdc426d46be97b256a01a25cc84041b88acfda0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LESDFM6BLWVB55ITYGY5DWVM7K/bundle.json","state_url":"https://pith.science/pith/LESDFM6BLWVB55ITYGY5DWVM7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LESDFM6BLWVB55ITYGY5DWVM7K/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-05-30T04:40:00Z","links":{"resolver":"https://pith.science/pith/LESDFM6BLWVB55ITYGY5DWVM7K","bundle":"https://pith.science/pith/LESDFM6BLWVB55ITYGY5DWVM7K/bundle.json","state":"https://pith.science/pith/LESDFM6BLWVB55ITYGY5DWVM7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LESDFM6BLWVB55ITYGY5DWVM7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LESDFM6BLWVB55ITYGY5DWVM7K","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":"c1a66ae2064a118f38579c47b078169e01aa797865e316dc6c2964da121399af","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-26T23:12:24Z","title_canon_sha256":"f5bb4a871e8ea0239a3b12a619ee1c92fed3b18eddddc36efc7008e074bf75b1"},"schema_version":"1.0","source":{"id":"1011.5936","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5936","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5936v1","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5936","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"LESDFM6BLWVB","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LESDFM6BLWVB55IT","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LESDFM6B","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:4ffcda02d8ad13483cb22e8ecdc426d46be97b256a01a25cc84041b88acfda0e","target":"graph","created_at":"2026-05-18T04:34:37Z","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":"It is known that a high-dimensional sparse vector x* in R^n can be recovered from low-dimensional measurements y= A^{m*n} x* (m<n) . In this paper, we investigate the recovering ability of l_p-minimization (0<=p<=1) as p varies, where l_p-minimization returns a vector with the least l_p ``norm'' among all the vectors x satisfying Ax=y. Besides analyzing the performance of strong recovery where l_p-minimization needs to recover all the sparse vectors up to certain sparsity, we also for the first time analyze the performance of ``weak'' recovery of l_p-minimization (0<=p<1) where the aim is to r","authors_text":"Ao Tang, Meng Wang, Weiyu Xu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-26T23:12:24Z","title":"On the Performance of Sparse Recovery via L_p-minimization (0<=p <=1)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5936","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:8ef1a29f82571c5eb55116bc97d6a71f4e9050ed8fa2447b73b4ded9d2ec40bf","target":"record","created_at":"2026-05-18T04:34:37Z","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":"c1a66ae2064a118f38579c47b078169e01aa797865e316dc6c2964da121399af","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-26T23:12:24Z","title_canon_sha256":"f5bb4a871e8ea0239a3b12a619ee1c92fed3b18eddddc36efc7008e074bf75b1"},"schema_version":"1.0","source":{"id":"1011.5936","kind":"arxiv","version":1}},"canonical_sha256":"592432b3c15daa1ef513c1b1d1daacfa9f7a81b11fcf3a4401c68e78a332d1d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"592432b3c15daa1ef513c1b1d1daacfa9f7a81b11fcf3a4401c68e78a332d1d0","first_computed_at":"2026-05-18T04:34:37.875623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:37.875623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tx0y3UWNsRm3tFnBmrAL7KEKCWwHCEV7pl4SudGKPS37Poc/ItJXq6plR/a5XKMuNeA1K9JJWWiD5tS1c9FgAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:37.876290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5936","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ef1a29f82571c5eb55116bc97d6a71f4e9050ed8fa2447b73b4ded9d2ec40bf","sha256:4ffcda02d8ad13483cb22e8ecdc426d46be97b256a01a25cc84041b88acfda0e"],"state_sha256":"d2e0f8423a0423ffaacead93dbab7a4116d017e5fed5ce68c52d26da0585dad5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEUl9Kdgte+qKHow6XAcdNhOVhuCT2iPyGbfGDznpgSIByPO7X2jaSqF84vDgzvBXryPNgp3wvBlXM0gADuxCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:40:00.795676Z","bundle_sha256":"e5088434bfbbc2c045724483fc6db24402915b94aaca2cdcaca6a679a8d1e0d2"}}