{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:W2NNZHZ2BTCIV2K7CGIYL6WVPP","short_pith_number":"pith:W2NNZHZ2","canonical_record":{"source":{"id":"1808.09574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-08-28T23:03:55Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"21775969b6df56319df1842e2aadaa96021fdf87312a4af2574144a212b06027","abstract_canon_sha256":"ceb9c26cf36934ae076870842da91ab7a9ae26a7d4f5e81a69e90efca4f09cc3"},"schema_version":"1.0"},"canonical_sha256":"b69adc9f3a0cc48ae95f119185fad57bfa94bdfb1e9ef9c527c64bfce42b4c22","source":{"kind":"arxiv","id":"1808.09574","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09574","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09574v1","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09574","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"pith_short_12","alias_value":"W2NNZHZ2BTCI","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W2NNZHZ2BTCIV2K7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W2NNZHZ2","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:W2NNZHZ2BTCIV2K7CGIYL6WVPP","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-08-28T23:03:55Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"21775969b6df56319df1842e2aadaa96021fdf87312a4af2574144a212b06027","abstract_canon_sha256":"ceb9c26cf36934ae076870842da91ab7a9ae26a7d4f5e81a69e90efca4f09cc3"},"schema_version":"1.0"},"canonical_sha256":"b69adc9f3a0cc48ae95f119185fad57bfa94bdfb1e9ef9c527c64bfce42b4c22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:55.116122Z","signature_b64":"BdROFHaV/X2b0PWhHu21DOLHDNHFhUQw1CocPvNchRHDxM5q+Rhhct8dW4dVNa2Vw42pVIFQwmvrqdUkvvRDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b69adc9f3a0cc48ae95f119185fad57bfa94bdfb1e9ef9c527c64bfce42b4c22","last_reissued_at":"2026-05-18T00:06:55.115541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:55.115541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09574","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-18T00:06:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9vtfpBv3V/QPwqwz+5oCBZkbdDgDJ8WqsjiaM4lEpZyDCugGi4zxXovZaaTawhNPIws3Dw1idStyBCOcOViMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:37:46.698385Z"},"content_sha256":"6c450bf103fa955b1bc05d88bf2efeeeccc76264badf101b93f472e9d54bd1fb","schema_version":"1.0","event_id":"sha256:6c450bf103fa955b1bc05d88bf2efeeeccc76264badf101b93f472e9d54bd1fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:W2NNZHZ2BTCIV2K7CGIYL6WVPP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Sparse Subspace Clustering Using Delayed Association","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Hassan Foroosh, Marianna Pensky, Maryam Jaberi","submitted_at":"2018-08-28T23:03:55Z","abstract_excerpt":"Discovering and clustering subspaces in high-dimensional data is a fundamental problem of machine learning with a wide range of applications in data mining, computer vision, and pattern recognition. Earlier methods divided the problem into two separate stages of finding the similarity matrix and finding clusters. Similar to some recent works, we integrate these two steps using a joint optimization approach. We make the following contributions: (i) we estimate the reliability of the cluster assignment for each point before assigning a point to a subspace. We group the data points into two group"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09574","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-18T00:06:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vTOZLoh5gMGdYKYOCwrHhjMhJz2/y5rpcvHSOBxbSkp15PMppp20oyBevcLsRMZqJybEaJ2Cqe0IzGkl+vftBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:37:46.698738Z"},"content_sha256":"1195813cb15a47cdde2c18ed96ebbc5baf61171e863add1c164870a840269712","schema_version":"1.0","event_id":"sha256:1195813cb15a47cdde2c18ed96ebbc5baf61171e863add1c164870a840269712"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W2NNZHZ2BTCIV2K7CGIYL6WVPP/bundle.json","state_url":"https://pith.science/pith/W2NNZHZ2BTCIV2K7CGIYL6WVPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W2NNZHZ2BTCIV2K7CGIYL6WVPP/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-03T20:37:46Z","links":{"resolver":"https://pith.science/pith/W2NNZHZ2BTCIV2K7CGIYL6WVPP","bundle":"https://pith.science/pith/W2NNZHZ2BTCIV2K7CGIYL6WVPP/bundle.json","state":"https://pith.science/pith/W2NNZHZ2BTCIV2K7CGIYL6WVPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W2NNZHZ2BTCIV2K7CGIYL6WVPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:W2NNZHZ2BTCIV2K7CGIYL6WVPP","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":"ceb9c26cf36934ae076870842da91ab7a9ae26a7d4f5e81a69e90efca4f09cc3","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-08-28T23:03:55Z","title_canon_sha256":"21775969b6df56319df1842e2aadaa96021fdf87312a4af2574144a212b06027"},"schema_version":"1.0","source":{"id":"1808.09574","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09574","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09574v1","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09574","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"pith_short_12","alias_value":"W2NNZHZ2BTCI","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W2NNZHZ2BTCIV2K7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W2NNZHZ2","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:1195813cb15a47cdde2c18ed96ebbc5baf61171e863add1c164870a840269712","target":"graph","created_at":"2026-05-18T00:06:55Z","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":"Discovering and clustering subspaces in high-dimensional data is a fundamental problem of machine learning with a wide range of applications in data mining, computer vision, and pattern recognition. Earlier methods divided the problem into two separate stages of finding the similarity matrix and finding clusters. Similar to some recent works, we integrate these two steps using a joint optimization approach. We make the following contributions: (i) we estimate the reliability of the cluster assignment for each point before assigning a point to a subspace. We group the data points into two group","authors_text":"Hassan Foroosh, Marianna Pensky, Maryam Jaberi","cross_cats":["cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-08-28T23:03:55Z","title":"Probabilistic Sparse Subspace Clustering Using Delayed Association"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09574","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:6c450bf103fa955b1bc05d88bf2efeeeccc76264badf101b93f472e9d54bd1fb","target":"record","created_at":"2026-05-18T00:06:55Z","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":"ceb9c26cf36934ae076870842da91ab7a9ae26a7d4f5e81a69e90efca4f09cc3","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-08-28T23:03:55Z","title_canon_sha256":"21775969b6df56319df1842e2aadaa96021fdf87312a4af2574144a212b06027"},"schema_version":"1.0","source":{"id":"1808.09574","kind":"arxiv","version":1}},"canonical_sha256":"b69adc9f3a0cc48ae95f119185fad57bfa94bdfb1e9ef9c527c64bfce42b4c22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b69adc9f3a0cc48ae95f119185fad57bfa94bdfb1e9ef9c527c64bfce42b4c22","first_computed_at":"2026-05-18T00:06:55.115541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:55.115541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BdROFHaV/X2b0PWhHu21DOLHDNHFhUQw1CocPvNchRHDxM5q+Rhhct8dW4dVNa2Vw42pVIFQwmvrqdUkvvRDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:55.116122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09574","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c450bf103fa955b1bc05d88bf2efeeeccc76264badf101b93f472e9d54bd1fb","sha256:1195813cb15a47cdde2c18ed96ebbc5baf61171e863add1c164870a840269712"],"state_sha256":"fc365f57ff2ef272c2463f41385ee930ac67d6a118b2cd8597097dc28c75afa8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"81nA4l3Yo1B825OeFUhJso3/ALUFNjE9gTv+GZVm5tow2CZjB8YVWiPOz5FaYvTYwCqJKrmwSD8F7D6HbBKMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:37:46.700825Z","bundle_sha256":"43ab0f9e7d36d7c319973b8a7b2704c2b6eedc745476d9e4eeddaf6ba1a01305"}}