{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7D4M27NHIXZ2WISXUJ2OFF6OFN","short_pith_number":"pith:7D4M27NH","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"},"canonical_sha256":"f8f8cd7da745f3ab2257a274e297ce2b59bea3e0c62d82be0991b5928537b1c5","source":{"kind":"arxiv","id":"1310.1654","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1654","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1654v2","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1654","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"pith_short_12","alias_value":"7D4M27NHIXZ2","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7D4M27NHIXZ2WISX","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7D4M27NH","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7D4M27NHIXZ2WISXUJ2OFF6OFN","target":"record","payload":{"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"},"canonical_sha256":"f8f8cd7da745f3ab2257a274e297ce2b59bea3e0c62d82be0991b5928537b1c5","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"},"source_kind":"arxiv","source_id":"1310.1654","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-18T02:32:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6zvaWeSIOmHU3ayY2YJOiKmsITug2cGiLQ/hMOzHwXkYTVG5JC8d7sYm2FHwHt4j1TbfXwN4zvZvXFyRHUpGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:08:21.630515Z"},"content_sha256":"943ea9912045f48e277ee5a2e49a20ca24ce153840b08e86efad341af202e627","schema_version":"1.0","event_id":"sha256:943ea9912045f48e277ee5a2e49a20ca24ce153840b08e86efad341af202e627"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7D4M27NHIXZ2WISXUJ2OFF6OFN","target":"graph","payload":{"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"},"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-18T02:32:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvyzz6571DSybq2TT77hIYKmpb/Y9wHGDaAx65+FOdRm4qTfbWPjokJvvVLsj6BiP3XECFTerz7geLWpw4XFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:08:21.631274Z"},"content_sha256":"2a966a3f70826ba9accf0a95d47fe3abe73a3c77cddbed75c7ad04c1378405de","schema_version":"1.0","event_id":"sha256:2a966a3f70826ba9accf0a95d47fe3abe73a3c77cddbed75c7ad04c1378405de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN/bundle.json","state_url":"https://pith.science/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN/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-01T01:08:21Z","links":{"resolver":"https://pith.science/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN","bundle":"https://pith.science/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN/bundle.json","state":"https://pith.science/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7D4M27NHIXZ2WISXUJ2OFF6OFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7D4M27NHIXZ2WISXUJ2OFF6OFN","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":"b2eeba8a4bc24a0291a9bba27b3b1e81c940e6c3878e6805517c2c28a3f44a46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-07T01:50:11Z","title_canon_sha256":"b91ad1284681fb9948341ff45c43df0cc0cf8fb8773d0d0863d02c70833d9ad9"},"schema_version":"1.0","source":{"id":"1310.1654","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1654","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1654v2","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1654","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"pith_short_12","alias_value":"7D4M27NHIXZ2","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7D4M27NHIXZ2WISX","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7D4M27NH","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:2a966a3f70826ba9accf0a95d47fe3abe73a3c77cddbed75c7ad04c1378405de","target":"graph","created_at":"2026-05-18T02:32:14Z","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 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","authors_text":"Laurent Demanet, Paul Hand","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-07T01:50:11Z","title":"Scaling Law for Recovering the Sparsest Element in a Subspace"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1654","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:943ea9912045f48e277ee5a2e49a20ca24ce153840b08e86efad341af202e627","target":"record","created_at":"2026-05-18T02:32:14Z","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":"b2eeba8a4bc24a0291a9bba27b3b1e81c940e6c3878e6805517c2c28a3f44a46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-07T01:50:11Z","title_canon_sha256":"b91ad1284681fb9948341ff45c43df0cc0cf8fb8773d0d0863d02c70833d9ad9"},"schema_version":"1.0","source":{"id":"1310.1654","kind":"arxiv","version":2}},"canonical_sha256":"f8f8cd7da745f3ab2257a274e297ce2b59bea3e0c62d82be0991b5928537b1c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8f8cd7da745f3ab2257a274e297ce2b59bea3e0c62d82be0991b5928537b1c5","first_computed_at":"2026-05-18T02:32:14.370435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:14.370435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RcdSmFgFNpRzVjM01JpBM2uy6NMp3RQMeooXWGjdN5W/8cgTzQmBX25jQb/pYShLGHjQpve3CzaXujp5G1LZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:14.371105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1654","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:943ea9912045f48e277ee5a2e49a20ca24ce153840b08e86efad341af202e627","sha256:2a966a3f70826ba9accf0a95d47fe3abe73a3c77cddbed75c7ad04c1378405de"],"state_sha256":"5d2192a8f0e5820cf222739536a0e213566a1aaaab623fb2466b0c2f077fbb40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zuJV1YmdsSCy0PPFLbfH1wYZG/nNig8ogkT403DVkAWMgkHBIIZ7X/m7Vufa1kyb0UC3raFajFfRpoUrx2GTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:08:21.634562Z","bundle_sha256":"ff4b8506b34709164fb0d6aba4e2d4e8ceb4d47b3efb9c8a3dbedbe7f176a09c"}}