{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S5M4Y2DQ2OEBBKMFOMOMZUFEVG","short_pith_number":"pith:S5M4Y2DQ","canonical_record":{"source":{"id":"1509.02649","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-09T06:35:12Z","cross_cats_sorted":[],"title_canon_sha256":"ef34c424edadb0c217f68ed7729084a1f270258d9a5452b7c58ce390b9dd2c59","abstract_canon_sha256":"7c7c4f99f2d568b935cffb54e2d3a5e6fdd70c30a1c8574f4730bec42d328e86"},"schema_version":"1.0"},"canonical_sha256":"9759cc6870d38810a985731cccd0a4a9817b699abdcec1514590a9c806557fab","source":{"kind":"arxiv","id":"1509.02649","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02649","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02649v2","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02649","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"S5M4Y2DQ2OEB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S5M4Y2DQ2OEBBKMF","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S5M4Y2DQ","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S5M4Y2DQ2OEBBKMFOMOMZUFEVG","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02649","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-09T06:35:12Z","cross_cats_sorted":[],"title_canon_sha256":"ef34c424edadb0c217f68ed7729084a1f270258d9a5452b7c58ce390b9dd2c59","abstract_canon_sha256":"7c7c4f99f2d568b935cffb54e2d3a5e6fdd70c30a1c8574f4730bec42d328e86"},"schema_version":"1.0"},"canonical_sha256":"9759cc6870d38810a985731cccd0a4a9817b699abdcec1514590a9c806557fab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:59.365670Z","signature_b64":"HjcCqtuaZB8MuRbLm3EPhU/yZRdlr7Pr9uth5XmeNMjrAOaQ0p5r38kXCF1yAHq6K/rwOg7nSiq9ihNUuNr/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9759cc6870d38810a985731cccd0a4a9817b699abdcec1514590a9c806557fab","last_reissued_at":"2026-05-18T01:02:59.365197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:59.365197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02649","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:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X2BbX/k7En/t3mhRlVbrE5eA7OM9GdxBSNd3PB8GHm0v2sns418v/0fvSjZvEgikSV5aVupiqt1VopbWZKIlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:01:04.343787Z"},"content_sha256":"7907d98a57210b1e26f41f8ce780735609f4d59fa2aed91fdbee0e4282bff323","schema_version":"1.0","event_id":"sha256:7907d98a57210b1e26f41f8ce780735609f4d59fa2aed91fdbee0e4282bff323"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S5M4Y2DQ2OEBBKMFOMOMZUFEVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shape Interaction Matrix Revisited and Robustified: Efficient Subspace Clustering with Corrupted and Incomplete Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hongdong Li, Mathieu Salzmann, Pan Ji","submitted_at":"2015-09-09T06:35:12Z","abstract_excerpt":"The Shape Interaction Matrix (SIM) is one of the earliest approaches to performing subspace clustering (i.e., separating points drawn from a union of subspaces). In this paper, we revisit the SIM and reveal its connections to several recent subspace clustering methods. Our analysis lets us derive a simple, yet effective algorithm to robustify the SIM and make it applicable to realistic scenarios where the data is corrupted by noise. We justify our method by intuitive examples and the matrix perturbation theory. We then show how this approach can be extended to handle missing data, thus yieldin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02649","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:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eQxmEYIZ3WNmrZHqOM9Vyh5wjVs0NFpKGyJEn6XoQSrWUD956tVJBMu9OLatcQPysIzIml+lG8p83Ta1OBxXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:01:04.344457Z"},"content_sha256":"c90a26c7246a68e6b10d3cbb71398127606866fd874919ff2704dae358f70ac9","schema_version":"1.0","event_id":"sha256:c90a26c7246a68e6b10d3cbb71398127606866fd874919ff2704dae358f70ac9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5M4Y2DQ2OEBBKMFOMOMZUFEVG/bundle.json","state_url":"https://pith.science/pith/S5M4Y2DQ2OEBBKMFOMOMZUFEVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5M4Y2DQ2OEBBKMFOMOMZUFEVG/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-05-30T09:01:04Z","links":{"resolver":"https://pith.science/pith/S5M4Y2DQ2OEBBKMFOMOMZUFEVG","bundle":"https://pith.science/pith/S5M4Y2DQ2OEBBKMFOMOMZUFEVG/bundle.json","state":"https://pith.science/pith/S5M4Y2DQ2OEBBKMFOMOMZUFEVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5M4Y2DQ2OEBBKMFOMOMZUFEVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S5M4Y2DQ2OEBBKMFOMOMZUFEVG","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":"7c7c4f99f2d568b935cffb54e2d3a5e6fdd70c30a1c8574f4730bec42d328e86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-09T06:35:12Z","title_canon_sha256":"ef34c424edadb0c217f68ed7729084a1f270258d9a5452b7c58ce390b9dd2c59"},"schema_version":"1.0","source":{"id":"1509.02649","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02649","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02649v2","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02649","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"S5M4Y2DQ2OEB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S5M4Y2DQ2OEBBKMF","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S5M4Y2DQ","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:c90a26c7246a68e6b10d3cbb71398127606866fd874919ff2704dae358f70ac9","target":"graph","created_at":"2026-05-18T01:02: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":"The Shape Interaction Matrix (SIM) is one of the earliest approaches to performing subspace clustering (i.e., separating points drawn from a union of subspaces). In this paper, we revisit the SIM and reveal its connections to several recent subspace clustering methods. Our analysis lets us derive a simple, yet effective algorithm to robustify the SIM and make it applicable to realistic scenarios where the data is corrupted by noise. We justify our method by intuitive examples and the matrix perturbation theory. We then show how this approach can be extended to handle missing data, thus yieldin","authors_text":"Hongdong Li, Mathieu Salzmann, Pan Ji","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-09T06:35:12Z","title":"Shape Interaction Matrix Revisited and Robustified: Efficient Subspace Clustering with Corrupted and Incomplete Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02649","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:7907d98a57210b1e26f41f8ce780735609f4d59fa2aed91fdbee0e4282bff323","target":"record","created_at":"2026-05-18T01:02: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":"7c7c4f99f2d568b935cffb54e2d3a5e6fdd70c30a1c8574f4730bec42d328e86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-09T06:35:12Z","title_canon_sha256":"ef34c424edadb0c217f68ed7729084a1f270258d9a5452b7c58ce390b9dd2c59"},"schema_version":"1.0","source":{"id":"1509.02649","kind":"arxiv","version":2}},"canonical_sha256":"9759cc6870d38810a985731cccd0a4a9817b699abdcec1514590a9c806557fab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9759cc6870d38810a985731cccd0a4a9817b699abdcec1514590a9c806557fab","first_computed_at":"2026-05-18T01:02:59.365197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:59.365197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HjcCqtuaZB8MuRbLm3EPhU/yZRdlr7Pr9uth5XmeNMjrAOaQ0p5r38kXCF1yAHq6K/rwOg7nSiq9ihNUuNr/CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:59.365670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02649","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7907d98a57210b1e26f41f8ce780735609f4d59fa2aed91fdbee0e4282bff323","sha256:c90a26c7246a68e6b10d3cbb71398127606866fd874919ff2704dae358f70ac9"],"state_sha256":"9e822c7b885520d15d985feca9253468c52b4c22384d31eb99c0518fb8d73563"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dJq64dgXiSBEFPvku1M6kRXE4wKUh39O7MnTWq0k+QCgquKebjmJ9wf2B5xQ13pZ07pUfLvESwainPP7UqgUAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:01:04.347694Z","bundle_sha256":"cb7749ae9ea6c59c311adcb9e16abfbec3373a412f922d78ed25b437c9b17f01"}}