{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DUK4NPC24ZZNGBHM4NOP2MW3CF","short_pith_number":"pith:DUK4NPC2","schema_version":"1.0","canonical_sha256":"1d15c6bc5ae672d304ece35cfd32db116d464ead1bd3284a296f5d3d380ad7b6","source":{"kind":"arxiv","id":"1304.8132","version":2},"attestation_state":"computed","paper":{"title":"Local Graph Clustering Beyond Cheeger's Inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Silvio Lattanzi, Vahab Mirrokni, Zeyuan Allen Zhu","submitted_at":"2013-04-30T19:57:36Z","abstract_excerpt":"Motivated by applications of large-scale graph clustering, we study random-walk-based LOCAL algorithms whose running times depend only on the size of the output cluster, rather than the entire graph. All previously known such algorithms guarantee an output conductance of $\\tilde{O}(\\sqrt{\\phi(A)})$ when the target set $A$ has conductance $\\phi(A)\\in[0,1]$. In this paper, we improve it to $$\\tilde{O}\\bigg( \\min\\Big\\{\\sqrt{\\phi(A)}, \\frac{\\phi(A)}{\\sqrt{\\mathsf{Conn}(A)}} \\Big\\} \\bigg)\\enspace, $$ where the internal connectivity parameter $\\mathsf{Conn}(A) \\in [0,1]$ is defined as the reciprocal"},"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":"1304.8132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-30T19:57:36Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e3274b43ff937536791418e794c104dc25ef85158e6fdfee6fe4068b8e78bb56","abstract_canon_sha256":"dc5e5d0f2339d69e259107154760650eb6ff663c5c5ee85e219ef8cc898bb222"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:44.365055Z","signature_b64":"Bj+UMX5eJQ7QntBupB0zHHVgK5W68+S/VANomn1j1oMqDeIaTnwU9YDcRGk7OiCXepi5imbBZWkeWCXdZGqGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d15c6bc5ae672d304ece35cfd32db116d464ead1bd3284a296f5d3d380ad7b6","last_reissued_at":"2026-05-18T03:07:44.364380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:44.364380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Graph Clustering Beyond Cheeger's Inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Silvio Lattanzi, Vahab Mirrokni, Zeyuan Allen Zhu","submitted_at":"2013-04-30T19:57:36Z","abstract_excerpt":"Motivated by applications of large-scale graph clustering, we study random-walk-based LOCAL algorithms whose running times depend only on the size of the output cluster, rather than the entire graph. All previously known such algorithms guarantee an output conductance of $\\tilde{O}(\\sqrt{\\phi(A)})$ when the target set $A$ has conductance $\\phi(A)\\in[0,1]$. In this paper, we improve it to $$\\tilde{O}\\bigg( \\min\\Big\\{\\sqrt{\\phi(A)}, \\frac{\\phi(A)}{\\sqrt{\\mathsf{Conn}(A)}} \\Big\\} \\bigg)\\enspace, $$ where the internal connectivity parameter $\\mathsf{Conn}(A) \\in [0,1]$ is defined as the reciprocal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.8132","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":"1304.8132","created_at":"2026-05-18T03:07:44.364503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.8132v2","created_at":"2026-05-18T03:07:44.364503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.8132","created_at":"2026-05-18T03:07:44.364503+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUK4NPC24ZZN","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUK4NPC24ZZNGBHM","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUK4NPC2","created_at":"2026-05-18T12:27:43.054852+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/DUK4NPC24ZZNGBHM4NOP2MW3CF","json":"https://pith.science/pith/DUK4NPC24ZZNGBHM4NOP2MW3CF.json","graph_json":"https://pith.science/api/pith-number/DUK4NPC24ZZNGBHM4NOP2MW3CF/graph.json","events_json":"https://pith.science/api/pith-number/DUK4NPC24ZZNGBHM4NOP2MW3CF/events.json","paper":"https://pith.science/paper/DUK4NPC2"},"agent_actions":{"view_html":"https://pith.science/pith/DUK4NPC24ZZNGBHM4NOP2MW3CF","download_json":"https://pith.science/pith/DUK4NPC24ZZNGBHM4NOP2MW3CF.json","view_paper":"https://pith.science/paper/DUK4NPC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.8132&json=true","fetch_graph":"https://pith.science/api/pith-number/DUK4NPC24ZZNGBHM4NOP2MW3CF/graph.json","fetch_events":"https://pith.science/api/pith-number/DUK4NPC24ZZNGBHM4NOP2MW3CF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUK4NPC24ZZNGBHM4NOP2MW3CF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUK4NPC24ZZNGBHM4NOP2MW3CF/action/storage_attestation","attest_author":"https://pith.science/pith/DUK4NPC24ZZNGBHM4NOP2MW3CF/action/author_attestation","sign_citation":"https://pith.science/pith/DUK4NPC24ZZNGBHM4NOP2MW3CF/action/citation_signature","submit_replication":"https://pith.science/pith/DUK4NPC24ZZNGBHM4NOP2MW3CF/action/replication_record"}},"created_at":"2026-05-18T03:07:44.364503+00:00","updated_at":"2026-05-18T03:07:44.364503+00:00"}