{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YZ46ADLWR6CLLL6RN27OSZUVLZ","short_pith_number":"pith:YZ46ADLW","schema_version":"1.0","canonical_sha256":"c679e00d768f84b5afd16ebee966955e5703c1e59ad798e3c523666bc13db84e","source":{"kind":"arxiv","id":"1901.07689","version":1},"attestation_state":"computed","paper":{"title":"Simultaneous Subspace Clustering and Cluster Number Estimating based on Triplet Relationship","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jie Liang, Jufeng Yang, Liang Wang, Ming-Ming Cheng, Paul L. Rosin","submitted_at":"2019-01-23T02:13:08Z","abstract_excerpt":"In this paper we propose a unified framework to simultaneously discover the number of clusters and group the data points into them using subspace clustering. Real data distributed in a high-dimensional space can be disentangled into a union of low-dimensional subspaces, which can benefit various applications. To explore such intrinsic structure, state-of-the-art subspace clustering approaches often optimize a self-representation problem among all samples, to construct a pairwise affinity graph for spectral clustering. However, a graph with pairwise similarities lacks robustness for segmentatio"},"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":"1901.07689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-23T02:13:08Z","cross_cats_sorted":[],"title_canon_sha256":"5b4f995605a2f8a9c7dc19f2ae42671c2a4a984b5ceb80902200d5fb0bb484cc","abstract_canon_sha256":"8ef08563118e43d6bac443635d33120e5a782ba8d4c3c8aede118472d20a3e8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:55.241805Z","signature_b64":"l4FNva2lGQO8nwBY2gu7j5q5Dx2FPLOQ318nRB27TVgl7ofCanHxcrP+0T8uZKt3hg4U6xW5V8YvljbU/tHODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c679e00d768f84b5afd16ebee966955e5703c1e59ad798e3c523666bc13db84e","last_reissued_at":"2026-05-17T23:39:55.241288Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:55.241288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous Subspace Clustering and Cluster Number Estimating based on Triplet Relationship","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jie Liang, Jufeng Yang, Liang Wang, Ming-Ming Cheng, Paul L. Rosin","submitted_at":"2019-01-23T02:13:08Z","abstract_excerpt":"In this paper we propose a unified framework to simultaneously discover the number of clusters and group the data points into them using subspace clustering. Real data distributed in a high-dimensional space can be disentangled into a union of low-dimensional subspaces, which can benefit various applications. To explore such intrinsic structure, state-of-the-art subspace clustering approaches often optimize a self-representation problem among all samples, to construct a pairwise affinity graph for spectral clustering. However, a graph with pairwise similarities lacks robustness for segmentatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07689","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":"1901.07689","created_at":"2026-05-17T23:39:55.241373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07689v1","created_at":"2026-05-17T23:39:55.241373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07689","created_at":"2026-05-17T23:39:55.241373+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZ46ADLWR6CL","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZ46ADLWR6CLLL6R","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZ46ADLW","created_at":"2026-05-18T12:33:33.725879+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/YZ46ADLWR6CLLL6RN27OSZUVLZ","json":"https://pith.science/pith/YZ46ADLWR6CLLL6RN27OSZUVLZ.json","graph_json":"https://pith.science/api/pith-number/YZ46ADLWR6CLLL6RN27OSZUVLZ/graph.json","events_json":"https://pith.science/api/pith-number/YZ46ADLWR6CLLL6RN27OSZUVLZ/events.json","paper":"https://pith.science/paper/YZ46ADLW"},"agent_actions":{"view_html":"https://pith.science/pith/YZ46ADLWR6CLLL6RN27OSZUVLZ","download_json":"https://pith.science/pith/YZ46ADLWR6CLLL6RN27OSZUVLZ.json","view_paper":"https://pith.science/paper/YZ46ADLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07689&json=true","fetch_graph":"https://pith.science/api/pith-number/YZ46ADLWR6CLLL6RN27OSZUVLZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YZ46ADLWR6CLLL6RN27OSZUVLZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZ46ADLWR6CLLL6RN27OSZUVLZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZ46ADLWR6CLLL6RN27OSZUVLZ/action/storage_attestation","attest_author":"https://pith.science/pith/YZ46ADLWR6CLLL6RN27OSZUVLZ/action/author_attestation","sign_citation":"https://pith.science/pith/YZ46ADLWR6CLLL6RN27OSZUVLZ/action/citation_signature","submit_replication":"https://pith.science/pith/YZ46ADLWR6CLLL6RN27OSZUVLZ/action/replication_record"}},"created_at":"2026-05-17T23:39:55.241373+00:00","updated_at":"2026-05-17T23:39:55.241373+00:00"}