{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:MG5U65EDICAJ32KAJZSEADQRO2","short_pith_number":"pith:MG5U65ED","schema_version":"1.0","canonical_sha256":"61bb4f748340809de9404e64400e1176985c5d76b591c4a9b72e481f645485fb","source":{"kind":"arxiv","id":"cs/0510032","version":1},"attestation_state":"computed","paper":{"title":"Polar Polytopes and Recovery of Sparse Representations","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mark D. Plumbley","submitted_at":"2005-10-13T14:41:15Z","abstract_excerpt":"Suppose we have a signal y which we wish to represent using a linear combination of a number of basis atoms a_i, y=sum_i x_i a_i = Ax. The problem of finding the minimum L0 norm representation for y is a hard problem. The Basis Pursuit (BP) approach proposes to find the minimum L1 norm representation instead, which corresponds to a linear program (LP) that can be solved using modern LP techniques, and several recent authors have given conditions for the BP (minimum L1 norm) and sparse (minimum L0 solutions) representations to be identical. In this paper, we explore this sparse representation p"},"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":"cs/0510032","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-10-13T14:41:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"79f7424b56029b53c8e5a41315a9f0f6226827ce983211f550499774fdefc7c0","abstract_canon_sha256":"593ca5b94b6319a1545b6b857b9ea32741f4ac482d5b5667be0ae788b5885758"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:55.921475Z","signature_b64":"NHCfMsV/ERXU3VyhweI+DFzqjOVibDwu1hc69IZWhimcFoiYKYPzOhW5h4ViIXcTYus2idTzhz4au5jv87qBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61bb4f748340809de9404e64400e1176985c5d76b591c4a9b72e481f645485fb","last_reissued_at":"2026-05-18T01:09:55.920885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:55.920885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polar Polytopes and Recovery of Sparse Representations","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mark D. Plumbley","submitted_at":"2005-10-13T14:41:15Z","abstract_excerpt":"Suppose we have a signal y which we wish to represent using a linear combination of a number of basis atoms a_i, y=sum_i x_i a_i = Ax. The problem of finding the minimum L0 norm representation for y is a hard problem. The Basis Pursuit (BP) approach proposes to find the minimum L1 norm representation instead, which corresponds to a linear program (LP) that can be solved using modern LP techniques, and several recent authors have given conditions for the BP (minimum L1 norm) and sparse (minimum L0 solutions) representations to be identical. In this paper, we explore this sparse representation p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0510032","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0510032","created_at":"2026-05-18T01:09:55.920975+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0510032v1","created_at":"2026-05-18T01:09:55.920975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0510032","created_at":"2026-05-18T01:09:55.920975+00:00"},{"alias_kind":"pith_short_12","alias_value":"MG5U65EDICAJ","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"MG5U65EDICAJ32KA","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"MG5U65ED","created_at":"2026-05-18T12:25:53.335082+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/MG5U65EDICAJ32KAJZSEADQRO2","json":"https://pith.science/pith/MG5U65EDICAJ32KAJZSEADQRO2.json","graph_json":"https://pith.science/api/pith-number/MG5U65EDICAJ32KAJZSEADQRO2/graph.json","events_json":"https://pith.science/api/pith-number/MG5U65EDICAJ32KAJZSEADQRO2/events.json","paper":"https://pith.science/paper/MG5U65ED"},"agent_actions":{"view_html":"https://pith.science/pith/MG5U65EDICAJ32KAJZSEADQRO2","download_json":"https://pith.science/pith/MG5U65EDICAJ32KAJZSEADQRO2.json","view_paper":"https://pith.science/paper/MG5U65ED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0510032&json=true","fetch_graph":"https://pith.science/api/pith-number/MG5U65EDICAJ32KAJZSEADQRO2/graph.json","fetch_events":"https://pith.science/api/pith-number/MG5U65EDICAJ32KAJZSEADQRO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MG5U65EDICAJ32KAJZSEADQRO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MG5U65EDICAJ32KAJZSEADQRO2/action/storage_attestation","attest_author":"https://pith.science/pith/MG5U65EDICAJ32KAJZSEADQRO2/action/author_attestation","sign_citation":"https://pith.science/pith/MG5U65EDICAJ32KAJZSEADQRO2/action/citation_signature","submit_replication":"https://pith.science/pith/MG5U65EDICAJ32KAJZSEADQRO2/action/replication_record"}},"created_at":"2026-05-18T01:09:55.920975+00:00","updated_at":"2026-05-18T01:09:55.920975+00:00"}