{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FEYUSNG76HDR3V6EPYLKXLTH3J","short_pith_number":"pith:FEYUSNG7","canonical_record":{"source":{"id":"1711.04178","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-11T18:34:34Z","cross_cats_sorted":["cs.CV","math.NA","stat.ML"],"title_canon_sha256":"0366ba59bb663570bbee2e1bfd4cc5956bd145ba06ddec77d9ed1ee436c6a57a","abstract_canon_sha256":"4d88198343aea147584fdd768bb49beeed74893da8c4a6110281786600883029"},"schema_version":"1.0"},"canonical_sha256":"29314934dff1c71dd7c47e16abae67da506c11e0caaa3550958e57b856c7d905","source":{"kind":"arxiv","id":"1711.04178","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04178","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04178v3","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04178","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"FEYUSNG76HDR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FEYUSNG76HDR3V6E","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FEYUSNG7","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FEYUSNG76HDR3V6EPYLKXLTH3J","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04178","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-11T18:34:34Z","cross_cats_sorted":["cs.CV","math.NA","stat.ML"],"title_canon_sha256":"0366ba59bb663570bbee2e1bfd4cc5956bd145ba06ddec77d9ed1ee436c6a57a","abstract_canon_sha256":"4d88198343aea147584fdd768bb49beeed74893da8c4a6110281786600883029"},"schema_version":"1.0"},"canonical_sha256":"29314934dff1c71dd7c47e16abae67da506c11e0caaa3550958e57b856c7d905","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:31.114373Z","signature_b64":"ubVIMcndyj5MIOSoOMQqGnAjtCsjmJuDoRf7nKW/QnwV2aQ0Ubylu1BPa0zV3afvJYQsh1T6JIhslL2o3s77Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29314934dff1c71dd7c47e16abae67da506c11e0caaa3550958e57b856c7d905","last_reissued_at":"2026-05-17T23:58:31.113721Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:31.113721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04178","source_version":3,"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-17T23:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONERLWrg3TCWugMD0Y6LZHwDWktVzj+E24ca88urCEs7iz0ZjSb7qnUChBAWX2nHNebWYp+1VMuT6P+15TwlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:31:26.549550Z"},"content_sha256":"be0ab444f250fb3509f7d9d8cfb375197230355d6f4cf464641a50d4e2738ca0","schema_version":"1.0","event_id":"sha256:be0ab444f250fb3509f7d9d8cfb375197230355d6f4cf464641a50d4e2738ca0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FEYUSNG76HDR3V6EPYLKXLTH3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CUR Decompositions, Similarity Matrices, and Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ahmet Bugra Koku, Akram Aldroubi, Ali Sekmen, Keaton Hamm","submitted_at":"2017-11-11T18:34:34Z","abstract_excerpt":"A general framework for solving the subspace clustering problem using the CUR decomposition is presented. The CUR decomposition provides a natural way to construct similarity matrices for data that come from a union of unknown subspaces $\\mathscr{U}=\\underset{i=1}{\\overset{M}\\bigcup}S_i$. The similarity matrices thus constructed give the exact clustering in the noise-free case. Additionally, this decomposition gives rise to many distinct similarity matrices from a given set of data, which allow enough flexibility to perform accurate clustering of noisy data. We also show that two known methods"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04178","kind":"arxiv","version":3},"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-17T23:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1T560GljsOvMweCJc6pqcljmZ/OF0P+K05Cpt0xMgD9v3WYeyNlesBKU7u76jm7EVlQlux5PJjBdMv7kg+aYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:31:26.549901Z"},"content_sha256":"8691690e38edba511152c0f6c7dffcc61ed00d9fb40c0b575e03e780bf8ab1a2","schema_version":"1.0","event_id":"sha256:8691690e38edba511152c0f6c7dffcc61ed00d9fb40c0b575e03e780bf8ab1a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEYUSNG76HDR3V6EPYLKXLTH3J/bundle.json","state_url":"https://pith.science/pith/FEYUSNG76HDR3V6EPYLKXLTH3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEYUSNG76HDR3V6EPYLKXLTH3J/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-01T04:31:26Z","links":{"resolver":"https://pith.science/pith/FEYUSNG76HDR3V6EPYLKXLTH3J","bundle":"https://pith.science/pith/FEYUSNG76HDR3V6EPYLKXLTH3J/bundle.json","state":"https://pith.science/pith/FEYUSNG76HDR3V6EPYLKXLTH3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEYUSNG76HDR3V6EPYLKXLTH3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FEYUSNG76HDR3V6EPYLKXLTH3J","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":"4d88198343aea147584fdd768bb49beeed74893da8c4a6110281786600883029","cross_cats_sorted":["cs.CV","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-11T18:34:34Z","title_canon_sha256":"0366ba59bb663570bbee2e1bfd4cc5956bd145ba06ddec77d9ed1ee436c6a57a"},"schema_version":"1.0","source":{"id":"1711.04178","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04178","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04178v3","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04178","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"FEYUSNG76HDR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FEYUSNG76HDR3V6E","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FEYUSNG7","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:8691690e38edba511152c0f6c7dffcc61ed00d9fb40c0b575e03e780bf8ab1a2","target":"graph","created_at":"2026-05-17T23:58:31Z","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":"A general framework for solving the subspace clustering problem using the CUR decomposition is presented. The CUR decomposition provides a natural way to construct similarity matrices for data that come from a union of unknown subspaces $\\mathscr{U}=\\underset{i=1}{\\overset{M}\\bigcup}S_i$. The similarity matrices thus constructed give the exact clustering in the noise-free case. Additionally, this decomposition gives rise to many distinct similarity matrices from a given set of data, which allow enough flexibility to perform accurate clustering of noisy data. We also show that two known methods","authors_text":"Ahmet Bugra Koku, Akram Aldroubi, Ali Sekmen, Keaton Hamm","cross_cats":["cs.CV","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-11T18:34:34Z","title":"CUR Decompositions, Similarity Matrices, and Subspace Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04178","kind":"arxiv","version":3},"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:be0ab444f250fb3509f7d9d8cfb375197230355d6f4cf464641a50d4e2738ca0","target":"record","created_at":"2026-05-17T23:58:31Z","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":"4d88198343aea147584fdd768bb49beeed74893da8c4a6110281786600883029","cross_cats_sorted":["cs.CV","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-11T18:34:34Z","title_canon_sha256":"0366ba59bb663570bbee2e1bfd4cc5956bd145ba06ddec77d9ed1ee436c6a57a"},"schema_version":"1.0","source":{"id":"1711.04178","kind":"arxiv","version":3}},"canonical_sha256":"29314934dff1c71dd7c47e16abae67da506c11e0caaa3550958e57b856c7d905","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29314934dff1c71dd7c47e16abae67da506c11e0caaa3550958e57b856c7d905","first_computed_at":"2026-05-17T23:58:31.113721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:31.113721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ubVIMcndyj5MIOSoOMQqGnAjtCsjmJuDoRf7nKW/QnwV2aQ0Ubylu1BPa0zV3afvJYQsh1T6JIhslL2o3s77Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:31.114373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04178","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be0ab444f250fb3509f7d9d8cfb375197230355d6f4cf464641a50d4e2738ca0","sha256:8691690e38edba511152c0f6c7dffcc61ed00d9fb40c0b575e03e780bf8ab1a2"],"state_sha256":"5693ab1b513436f25bc27b5063a8c7afa809a7196db66cb2fec025fcd8d5a99a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pusf6C7TtwxALv95lgWfIpQ29I3YSj6679e1bO07yHF/cEeHKfTvnEYeLTgkOEC5thY+Fi8hoWrNAPjypDLgCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:31:26.551952Z","bundle_sha256":"bbc892ea1033baefa87b7fb1e9dd22782094795ab1ca5c34bf20e4b0498a2623"}}