{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7D4M27NHIXZ2WISXUJ2OFF6OFN","short_pith_number":"pith:7D4M27NH","schema_version":"1.0","canonical_sha256":"f8f8cd7da745f3ab2257a274e297ce2b59bea3e0c62d82be0991b5928537b1c5","source":{"kind":"arxiv","id":"1310.1654","version":2},"attestation_state":"computed","paper":{"title":"Scaling Law for Recovering the Sparsest Element in a Subspace","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Laurent Demanet, Paul Hand","submitted_at":"2013-10-07T01:50:11Z","abstract_excerpt":"We address the problem of recovering a sparse $n$-vector within a given subspace. This problem is a subtask of some approaches to dictionary learning and sparse principal component analysis. Hence, if we can prove scaling laws for recovery of sparse vectors, it will be easier to derive and prove recovery results in these applications. In this paper, we present a scaling law for recovering the sparse vector from a subspace that is spanned by the sparse vector and $k$ random vectors. We prove that the sparse vector will be the output to one of $n$ linear programs with high probability if its sup"},"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":"1310.1654","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-07T01:50:11Z","cross_cats_sorted":[],"title_canon_sha256":"b91ad1284681fb9948341ff45c43df0cc0cf8fb8773d0d0863d02c70833d9ad9","abstract_canon_sha256":"b2eeba8a4bc24a0291a9bba27b3b1e81c940e6c3878e6805517c2c28a3f44a46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:14.371105Z","signature_b64":"RcdSmFgFNpRzVjM01JpBM2uy6NMp3RQMeooXWGjdN5W/8cgTzQmBX25jQb/pYShLGHjQpve3CzaXujp5G1LZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8f8cd7da745f3ab2257a274e297ce2b59bea3e0c62d82be0991b5928537b1c5","last_reissued_at":"2026-05-18T02:32:14.370435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:14.370435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling Law for Recovering the Sparsest Element in a Subspace","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Laurent Demanet, Paul Hand","submitted_at":"2013-10-07T01:50:11Z","abstract_excerpt":"We address the problem of recovering a sparse $n$-vector within a given subspace. This problem is a subtask of some approaches to dictionary learning and sparse principal component analysis. Hence, if we can prove scaling laws for recovery of sparse vectors, it will be easier to derive and prove recovery results in these applications. In this paper, we present a scaling law for recovering the sparse vector from a subspace that is spanned by the sparse vector and $k$ random vectors. We prove that the sparse vector will be the output to one of $n$ linear programs with high probability if its sup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1654","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":"1310.1654","created_at":"2026-05-18T02:32:14.370564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1654v2","created_at":"2026-05-18T02:32:14.370564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1654","created_at":"2026-05-18T02:32:14.370564+00:00"},{"alias_kind":"pith_short_12","alias_value":"7D4M27NHIXZ2","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7D4M27NHIXZ2WISX","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7D4M27NH","created_at":"2026-05-18T12:27:36.564083+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/7D4M27NHIXZ2WISXUJ2OFF6OFN","json":"https://pith.science/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN.json","graph_json":"https://pith.science/api/pith-number/7D4M27NHIXZ2WISXUJ2OFF6OFN/graph.json","events_json":"https://pith.science/api/pith-number/7D4M27NHIXZ2WISXUJ2OFF6OFN/events.json","paper":"https://pith.science/paper/7D4M27NH"},"agent_actions":{"view_html":"https://pith.science/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN","download_json":"https://pith.science/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN.json","view_paper":"https://pith.science/paper/7D4M27NH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1654&json=true","fetch_graph":"https://pith.science/api/pith-number/7D4M27NHIXZ2WISXUJ2OFF6OFN/graph.json","fetch_events":"https://pith.science/api/pith-number/7D4M27NHIXZ2WISXUJ2OFF6OFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN/action/storage_attestation","attest_author":"https://pith.science/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN/action/author_attestation","sign_citation":"https://pith.science/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN/action/citation_signature","submit_replication":"https://pith.science/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN/action/replication_record"}},"created_at":"2026-05-18T02:32:14.370564+00:00","updated_at":"2026-05-18T02:32:14.370564+00:00"}