{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:THF43SS3K32TPKQBRTW7XNCILK","short_pith_number":"pith:THF43SS3","schema_version":"1.0","canonical_sha256":"99cbcdca5b56f537aa018cedfbb4485abfa1540b6486b459a5050bb25c18e247","source":{"kind":"arxiv","id":"1509.02970","version":1},"attestation_state":"computed","paper":{"title":"Dictionary Learning and Sparse Coding for Third-order Super-symmetric Tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anoop Cherian, Piotr Koniusz","submitted_at":"2015-09-09T22:30:01Z","abstract_excerpt":"Super-symmetric tensors - a higher-order extension of scatter matrices - are becoming increasingly popular in machine learning and computer vision for modelling data statistics, co-occurrences, or even as visual descriptors. However, the size of these tensors are exponential in the data dimensionality, which is a significant concern. In this paper, we study third-order super-symmetric tensor descriptors in the context of dictionary learning and sparse coding. Our goal is to approximate these tensors as sparse conic combinations of atoms from a learned dictionary, where each atom is a symmetric"},"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":"1509.02970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-09T22:30:01Z","cross_cats_sorted":[],"title_canon_sha256":"13def59b7399be51fcaf5beadd07c4f337a0a44d0a94e86e0d3931ac90cff24c","abstract_canon_sha256":"b94dafdd12d4ba341a1fb7244bc6a72c37f1253aa9ba849fee38e3f8c3e11dc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:25.925362Z","signature_b64":"K+NWCWOMRy/mWZDO4LKML8+iiGCli652Ulv9y6gwuo5/pz8KhFtf3u1MdK5Ahhe58KXIib8nvMeGAxfXAnY7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99cbcdca5b56f537aa018cedfbb4485abfa1540b6486b459a5050bb25c18e247","last_reissued_at":"2026-05-18T01:33:25.924569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:25.924569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dictionary Learning and Sparse Coding for Third-order Super-symmetric Tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anoop Cherian, Piotr Koniusz","submitted_at":"2015-09-09T22:30:01Z","abstract_excerpt":"Super-symmetric tensors - a higher-order extension of scatter matrices - are becoming increasingly popular in machine learning and computer vision for modelling data statistics, co-occurrences, or even as visual descriptors. However, the size of these tensors are exponential in the data dimensionality, which is a significant concern. In this paper, we study third-order super-symmetric tensor descriptors in the context of dictionary learning and sparse coding. Our goal is to approximate these tensors as sparse conic combinations of atoms from a learned dictionary, where each atom is a symmetric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02970","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":"1509.02970","created_at":"2026-05-18T01:33:25.924700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02970v1","created_at":"2026-05-18T01:33:25.924700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02970","created_at":"2026-05-18T01:33:25.924700+00:00"},{"alias_kind":"pith_short_12","alias_value":"THF43SS3K32T","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"THF43SS3K32TPKQB","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"THF43SS3","created_at":"2026-05-18T12:29:42.218222+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/THF43SS3K32TPKQBRTW7XNCILK","json":"https://pith.science/pith/THF43SS3K32TPKQBRTW7XNCILK.json","graph_json":"https://pith.science/api/pith-number/THF43SS3K32TPKQBRTW7XNCILK/graph.json","events_json":"https://pith.science/api/pith-number/THF43SS3K32TPKQBRTW7XNCILK/events.json","paper":"https://pith.science/paper/THF43SS3"},"agent_actions":{"view_html":"https://pith.science/pith/THF43SS3K32TPKQBRTW7XNCILK","download_json":"https://pith.science/pith/THF43SS3K32TPKQBRTW7XNCILK.json","view_paper":"https://pith.science/paper/THF43SS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02970&json=true","fetch_graph":"https://pith.science/api/pith-number/THF43SS3K32TPKQBRTW7XNCILK/graph.json","fetch_events":"https://pith.science/api/pith-number/THF43SS3K32TPKQBRTW7XNCILK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THF43SS3K32TPKQBRTW7XNCILK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THF43SS3K32TPKQBRTW7XNCILK/action/storage_attestation","attest_author":"https://pith.science/pith/THF43SS3K32TPKQBRTW7XNCILK/action/author_attestation","sign_citation":"https://pith.science/pith/THF43SS3K32TPKQBRTW7XNCILK/action/citation_signature","submit_replication":"https://pith.science/pith/THF43SS3K32TPKQBRTW7XNCILK/action/replication_record"}},"created_at":"2026-05-18T01:33:25.924700+00:00","updated_at":"2026-05-18T01:33:25.924700+00:00"}