{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3JIX4FF3F6RU4ZUGUKKAOFM74W","short_pith_number":"pith:3JIX4FF3","canonical_record":{"source":{"id":"1709.01467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-05T15:58:30Z","cross_cats_sorted":[],"title_canon_sha256":"5cab9bdb0f7d19296d1f5e3d292ab7d9709f1a03c066a07c0f5b84373d413df6","abstract_canon_sha256":"d8ca932be49405bea2bb62b7cedea151b43cf7f50431c19bc1276ce831d38cbd"},"schema_version":"1.0"},"canonical_sha256":"da517e14bb2fa34e6686a29407159fe5943f686e1702c7390f21e4f72f7c7ed4","source":{"kind":"arxiv","id":"1709.01467","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01467","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01467v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01467","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"3JIX4FF3F6RU","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3JIX4FF3F6RU4ZUG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3JIX4FF3","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3JIX4FF3F6RU4ZUGUKKAOFM74W","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-05T15:58:30Z","cross_cats_sorted":[],"title_canon_sha256":"5cab9bdb0f7d19296d1f5e3d292ab7d9709f1a03c066a07c0f5b84373d413df6","abstract_canon_sha256":"d8ca932be49405bea2bb62b7cedea151b43cf7f50431c19bc1276ce831d38cbd"},"schema_version":"1.0"},"canonical_sha256":"da517e14bb2fa34e6686a29407159fe5943f686e1702c7390f21e4f72f7c7ed4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:00.010693Z","signature_b64":"etwDm+UzLSRcanPQ8k577MAc7gYhHPKcErGp4Gw97sA8aGof70JV51+TSV7pe9oYqh92QVs7O7vbD3r92dUsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da517e14bb2fa34e6686a29407159fe5943f686e1702c7390f21e4f72f7c7ed4","last_reissued_at":"2026-05-18T00:36:00.010200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:00.010200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01467","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCxCtpCBausV4Wf4Ve+lKoAFDx7uuxBq6dk0CGAWhleOAqDfukNfWwlhejIv6vWsLwgJ8f44UCf/2aKklv+0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:00:26.892296Z"},"content_sha256":"5117a0b2dc13c65a4faba58ae25fc988f8440decec0863cc2283cba424d77622","schema_version":"1.0","event_id":"sha256:5117a0b2dc13c65a4faba58ae25fc988f8440decec0863cc2283cba424d77622"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3JIX4FF3F6RU4ZUGUKKAOFM74W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subspace Segmentation by Successive Approximations: A Method for Low-Rank and High-Rank Data with Missing Entries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jo\\~ao Carvalho, Jo\\~ao P. Costeira, Manuel Marques","submitted_at":"2017-09-05T15:58:30Z","abstract_excerpt":"We propose a method to reconstruct and cluster incomplete high-dimensional data lying in a union of low-dimensional subspaces. Exploring the sparse representation model, we jointly estimate the missing data while imposing the intrinsic subspace structure. Since we have a non-convex problem, we propose an iterative method to reconstruct the data and provide a sparse similarity affinity matrix. This method is robust to initialization and achieves greater reconstruction accuracy than current methods, which dramatically improves clustering performance. Extensive experiments with synthetic and real"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01467","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2h1pt1BxsI8vffmocbYbvxCn3OvTRmCAyCvqCb7m1hVbRVVQE42BUw7zQq1FJKcqHGgQ0pRG8sdbE9D83nTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:00:26.892663Z"},"content_sha256":"44382a3f75680888152fc24de9b6424aa37fe9bfbf57213c1059c9ec6d42abbb","schema_version":"1.0","event_id":"sha256:44382a3f75680888152fc24de9b6424aa37fe9bfbf57213c1059c9ec6d42abbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W/bundle.json","state_url":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W/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-01T10:00:26Z","links":{"resolver":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W","bundle":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W/bundle.json","state":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3JIX4FF3F6RU4ZUGUKKAOFM74W","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":"d8ca932be49405bea2bb62b7cedea151b43cf7f50431c19bc1276ce831d38cbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-05T15:58:30Z","title_canon_sha256":"5cab9bdb0f7d19296d1f5e3d292ab7d9709f1a03c066a07c0f5b84373d413df6"},"schema_version":"1.0","source":{"id":"1709.01467","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01467","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01467v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01467","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"3JIX4FF3F6RU","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3JIX4FF3F6RU4ZUG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3JIX4FF3","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:44382a3f75680888152fc24de9b6424aa37fe9bfbf57213c1059c9ec6d42abbb","target":"graph","created_at":"2026-05-18T00:36:00Z","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":"We propose a method to reconstruct and cluster incomplete high-dimensional data lying in a union of low-dimensional subspaces. Exploring the sparse representation model, we jointly estimate the missing data while imposing the intrinsic subspace structure. Since we have a non-convex problem, we propose an iterative method to reconstruct the data and provide a sparse similarity affinity matrix. This method is robust to initialization and achieves greater reconstruction accuracy than current methods, which dramatically improves clustering performance. Extensive experiments with synthetic and real","authors_text":"Jo\\~ao Carvalho, Jo\\~ao P. Costeira, Manuel Marques","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-05T15:58:30Z","title":"Subspace Segmentation by Successive Approximations: A Method for Low-Rank and High-Rank Data with Missing Entries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01467","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:5117a0b2dc13c65a4faba58ae25fc988f8440decec0863cc2283cba424d77622","target":"record","created_at":"2026-05-18T00:36:00Z","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":"d8ca932be49405bea2bb62b7cedea151b43cf7f50431c19bc1276ce831d38cbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-05T15:58:30Z","title_canon_sha256":"5cab9bdb0f7d19296d1f5e3d292ab7d9709f1a03c066a07c0f5b84373d413df6"},"schema_version":"1.0","source":{"id":"1709.01467","kind":"arxiv","version":1}},"canonical_sha256":"da517e14bb2fa34e6686a29407159fe5943f686e1702c7390f21e4f72f7c7ed4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da517e14bb2fa34e6686a29407159fe5943f686e1702c7390f21e4f72f7c7ed4","first_computed_at":"2026-05-18T00:36:00.010200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:00.010200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"etwDm+UzLSRcanPQ8k577MAc7gYhHPKcErGp4Gw97sA8aGof70JV51+TSV7pe9oYqh92QVs7O7vbD3r92dUsAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:00.010693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01467","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5117a0b2dc13c65a4faba58ae25fc988f8440decec0863cc2283cba424d77622","sha256:44382a3f75680888152fc24de9b6424aa37fe9bfbf57213c1059c9ec6d42abbb"],"state_sha256":"98ca954c741a66992438647cb3eed4297f0d805cd40ce14fabdee31f1068f76a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RF83YoI0kZiKpfVHHmS32k+rBonzQUQcBn8xrzGS5IuP8zM5Z7hk5qkcQlczYxRT4HWKtLLAsdvOX1jLkktQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:00:26.894598Z","bundle_sha256":"a9fa7f76bec12944b377ee22ac35b26b4cfd0a06114d384ce0aaf627a3f7329e"}}