{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PNU6MJNDOLRLFVALLYZFPLVXQ6","short_pith_number":"pith:PNU6MJND","canonical_record":{"source":{"id":"1302.1236","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T00:24:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cefc6687d3af1d3a76e6d974964c296e07e7ed603eaaa9d44e25fc41d4a0a729","abstract_canon_sha256":"ab1d518051e9913c7b6da36f77c650e26637be38ffd87fb219c6f38f1893b02b"},"schema_version":"1.0"},"canonical_sha256":"7b69e625a372e2b2d40b5e3257aeb78781dc4c378b75676eb7130e85745e28ad","source":{"kind":"arxiv","id":"1302.1236","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1236","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1236v1","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1236","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"pith_short_12","alias_value":"PNU6MJNDOLRL","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PNU6MJNDOLRLFVAL","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PNU6MJND","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PNU6MJNDOLRLFVALLYZFPLVXQ6","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1236","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T00:24:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cefc6687d3af1d3a76e6d974964c296e07e7ed603eaaa9d44e25fc41d4a0a729","abstract_canon_sha256":"ab1d518051e9913c7b6da36f77c650e26637be38ffd87fb219c6f38f1893b02b"},"schema_version":"1.0"},"canonical_sha256":"7b69e625a372e2b2d40b5e3257aeb78781dc4c378b75676eb7130e85745e28ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:24.796665Z","signature_b64":"lmBO1EL/00YLZGYLKtJju8Vr6mZVdxd5yPWHHOvirCM27hKpogRHcf8+NHCQd31kNSOS9p2rYZi3CIOk/bCYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b69e625a372e2b2d40b5e3257aeb78781dc4c378b75676eb7130e85745e28ad","last_reissued_at":"2026-05-18T03:34:24.796170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:24.796170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1236","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-18T03:34:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CPBehRDMbLw3MlLr2uIAghXZ5NoUJrRQFiW8zZWQ1CLDh8jCWyWBFcmeYlZd+HFsznBP5U8n7UAltK6s6fPmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:53:02.245474Z"},"content_sha256":"1ae7fc0342aed53f273f3db2bc47541f6ddaeda51e8f5064b1a7ff63aa49fde8","schema_version":"1.0","event_id":"sha256:1ae7fc0342aed53f273f3db2bc47541f6ddaeda51e8f5064b1a7ff63aa49fde8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PNU6MJNDOLRLFVALLYZFPLVXQ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp RIP Bound for Sparse Signal and Low-Rank Matrix Recovery","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anru Zhang, T. Tony Cai","submitted_at":"2013-02-06T00:24:14Z","abstract_excerpt":"This paper establishes a sharp condition on the restricted isometry property (RIP) for both the sparse signal recovery and low-rank matrix recovery. It is shown that if the measurement matrix $A$ satisfies the RIP condition $\\delta_k^A<1/3$, then all $k$-sparse signals $\\beta$ can be recovered exactly via the constrained $\\ell_1$ minimization based on $y=A\\beta$. Similarly, if the linear map $\\cal M$ satisfies the RIP condition $\\delta_r^{\\cal M}<1/3$, then all matrices $X$ of rank at most $r$ can be recovered exactly via the constrained nuclear norm minimization based on $b={\\cal M}(X)$. Furt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1236","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-18T03:34:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"miy3TTP9Fsai5mMs8J+lQCXqxIKBMPX8+gIfD6KnsTWqjbF213rHwgO6bPPwXe7U1kQm//kd/9PHM3+OIbTMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:53:02.245857Z"},"content_sha256":"b316d9d84a0d562f91ce15d2035b4a1b2a84f764f18155300f950399aea64574","schema_version":"1.0","event_id":"sha256:b316d9d84a0d562f91ce15d2035b4a1b2a84f764f18155300f950399aea64574"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PNU6MJNDOLRLFVALLYZFPLVXQ6/bundle.json","state_url":"https://pith.science/pith/PNU6MJNDOLRLFVALLYZFPLVXQ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PNU6MJNDOLRLFVALLYZFPLVXQ6/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-26T11:53:02Z","links":{"resolver":"https://pith.science/pith/PNU6MJNDOLRLFVALLYZFPLVXQ6","bundle":"https://pith.science/pith/PNU6MJNDOLRLFVALLYZFPLVXQ6/bundle.json","state":"https://pith.science/pith/PNU6MJNDOLRLFVALLYZFPLVXQ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PNU6MJNDOLRLFVALLYZFPLVXQ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PNU6MJNDOLRLFVALLYZFPLVXQ6","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":"ab1d518051e9913c7b6da36f77c650e26637be38ffd87fb219c6f38f1893b02b","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T00:24:14Z","title_canon_sha256":"cefc6687d3af1d3a76e6d974964c296e07e7ed603eaaa9d44e25fc41d4a0a729"},"schema_version":"1.0","source":{"id":"1302.1236","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1236","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1236v1","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1236","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"pith_short_12","alias_value":"PNU6MJNDOLRL","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PNU6MJNDOLRLFVAL","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PNU6MJND","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:b316d9d84a0d562f91ce15d2035b4a1b2a84f764f18155300f950399aea64574","target":"graph","created_at":"2026-05-18T03:34:24Z","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":"This paper establishes a sharp condition on the restricted isometry property (RIP) for both the sparse signal recovery and low-rank matrix recovery. It is shown that if the measurement matrix $A$ satisfies the RIP condition $\\delta_k^A<1/3$, then all $k$-sparse signals $\\beta$ can be recovered exactly via the constrained $\\ell_1$ minimization based on $y=A\\beta$. Similarly, if the linear map $\\cal M$ satisfies the RIP condition $\\delta_r^{\\cal M}<1/3$, then all matrices $X$ of rank at most $r$ can be recovered exactly via the constrained nuclear norm minimization based on $b={\\cal M}(X)$. Furt","authors_text":"Anru Zhang, T. Tony Cai","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T00:24:14Z","title":"Sharp RIP Bound for Sparse Signal and Low-Rank Matrix Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1236","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:1ae7fc0342aed53f273f3db2bc47541f6ddaeda51e8f5064b1a7ff63aa49fde8","target":"record","created_at":"2026-05-18T03:34:24Z","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":"ab1d518051e9913c7b6da36f77c650e26637be38ffd87fb219c6f38f1893b02b","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T00:24:14Z","title_canon_sha256":"cefc6687d3af1d3a76e6d974964c296e07e7ed603eaaa9d44e25fc41d4a0a729"},"schema_version":"1.0","source":{"id":"1302.1236","kind":"arxiv","version":1}},"canonical_sha256":"7b69e625a372e2b2d40b5e3257aeb78781dc4c378b75676eb7130e85745e28ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b69e625a372e2b2d40b5e3257aeb78781dc4c378b75676eb7130e85745e28ad","first_computed_at":"2026-05-18T03:34:24.796170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:24.796170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lmBO1EL/00YLZGYLKtJju8Vr6mZVdxd5yPWHHOvirCM27hKpogRHcf8+NHCQd31kNSOS9p2rYZi3CIOk/bCYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:24.796665Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1236","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ae7fc0342aed53f273f3db2bc47541f6ddaeda51e8f5064b1a7ff63aa49fde8","sha256:b316d9d84a0d562f91ce15d2035b4a1b2a84f764f18155300f950399aea64574"],"state_sha256":"3e805cd5e2884f26215b5c7def4ff296578ca4e581043f681f4a5ce3d5f8e8e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U4AzcUy4994R2r+JbKZkKUeAFHT+XFZEWAf9mMlv2vwmWvKGk39wNRPeApPNxOnZNA2f4+m7+ZKTC40aFVxoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:53:02.248027Z","bundle_sha256":"5e17ae484fc8b543f4372e4301484cb0423515d09120244bf2712db0827ccd2c"}}