{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VOE7P6U7WBUM7XPHKL2SPBUUER","short_pith_number":"pith:VOE7P6U7","canonical_record":{"source":{"id":"1009.3802","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-09-20T12:54:12Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"dbed6e82706c6dc9a3e96641738b67986ce77374f10366eb17340a8e7a1dbfa6","abstract_canon_sha256":"8d1f34c5f3042ca587ec872286ceec738dc93a8092b3633e7652c8c50bbd3e4d"},"schema_version":"1.0"},"canonical_sha256":"ab89f7fa9fb068cfdde752f5278694244dbf35034f17a4937452b4cce65b2004","source":{"kind":"arxiv","id":"1009.3802","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3802","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3802v3","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3802","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"VOE7P6U7WBUM","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VOE7P6U7WBUM7XPH","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VOE7P6U7","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VOE7P6U7WBUM7XPHKL2SPBUUER","target":"record","payload":{"canonical_record":{"source":{"id":"1009.3802","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-09-20T12:54:12Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"dbed6e82706c6dc9a3e96641738b67986ce77374f10366eb17340a8e7a1dbfa6","abstract_canon_sha256":"8d1f34c5f3042ca587ec872286ceec738dc93a8092b3633e7652c8c50bbd3e4d"},"schema_version":"1.0"},"canonical_sha256":"ab89f7fa9fb068cfdde752f5278694244dbf35034f17a4937452b4cce65b2004","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:40.306839Z","signature_b64":"dyaLka5YmTvpM5ehQrBFjdDWzOufUdGVLI2vcfOrHCbkLlkefl7Uk03wwM1BzfJ7BWiirn9omwnj/NNT5AUKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab89f7fa9fb068cfdde752f5278694244dbf35034f17a4937452b4cce65b2004","last_reissued_at":"2026-05-18T04:39:40.306251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:40.306251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.3802","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-18T04:39:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q8C+STI38mMVs/W1tAC9wmuOXfG77xHifaw3xAnDvfnu73ouJ7OtXRsjz807N1cmeIzf+MWx4lCHhdIEAdYsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:14:32.360645Z"},"content_sha256":"1de864a7c35ea6340f676db8ac27613f4e1e9ae33486e71120c77edcada9bd5a","schema_version":"1.0","event_id":"sha256:1de864a7c35ea6340f676db8ac27613f4e1e9ae33486e71120c77edcada9bd5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VOE7P6U7WBUM7XPHKL2SPBUUER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Low-Rank Subspace Segmentation with Semidefinite Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.CV","authors_text":"Ju Sun, Loong-Fah Cheong, Shuicheng Yan, Xiaotong Yuan, Yuzhao Ni","submitted_at":"2010-09-20T12:54:12Z","abstract_excerpt":"Recently there is a line of research work proposing to employ Spectral Clustering (SC) to segment (group){Throughout the paper, we use segmentation, clustering, and grouping, and their verb forms, interchangeably.} high-dimensional structural data such as those (approximately) lying on subspaces {We follow {liu2010robust} and use the term \"subspace\" to denote both linear subspaces and affine subspaces. There is a trivial conversion between linear subspaces and affine subspaces as mentioned therein.} or low-dimensional manifolds. By learning the affinity matrix in the form of sparse reconstruct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3802","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-18T04:39:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QApuNBQTD48GeSBYRjt9dtAVcKFABTa5I50Ec5YuKJjbPUn4/0gxo8ckQhxd/5w5rKDBzA3ICxA1DkQualq5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:14:32.361047Z"},"content_sha256":"89464d62811a053afd25847ad20c64df95c3d444fee6981a528151400386a730","schema_version":"1.0","event_id":"sha256:89464d62811a053afd25847ad20c64df95c3d444fee6981a528151400386a730"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VOE7P6U7WBUM7XPHKL2SPBUUER/bundle.json","state_url":"https://pith.science/pith/VOE7P6U7WBUM7XPHKL2SPBUUER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VOE7P6U7WBUM7XPHKL2SPBUUER/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-10T05:14:32Z","links":{"resolver":"https://pith.science/pith/VOE7P6U7WBUM7XPHKL2SPBUUER","bundle":"https://pith.science/pith/VOE7P6U7WBUM7XPHKL2SPBUUER/bundle.json","state":"https://pith.science/pith/VOE7P6U7WBUM7XPHKL2SPBUUER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VOE7P6U7WBUM7XPHKL2SPBUUER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VOE7P6U7WBUM7XPHKL2SPBUUER","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":"8d1f34c5f3042ca587ec872286ceec738dc93a8092b3633e7652c8c50bbd3e4d","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-09-20T12:54:12Z","title_canon_sha256":"dbed6e82706c6dc9a3e96641738b67986ce77374f10366eb17340a8e7a1dbfa6"},"schema_version":"1.0","source":{"id":"1009.3802","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3802","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3802v3","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3802","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"VOE7P6U7WBUM","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VOE7P6U7WBUM7XPH","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VOE7P6U7","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:89464d62811a053afd25847ad20c64df95c3d444fee6981a528151400386a730","target":"graph","created_at":"2026-05-18T04:39:40Z","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":"Recently there is a line of research work proposing to employ Spectral Clustering (SC) to segment (group){Throughout the paper, we use segmentation, clustering, and grouping, and their verb forms, interchangeably.} high-dimensional structural data such as those (approximately) lying on subspaces {We follow {liu2010robust} and use the term \"subspace\" to denote both linear subspaces and affine subspaces. There is a trivial conversion between linear subspaces and affine subspaces as mentioned therein.} or low-dimensional manifolds. By learning the affinity matrix in the form of sparse reconstruct","authors_text":"Ju Sun, Loong-Fah Cheong, Shuicheng Yan, Xiaotong Yuan, Yuzhao Ni","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-09-20T12:54:12Z","title":"Robust Low-Rank Subspace Segmentation with Semidefinite Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3802","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:1de864a7c35ea6340f676db8ac27613f4e1e9ae33486e71120c77edcada9bd5a","target":"record","created_at":"2026-05-18T04:39:40Z","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":"8d1f34c5f3042ca587ec872286ceec738dc93a8092b3633e7652c8c50bbd3e4d","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-09-20T12:54:12Z","title_canon_sha256":"dbed6e82706c6dc9a3e96641738b67986ce77374f10366eb17340a8e7a1dbfa6"},"schema_version":"1.0","source":{"id":"1009.3802","kind":"arxiv","version":3}},"canonical_sha256":"ab89f7fa9fb068cfdde752f5278694244dbf35034f17a4937452b4cce65b2004","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab89f7fa9fb068cfdde752f5278694244dbf35034f17a4937452b4cce65b2004","first_computed_at":"2026-05-18T04:39:40.306251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:40.306251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dyaLka5YmTvpM5ehQrBFjdDWzOufUdGVLI2vcfOrHCbkLlkefl7Uk03wwM1BzfJ7BWiirn9omwnj/NNT5AUKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:40.306839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3802","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1de864a7c35ea6340f676db8ac27613f4e1e9ae33486e71120c77edcada9bd5a","sha256:89464d62811a053afd25847ad20c64df95c3d444fee6981a528151400386a730"],"state_sha256":"6c810e5b3b10733c75a07966fb929c4c983b39728b1cc86b6917c0f5bddf0e63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BVK8ShoM8XS49opDZdZIx3uSGz1dcLCg3oed1GORwdW7f6kU/t1XOASznGHvbXtLY9m5pdp75VjmUp7O6+7aDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:14:32.365453Z","bundle_sha256":"0d4572b016b4ffc9fedc4b9999ff8a77f89cbb01cda1e0dfab335c0e8a4172d3"}}