{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XKDQCBRX3P4YA36LC6SDGGLPQW","short_pith_number":"pith:XKDQCBRX","schema_version":"1.0","canonical_sha256":"ba87010637dbf9806fcb17a433196f8588926951e594c6bb44c8400a2a24e1ee","source":{"kind":"arxiv","id":"1911.08975","version":1},"attestation_state":"computed","paper":{"title":"Dictionary Learning Using Rank-One Projection (ROP)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Cheng cheng, Wei Dai","submitted_at":"2019-11-20T15:41:35Z","abstract_excerpt":"Dictionary learning aims to find a dictionary that can sparsely represent the training data. Methods in the literature typically formulate the dictionary learning problem as an optimisation with respect to 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 Projection (ROP) formulation where dictionary learning is cast as an optimisation with respect to a single variable which is a set of rank one matrices. The resulting algorithm is hence single staged. An "},"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":"1911.08975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-11-20T15:41:35Z","cross_cats_sorted":[],"title_canon_sha256":"8f0635146f177c38fd907af0b898ab203b8e751afb59c208507349a613d44599","abstract_canon_sha256":"8434bf08d97ae12270eb601359b4fe845bba9dc818d979fb27f096f89523969c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:48.447433Z","signature_b64":"qMMKI8ucsuzUGPdu1SmflcYdXwLHgcvdkMxqaZGVVVjdGFf7DlzZN4i6xgiTwiJ4tS9Wcjks5L16B8v3Npo4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba87010637dbf9806fcb17a433196f8588926951e594c6bb44c8400a2a24e1ee","last_reissued_at":"2026-07-05T00:20:48.447015Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:48.447015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dictionary Learning Using Rank-One Projection (ROP)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Cheng cheng, Wei Dai","submitted_at":"2019-11-20T15:41:35Z","abstract_excerpt":"Dictionary learning aims to find a dictionary that can sparsely represent the training data. Methods in the literature typically formulate the dictionary learning problem as an optimisation with respect to 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 Projection (ROP) formulation where dictionary learning is cast as an optimisation with respect to a single variable which is a set of rank one matrices. The resulting algorithm is hence single staged. An "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08975","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.08975/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":"1911.08975","created_at":"2026-07-05T00:20:48.447081+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.08975v1","created_at":"2026-07-05T00:20:48.447081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08975","created_at":"2026-07-05T00:20:48.447081+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKDQCBRX3P4Y","created_at":"2026-07-05T00:20:48.447081+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKDQCBRX3P4YA36L","created_at":"2026-07-05T00:20:48.447081+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKDQCBRX","created_at":"2026-07-05T00:20:48.447081+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/XKDQCBRX3P4YA36LC6SDGGLPQW","json":"https://pith.science/pith/XKDQCBRX3P4YA36LC6SDGGLPQW.json","graph_json":"https://pith.science/api/pith-number/XKDQCBRX3P4YA36LC6SDGGLPQW/graph.json","events_json":"https://pith.science/api/pith-number/XKDQCBRX3P4YA36LC6SDGGLPQW/events.json","paper":"https://pith.science/paper/XKDQCBRX"},"agent_actions":{"view_html":"https://pith.science/pith/XKDQCBRX3P4YA36LC6SDGGLPQW","download_json":"https://pith.science/pith/XKDQCBRX3P4YA36LC6SDGGLPQW.json","view_paper":"https://pith.science/paper/XKDQCBRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.08975&json=true","fetch_graph":"https://pith.science/api/pith-number/XKDQCBRX3P4YA36LC6SDGGLPQW/graph.json","fetch_events":"https://pith.science/api/pith-number/XKDQCBRX3P4YA36LC6SDGGLPQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKDQCBRX3P4YA36LC6SDGGLPQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKDQCBRX3P4YA36LC6SDGGLPQW/action/storage_attestation","attest_author":"https://pith.science/pith/XKDQCBRX3P4YA36LC6SDGGLPQW/action/author_attestation","sign_citation":"https://pith.science/pith/XKDQCBRX3P4YA36LC6SDGGLPQW/action/citation_signature","submit_replication":"https://pith.science/pith/XKDQCBRX3P4YA36LC6SDGGLPQW/action/replication_record"}},"created_at":"2026-07-05T00:20:48.447081+00:00","updated_at":"2026-07-05T00:20:48.447081+00:00"}