{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3JIX4FF3F6RU4ZUGUKKAOFM74W","short_pith_number":"pith:3JIX4FF3","schema_version":"1.0","canonical_sha256":"da517e14bb2fa34e6686a29407159fe5943f686e1702c7390f21e4f72f7c7ed4","source":{"kind":"arxiv","id":"1709.01467","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.01467","created_at":"2026-05-18T00:36:00.010269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01467v1","created_at":"2026-05-18T00:36:00.010269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01467","created_at":"2026-05-18T00:36:00.010269+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JIX4FF3F6RU","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JIX4FF3F6RU4ZUG","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JIX4FF3","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W","json":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W.json","graph_json":"https://pith.science/api/pith-number/3JIX4FF3F6RU4ZUGUKKAOFM74W/graph.json","events_json":"https://pith.science/api/pith-number/3JIX4FF3F6RU4ZUGUKKAOFM74W/events.json","paper":"https://pith.science/paper/3JIX4FF3"},"agent_actions":{"view_html":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W","download_json":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W.json","view_paper":"https://pith.science/paper/3JIX4FF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01467&json=true","fetch_graph":"https://pith.science/api/pith-number/3JIX4FF3F6RU4ZUGUKKAOFM74W/graph.json","fetch_events":"https://pith.science/api/pith-number/3JIX4FF3F6RU4ZUGUKKAOFM74W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W/action/storage_attestation","attest_author":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W/action/author_attestation","sign_citation":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W/action/citation_signature","submit_replication":"https://pith.science/pith/3JIX4FF3F6RU4ZUGUKKAOFM74W/action/replication_record"}},"created_at":"2026-05-18T00:36:00.010269+00:00","updated_at":"2026-05-18T00:36:00.010269+00:00"}