{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4AI5I7DLJSJX3LPNEPZ63FXXG4","short_pith_number":"pith:4AI5I7DL","schema_version":"1.0","canonical_sha256":"e011d47c6b4c937daded23f3ed96f7373d2f5379b569ad6c72b99057d33ef194","source":{"kind":"arxiv","id":"1304.4344","version":1},"attestation_state":"computed","paper":{"title":"Sparse Coding and Dictionary Learning for Symmetric Positive Definite Matrices: A Kernel Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Brian C. Lovell, Conrad Sanderson, Mehrtash T. Harandi, Richard Hartley","submitted_at":"2013-04-16T06:47:03Z","abstract_excerpt":"Recent advances suggest that a wide range of computer vision problems can be addressed more appropriately by considering non-Euclidean geometry. This paper tackles the problem of sparse coding and dictionary learning in the space of symmetric positive definite matrices, which form a Riemannian manifold. With the aid of the recently introduced Stein kernel (related to a symmetric version of Bregman matrix divergence), we propose to perform sparse coding by embedding Riemannian manifolds into reproducing kernel Hilbert spaces. This leads to a convex and kernel version of the Lasso problem, which"},"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":"1304.4344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-16T06:47:03Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"8950ff30958a4f3bf668d9f664a59aef8de0dd5ae950c76cf5c693a314c381da","abstract_canon_sha256":"7bcb82b15f66454d44833a1267fa8df087e6b3ea13ef1e92b9bc086de80adeba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:53.370489Z","signature_b64":"koelzOdOTaSpnfflNKYrVH+s8P9BNSaeu2ZWbY14kWkaO3841b+hjLFOyPJ6RWMnMjAJJKiVyyJSGj5PbrIxBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e011d47c6b4c937daded23f3ed96f7373d2f5379b569ad6c72b99057d33ef194","last_reissued_at":"2026-05-18T03:27:53.369998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:53.369998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Coding and Dictionary Learning for Symmetric Positive Definite Matrices: A Kernel Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Brian C. Lovell, Conrad Sanderson, Mehrtash T. Harandi, Richard Hartley","submitted_at":"2013-04-16T06:47:03Z","abstract_excerpt":"Recent advances suggest that a wide range of computer vision problems can be addressed more appropriately by considering non-Euclidean geometry. This paper tackles the problem of sparse coding and dictionary learning in the space of symmetric positive definite matrices, which form a Riemannian manifold. With the aid of the recently introduced Stein kernel (related to a symmetric version of Bregman matrix divergence), we propose to perform sparse coding by embedding Riemannian manifolds into reproducing kernel Hilbert spaces. This leads to a convex and kernel version of the Lasso problem, which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4344","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":"1304.4344","created_at":"2026-05-18T03:27:53.370072+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4344v1","created_at":"2026-05-18T03:27:53.370072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4344","created_at":"2026-05-18T03:27:53.370072+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AI5I7DLJSJX","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AI5I7DLJSJX3LPN","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AI5I7DL","created_at":"2026-05-18T12:27:32.513160+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/4AI5I7DLJSJX3LPNEPZ63FXXG4","json":"https://pith.science/pith/4AI5I7DLJSJX3LPNEPZ63FXXG4.json","graph_json":"https://pith.science/api/pith-number/4AI5I7DLJSJX3LPNEPZ63FXXG4/graph.json","events_json":"https://pith.science/api/pith-number/4AI5I7DLJSJX3LPNEPZ63FXXG4/events.json","paper":"https://pith.science/paper/4AI5I7DL"},"agent_actions":{"view_html":"https://pith.science/pith/4AI5I7DLJSJX3LPNEPZ63FXXG4","download_json":"https://pith.science/pith/4AI5I7DLJSJX3LPNEPZ63FXXG4.json","view_paper":"https://pith.science/paper/4AI5I7DL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4344&json=true","fetch_graph":"https://pith.science/api/pith-number/4AI5I7DLJSJX3LPNEPZ63FXXG4/graph.json","fetch_events":"https://pith.science/api/pith-number/4AI5I7DLJSJX3LPNEPZ63FXXG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AI5I7DLJSJX3LPNEPZ63FXXG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AI5I7DLJSJX3LPNEPZ63FXXG4/action/storage_attestation","attest_author":"https://pith.science/pith/4AI5I7DLJSJX3LPNEPZ63FXXG4/action/author_attestation","sign_citation":"https://pith.science/pith/4AI5I7DLJSJX3LPNEPZ63FXXG4/action/citation_signature","submit_replication":"https://pith.science/pith/4AI5I7DLJSJX3LPNEPZ63FXXG4/action/replication_record"}},"created_at":"2026-05-18T03:27:53.370072+00:00","updated_at":"2026-05-18T03:27:53.370072+00:00"}