{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2UZHYRLKAFK5EUG2NA7EBNY3IC","short_pith_number":"pith:2UZHYRLK","schema_version":"1.0","canonical_sha256":"d5327c456a0155d250da683e40b71b40ad60e1325a03a1064684ba7816c12084","source":{"kind":"arxiv","id":"1608.04290","version":1},"attestation_state":"computed","paper":{"title":"Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Bo Yang, Kejun Huang, Nicholas D. Sidiropoulos, Wing-Kin Ma, Xiao Fu","submitted_at":"2016-08-15T14:51:10Z","abstract_excerpt":"This paper considers \\emph{volume minimization} (VolMin)-based structured matrix factorization (SMF). VolMin is a factorization criterion that decomposes a given data matrix into a basis matrix times a structured coefficient matrix via finding the minimum-volume simplex that encloses all the columns of the data matrix. Recent work showed that VolMin guarantees the identifiability of the factor matrices under mild conditions that are realistic in a wide variety of applications. This paper focuses on both theoretical and practical aspects of VolMin. On the theory side, exact equivalence of two i"},"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":"1608.04290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-15T14:51:10Z","cross_cats_sorted":[],"title_canon_sha256":"ee034275e0d1a71af1a21fe51a8451aebb173dc8f3cceec5671d9b796802b4c3","abstract_canon_sha256":"c755822e73390a362eaa3db8c722efe18ae10a450eff8f0843ae80da71347782"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:33.807876Z","signature_b64":"RgKi0RhbF78ZaKxrmfp5M2m6+2lXNSb8ejysIPKdt5RTWR3rt0xfuiO63wJWw/pBURRDT29QmPI8r2LR200LAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5327c456a0155d250da683e40b71b40ad60e1325a03a1064684ba7816c12084","last_reissued_at":"2026-05-18T01:00:33.807287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:33.807287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Bo Yang, Kejun Huang, Nicholas D. Sidiropoulos, Wing-Kin Ma, Xiao Fu","submitted_at":"2016-08-15T14:51:10Z","abstract_excerpt":"This paper considers \\emph{volume minimization} (VolMin)-based structured matrix factorization (SMF). VolMin is a factorization criterion that decomposes a given data matrix into a basis matrix times a structured coefficient matrix via finding the minimum-volume simplex that encloses all the columns of the data matrix. Recent work showed that VolMin guarantees the identifiability of the factor matrices under mild conditions that are realistic in a wide variety of applications. This paper focuses on both theoretical and practical aspects of VolMin. On the theory side, exact equivalence of two i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04290","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":"1608.04290","created_at":"2026-05-18T01:00:33.807377+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04290v1","created_at":"2026-05-18T01:00:33.807377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04290","created_at":"2026-05-18T01:00:33.807377+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UZHYRLKAFK5","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UZHYRLKAFK5EUG2","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UZHYRLK","created_at":"2026-05-18T12:29:55.572404+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/2UZHYRLKAFK5EUG2NA7EBNY3IC","json":"https://pith.science/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC.json","graph_json":"https://pith.science/api/pith-number/2UZHYRLKAFK5EUG2NA7EBNY3IC/graph.json","events_json":"https://pith.science/api/pith-number/2UZHYRLKAFK5EUG2NA7EBNY3IC/events.json","paper":"https://pith.science/paper/2UZHYRLK"},"agent_actions":{"view_html":"https://pith.science/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC","download_json":"https://pith.science/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC.json","view_paper":"https://pith.science/paper/2UZHYRLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04290&json=true","fetch_graph":"https://pith.science/api/pith-number/2UZHYRLKAFK5EUG2NA7EBNY3IC/graph.json","fetch_events":"https://pith.science/api/pith-number/2UZHYRLKAFK5EUG2NA7EBNY3IC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC/action/storage_attestation","attest_author":"https://pith.science/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC/action/author_attestation","sign_citation":"https://pith.science/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC/action/citation_signature","submit_replication":"https://pith.science/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC/action/replication_record"}},"created_at":"2026-05-18T01:00:33.807377+00:00","updated_at":"2026-05-18T01:00:33.807377+00:00"}