{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:STT7JGBDU4IWGTO6EEM7JLJRJZ","short_pith_number":"pith:STT7JGBD","schema_version":"1.0","canonical_sha256":"94e7f49823a711634dde2119f4ad314e680e08e4a54273fb1b021cf24b6b292e","source":{"kind":"arxiv","id":"2508.00893","version":1},"attestation_state":"computed","paper":{"title":"Multi-Community Spectral Clustering for Geometric Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.PR","math.SP","stat.ML"],"primary_cat":"cs.SI","authors_text":"Carlos Hoppen, Hariprasad Manjunath, Konstantin Avrachenkov, Lucas Siviero Sibemberg, Luiz Emilio Allem","submitted_at":"2025-07-27T14:09:00Z","abstract_excerpt":"In this paper, we consider the soft geometric block model (SGBM) with a fixed number $k \\geq 2$ of homogeneous communities in the dense regime, and we introduce a spectral clustering algorithm for community recovery on graphs generated by this model. Given such a graph, the algorithm produces an embedding into $\\mathbb{R}^{k-1}$ using the eigenvectors associated with the $k-1$ eigenvalues of the adjacency matrix of the graph that are closest to a value determined by the parameters of the model. It then applies $k$-means clustering to the embedding. We prove weak consistency and show that a sim"},"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":"2508.00893","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2025-07-27T14:09:00Z","cross_cats_sorted":["cs.LG","math.PR","math.SP","stat.ML"],"title_canon_sha256":"d592b967ac383f59f0197a34c459793f1be85827983e37285dc6652e66db0e67","abstract_canon_sha256":"f3f3e8566b009beb7229d540e331167d236c9c492315fd3a2c37c3f2da2a09e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:29.352740Z","signature_b64":"6KTDFRD+PiiJGob1OE5pDjfTVvC+G0BXMvM0oEVj1oOAuij/M4FoToUif6aeWmCZx2psXmkqDw0yU1cy0KGuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94e7f49823a711634dde2119f4ad314e680e08e4a54273fb1b021cf24b6b292e","last_reissued_at":"2026-07-05T11:47:29.352289Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:29.352289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Community Spectral Clustering for Geometric Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.PR","math.SP","stat.ML"],"primary_cat":"cs.SI","authors_text":"Carlos Hoppen, Hariprasad Manjunath, Konstantin Avrachenkov, Lucas Siviero Sibemberg, Luiz Emilio Allem","submitted_at":"2025-07-27T14:09:00Z","abstract_excerpt":"In this paper, we consider the soft geometric block model (SGBM) with a fixed number $k \\geq 2$ of homogeneous communities in the dense regime, and we introduce a spectral clustering algorithm for community recovery on graphs generated by this model. Given such a graph, the algorithm produces an embedding into $\\mathbb{R}^{k-1}$ using the eigenvectors associated with the $k-1$ eigenvalues of the adjacency matrix of the graph that are closest to a value determined by the parameters of the model. It then applies $k$-means clustering to the embedding. We prove weak consistency and show that a sim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.00893","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.00893/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":"2508.00893","created_at":"2026-07-05T11:47:29.352371+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.00893v1","created_at":"2026-07-05T11:47:29.352371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.00893","created_at":"2026-07-05T11:47:29.352371+00:00"},{"alias_kind":"pith_short_12","alias_value":"STT7JGBDU4IW","created_at":"2026-07-05T11:47:29.352371+00:00"},{"alias_kind":"pith_short_16","alias_value":"STT7JGBDU4IWGTO6","created_at":"2026-07-05T11:47:29.352371+00:00"},{"alias_kind":"pith_short_8","alias_value":"STT7JGBD","created_at":"2026-07-05T11:47:29.352371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.11321","citing_title":"Spectral graph clustering with inhomogeneous latent geometry","ref_index":2025,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/STT7JGBDU4IWGTO6EEM7JLJRJZ","json":"https://pith.science/pith/STT7JGBDU4IWGTO6EEM7JLJRJZ.json","graph_json":"https://pith.science/api/pith-number/STT7JGBDU4IWGTO6EEM7JLJRJZ/graph.json","events_json":"https://pith.science/api/pith-number/STT7JGBDU4IWGTO6EEM7JLJRJZ/events.json","paper":"https://pith.science/paper/STT7JGBD"},"agent_actions":{"view_html":"https://pith.science/pith/STT7JGBDU4IWGTO6EEM7JLJRJZ","download_json":"https://pith.science/pith/STT7JGBDU4IWGTO6EEM7JLJRJZ.json","view_paper":"https://pith.science/paper/STT7JGBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.00893&json=true","fetch_graph":"https://pith.science/api/pith-number/STT7JGBDU4IWGTO6EEM7JLJRJZ/graph.json","fetch_events":"https://pith.science/api/pith-number/STT7JGBDU4IWGTO6EEM7JLJRJZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STT7JGBDU4IWGTO6EEM7JLJRJZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STT7JGBDU4IWGTO6EEM7JLJRJZ/action/storage_attestation","attest_author":"https://pith.science/pith/STT7JGBDU4IWGTO6EEM7JLJRJZ/action/author_attestation","sign_citation":"https://pith.science/pith/STT7JGBDU4IWGTO6EEM7JLJRJZ/action/citation_signature","submit_replication":"https://pith.science/pith/STT7JGBDU4IWGTO6EEM7JLJRJZ/action/replication_record"}},"created_at":"2026-07-05T11:47:29.352371+00:00","updated_at":"2026-07-05T11:47:29.352371+00:00"}