{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AJVM2WCZYLZS3RMRX7W42XS4BL","short_pith_number":"pith:AJVM2WCZ","canonical_record":{"source":{"id":"1203.2210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-09T23:35:52Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"b8dc3fd37149dc6fafd5632a2e91000d0d3e2b3d52c4f317bb58ad30c6c87063","abstract_canon_sha256":"e43d31e06a499b52f13b64fadaae91c6fb5e337417db569fc4e11eead0aa6d4b"},"schema_version":"1.0"},"canonical_sha256":"026acd5859c2f32dc591bfedcd5e5c0af02aa71a80978f349cc8640ccb6884d7","source":{"kind":"arxiv","id":"1203.2210","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2210","created_at":"2026-05-18T03:57:40Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2210v2","created_at":"2026-05-18T03:57:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2210","created_at":"2026-05-18T03:57:40Z"},{"alias_kind":"pith_short_12","alias_value":"AJVM2WCZYLZS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AJVM2WCZYLZS3RMR","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AJVM2WCZ","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AJVM2WCZYLZS3RMRX7W42XS4BL","target":"record","payload":{"canonical_record":{"source":{"id":"1203.2210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-09T23:35:52Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"b8dc3fd37149dc6fafd5632a2e91000d0d3e2b3d52c4f317bb58ad30c6c87063","abstract_canon_sha256":"e43d31e06a499b52f13b64fadaae91c6fb5e337417db569fc4e11eead0aa6d4b"},"schema_version":"1.0"},"canonical_sha256":"026acd5859c2f32dc591bfedcd5e5c0af02aa71a80978f349cc8640ccb6884d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:40.176101Z","signature_b64":"0VboBowdr/TyohyYnedvm1eTQAw6WhSIJiUx4U22fTSXcw0PY7ZqFu5SygvM/9qQrorbwuT1BAzHrgsSBLMKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"026acd5859c2f32dc591bfedcd5e5c0af02aa71a80978f349cc8640ccb6884d7","last_reissued_at":"2026-05-18T03:57:40.175550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:40.175550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.2210","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-18T03:57:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"stMiWkpjxSwXWI5z/73vsURaBcEzJUDxVTk2jbZY+wYXmIngAoPgQjU8couJmNDt6oeSsZDXeobqHEEKgYRjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:54:52.695772Z"},"content_sha256":"88881381a89690706d5e3f29c5b1597ed59d9c5f7bdf1c06349fc7a6258ee13e","schema_version":"1.0","event_id":"sha256:88881381a89690706d5e3f29c5b1597ed59d9c5f7bdf1c06349fc7a6258ee13e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AJVM2WCZYLZS3RMRX7W42XS4BL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fixed-Rank Representation for Unsupervised Visual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.CV","authors_text":"Fernando De la Torre, Risheng Liu, Zhixun Su, Zhouchen Lin","submitted_at":"2012-03-09T23:35:52Z","abstract_excerpt":"Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-the-art techniques for subspace clustering make use of recent advances in sparsity and rank minimization. However, existing techniques are computationally expensive and may result in degenerate solutions that degrade clustering performance in the case of insufficient data sampling. To partially solve these problems, and inspired by existing work on matrix factorization, this paper proposes fixed-rank representation (FRR) as a unified"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2210","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-18T03:57:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJseVCU2WmtT5IkrwfVfqX+Y2bJv/zSXOZbDB9muxdFebRHSJ4rCK/ItefRxZ/7C4JXZKKEhZfZ+LED5M4C7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:54:52.696133Z"},"content_sha256":"5a39d1f77a7581709aac83aa82d0d7be6801ae791f8f90b0f1e8c13b9c7a18ed","schema_version":"1.0","event_id":"sha256:5a39d1f77a7581709aac83aa82d0d7be6801ae791f8f90b0f1e8c13b9c7a18ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJVM2WCZYLZS3RMRX7W42XS4BL/bundle.json","state_url":"https://pith.science/pith/AJVM2WCZYLZS3RMRX7W42XS4BL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJVM2WCZYLZS3RMRX7W42XS4BL/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-28T07:54:52Z","links":{"resolver":"https://pith.science/pith/AJVM2WCZYLZS3RMRX7W42XS4BL","bundle":"https://pith.science/pith/AJVM2WCZYLZS3RMRX7W42XS4BL/bundle.json","state":"https://pith.science/pith/AJVM2WCZYLZS3RMRX7W42XS4BL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJVM2WCZYLZS3RMRX7W42XS4BL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AJVM2WCZYLZS3RMRX7W42XS4BL","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":"e43d31e06a499b52f13b64fadaae91c6fb5e337417db569fc4e11eead0aa6d4b","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-09T23:35:52Z","title_canon_sha256":"b8dc3fd37149dc6fafd5632a2e91000d0d3e2b3d52c4f317bb58ad30c6c87063"},"schema_version":"1.0","source":{"id":"1203.2210","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2210","created_at":"2026-05-18T03:57:40Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2210v2","created_at":"2026-05-18T03:57:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2210","created_at":"2026-05-18T03:57:40Z"},{"alias_kind":"pith_short_12","alias_value":"AJVM2WCZYLZS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AJVM2WCZYLZS3RMR","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AJVM2WCZ","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:5a39d1f77a7581709aac83aa82d0d7be6801ae791f8f90b0f1e8c13b9c7a18ed","target":"graph","created_at":"2026-05-18T03:57: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":"Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-the-art techniques for subspace clustering make use of recent advances in sparsity and rank minimization. However, existing techniques are computationally expensive and may result in degenerate solutions that degrade clustering performance in the case of insufficient data sampling. To partially solve these problems, and inspired by existing work on matrix factorization, this paper proposes fixed-rank representation (FRR) as a unified","authors_text":"Fernando De la Torre, Risheng Liu, Zhixun Su, Zhouchen Lin","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-09T23:35:52Z","title":"Fixed-Rank Representation for Unsupervised Visual Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2210","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:88881381a89690706d5e3f29c5b1597ed59d9c5f7bdf1c06349fc7a6258ee13e","target":"record","created_at":"2026-05-18T03:57: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":"e43d31e06a499b52f13b64fadaae91c6fb5e337417db569fc4e11eead0aa6d4b","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-09T23:35:52Z","title_canon_sha256":"b8dc3fd37149dc6fafd5632a2e91000d0d3e2b3d52c4f317bb58ad30c6c87063"},"schema_version":"1.0","source":{"id":"1203.2210","kind":"arxiv","version":2}},"canonical_sha256":"026acd5859c2f32dc591bfedcd5e5c0af02aa71a80978f349cc8640ccb6884d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"026acd5859c2f32dc591bfedcd5e5c0af02aa71a80978f349cc8640ccb6884d7","first_computed_at":"2026-05-18T03:57:40.175550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:40.175550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0VboBowdr/TyohyYnedvm1eTQAw6WhSIJiUx4U22fTSXcw0PY7ZqFu5SygvM/9qQrorbwuT1BAzHrgsSBLMKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:40.176101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2210","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88881381a89690706d5e3f29c5b1597ed59d9c5f7bdf1c06349fc7a6258ee13e","sha256:5a39d1f77a7581709aac83aa82d0d7be6801ae791f8f90b0f1e8c13b9c7a18ed"],"state_sha256":"d72d97a8cd19b1f93a8bc63e274ecbdb88e96bc0f141be7d389b8f6c8cbc2dda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XB8aoUfgeira53I6XDhc3FcOQprCg8eRjc9RT8ew98vn1TK5WxKMgxAvTFzZTldr7Htf0RQWUVDJyRbGZSsGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:54:52.698344Z","bundle_sha256":"5bdd08d2b77f2c470dbfab8112b22ce94794c82b0c76be32797c9c1d7ea85934"}}