{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MSXUDWCL42I5OGXY5E3QLYTF25","short_pith_number":"pith:MSXUDWCL","canonical_record":{"source":{"id":"1507.07105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-25T14:49:01Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"9959b82a258da759a90ca4ae5aa042832a76586f2994e2fcc7a6b42666157b2f","abstract_canon_sha256":"34648a84cd386a39d8e752ef8291af720a9beaf9dbb5b47334848069aff45932"},"schema_version":"1.0"},"canonical_sha256":"64af41d84be691d71af8e93705e265d74b18faa0421eb29b9e9c2017628adaed","source":{"kind":"arxiv","id":"1507.07105","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07105","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07105v2","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07105","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"pith_short_12","alias_value":"MSXUDWCL42I5","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MSXUDWCL42I5OGXY","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MSXUDWCL","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MSXUDWCL42I5OGXY5E3QLYTF25","target":"record","payload":{"canonical_record":{"source":{"id":"1507.07105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-25T14:49:01Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"9959b82a258da759a90ca4ae5aa042832a76586f2994e2fcc7a6b42666157b2f","abstract_canon_sha256":"34648a84cd386a39d8e752ef8291af720a9beaf9dbb5b47334848069aff45932"},"schema_version":"1.0"},"canonical_sha256":"64af41d84be691d71af8e93705e265d74b18faa0421eb29b9e9c2017628adaed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:24.630931Z","signature_b64":"eEdl5HufRzvrnD8q92OaFGTzhLQunHBco7xNcj/Bu/w4aRC2V0pdTbLBe+8n9Yf2GMwxsuBrw+vusdFX22MTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64af41d84be691d71af8e93705e265d74b18faa0421eb29b9e9c2017628adaed","last_reissued_at":"2026-05-18T01:24:24.630403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:24.630403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.07105","source_version":2,"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:24:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2sQh3kctKPjl+3NK0E6ShRG/jqk/tJRsJMStxXfeMqgdWgM5DQmNrL6N+dA0QLE2eteDNANz7HqDhcgr57jMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:03:45.774074Z"},"content_sha256":"745e8ed3b48b965cd10fe924ca420a513c6ef6b62b94baca943c0e088dc153a0","schema_version":"1.0","event_id":"sha256:745e8ed3b48b965cd10fe924ca420a513c6ef6b62b94baca943c0e088dc153a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MSXUDWCL42I5OGXY5E3QLYTF25","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dimensionality-reduced subspace clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Helmut B\\\"olcskei, Michael Tschannen, Reinhard Heckel","submitted_at":"2015-07-25T14:49:01Z","abstract_excerpt":"Subspace clustering refers to the problem of clustering unlabeled high-dimensional data points into a union of low-dimensional linear subspaces, whose number, orientations, and dimensions are all unknown. In practice one may have access to dimensionality-reduced observations of the data only, resulting, e.g., from undersampling due to complexity and speed constraints on the acquisition device or mechanism. More pertinently, even if the high-dimensional data set is available it is often desirable to first project the data points into a lower-dimensional space and to perform clustering there; th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07105","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"},"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:24:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0pYvBcl9GZ3OB7UysUM+xwnqGMlVFwNbZ854UK4AIbEOXSKnJGMIMqnRI/oggoyyx7Sd3cjvZk1zqe5SCY5KCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:03:45.774751Z"},"content_sha256":"70b708c5df35b437f2adf5910f6736a3dcc2f27bebb3ca07b0a60cf19e3a9488","schema_version":"1.0","event_id":"sha256:70b708c5df35b437f2adf5910f6736a3dcc2f27bebb3ca07b0a60cf19e3a9488"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSXUDWCL42I5OGXY5E3QLYTF25/bundle.json","state_url":"https://pith.science/pith/MSXUDWCL42I5OGXY5E3QLYTF25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSXUDWCL42I5OGXY5E3QLYTF25/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-09T06:03:45Z","links":{"resolver":"https://pith.science/pith/MSXUDWCL42I5OGXY5E3QLYTF25","bundle":"https://pith.science/pith/MSXUDWCL42I5OGXY5E3QLYTF25/bundle.json","state":"https://pith.science/pith/MSXUDWCL42I5OGXY5E3QLYTF25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSXUDWCL42I5OGXY5E3QLYTF25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MSXUDWCL42I5OGXY5E3QLYTF25","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":"34648a84cd386a39d8e752ef8291af720a9beaf9dbb5b47334848069aff45932","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-25T14:49:01Z","title_canon_sha256":"9959b82a258da759a90ca4ae5aa042832a76586f2994e2fcc7a6b42666157b2f"},"schema_version":"1.0","source":{"id":"1507.07105","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07105","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07105v2","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07105","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"pith_short_12","alias_value":"MSXUDWCL42I5","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MSXUDWCL42I5OGXY","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MSXUDWCL","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:70b708c5df35b437f2adf5910f6736a3dcc2f27bebb3ca07b0a60cf19e3a9488","target":"graph","created_at":"2026-05-18T01:24:24Z","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":"Subspace clustering refers to the problem of clustering unlabeled high-dimensional data points into a union of low-dimensional linear subspaces, whose number, orientations, and dimensions are all unknown. In practice one may have access to dimensionality-reduced observations of the data only, resulting, e.g., from undersampling due to complexity and speed constraints on the acquisition device or mechanism. More pertinently, even if the high-dimensional data set is available it is often desirable to first project the data points into a lower-dimensional space and to perform clustering there; th","authors_text":"Helmut B\\\"olcskei, Michael Tschannen, Reinhard Heckel","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-25T14:49:01Z","title":"Dimensionality-reduced subspace clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07105","kind":"arxiv","version":2},"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:745e8ed3b48b965cd10fe924ca420a513c6ef6b62b94baca943c0e088dc153a0","target":"record","created_at":"2026-05-18T01:24:24Z","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":"34648a84cd386a39d8e752ef8291af720a9beaf9dbb5b47334848069aff45932","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-25T14:49:01Z","title_canon_sha256":"9959b82a258da759a90ca4ae5aa042832a76586f2994e2fcc7a6b42666157b2f"},"schema_version":"1.0","source":{"id":"1507.07105","kind":"arxiv","version":2}},"canonical_sha256":"64af41d84be691d71af8e93705e265d74b18faa0421eb29b9e9c2017628adaed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64af41d84be691d71af8e93705e265d74b18faa0421eb29b9e9c2017628adaed","first_computed_at":"2026-05-18T01:24:24.630403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:24.630403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eEdl5HufRzvrnD8q92OaFGTzhLQunHBco7xNcj/Bu/w4aRC2V0pdTbLBe+8n9Yf2GMwxsuBrw+vusdFX22MTAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:24.630931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07105","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:745e8ed3b48b965cd10fe924ca420a513c6ef6b62b94baca943c0e088dc153a0","sha256:70b708c5df35b437f2adf5910f6736a3dcc2f27bebb3ca07b0a60cf19e3a9488"],"state_sha256":"8caa15d95add3a5b8d33ff893b9d81ef2c57be8b930bad2a10a8dac96b199988"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+Ro/Rv85rRZWpJH21qDdhnl99EtBmKGpm/4aLmTGBlAVgtD3DbgaiwCYNkYrgVPbuhY3xLZkJqXZUfWa2c8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:03:45.778777Z","bundle_sha256":"77d30d9cb67c00c1f19a400460ff08ae0e095558f8d324b533bb19ab344c15b3"}}