{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GWZQULWTZOQYPLMKQKAGXYMDIW","short_pith_number":"pith:GWZQULWT","canonical_record":{"source":{"id":"1805.09243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T15:58:34Z","cross_cats_sorted":[],"title_canon_sha256":"d5dde928fe53306160834b0935d4908dd4efd8aa15e9dfb90a9e54ac5931c6dc","abstract_canon_sha256":"524f9e957ec1e425d749cd17a91169e057b37f7ed23ebd0755e5ac6088604b6f"},"schema_version":"1.0"},"canonical_sha256":"35b30a2ed3cba187ad8a82806be18345a541067cc896893e3ee1e708e82126af","source":{"kind":"arxiv","id":"1805.09243","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09243","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09243v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09243","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"GWZQULWTZOQY","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GWZQULWTZOQYPLMK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GWZQULWT","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GWZQULWTZOQYPLMKQKAGXYMDIW","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T15:58:34Z","cross_cats_sorted":[],"title_canon_sha256":"d5dde928fe53306160834b0935d4908dd4efd8aa15e9dfb90a9e54ac5931c6dc","abstract_canon_sha256":"524f9e957ec1e425d749cd17a91169e057b37f7ed23ebd0755e5ac6088604b6f"},"schema_version":"1.0"},"canonical_sha256":"35b30a2ed3cba187ad8a82806be18345a541067cc896893e3ee1e708e82126af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:08.172236Z","signature_b64":"+TBJvFQS9XFMajH9/GR/q/ldpW3Tdj1n0Z8tL4hXh1Xus8ibfgYlVFNAMWuXLp7psSudxbMcz+GaF2ioN+7RDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35b30a2ed3cba187ad8a82806be18345a541067cc896893e3ee1e708e82126af","last_reissued_at":"2026-05-18T00:15:08.171796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:08.171796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09243","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:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBfgphiQpYvNprwH3+u3xRqG6BLCqK1+P6vKuz4CgADsFWCt+2qSC1w3kwGidQoQF0a1YxN9OFNwOeqEHahqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:04:34.949021Z"},"content_sha256":"559f4a94c38588d8ecb8b03be75386a523cac9688578b0e89fab3b4e43a0117f","schema_version":"1.0","event_id":"sha256:559f4a94c38588d8ecb8b03be75386a523cac9688578b0e89fab3b4e43a0117f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GWZQULWTZOQYPLMKQKAGXYMDIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subspace Clustering by Block Diagonal Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Canyi Lu, Jiashi Feng, Shuicheng Yan, Tao Mei, Zhouchen Lin","submitted_at":"2018-05-23T15:58:34Z","abstract_excerpt":"This paper studies the subspace clustering problem. Given some data points approximately drawn from a union of subspaces, the goal is to group these data points into their underlying subspaces. Many subspace clustering methods have been proposed and among which sparse subspace clustering and low-rank representation are two representative ones. Despite the different motivations, we observe that many existing methods own the common block diagonal property, which possibly leads to correct clustering, yet with their proofs given case by case. In this work, we consider a general formulation and pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09243","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:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3NdxCRXH00yHkdeHukBu87XVqg04iGVz/p3E5wHOY/tMA6mAqduEBywX1p70eR1LDRPkZ+HOEIMyhfzIQInnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:04:34.949770Z"},"content_sha256":"ab597edaaa2bc86f9d58c06c4121cf95de83913092ed67b6b2a47c22194a5046","schema_version":"1.0","event_id":"sha256:ab597edaaa2bc86f9d58c06c4121cf95de83913092ed67b6b2a47c22194a5046"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWZQULWTZOQYPLMKQKAGXYMDIW/bundle.json","state_url":"https://pith.science/pith/GWZQULWTZOQYPLMKQKAGXYMDIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWZQULWTZOQYPLMKQKAGXYMDIW/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-09T03:04:34Z","links":{"resolver":"https://pith.science/pith/GWZQULWTZOQYPLMKQKAGXYMDIW","bundle":"https://pith.science/pith/GWZQULWTZOQYPLMKQKAGXYMDIW/bundle.json","state":"https://pith.science/pith/GWZQULWTZOQYPLMKQKAGXYMDIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWZQULWTZOQYPLMKQKAGXYMDIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GWZQULWTZOQYPLMKQKAGXYMDIW","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":"524f9e957ec1e425d749cd17a91169e057b37f7ed23ebd0755e5ac6088604b6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T15:58:34Z","title_canon_sha256":"d5dde928fe53306160834b0935d4908dd4efd8aa15e9dfb90a9e54ac5931c6dc"},"schema_version":"1.0","source":{"id":"1805.09243","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09243","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09243v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09243","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"GWZQULWTZOQY","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GWZQULWTZOQYPLMK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GWZQULWT","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:ab597edaaa2bc86f9d58c06c4121cf95de83913092ed67b6b2a47c22194a5046","target":"graph","created_at":"2026-05-18T00:15:08Z","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":"This paper studies the subspace clustering problem. Given some data points approximately drawn from a union of subspaces, the goal is to group these data points into their underlying subspaces. Many subspace clustering methods have been proposed and among which sparse subspace clustering and low-rank representation are two representative ones. Despite the different motivations, we observe that many existing methods own the common block diagonal property, which possibly leads to correct clustering, yet with their proofs given case by case. In this work, we consider a general formulation and pro","authors_text":"Canyi Lu, Jiashi Feng, Shuicheng Yan, Tao Mei, Zhouchen Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T15:58:34Z","title":"Subspace Clustering by Block Diagonal Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09243","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:559f4a94c38588d8ecb8b03be75386a523cac9688578b0e89fab3b4e43a0117f","target":"record","created_at":"2026-05-18T00:15:08Z","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":"524f9e957ec1e425d749cd17a91169e057b37f7ed23ebd0755e5ac6088604b6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T15:58:34Z","title_canon_sha256":"d5dde928fe53306160834b0935d4908dd4efd8aa15e9dfb90a9e54ac5931c6dc"},"schema_version":"1.0","source":{"id":"1805.09243","kind":"arxiv","version":1}},"canonical_sha256":"35b30a2ed3cba187ad8a82806be18345a541067cc896893e3ee1e708e82126af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35b30a2ed3cba187ad8a82806be18345a541067cc896893e3ee1e708e82126af","first_computed_at":"2026-05-18T00:15:08.171796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:08.171796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+TBJvFQS9XFMajH9/GR/q/ldpW3Tdj1n0Z8tL4hXh1Xus8ibfgYlVFNAMWuXLp7psSudxbMcz+GaF2ioN+7RDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:08.172236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09243","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:559f4a94c38588d8ecb8b03be75386a523cac9688578b0e89fab3b4e43a0117f","sha256:ab597edaaa2bc86f9d58c06c4121cf95de83913092ed67b6b2a47c22194a5046"],"state_sha256":"a8d14c1c796c7195f8db95da4c1a329c28e9b335d657f8a24791c81db624bce7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOAcEqgxp2HYhI4oSSOm/4Tp49Rl4w13dij/GLHcwhjG3OoquumEYRtuGkTr40/i36EPNubklP5BqZA2avNcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:04:34.954001Z","bundle_sha256":"25fd7b434ff44df834cc7c803d7413baaa89f36cb1be3a18217c8b8df1e9fc47"}}