{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4EF3INJFREAVMHOQI5FKTGXC6S","short_pith_number":"pith:4EF3INJF","canonical_record":{"source":{"id":"1404.6736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-27T11:01:17Z","cross_cats_sorted":[],"title_canon_sha256":"95da08d30c1ffa558ff5ca759ec4facff67c02b3cba14417150a9ab5c1894555","abstract_canon_sha256":"2857a354437999a1b31c40a4bef6bd6a7b08bb16bfa0c2625bcc159dfe353c23"},"schema_version":"1.0"},"canonical_sha256":"e10bb435258901561dd0474aa99ae2f4818e525c22a2361d65d130a580368590","source":{"kind":"arxiv","id":"1404.6736","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6736","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6736v1","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6736","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"4EF3INJFREAV","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4EF3INJFREAVMHOQ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4EF3INJF","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4EF3INJFREAVMHOQI5FKTGXC6S","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-27T11:01:17Z","cross_cats_sorted":[],"title_canon_sha256":"95da08d30c1ffa558ff5ca759ec4facff67c02b3cba14417150a9ab5c1894555","abstract_canon_sha256":"2857a354437999a1b31c40a4bef6bd6a7b08bb16bfa0c2625bcc159dfe353c23"},"schema_version":"1.0"},"canonical_sha256":"e10bb435258901561dd0474aa99ae2f4818e525c22a2361d65d130a580368590","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:06.122981Z","signature_b64":"BtZuTbW5HJK7QDyMW/BO6O5jBhZRve+65SfqN/kEQFlHrcCoJDgPyjJwIC0TqhWBcA4r4hvuVgaQ9WZ1iv4JDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e10bb435258901561dd0474aa99ae2f4818e525c22a2361d65d130a580368590","last_reissued_at":"2026-05-18T02:53:06.122300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:06.122300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6736","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-18T02:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BP4BMt2nq6t3CQRmUrtfSUNA1C/ctoa+FU3iIWk7IbgY6rKeaI6l0izvOx07Dpk1sd+p3IvpNBJ2WMYg/JlICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:42:02.702056Z"},"content_sha256":"202e8c5cc9cc6f4c3c7be0eb634e84066d7a60619c1e8ac584c1f5c19737ab2d","schema_version":"1.0","event_id":"sha256:202e8c5cc9cc6f4c3c7be0eb634e84066d7a60619c1e8ac584c1f5c19737ab2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4EF3INJFREAVMHOQI5FKTGXC6S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust and Efficient Subspace Segmentation via Least Squares Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Can-Yi Lu, De-Shuang Huang, Hai Min, Lin Zhu, Shuicheng Yan, Zhong-Qiu Zhao","submitted_at":"2014-04-27T11:01:17Z","abstract_excerpt":"This paper studies the subspace segmentation problem which aims to segment data drawn from a union of multiple linear subspaces. Recent works by using sparse representation, low rank representation and their extensions attract much attention. If the subspaces from which the data drawn are independent or orthogonal, they are able to obtain a block diagonal affinity matrix, which usually leads to a correct segmentation. The main differences among them are their objective functions. We theoretically show that if the objective function satisfies some conditions, and the data are sufficiently drawn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6736","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-18T02:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GkEZRL++eCCuTWZlKJJwSUek+mOfwd/VcpAAlqrQ5HLJI7zVolSq26baXcJE6w8a3eHRXLfmECiwLrNHkAl3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:42:02.702414Z"},"content_sha256":"27d742c0db7935b421c20ba5cb0c5aad9f12f46fbf0254b450dc68a005d44c95","schema_version":"1.0","event_id":"sha256:27d742c0db7935b421c20ba5cb0c5aad9f12f46fbf0254b450dc68a005d44c95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EF3INJFREAVMHOQI5FKTGXC6S/bundle.json","state_url":"https://pith.science/pith/4EF3INJFREAVMHOQI5FKTGXC6S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EF3INJFREAVMHOQI5FKTGXC6S/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-20T18:42:02Z","links":{"resolver":"https://pith.science/pith/4EF3INJFREAVMHOQI5FKTGXC6S","bundle":"https://pith.science/pith/4EF3INJFREAVMHOQI5FKTGXC6S/bundle.json","state":"https://pith.science/pith/4EF3INJFREAVMHOQI5FKTGXC6S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EF3INJFREAVMHOQI5FKTGXC6S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4EF3INJFREAVMHOQI5FKTGXC6S","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":"2857a354437999a1b31c40a4bef6bd6a7b08bb16bfa0c2625bcc159dfe353c23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-27T11:01:17Z","title_canon_sha256":"95da08d30c1ffa558ff5ca759ec4facff67c02b3cba14417150a9ab5c1894555"},"schema_version":"1.0","source":{"id":"1404.6736","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6736","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6736v1","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6736","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"4EF3INJFREAV","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4EF3INJFREAVMHOQ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4EF3INJF","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:27d742c0db7935b421c20ba5cb0c5aad9f12f46fbf0254b450dc68a005d44c95","target":"graph","created_at":"2026-05-18T02:53:06Z","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 segmentation problem which aims to segment data drawn from a union of multiple linear subspaces. Recent works by using sparse representation, low rank representation and their extensions attract much attention. If the subspaces from which the data drawn are independent or orthogonal, they are able to obtain a block diagonal affinity matrix, which usually leads to a correct segmentation. The main differences among them are their objective functions. We theoretically show that if the objective function satisfies some conditions, and the data are sufficiently drawn","authors_text":"Can-Yi Lu, De-Shuang Huang, Hai Min, Lin Zhu, Shuicheng Yan, Zhong-Qiu Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-27T11:01:17Z","title":"Robust and Efficient Subspace Segmentation via Least Squares Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6736","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:202e8c5cc9cc6f4c3c7be0eb634e84066d7a60619c1e8ac584c1f5c19737ab2d","target":"record","created_at":"2026-05-18T02:53:06Z","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":"2857a354437999a1b31c40a4bef6bd6a7b08bb16bfa0c2625bcc159dfe353c23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-27T11:01:17Z","title_canon_sha256":"95da08d30c1ffa558ff5ca759ec4facff67c02b3cba14417150a9ab5c1894555"},"schema_version":"1.0","source":{"id":"1404.6736","kind":"arxiv","version":1}},"canonical_sha256":"e10bb435258901561dd0474aa99ae2f4818e525c22a2361d65d130a580368590","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e10bb435258901561dd0474aa99ae2f4818e525c22a2361d65d130a580368590","first_computed_at":"2026-05-18T02:53:06.122300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:06.122300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BtZuTbW5HJK7QDyMW/BO6O5jBhZRve+65SfqN/kEQFlHrcCoJDgPyjJwIC0TqhWBcA4r4hvuVgaQ9WZ1iv4JDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:06.122981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6736","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:202e8c5cc9cc6f4c3c7be0eb634e84066d7a60619c1e8ac584c1f5c19737ab2d","sha256:27d742c0db7935b421c20ba5cb0c5aad9f12f46fbf0254b450dc68a005d44c95"],"state_sha256":"3a18189efd020d82799e8f5e268b599a4b13366c14cdae42ab913702944811c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6pDkxNw7rtBLY/8oJ/vHVIhUSDfKujsO/k4g8VF9iTSeqB1YyJprwo55kkEXEfCn09Mq8w+1Fm1K1H0UG5FBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T18:42:02.704344Z","bundle_sha256":"187b4da1a8003d6122f4903b52da60b07848585c152253d7541979c5ea238526"}}