{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:W6BKDRCDGHYX3DLFCSFXPTMOPX","short_pith_number":"pith:W6BKDRCD","schema_version":"1.0","canonical_sha256":"b782a1c44331f17d8d65148b77cd8e7dd3111c5153b5ed41ff4dcda2a017b3d9","source":{"kind":"arxiv","id":"1905.01145","version":1},"attestation_state":"computed","paper":{"title":"Three-Stage Subspace Clustering Framework with Graph-Based Transformation and Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Shuai Yang, Wenqi Zhu, Yuesheng Zhu","submitted_at":"2019-05-02T07:38:41Z","abstract_excerpt":"Subspace clustering (SC) refers to the problem of clustering high-dimensional data into a union of low-dimensional subspaces. Based on spectral clustering, state-of-the-art approaches solve SC problem within a two-stage framework. In the first stage, data representation techniques are applied to draw an affinity matrix from the original data. In the second stage, spectral clustering is directly applied to the affinity matrix so that data can be grouped into different subspaces. However, the affinity matrix obtained in the first stage usually fails to reveal the authentic relationship between d"},"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":"1905.01145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-02T07:38:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3d94eddbecabde72c67f743a6685ef9d5800b5d29eca78814e4189a33cd50697","abstract_canon_sha256":"b875fd03c9e241a65f749008085d8cbb14aa560f06bed2140f3072b207bee9d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:06.677955Z","signature_b64":"W0CEyQjyqIgbY76sEBfKIAsb7R1r/07O+Bdufwyc+nCBRVqmruOUcv+AO9wOEkEXr46pXMC0Rllow1+eFvjhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b782a1c44331f17d8d65148b77cd8e7dd3111c5153b5ed41ff4dcda2a017b3d9","last_reissued_at":"2026-05-17T23:47:06.677296Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:06.677296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Three-Stage Subspace Clustering Framework with Graph-Based Transformation and Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Shuai Yang, Wenqi Zhu, Yuesheng Zhu","submitted_at":"2019-05-02T07:38:41Z","abstract_excerpt":"Subspace clustering (SC) refers to the problem of clustering high-dimensional data into a union of low-dimensional subspaces. Based on spectral clustering, state-of-the-art approaches solve SC problem within a two-stage framework. In the first stage, data representation techniques are applied to draw an affinity matrix from the original data. In the second stage, spectral clustering is directly applied to the affinity matrix so that data can be grouped into different subspaces. However, the affinity matrix obtained in the first stage usually fails to reveal the authentic relationship between d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01145","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":"1905.01145","created_at":"2026-05-17T23:47:06.677410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01145v1","created_at":"2026-05-17T23:47:06.677410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01145","created_at":"2026-05-17T23:47:06.677410+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6BKDRCDGHYX","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6BKDRCDGHYX3DLF","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6BKDRCD","created_at":"2026-05-18T12:33:30.264802+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/W6BKDRCDGHYX3DLFCSFXPTMOPX","json":"https://pith.science/pith/W6BKDRCDGHYX3DLFCSFXPTMOPX.json","graph_json":"https://pith.science/api/pith-number/W6BKDRCDGHYX3DLFCSFXPTMOPX/graph.json","events_json":"https://pith.science/api/pith-number/W6BKDRCDGHYX3DLFCSFXPTMOPX/events.json","paper":"https://pith.science/paper/W6BKDRCD"},"agent_actions":{"view_html":"https://pith.science/pith/W6BKDRCDGHYX3DLFCSFXPTMOPX","download_json":"https://pith.science/pith/W6BKDRCDGHYX3DLFCSFXPTMOPX.json","view_paper":"https://pith.science/paper/W6BKDRCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01145&json=true","fetch_graph":"https://pith.science/api/pith-number/W6BKDRCDGHYX3DLFCSFXPTMOPX/graph.json","fetch_events":"https://pith.science/api/pith-number/W6BKDRCDGHYX3DLFCSFXPTMOPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6BKDRCDGHYX3DLFCSFXPTMOPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6BKDRCDGHYX3DLFCSFXPTMOPX/action/storage_attestation","attest_author":"https://pith.science/pith/W6BKDRCDGHYX3DLFCSFXPTMOPX/action/author_attestation","sign_citation":"https://pith.science/pith/W6BKDRCDGHYX3DLFCSFXPTMOPX/action/citation_signature","submit_replication":"https://pith.science/pith/W6BKDRCDGHYX3DLFCSFXPTMOPX/action/replication_record"}},"created_at":"2026-05-17T23:47:06.677410+00:00","updated_at":"2026-05-17T23:47:06.677410+00:00"}