{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FWDFCOIJLNHH37CFXGMY4SKDPA","short_pith_number":"pith:FWDFCOIJ","schema_version":"1.0","canonical_sha256":"2d865139095b4e7dfc45b9998e494378362f8222c10561a08617a5baa839e143","source":{"kind":"arxiv","id":"1510.04396","version":1},"attestation_state":"computed","paper":{"title":"Filtrated Spectral Algebraic Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Manolis C. Tsakiris, Rene Vidal","submitted_at":"2015-10-15T04:12:37Z","abstract_excerpt":"Algebraic Subspace Clustering (ASC) is a simple and elegant method based on polynomial fitting and differentiation for clustering noiseless data drawn from an arbitrary union of subspaces. In practice, however, ASC is limited to equi-dimensional subspaces because the estimation of the subspace dimension via algebraic methods is sensitive to noise. This paper proposes a new ASC algorithm that can handle noisy data drawn from subspaces of arbitrary dimensions. The key ideas are (1) to construct, at each point, a decreasing sequence of subspaces containing the subspace passing through that point;"},"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":"1510.04396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-10-15T04:12:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6ce5f96679925993a9f90a7e13462ebabafcb8f034027b487dfdcb0c7a083435","abstract_canon_sha256":"fa46126e9d6f2900314dea8ec3f633a3c00583613c826a8e1bf622702dd96853"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:07.297225Z","signature_b64":"5VmXsiihhdGq1Ke3Lq1lGdNvbyj89+qniqfemyoozmIotJi8Mj0RIEAQxKETpaJXVmXFsxhjRAUrqMIv3YSPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d865139095b4e7dfc45b9998e494378362f8222c10561a08617a5baa839e143","last_reissued_at":"2026-05-18T01:30:07.296564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:07.296564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Filtrated Spectral Algebraic Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Manolis C. Tsakiris, Rene Vidal","submitted_at":"2015-10-15T04:12:37Z","abstract_excerpt":"Algebraic Subspace Clustering (ASC) is a simple and elegant method based on polynomial fitting and differentiation for clustering noiseless data drawn from an arbitrary union of subspaces. In practice, however, ASC is limited to equi-dimensional subspaces because the estimation of the subspace dimension via algebraic methods is sensitive to noise. This paper proposes a new ASC algorithm that can handle noisy data drawn from subspaces of arbitrary dimensions. The key ideas are (1) to construct, at each point, a decreasing sequence of subspaces containing the subspace passing through that point;"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04396","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":"1510.04396","created_at":"2026-05-18T01:30:07.296673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04396v1","created_at":"2026-05-18T01:30:07.296673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04396","created_at":"2026-05-18T01:30:07.296673+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWDFCOIJLNHH","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWDFCOIJLNHH37CF","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWDFCOIJ","created_at":"2026-05-18T12:29:22.688609+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/FWDFCOIJLNHH37CFXGMY4SKDPA","json":"https://pith.science/pith/FWDFCOIJLNHH37CFXGMY4SKDPA.json","graph_json":"https://pith.science/api/pith-number/FWDFCOIJLNHH37CFXGMY4SKDPA/graph.json","events_json":"https://pith.science/api/pith-number/FWDFCOIJLNHH37CFXGMY4SKDPA/events.json","paper":"https://pith.science/paper/FWDFCOIJ"},"agent_actions":{"view_html":"https://pith.science/pith/FWDFCOIJLNHH37CFXGMY4SKDPA","download_json":"https://pith.science/pith/FWDFCOIJLNHH37CFXGMY4SKDPA.json","view_paper":"https://pith.science/paper/FWDFCOIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04396&json=true","fetch_graph":"https://pith.science/api/pith-number/FWDFCOIJLNHH37CFXGMY4SKDPA/graph.json","fetch_events":"https://pith.science/api/pith-number/FWDFCOIJLNHH37CFXGMY4SKDPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWDFCOIJLNHH37CFXGMY4SKDPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWDFCOIJLNHH37CFXGMY4SKDPA/action/storage_attestation","attest_author":"https://pith.science/pith/FWDFCOIJLNHH37CFXGMY4SKDPA/action/author_attestation","sign_citation":"https://pith.science/pith/FWDFCOIJLNHH37CFXGMY4SKDPA/action/citation_signature","submit_replication":"https://pith.science/pith/FWDFCOIJLNHH37CFXGMY4SKDPA/action/replication_record"}},"created_at":"2026-05-18T01:30:07.296673+00:00","updated_at":"2026-05-18T01:30:07.296673+00:00"}