{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:T2HZKPJZHAUJESYRGC63TOUATT","short_pith_number":"pith:T2HZKPJZ","schema_version":"1.0","canonical_sha256":"9e8f953d393828924b1130bdb9ba809cf9355726bcf8fb78cbc2204822a95d88","source":{"kind":"arxiv","id":"2110.12786","version":2},"attestation_state":"computed","paper":{"title":"Dictionary Learning Using Rank-One Atomic Decomposition (ROAD)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Cheng cheng, Wei Dai","submitted_at":"2021-10-25T10:29:52Z","abstract_excerpt":"Dictionary learning aims at seeking a dictionary under which the training data can be sparsely represented. Methods in the literature typically formulate the dictionary learning problem as an optimization w.r.t. two variables, i.e., dictionary and sparse coefficients, and solve it by alternating between two stages: sparse coding and dictionary update. The key contribution of this work is a Rank-One Atomic Decomposition (ROAD) formulation where dictionary learning is cast as an optimization w.r.t. a single variable which is a set of rank one matrices. The resulting algorithm is hence single-sta"},"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":"2110.12786","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-10-25T10:29:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"37fc7a824d4072d00359cb160f538af233f3b076c21286a17affb67b66ea21d9","abstract_canon_sha256":"4299361b3b0044e8231dad9470b86a0ef452b452fc7140d0f46eebb47100c7db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:25:35.562406Z","signature_b64":"zRQPMM5sZWkbmmMyR1H7oVwmuDsCY55dP5dVtzHKxcDKARnVePMmR3itSOdoEtRUx9lR0/aMwwaRUkxrCWrFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e8f953d393828924b1130bdb9ba809cf9355726bcf8fb78cbc2204822a95d88","last_reissued_at":"2026-07-05T03:25:35.562019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:25:35.562019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dictionary Learning Using Rank-One Atomic Decomposition (ROAD)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Cheng cheng, Wei Dai","submitted_at":"2021-10-25T10:29:52Z","abstract_excerpt":"Dictionary learning aims at seeking a dictionary under which the training data can be sparsely represented. Methods in the literature typically formulate the dictionary learning problem as an optimization w.r.t. two variables, i.e., dictionary and sparse coefficients, and solve it by alternating between two stages: sparse coding and dictionary update. The key contribution of this work is a Rank-One Atomic Decomposition (ROAD) formulation where dictionary learning is cast as an optimization w.r.t. a single variable which is a set of rank one matrices. The resulting algorithm is hence single-sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.12786","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.12786/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2110.12786","created_at":"2026-07-05T03:25:35.562085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.12786v2","created_at":"2026-07-05T03:25:35.562085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.12786","created_at":"2026-07-05T03:25:35.562085+00:00"},{"alias_kind":"pith_short_12","alias_value":"T2HZKPJZHAUJ","created_at":"2026-07-05T03:25:35.562085+00:00"},{"alias_kind":"pith_short_16","alias_value":"T2HZKPJZHAUJESYR","created_at":"2026-07-05T03:25:35.562085+00:00"},{"alias_kind":"pith_short_8","alias_value":"T2HZKPJZ","created_at":"2026-07-05T03:25:35.562085+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/T2HZKPJZHAUJESYRGC63TOUATT","json":"https://pith.science/pith/T2HZKPJZHAUJESYRGC63TOUATT.json","graph_json":"https://pith.science/api/pith-number/T2HZKPJZHAUJESYRGC63TOUATT/graph.json","events_json":"https://pith.science/api/pith-number/T2HZKPJZHAUJESYRGC63TOUATT/events.json","paper":"https://pith.science/paper/T2HZKPJZ"},"agent_actions":{"view_html":"https://pith.science/pith/T2HZKPJZHAUJESYRGC63TOUATT","download_json":"https://pith.science/pith/T2HZKPJZHAUJESYRGC63TOUATT.json","view_paper":"https://pith.science/paper/T2HZKPJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.12786&json=true","fetch_graph":"https://pith.science/api/pith-number/T2HZKPJZHAUJESYRGC63TOUATT/graph.json","fetch_events":"https://pith.science/api/pith-number/T2HZKPJZHAUJESYRGC63TOUATT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T2HZKPJZHAUJESYRGC63TOUATT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T2HZKPJZHAUJESYRGC63TOUATT/action/storage_attestation","attest_author":"https://pith.science/pith/T2HZKPJZHAUJESYRGC63TOUATT/action/author_attestation","sign_citation":"https://pith.science/pith/T2HZKPJZHAUJESYRGC63TOUATT/action/citation_signature","submit_replication":"https://pith.science/pith/T2HZKPJZHAUJESYRGC63TOUATT/action/replication_record"}},"created_at":"2026-07-05T03:25:35.562085+00:00","updated_at":"2026-07-05T03:25:35.562085+00:00"}