{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UY2O42IM4UTF25MZK4ANA52GVJ","short_pith_number":"pith:UY2O42IM","schema_version":"1.0","canonical_sha256":"a634ee690ce5265d75995700d07746aa47b1dcc0b46ba1a292ebc866a3b40d06","source":{"kind":"arxiv","id":"1409.0083","version":1},"attestation_state":"computed","paper":{"title":"Sparse Coding on Symmetric Positive Definite Manifolds using Bregman Divergences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Brian Lovell, Conrad Sanderson, Mehrtash Harandi, Richard Hartley","submitted_at":"2014-08-30T04:46:43Z","abstract_excerpt":"This paper introduces sparse coding and dictionary learning for Symmetric Positive Definite (SPD) matrices, which are often used in machine learning, computer vision and related areas. Unlike traditional sparse coding schemes that work in vector spaces, in this paper we discuss how SPD matrices can be described by sparse combination of dictionary atoms, where the atoms are also SPD matrices. We propose to seek sparse coding by embedding the space of SPD matrices into Hilbert spaces through two types of Bregman matrix divergences. This not only leads to an efficient way of performing sparse cod"},"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":"1409.0083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-30T04:46:43Z","cross_cats_sorted":[],"title_canon_sha256":"d4e0fae2fbc54c4daa1ddb013879bfcc5dde57a6cea1611a8af122b89d89ecff","abstract_canon_sha256":"888a8984f444dec77ce7438933ac11cdc7873d23a5a8996858d323f08fab4095"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:53.417099Z","signature_b64":"EfOYLdZPBjIsbQ3IeUd2fl1rRni4iPzf3sXneNem3tJcpnyRWBBDz6d2WIr562BB6SM0VxMG/+4+FpnCT3bFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a634ee690ce5265d75995700d07746aa47b1dcc0b46ba1a292ebc866a3b40d06","last_reissued_at":"2026-05-18T02:43:53.416740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:53.416740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Coding on Symmetric Positive Definite Manifolds using Bregman Divergences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Brian Lovell, Conrad Sanderson, Mehrtash Harandi, Richard Hartley","submitted_at":"2014-08-30T04:46:43Z","abstract_excerpt":"This paper introduces sparse coding and dictionary learning for Symmetric Positive Definite (SPD) matrices, which are often used in machine learning, computer vision and related areas. Unlike traditional sparse coding schemes that work in vector spaces, in this paper we discuss how SPD matrices can be described by sparse combination of dictionary atoms, where the atoms are also SPD matrices. We propose to seek sparse coding by embedding the space of SPD matrices into Hilbert spaces through two types of Bregman matrix divergences. This not only leads to an efficient way of performing sparse cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0083","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":"1409.0083","created_at":"2026-05-18T02:43:53.416790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0083v1","created_at":"2026-05-18T02:43:53.416790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0083","created_at":"2026-05-18T02:43:53.416790+00:00"},{"alias_kind":"pith_short_12","alias_value":"UY2O42IM4UTF","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UY2O42IM4UTF25MZ","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UY2O42IM","created_at":"2026-05-18T12:28:52.271510+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/UY2O42IM4UTF25MZK4ANA52GVJ","json":"https://pith.science/pith/UY2O42IM4UTF25MZK4ANA52GVJ.json","graph_json":"https://pith.science/api/pith-number/UY2O42IM4UTF25MZK4ANA52GVJ/graph.json","events_json":"https://pith.science/api/pith-number/UY2O42IM4UTF25MZK4ANA52GVJ/events.json","paper":"https://pith.science/paper/UY2O42IM"},"agent_actions":{"view_html":"https://pith.science/pith/UY2O42IM4UTF25MZK4ANA52GVJ","download_json":"https://pith.science/pith/UY2O42IM4UTF25MZK4ANA52GVJ.json","view_paper":"https://pith.science/paper/UY2O42IM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0083&json=true","fetch_graph":"https://pith.science/api/pith-number/UY2O42IM4UTF25MZK4ANA52GVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/UY2O42IM4UTF25MZK4ANA52GVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UY2O42IM4UTF25MZK4ANA52GVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UY2O42IM4UTF25MZK4ANA52GVJ/action/storage_attestation","attest_author":"https://pith.science/pith/UY2O42IM4UTF25MZK4ANA52GVJ/action/author_attestation","sign_citation":"https://pith.science/pith/UY2O42IM4UTF25MZK4ANA52GVJ/action/citation_signature","submit_replication":"https://pith.science/pith/UY2O42IM4UTF25MZK4ANA52GVJ/action/replication_record"}},"created_at":"2026-05-18T02:43:53.416790+00:00","updated_at":"2026-05-18T02:43:53.416790+00:00"}