{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GOY2ILPFHEFXONUTU4SXL4WZBO","short_pith_number":"pith:GOY2ILPF","schema_version":"1.0","canonical_sha256":"33b1a42de5390b773693a72575f2d90b90c4f331e2c8e89af869c1bcd215939c","source":{"kind":"arxiv","id":"2011.14859","version":2},"attestation_state":"computed","paper":{"title":"Doubly Stochastic Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Benjamin D. Haeffele, Derek Lim, Ren\\'e Vidal","submitted_at":"2020-11-30T14:56:54Z","abstract_excerpt":"Many state-of-the-art subspace clustering methods follow a two-step process by first constructing an affinity matrix between data points and then applying spectral clustering to this affinity. Most of the research into these methods focuses on the first step of generating the affinity, which often exploits the self-expressive property of linear subspaces, with little consideration typically given to the spectral clustering step that produces the final clustering. Moreover, existing methods often obtain the final affinity that is used in the spectral clustering step by applying ad-hoc or arbitr"},"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":"2011.14859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-30T14:56:54Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"fd278ff9dbd744731454ef6564be51cd54df2f29a29f3760a49d9e6037ad7102","abstract_canon_sha256":"309ff46e166fb6910ff057d99f3cb693cd53f2768edc5d2e1f00cab5da4561bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:33:23.849167Z","signature_b64":"ByZcBK3u6ZBBcBiB1+iNYLhxZVqsRwp3kdNvwTOKACZ29Nbja+V3WnCd3vtsS5SpdMrZRDEeAnYgfe+JczLmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33b1a42de5390b773693a72575f2d90b90c4f331e2c8e89af869c1bcd215939c","last_reissued_at":"2026-07-05T02:33:23.848656Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:33:23.848656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doubly Stochastic Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Benjamin D. Haeffele, Derek Lim, Ren\\'e Vidal","submitted_at":"2020-11-30T14:56:54Z","abstract_excerpt":"Many state-of-the-art subspace clustering methods follow a two-step process by first constructing an affinity matrix between data points and then applying spectral clustering to this affinity. Most of the research into these methods focuses on the first step of generating the affinity, which often exploits the self-expressive property of linear subspaces, with little consideration typically given to the spectral clustering step that produces the final clustering. Moreover, existing methods often obtain the final affinity that is used in the spectral clustering step by applying ad-hoc or arbitr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.14859","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.14859/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.14859","created_at":"2026-07-05T02:33:23.848733+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.14859v2","created_at":"2026-07-05T02:33:23.848733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.14859","created_at":"2026-07-05T02:33:23.848733+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOY2ILPFHEFX","created_at":"2026-07-05T02:33:23.848733+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOY2ILPFHEFXONUT","created_at":"2026-07-05T02:33:23.848733+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOY2ILPF","created_at":"2026-07-05T02:33:23.848733+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.18930","citing_title":"Graph Cut-guided Maximal Coding Rate Reduction for Learning Image Embedding and Clustering","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GOY2ILPFHEFXONUTU4SXL4WZBO","json":"https://pith.science/pith/GOY2ILPFHEFXONUTU4SXL4WZBO.json","graph_json":"https://pith.science/api/pith-number/GOY2ILPFHEFXONUTU4SXL4WZBO/graph.json","events_json":"https://pith.science/api/pith-number/GOY2ILPFHEFXONUTU4SXL4WZBO/events.json","paper":"https://pith.science/paper/GOY2ILPF"},"agent_actions":{"view_html":"https://pith.science/pith/GOY2ILPFHEFXONUTU4SXL4WZBO","download_json":"https://pith.science/pith/GOY2ILPFHEFXONUTU4SXL4WZBO.json","view_paper":"https://pith.science/paper/GOY2ILPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.14859&json=true","fetch_graph":"https://pith.science/api/pith-number/GOY2ILPFHEFXONUTU4SXL4WZBO/graph.json","fetch_events":"https://pith.science/api/pith-number/GOY2ILPFHEFXONUTU4SXL4WZBO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOY2ILPFHEFXONUTU4SXL4WZBO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOY2ILPFHEFXONUTU4SXL4WZBO/action/storage_attestation","attest_author":"https://pith.science/pith/GOY2ILPFHEFXONUTU4SXL4WZBO/action/author_attestation","sign_citation":"https://pith.science/pith/GOY2ILPFHEFXONUTU4SXL4WZBO/action/citation_signature","submit_replication":"https://pith.science/pith/GOY2ILPFHEFXONUTU4SXL4WZBO/action/replication_record"}},"created_at":"2026-07-05T02:33:23.848733+00:00","updated_at":"2026-07-05T02:33:23.848733+00:00"}