{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IYVWILX2OYJLBCTGYBL2W55MJX","short_pith_number":"pith:IYVWILX2","schema_version":"1.0","canonical_sha256":"462b642efa7612b08a66c057ab77ac4dc61576a64c1dcd1a2b2027eef31ea24f","source":{"kind":"arxiv","id":"1510.02189","version":2},"attestation_state":"computed","paper":{"title":"Sparse approximation based on a random overcomplete basis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"primary_cat":"cs.IT","authors_text":"Masato Okada, Tomoyuki Obuchi, Yoshinori Nakanishi-Ohno, Yoshiyuki Kabashima","submitted_at":"2015-10-08T03:09:13Z","abstract_excerpt":"We discuss a strategy of sparse approximation that is based on the use of an overcomplete basis, and evaluate its performance when a random matrix is used as this basis. A small combination of basis vectors is chosen from a given overcomplete basis, according to a given compression rate, such that they compactly represent the target data with as small a distortion as possible. As a selection method, we study the $\\ell_0$- and $\\ell_1$-based methods, which employ the exhaustive search and $\\ell_1$-norm regularization techniques, respectively. The performance is assessed in terms of the trade-of"},"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":"1510.02189","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-08T03:09:13Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"title_canon_sha256":"04e887579510bf9a10cb59715e117f72400811ae815a28c31175b072587623ee","abstract_canon_sha256":"238f3f8dcb22ad7acc9382a62f8c5ad9c6bc07182825899cf312779ac445fe9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:46.640368Z","signature_b64":"sq1EY7kwZLrELkrwo3z7rNVy1WBYKOO13BoY6Vu7L6vYQOihNcbiwfMoLqUVJY107zA0bDNklulC7ZORVjJZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"462b642efa7612b08a66c057ab77ac4dc61576a64c1dcd1a2b2027eef31ea24f","last_reissued_at":"2026-05-18T01:11:46.639986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:46.639986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse approximation based on a random overcomplete basis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"primary_cat":"cs.IT","authors_text":"Masato Okada, Tomoyuki Obuchi, Yoshinori Nakanishi-Ohno, Yoshiyuki Kabashima","submitted_at":"2015-10-08T03:09:13Z","abstract_excerpt":"We discuss a strategy of sparse approximation that is based on the use of an overcomplete basis, and evaluate its performance when a random matrix is used as this basis. A small combination of basis vectors is chosen from a given overcomplete basis, according to a given compression rate, such that they compactly represent the target data with as small a distortion as possible. As a selection method, we study the $\\ell_0$- and $\\ell_1$-based methods, which employ the exhaustive search and $\\ell_1$-norm regularization techniques, respectively. The performance is assessed in terms of the trade-of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02189","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":"1510.02189","created_at":"2026-05-18T01:11:46.640049+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02189v2","created_at":"2026-05-18T01:11:46.640049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02189","created_at":"2026-05-18T01:11:46.640049+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYVWILX2OYJL","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYVWILX2OYJLBCTG","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYVWILX2","created_at":"2026-05-18T12:29:27.538025+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/IYVWILX2OYJLBCTGYBL2W55MJX","json":"https://pith.science/pith/IYVWILX2OYJLBCTGYBL2W55MJX.json","graph_json":"https://pith.science/api/pith-number/IYVWILX2OYJLBCTGYBL2W55MJX/graph.json","events_json":"https://pith.science/api/pith-number/IYVWILX2OYJLBCTGYBL2W55MJX/events.json","paper":"https://pith.science/paper/IYVWILX2"},"agent_actions":{"view_html":"https://pith.science/pith/IYVWILX2OYJLBCTGYBL2W55MJX","download_json":"https://pith.science/pith/IYVWILX2OYJLBCTGYBL2W55MJX.json","view_paper":"https://pith.science/paper/IYVWILX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02189&json=true","fetch_graph":"https://pith.science/api/pith-number/IYVWILX2OYJLBCTGYBL2W55MJX/graph.json","fetch_events":"https://pith.science/api/pith-number/IYVWILX2OYJLBCTGYBL2W55MJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYVWILX2OYJLBCTGYBL2W55MJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYVWILX2OYJLBCTGYBL2W55MJX/action/storage_attestation","attest_author":"https://pith.science/pith/IYVWILX2OYJLBCTGYBL2W55MJX/action/author_attestation","sign_citation":"https://pith.science/pith/IYVWILX2OYJLBCTGYBL2W55MJX/action/citation_signature","submit_replication":"https://pith.science/pith/IYVWILX2OYJLBCTGYBL2W55MJX/action/replication_record"}},"created_at":"2026-05-18T01:11:46.640049+00:00","updated_at":"2026-05-18T01:11:46.640049+00:00"}