{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2YXSYW3HE3UK2ULFBUIMKN5KTU","short_pith_number":"pith:2YXSYW3H","canonical_record":{"source":{"id":"1512.06730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-21T17:53:35Z","cross_cats_sorted":["cs.CV","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"b0ffe0afd571512555c063cde0d282717ba53f729e36f789203092ae57e8b6b2","abstract_canon_sha256":"da9748fb8adede41cb0597dd8b0bd7aec6c5db044c2ef321f4c41264e5817fb5"},"schema_version":"1.0"},"canonical_sha256":"d62f2c5b6726e8ad51650d10c537aa9d32d7ff4b5ca15eafbfa462b6b8fa01d3","source":{"kind":"arxiv","id":"1512.06730","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06730","created_at":"2026-05-18T01:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06730v1","created_at":"2026-05-18T01:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06730","created_at":"2026-05-18T01:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"2YXSYW3HE3UK","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2YXSYW3HE3UK2ULF","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2YXSYW3H","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2YXSYW3HE3UK2ULFBUIMKN5KTU","target":"record","payload":{"canonical_record":{"source":{"id":"1512.06730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-21T17:53:35Z","cross_cats_sorted":["cs.CV","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"b0ffe0afd571512555c063cde0d282717ba53f729e36f789203092ae57e8b6b2","abstract_canon_sha256":"da9748fb8adede41cb0597dd8b0bd7aec6c5db044c2ef321f4c41264e5817fb5"},"schema_version":"1.0"},"canonical_sha256":"d62f2c5b6726e8ad51650d10c537aa9d32d7ff4b5ca15eafbfa462b6b8fa01d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:59.814171Z","signature_b64":"2dEVp8CM4nkpXDsmsD1zedC5oQo+6OlTjLL3B/c6GNyYkJFYSUjwAsDhSWRfIY9KUUbZW/X06OT+VlBbXaNIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d62f2c5b6726e8ad51650d10c537aa9d32d7ff4b5ca15eafbfa462b6b8fa01d3","last_reissued_at":"2026-05-18T01:23:59.813660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:59.813660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.06730","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:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Li7HG3KenG8PiU3zwlewnZjZBptRUofs8Qpsx+lnsj+ldPoXjiFGweOZTqUhLJXY+v3s5N4MpysV5sd4penfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:16:53.393578Z"},"content_sha256":"7bbf26e3d21faae8ab279a1d495df3ee1df0a3f5597057ae5ea685db8c0ebde8","schema_version":"1.0","event_id":"sha256:7bbf26e3d21faae8ab279a1d495df3ee1df0a3f5597057ae5ea685db8c0ebde8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2YXSYW3HE3UK2ULFBUIMKN5KTU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multilinear Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Eric Kernfeld, Misha Kilmer, Nathan Majumder, Shuchin Aeron","submitted_at":"2015-12-21T17:53:35Z","abstract_excerpt":"In this paper we present a new model and an algorithm for unsupervised clustering of 2-D data such as images. We assume that the data comes from a union of multilinear subspaces (UOMS) model, which is a specific structured case of the much studied union of subspaces (UOS) model. For segmentation under this model, we develop Multilinear Subspace Clustering (MSC) algorithm and evaluate its performance on the YaleB and Olivietti image data sets. We show that MSC is highly competitive with existing algorithms employing the UOS model in terms of clustering performance while enjoying improvement in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06730","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:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gj3h/Zx13sXSZI1XXCoJzHE7gSvmvt8RP7J90Rfnf+SH+O2IS+QIMm0NToJEAEdbrMqKiVEMtPBvHNk0PCyICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:16:53.394226Z"},"content_sha256":"5f3960fa9252ac20eb7131ab87e222898e42955329f26987c1634ff1d6244e71","schema_version":"1.0","event_id":"sha256:5f3960fa9252ac20eb7131ab87e222898e42955329f26987c1634ff1d6244e71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YXSYW3HE3UK2ULFBUIMKN5KTU/bundle.json","state_url":"https://pith.science/pith/2YXSYW3HE3UK2ULFBUIMKN5KTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YXSYW3HE3UK2ULFBUIMKN5KTU/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-08T03:16:53Z","links":{"resolver":"https://pith.science/pith/2YXSYW3HE3UK2ULFBUIMKN5KTU","bundle":"https://pith.science/pith/2YXSYW3HE3UK2ULFBUIMKN5KTU/bundle.json","state":"https://pith.science/pith/2YXSYW3HE3UK2ULFBUIMKN5KTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YXSYW3HE3UK2ULFBUIMKN5KTU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2YXSYW3HE3UK2ULFBUIMKN5KTU","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":"da9748fb8adede41cb0597dd8b0bd7aec6c5db044c2ef321f4c41264e5817fb5","cross_cats_sorted":["cs.CV","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-21T17:53:35Z","title_canon_sha256":"b0ffe0afd571512555c063cde0d282717ba53f729e36f789203092ae57e8b6b2"},"schema_version":"1.0","source":{"id":"1512.06730","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06730","created_at":"2026-05-18T01:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06730v1","created_at":"2026-05-18T01:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06730","created_at":"2026-05-18T01:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"2YXSYW3HE3UK","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2YXSYW3HE3UK2ULF","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2YXSYW3H","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:5f3960fa9252ac20eb7131ab87e222898e42955329f26987c1634ff1d6244e71","target":"graph","created_at":"2026-05-18T01:23:59Z","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":"In this paper we present a new model and an algorithm for unsupervised clustering of 2-D data such as images. We assume that the data comes from a union of multilinear subspaces (UOMS) model, which is a specific structured case of the much studied union of subspaces (UOS) model. For segmentation under this model, we develop Multilinear Subspace Clustering (MSC) algorithm and evaluate its performance on the YaleB and Olivietti image data sets. We show that MSC is highly competitive with existing algorithms employing the UOS model in terms of clustering performance while enjoying improvement in ","authors_text":"Eric Kernfeld, Misha Kilmer, Nathan Majumder, Shuchin Aeron","cross_cats":["cs.CV","cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-21T17:53:35Z","title":"Multilinear Subspace Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06730","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:7bbf26e3d21faae8ab279a1d495df3ee1df0a3f5597057ae5ea685db8c0ebde8","target":"record","created_at":"2026-05-18T01:23:59Z","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":"da9748fb8adede41cb0597dd8b0bd7aec6c5db044c2ef321f4c41264e5817fb5","cross_cats_sorted":["cs.CV","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-21T17:53:35Z","title_canon_sha256":"b0ffe0afd571512555c063cde0d282717ba53f729e36f789203092ae57e8b6b2"},"schema_version":"1.0","source":{"id":"1512.06730","kind":"arxiv","version":1}},"canonical_sha256":"d62f2c5b6726e8ad51650d10c537aa9d32d7ff4b5ca15eafbfa462b6b8fa01d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d62f2c5b6726e8ad51650d10c537aa9d32d7ff4b5ca15eafbfa462b6b8fa01d3","first_computed_at":"2026-05-18T01:23:59.813660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:59.813660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2dEVp8CM4nkpXDsmsD1zedC5oQo+6OlTjLL3B/c6GNyYkJFYSUjwAsDhSWRfIY9KUUbZW/X06OT+VlBbXaNIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:59.814171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06730","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bbf26e3d21faae8ab279a1d495df3ee1df0a3f5597057ae5ea685db8c0ebde8","sha256:5f3960fa9252ac20eb7131ab87e222898e42955329f26987c1634ff1d6244e71"],"state_sha256":"c380e16b9b6607d31f4edfef5d3fc100882bb8bce962a24192bdcc9fb039da29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fag18VLI+xiA7jQeXcFhVGDTNF98Sy4juGYBgm+ErGHomJZB6HorWpiOK6s/+7Y1OB9Qbaj2PlZ8h7OYGfA/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:16:53.397914Z","bundle_sha256":"e187a00f15c17df3d36b3feff70204c9368368b192c945d7dec20368700f401c"}}