{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:RGFBQTGJTUHCOHOZOK3NAPW2Z6","short_pith_number":"pith:RGFBQTGJ","schema_version":"1.0","canonical_sha256":"898a184cc99d0e271dd972b6d03edacfb143847eed951c9f4567a504b5f72667","source":{"kind":"arxiv","id":"1010.2198","version":2},"attestation_state":"computed","paper":{"title":"Nearness to Local Subspace Algorithm for Subspace and Motion Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Akram Aldroubi, Ali Sekmen","submitted_at":"2010-10-11T19:47:41Z","abstract_excerpt":"There is a growing interest in computer science, engineering, and mathematics for modeling signals in terms of union of subspaces and manifolds. Subspace segmentation and clustering of high dimensional data drawn from a union of subspaces are especially important with many practical applications in computer vision, image and signal processing, communications, and information theory. This paper presents a clustering algorithm for high dimensional data that comes from a union of lower dimensional subspaces of equal and known dimensions. Such cases occur in many data clustering problems, such as "},"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":"1010.2198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-11T19:47:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d1da644b2986ccfb9bf4e8289e0a3ba4d4f11ad75dd1d0804ea7e6a2b95201d8","abstract_canon_sha256":"d95d6d1cedbe77adf53206cfb5dfd3899552389b8d5d5a6ffe64450a34547941"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:37.647069Z","signature_b64":"yRo2d8z8PJR+ufSnEKbkKwc3QSU5AGuLI7OXHm64z3QMGnzmGkVMA/rZuc+aJiSa0krJCJiRwszcBK7BxMOZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"898a184cc99d0e271dd972b6d03edacfb143847eed951c9f4567a504b5f72667","last_reissued_at":"2026-05-18T03:55:37.646541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:37.646541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearness to Local Subspace Algorithm for Subspace and Motion Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Akram Aldroubi, Ali Sekmen","submitted_at":"2010-10-11T19:47:41Z","abstract_excerpt":"There is a growing interest in computer science, engineering, and mathematics for modeling signals in terms of union of subspaces and manifolds. Subspace segmentation and clustering of high dimensional data drawn from a union of subspaces are especially important with many practical applications in computer vision, image and signal processing, communications, and information theory. This paper presents a clustering algorithm for high dimensional data that comes from a union of lower dimensional subspaces of equal and known dimensions. Such cases occur in many data clustering problems, such as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2198","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.2198","created_at":"2026-05-18T03:55:37.646617+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.2198v2","created_at":"2026-05-18T03:55:37.646617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2198","created_at":"2026-05-18T03:55:37.646617+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGFBQTGJTUHC","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGFBQTGJTUHCOHOZ","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGFBQTGJ","created_at":"2026-05-18T12:26:13.927090+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/RGFBQTGJTUHCOHOZOK3NAPW2Z6","json":"https://pith.science/pith/RGFBQTGJTUHCOHOZOK3NAPW2Z6.json","graph_json":"https://pith.science/api/pith-number/RGFBQTGJTUHCOHOZOK3NAPW2Z6/graph.json","events_json":"https://pith.science/api/pith-number/RGFBQTGJTUHCOHOZOK3NAPW2Z6/events.json","paper":"https://pith.science/paper/RGFBQTGJ"},"agent_actions":{"view_html":"https://pith.science/pith/RGFBQTGJTUHCOHOZOK3NAPW2Z6","download_json":"https://pith.science/pith/RGFBQTGJTUHCOHOZOK3NAPW2Z6.json","view_paper":"https://pith.science/paper/RGFBQTGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.2198&json=true","fetch_graph":"https://pith.science/api/pith-number/RGFBQTGJTUHCOHOZOK3NAPW2Z6/graph.json","fetch_events":"https://pith.science/api/pith-number/RGFBQTGJTUHCOHOZOK3NAPW2Z6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGFBQTGJTUHCOHOZOK3NAPW2Z6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGFBQTGJTUHCOHOZOK3NAPW2Z6/action/storage_attestation","attest_author":"https://pith.science/pith/RGFBQTGJTUHCOHOZOK3NAPW2Z6/action/author_attestation","sign_citation":"https://pith.science/pith/RGFBQTGJTUHCOHOZOK3NAPW2Z6/action/citation_signature","submit_replication":"https://pith.science/pith/RGFBQTGJTUHCOHOZOK3NAPW2Z6/action/replication_record"}},"created_at":"2026-05-18T03:55:37.646617+00:00","updated_at":"2026-05-18T03:55:37.646617+00:00"}