{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3B4Y2LIKBOAZGJPCRIUCX4L5LW","short_pith_number":"pith:3B4Y2LIK","schema_version":"1.0","canonical_sha256":"d8798d2d0a0b819325e28a282bf17d5d8529fcf31d50a7ab1cc32e7333cfbfd6","source":{"kind":"arxiv","id":"1801.06432","version":2},"attestation_state":"computed","paper":{"title":"Robust Kronecker Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Mehdi Bahri, Stefanos Zafeiriou, Yannis Panagakis","submitted_at":"2018-01-18T18:01:50Z","abstract_excerpt":"Dictionary learning and component analysis models are fundamental for learning compact representations that are relevant to a given task (feature extraction, dimensionality reduction, denoising, etc.). The model complexity is encoded by means of specific structure, such as sparsity, low-rankness, or nonnegativity. Unfortunately, approaches like K-SVD - that learn dictionaries for sparse coding via Singular Value Decomposition (SVD) - are hard to scale to high-volume and high-dimensional visual data, and fragile in the presence of outliers. Conversely, robust component analysis methods such as "},"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":"1801.06432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-18T18:01:50Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"ba72aba2b675f68c300691fb22c96f6238205f52326a12812adcc011cbfbcd17","abstract_canon_sha256":"f7d24b1f7b64c898b169ce87c727981c7911086c5a7ae11498712060d1eb4448"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:09.908672Z","signature_b64":"2NesECcXC5vaHvnOg+6GgEN1M21bXSCvBuK/NCb5FtDaz3H7R6bJdqexAyAfRmUsFplXM7gIinDMevSmIWuhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8798d2d0a0b819325e28a282bf17d5d8529fcf31d50a7ab1cc32e7333cfbfd6","last_reissued_at":"2026-05-18T00:01:09.907997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:09.907997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Kronecker Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Mehdi Bahri, Stefanos Zafeiriou, Yannis Panagakis","submitted_at":"2018-01-18T18:01:50Z","abstract_excerpt":"Dictionary learning and component analysis models are fundamental for learning compact representations that are relevant to a given task (feature extraction, dimensionality reduction, denoising, etc.). The model complexity is encoded by means of specific structure, such as sparsity, low-rankness, or nonnegativity. Unfortunately, approaches like K-SVD - that learn dictionaries for sparse coding via Singular Value Decomposition (SVD) - are hard to scale to high-volume and high-dimensional visual data, and fragile in the presence of outliers. Conversely, robust component analysis methods such as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06432","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":""},"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":"1801.06432","created_at":"2026-05-18T00:01:09.908086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.06432v2","created_at":"2026-05-18T00:01:09.908086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06432","created_at":"2026-05-18T00:01:09.908086+00:00"},{"alias_kind":"pith_short_12","alias_value":"3B4Y2LIKBOAZ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3B4Y2LIKBOAZGJPC","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3B4Y2LIK","created_at":"2026-05-18T12:32:02.567920+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/3B4Y2LIKBOAZGJPCRIUCX4L5LW","json":"https://pith.science/pith/3B4Y2LIKBOAZGJPCRIUCX4L5LW.json","graph_json":"https://pith.science/api/pith-number/3B4Y2LIKBOAZGJPCRIUCX4L5LW/graph.json","events_json":"https://pith.science/api/pith-number/3B4Y2LIKBOAZGJPCRIUCX4L5LW/events.json","paper":"https://pith.science/paper/3B4Y2LIK"},"agent_actions":{"view_html":"https://pith.science/pith/3B4Y2LIKBOAZGJPCRIUCX4L5LW","download_json":"https://pith.science/pith/3B4Y2LIKBOAZGJPCRIUCX4L5LW.json","view_paper":"https://pith.science/paper/3B4Y2LIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.06432&json=true","fetch_graph":"https://pith.science/api/pith-number/3B4Y2LIKBOAZGJPCRIUCX4L5LW/graph.json","fetch_events":"https://pith.science/api/pith-number/3B4Y2LIKBOAZGJPCRIUCX4L5LW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3B4Y2LIKBOAZGJPCRIUCX4L5LW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3B4Y2LIKBOAZGJPCRIUCX4L5LW/action/storage_attestation","attest_author":"https://pith.science/pith/3B4Y2LIKBOAZGJPCRIUCX4L5LW/action/author_attestation","sign_citation":"https://pith.science/pith/3B4Y2LIKBOAZGJPCRIUCX4L5LW/action/citation_signature","submit_replication":"https://pith.science/pith/3B4Y2LIKBOAZGJPCRIUCX4L5LW/action/replication_record"}},"created_at":"2026-05-18T00:01:09.908086+00:00","updated_at":"2026-05-18T00:01:09.908086+00:00"}