{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DLEYD2TVJKOZX2MDJ5X7LJPLBV","short_pith_number":"pith:DLEYD2TV","schema_version":"1.0","canonical_sha256":"1ac981ea754a9d9be9834f6ff5a5eb0d4e6f4606546f12e3b3153dcf8cd535ea","source":{"kind":"arxiv","id":"1306.1154","version":2},"attestation_state":"computed","paper":{"title":"Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-rank Matrices","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Anru Zhang, T. Tony Cai","submitted_at":"2013-06-05T15:50:28Z","abstract_excerpt":"This paper considers compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for sparse signal and low-rank matrix recovery. The analysis relies on a key technical tool which represents points in a polytope by convex combinations of sparse vectors. The technique is elementary while leads to sharp results.\n  It is shown that for any given constant $t\\ge {4/3}$, in compressed sensing $\\delta_{tk}^A < \\sqrt{(t-1)/t}$ guarantees the exact recovery of all $k$ sparse signals in the noiseless case through the constrained $"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1306.1154","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2013-06-05T15:50:28Z","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"2030b8730a9901f4244c4921981beea4397e18e4d1955cf014f73e7a5f07bbd2","abstract_canon_sha256":"c64a9324a3e3bd418360d4f43a71c5ccdf5d7985fc866ab1e8a61fee9ab4045b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:33.501513Z","signature_b64":"TvrqpPxDUdA4JqHhosnabb8oX+uKd2CyUHexNXJd6RE4OzWXPk6PAP6K9p+XGGVWUD/8GCktOKJNA5qPwQQBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ac981ea754a9d9be9834f6ff5a5eb0d4e6f4606546f12e3b3153dcf8cd535ea","last_reissued_at":"2026-05-18T03:09:33.500880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:33.500880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-rank Matrices","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Anru Zhang, T. Tony Cai","submitted_at":"2013-06-05T15:50:28Z","abstract_excerpt":"This paper considers compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for sparse signal and low-rank matrix recovery. The analysis relies on a key technical tool which represents points in a polytope by convex combinations of sparse vectors. The technique is elementary while leads to sharp results.\n  It is shown that for any given constant $t\\ge {4/3}$, in compressed sensing $\\delta_{tk}^A < \\sqrt{(t-1)/t}$ guarantees the exact recovery of all $k$ sparse signals in the noiseless case through the constrained $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1154","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.1154","created_at":"2026-05-18T03:09:33.500988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1154v2","created_at":"2026-05-18T03:09:33.500988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1154","created_at":"2026-05-18T03:09:33.500988+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLEYD2TVJKOZ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLEYD2TVJKOZX2MD","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLEYD2TV","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DLEYD2TVJKOZX2MDJ5X7LJPLBV","json":"https://pith.science/pith/DLEYD2TVJKOZX2MDJ5X7LJPLBV.json","graph_json":"https://pith.science/api/pith-number/DLEYD2TVJKOZX2MDJ5X7LJPLBV/graph.json","events_json":"https://pith.science/api/pith-number/DLEYD2TVJKOZX2MDJ5X7LJPLBV/events.json","paper":"https://pith.science/paper/DLEYD2TV"},"agent_actions":{"view_html":"https://pith.science/pith/DLEYD2TVJKOZX2MDJ5X7LJPLBV","download_json":"https://pith.science/pith/DLEYD2TVJKOZX2MDJ5X7LJPLBV.json","view_paper":"https://pith.science/paper/DLEYD2TV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1154&json=true","fetch_graph":"https://pith.science/api/pith-number/DLEYD2TVJKOZX2MDJ5X7LJPLBV/graph.json","fetch_events":"https://pith.science/api/pith-number/DLEYD2TVJKOZX2MDJ5X7LJPLBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLEYD2TVJKOZX2MDJ5X7LJPLBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLEYD2TVJKOZX2MDJ5X7LJPLBV/action/storage_attestation","attest_author":"https://pith.science/pith/DLEYD2TVJKOZX2MDJ5X7LJPLBV/action/author_attestation","sign_citation":"https://pith.science/pith/DLEYD2TVJKOZX2MDJ5X7LJPLBV/action/citation_signature","submit_replication":"https://pith.science/pith/DLEYD2TVJKOZX2MDJ5X7LJPLBV/action/replication_record"}},"created_at":"2026-05-18T03:09:33.500988+00:00","updated_at":"2026-05-18T03:09:33.500988+00:00"}