{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2UZHYRLKAFK5EUG2NA7EBNY3IC","short_pith_number":"pith:2UZHYRLK","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"},"canonical_sha256":"d5327c456a0155d250da683e40b71b40ad60e1325a03a1064684ba7816c12084","source":{"kind":"arxiv","id":"1608.04290","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04290","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04290v1","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04290","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"2UZHYRLKAFK5","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2UZHYRLKAFK5EUG2","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2UZHYRLK","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2UZHYRLKAFK5EUG2NA7EBNY3IC","target":"record","payload":{"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"},"canonical_sha256":"d5327c456a0155d250da683e40b71b40ad60e1325a03a1064684ba7816c12084","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"},"source_kind":"arxiv","source_id":"1608.04290","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wjm5flZ0vL5qonT2qf86kwhndRwBcpGA4pGRzSvatVZYMo0eFi4pLErqGO4vjQ9qZRcnVsjg6eFLyoFJvgSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:53:06.205835Z"},"content_sha256":"116286926f35c9f4719d57faff131b0c0cb2db1c487718ab89208056d8564764","schema_version":"1.0","event_id":"sha256:116286926f35c9f4719d57faff131b0c0cb2db1c487718ab89208056d8564764"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2UZHYRLKAFK5EUG2NA7EBNY3IC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tadV3L59qds/d3ck655CTkUClg60EtEU+potcQ9zk6npJkjKqWq4JKrD9i8S6/fExa5mLgh3tXsrB+3b4pPgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:53:06.206556Z"},"content_sha256":"621c168731171a145f92bbfeaf1fd9c278354f1c02ca5f1e709fb91ddb20a9b9","schema_version":"1.0","event_id":"sha256:621c168731171a145f92bbfeaf1fd9c278354f1c02ca5f1e709fb91ddb20a9b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC/bundle.json","state_url":"https://pith.science/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T17:53:06Z","links":{"resolver":"https://pith.science/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC","bundle":"https://pith.science/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC/bundle.json","state":"https://pith.science/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UZHYRLKAFK5EUG2NA7EBNY3IC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2UZHYRLKAFK5EUG2NA7EBNY3IC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c755822e73390a362eaa3db8c722efe18ae10a450eff8f0843ae80da71347782","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-15T14:51:10Z","title_canon_sha256":"ee034275e0d1a71af1a21fe51a8451aebb173dc8f3cceec5671d9b796802b4c3"},"schema_version":"1.0","source":{"id":"1608.04290","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04290","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04290v1","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04290","created_at":"2026-05-18T01:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"2UZHYRLKAFK5","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2UZHYRLKAFK5EUG2","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2UZHYRLK","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:621c168731171a145f92bbfeaf1fd9c278354f1c02ca5f1e709fb91ddb20a9b9","target":"graph","created_at":"2026-05-18T01:00:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bo Yang, Kejun Huang, Nicholas D. Sidiropoulos, Wing-Kin Ma, Xiao Fu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-15T14:51:10Z","title":"Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04290","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:116286926f35c9f4719d57faff131b0c0cb2db1c487718ab89208056d8564764","target":"record","created_at":"2026-05-18T01:00:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c755822e73390a362eaa3db8c722efe18ae10a450eff8f0843ae80da71347782","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-15T14:51:10Z","title_canon_sha256":"ee034275e0d1a71af1a21fe51a8451aebb173dc8f3cceec5671d9b796802b4c3"},"schema_version":"1.0","source":{"id":"1608.04290","kind":"arxiv","version":1}},"canonical_sha256":"d5327c456a0155d250da683e40b71b40ad60e1325a03a1064684ba7816c12084","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5327c456a0155d250da683e40b71b40ad60e1325a03a1064684ba7816c12084","first_computed_at":"2026-05-18T01:00:33.807287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:33.807287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RgKi0RhbF78ZaKxrmfp5M2m6+2lXNSb8ejysIPKdt5RTWR3rt0xfuiO63wJWw/pBURRDT29QmPI8r2LR200LAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:33.807876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04290","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:116286926f35c9f4719d57faff131b0c0cb2db1c487718ab89208056d8564764","sha256:621c168731171a145f92bbfeaf1fd9c278354f1c02ca5f1e709fb91ddb20a9b9"],"state_sha256":"1a45a8bf2f920099c17cef36685b7fd642be1c80980815fa18057a7403289a56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GwjleQJGDDPK0HW+K0YWKbARyTFxKIv7aZ+sh4v6cTswFOVILfh8VZlOYRAX95/D1WdYIqamlliZ3WoOT+ZNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:53:06.210170Z","bundle_sha256":"17181dfa3c15913fa31a8c3e3a70cc738505eeedb97c7718014c11112461fb7c"}}