{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BK4BZDZ3I7YUXRRM6RUS24FBW6","short_pith_number":"pith:BK4BZDZ3","schema_version":"1.0","canonical_sha256":"0ab81c8f3b47f14bc62cf4692d70a1b7a95a293a7bea4be4aaf66cf73b4211fe","source":{"kind":"arxiv","id":"1509.09188","version":5},"attestation_state":"computed","paper":{"title":"Approximate Spectral Clustering: Efficiency and Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Kurt Mehlhorn, Pavel Kolev","submitted_at":"2015-09-30T14:20:44Z","abstract_excerpt":"Approximate Spectral Clustering (ASC) is a popular and successful heuristic for partitioning the nodes of a graph $G$ into clusters for which the ratio of outside connections compared to the volume (sum of degrees) is small. ASC consists of the following two subroutines: i) compute an approximate Spectral Embedding via the Power method; and ii) partition the resulting vector set with an approximate $k$-means clustering algorithm. The resulting $k$-means partition naturally induces a $k$-way node partition of $G$.\n  We give a comprehensive analysis of ASC building on the work of Peng et al.~(SI"},"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":"1509.09188","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-09-30T14:20:44Z","cross_cats_sorted":[],"title_canon_sha256":"f13ee0b33a4c0b6efd6ae09d036bc4873231063e9d977999f3096ffb60631d21","abstract_canon_sha256":"09fec0f492ea97ce2238830a59cc557cbae9ea3794d1cfa6d288ccd2af73f271"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:36.915775Z","signature_b64":"d1Jtxk9rHvrzll9xht067sfXP1x4oDrRHS/1Dx8eiLC0L8cSS3UQ00jqB0/pfmsf/729pjjd1eSCLL5mdQWvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ab81c8f3b47f14bc62cf4692d70a1b7a95a293a7bea4be4aaf66cf73b4211fe","last_reissued_at":"2026-05-18T00:09:36.915108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:36.915108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Spectral Clustering: Efficiency and Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Kurt Mehlhorn, Pavel Kolev","submitted_at":"2015-09-30T14:20:44Z","abstract_excerpt":"Approximate Spectral Clustering (ASC) is a popular and successful heuristic for partitioning the nodes of a graph $G$ into clusters for which the ratio of outside connections compared to the volume (sum of degrees) is small. ASC consists of the following two subroutines: i) compute an approximate Spectral Embedding via the Power method; and ii) partition the resulting vector set with an approximate $k$-means clustering algorithm. The resulting $k$-means partition naturally induces a $k$-way node partition of $G$.\n  We give a comprehensive analysis of ASC building on the work of Peng et al.~(SI"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09188","kind":"arxiv","version":5},"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":"1509.09188","created_at":"2026-05-18T00:09:36.915208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.09188v5","created_at":"2026-05-18T00:09:36.915208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09188","created_at":"2026-05-18T00:09:36.915208+00:00"},{"alias_kind":"pith_short_12","alias_value":"BK4BZDZ3I7YU","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BK4BZDZ3I7YUXRRM","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BK4BZDZ3","created_at":"2026-05-18T12:29:14.074870+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/BK4BZDZ3I7YUXRRM6RUS24FBW6","json":"https://pith.science/pith/BK4BZDZ3I7YUXRRM6RUS24FBW6.json","graph_json":"https://pith.science/api/pith-number/BK4BZDZ3I7YUXRRM6RUS24FBW6/graph.json","events_json":"https://pith.science/api/pith-number/BK4BZDZ3I7YUXRRM6RUS24FBW6/events.json","paper":"https://pith.science/paper/BK4BZDZ3"},"agent_actions":{"view_html":"https://pith.science/pith/BK4BZDZ3I7YUXRRM6RUS24FBW6","download_json":"https://pith.science/pith/BK4BZDZ3I7YUXRRM6RUS24FBW6.json","view_paper":"https://pith.science/paper/BK4BZDZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.09188&json=true","fetch_graph":"https://pith.science/api/pith-number/BK4BZDZ3I7YUXRRM6RUS24FBW6/graph.json","fetch_events":"https://pith.science/api/pith-number/BK4BZDZ3I7YUXRRM6RUS24FBW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BK4BZDZ3I7YUXRRM6RUS24FBW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BK4BZDZ3I7YUXRRM6RUS24FBW6/action/storage_attestation","attest_author":"https://pith.science/pith/BK4BZDZ3I7YUXRRM6RUS24FBW6/action/author_attestation","sign_citation":"https://pith.science/pith/BK4BZDZ3I7YUXRRM6RUS24FBW6/action/citation_signature","submit_replication":"https://pith.science/pith/BK4BZDZ3I7YUXRRM6RUS24FBW6/action/replication_record"}},"created_at":"2026-05-18T00:09:36.915208+00:00","updated_at":"2026-05-18T00:09:36.915208+00:00"}