{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:25F6GIFE3NLXBOJT72QH6WXQR6","short_pith_number":"pith:25F6GIFE","schema_version":"1.0","canonical_sha256":"d74be320a4db5770b933fea07f5af08fae87976f4858e0b73f6e08e36a4ddbef","source":{"kind":"arxiv","id":"2101.05549","version":2},"attestation_state":"computed","paper":{"title":"Spectral Clustering Oracles in Sublinear Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aida Mousavifar, Christian Sohler, Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi","submitted_at":"2021-01-14T11:09:26Z","abstract_excerpt":"Given a graph $G$ that can be partitioned into $k$ disjoint expanders with outer conductance upper bounded by $\\epsilon\\ll 1$, can we efficiently construct a small space data structure that allows quickly classifying vertices of $G$ according to the expander (cluster) they belong to? Formally, we would like an efficient local computation algorithm that misclassifies at most an $O(\\epsilon)$ fraction of vertices in every expander. We refer to such a data structure as a \\textit{spectral clustering oracle}. Our main result is a spectral clustering oracle with query time $O^*(n^{1/2+O(\\epsilon)})$"},"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":"2101.05549","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-01-14T11:09:26Z","cross_cats_sorted":[],"title_canon_sha256":"3acfb740ee3d25d8716e5c080c7de0c009167953f9980214789067e229b7c929","abstract_canon_sha256":"843e05fe8dd68dde1b667dd63284a6e8cc4ba0e342dcaf3de81b1a55da264f70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:38.472427Z","signature_b64":"Ft4M3XbP6kSeJ9kcpkHz61pTxL+N7LYzy3eYl8AyV8OjX5sF7H3i+egWfJm8SUXYKf/CiDV7pXz2dzSU216wCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d74be320a4db5770b933fea07f5af08fae87976f4858e0b73f6e08e36a4ddbef","last_reissued_at":"2026-07-05T03:23:38.472000Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:38.472000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Clustering Oracles in Sublinear Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aida Mousavifar, Christian Sohler, Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi","submitted_at":"2021-01-14T11:09:26Z","abstract_excerpt":"Given a graph $G$ that can be partitioned into $k$ disjoint expanders with outer conductance upper bounded by $\\epsilon\\ll 1$, can we efficiently construct a small space data structure that allows quickly classifying vertices of $G$ according to the expander (cluster) they belong to? Formally, we would like an efficient local computation algorithm that misclassifies at most an $O(\\epsilon)$ fraction of vertices in every expander. We refer to such a data structure as a \\textit{spectral clustering oracle}. Our main result is a spectral clustering oracle with query time $O^*(n^{1/2+O(\\epsilon)})$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.05549","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/2101.05549/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":"2101.05549","created_at":"2026-07-05T03:23:38.472055+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.05549v2","created_at":"2026-07-05T03:23:38.472055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.05549","created_at":"2026-07-05T03:23:38.472055+00:00"},{"alias_kind":"pith_short_12","alias_value":"25F6GIFE3NLX","created_at":"2026-07-05T03:23:38.472055+00:00"},{"alias_kind":"pith_short_16","alias_value":"25F6GIFE3NLXBOJT","created_at":"2026-07-05T03:23:38.472055+00:00"},{"alias_kind":"pith_short_8","alias_value":"25F6GIFE","created_at":"2026-07-05T03:23:38.472055+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/25F6GIFE3NLXBOJT72QH6WXQR6","json":"https://pith.science/pith/25F6GIFE3NLXBOJT72QH6WXQR6.json","graph_json":"https://pith.science/api/pith-number/25F6GIFE3NLXBOJT72QH6WXQR6/graph.json","events_json":"https://pith.science/api/pith-number/25F6GIFE3NLXBOJT72QH6WXQR6/events.json","paper":"https://pith.science/paper/25F6GIFE"},"agent_actions":{"view_html":"https://pith.science/pith/25F6GIFE3NLXBOJT72QH6WXQR6","download_json":"https://pith.science/pith/25F6GIFE3NLXBOJT72QH6WXQR6.json","view_paper":"https://pith.science/paper/25F6GIFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.05549&json=true","fetch_graph":"https://pith.science/api/pith-number/25F6GIFE3NLXBOJT72QH6WXQR6/graph.json","fetch_events":"https://pith.science/api/pith-number/25F6GIFE3NLXBOJT72QH6WXQR6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25F6GIFE3NLXBOJT72QH6WXQR6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25F6GIFE3NLXBOJT72QH6WXQR6/action/storage_attestation","attest_author":"https://pith.science/pith/25F6GIFE3NLXBOJT72QH6WXQR6/action/author_attestation","sign_citation":"https://pith.science/pith/25F6GIFE3NLXBOJT72QH6WXQR6/action/citation_signature","submit_replication":"https://pith.science/pith/25F6GIFE3NLXBOJT72QH6WXQR6/action/replication_record"}},"created_at":"2026-07-05T03:23:38.472055+00:00","updated_at":"2026-07-05T03:23:38.472055+00:00"}