{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Z7ALERQKB5BXOUJ3HZJ7WZU3HF","short_pith_number":"pith:Z7ALERQK","schema_version":"1.0","canonical_sha256":"cfc0b2460a0f4377513b3e53fb669b397ceb5382e57cec3f0cd94880f4b3109a","source":{"kind":"arxiv","id":"1609.08251","version":2},"attestation_state":"computed","paper":{"title":"Robust and efficient multi-way spectral clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","cs.SI","physics.soc-ph"],"primary_cat":"math.NA","authors_text":"Anil Damle, Lexing Ying, Victor Minden","submitted_at":"2016-09-27T03:56:23Z","abstract_excerpt":"We present a new algorithm for spectral clustering based on a column-pivoted QR factorization that may be directly used for cluster assignment or to provide an initial guess for k-means. Our algorithm is simple to implement, direct, and requires no initial guess. Furthermore, it scales linearly in the number of nodes of the graph and a randomized variant provides significant computational gains. Provided the subspace spanned by the eigenvectors used for clustering contains a basis that resembles the set of indicator vectors on the clusters, we prove that both our deterministic and randomized a"},"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":"1609.08251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-27T03:56:23Z","cross_cats_sorted":["cs.NA","cs.SI","physics.soc-ph"],"title_canon_sha256":"6c92ea67dbc00e152149225ca18e7d13d08e60ff8fc0925d683416f3933c3678","abstract_canon_sha256":"8fd9f8cfc171e0cd2306037b42199e29cad95269a6eec647f678f5a2b1df7036"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:20.696702Z","signature_b64":"OXh2EpE01whJdy2N0XBJQNMqneORqATiHaPsFzXO4+bXydNNi3js2ISWRXLeeAUX3RsmWj/vefq38tENmrC0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfc0b2460a0f4377513b3e53fb669b397ceb5382e57cec3f0cd94880f4b3109a","last_reissued_at":"2026-05-18T00:46:20.696149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:20.696149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and efficient multi-way spectral clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","cs.SI","physics.soc-ph"],"primary_cat":"math.NA","authors_text":"Anil Damle, Lexing Ying, Victor Minden","submitted_at":"2016-09-27T03:56:23Z","abstract_excerpt":"We present a new algorithm for spectral clustering based on a column-pivoted QR factorization that may be directly used for cluster assignment or to provide an initial guess for k-means. Our algorithm is simple to implement, direct, and requires no initial guess. Furthermore, it scales linearly in the number of nodes of the graph and a randomized variant provides significant computational gains. Provided the subspace spanned by the eigenvectors used for clustering contains a basis that resembles the set of indicator vectors on the clusters, we prove that both our deterministic and randomized a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08251","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":"1609.08251","created_at":"2026-05-18T00:46:20.696247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08251v2","created_at":"2026-05-18T00:46:20.696247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08251","created_at":"2026-05-18T00:46:20.696247+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7ALERQKB5BX","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7ALERQKB5BXOUJ3","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7ALERQK","created_at":"2026-05-18T12:30:53.716459+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/Z7ALERQKB5BXOUJ3HZJ7WZU3HF","json":"https://pith.science/pith/Z7ALERQKB5BXOUJ3HZJ7WZU3HF.json","graph_json":"https://pith.science/api/pith-number/Z7ALERQKB5BXOUJ3HZJ7WZU3HF/graph.json","events_json":"https://pith.science/api/pith-number/Z7ALERQKB5BXOUJ3HZJ7WZU3HF/events.json","paper":"https://pith.science/paper/Z7ALERQK"},"agent_actions":{"view_html":"https://pith.science/pith/Z7ALERQKB5BXOUJ3HZJ7WZU3HF","download_json":"https://pith.science/pith/Z7ALERQKB5BXOUJ3HZJ7WZU3HF.json","view_paper":"https://pith.science/paper/Z7ALERQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08251&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7ALERQKB5BXOUJ3HZJ7WZU3HF/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7ALERQKB5BXOUJ3HZJ7WZU3HF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7ALERQKB5BXOUJ3HZJ7WZU3HF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7ALERQKB5BXOUJ3HZJ7WZU3HF/action/storage_attestation","attest_author":"https://pith.science/pith/Z7ALERQKB5BXOUJ3HZJ7WZU3HF/action/author_attestation","sign_citation":"https://pith.science/pith/Z7ALERQKB5BXOUJ3HZJ7WZU3HF/action/citation_signature","submit_replication":"https://pith.science/pith/Z7ALERQKB5BXOUJ3HZJ7WZU3HF/action/replication_record"}},"created_at":"2026-05-18T00:46:20.696247+00:00","updated_at":"2026-05-18T00:46:20.696247+00:00"}