{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OEVZV7SCCZOYX4G4SRIHW6EOCZ","short_pith_number":"pith:OEVZV7SC","schema_version":"1.0","canonical_sha256":"712b9afe42165d8bf0dc94507b788e1666519fe384ef9133320e53ac362bc79d","source":{"kind":"arxiv","id":"1304.3139","version":3},"attestation_state":"computed","paper":{"title":"The Complexity of Approximating Vertex Expansion","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anand Louis, Prasad Raghavendra, Santosh Vempala","submitted_at":"2013-04-10T20:31:28Z","abstract_excerpt":"We study the complexity of approximating the vertex expansion of graphs $G = (V,E)$, defined as \\[ \\Phi^V := \\min_{S \\subset V} n \\cdot \\frac{|N(S)|}{|S| |V \\backslash S|}. \\]\n  We give a simple polynomial-time algorithm for finding a subset with vertex expansion $O(\\sqrt{OPT \\log d})$ where $d$ is the maximum degree of the graph. Our main result is an asymptotically matching lower bound: under the Small Set Expansion (SSE) hypothesis, it is hard to find a subset with expansion less than $C\\sqrt{OPT \\log d}$ for an absolute constant $C$. In particular, this implies for all constant $\\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":"1304.3139","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2013-04-10T20:31:28Z","cross_cats_sorted":[],"title_canon_sha256":"9142c28b0e3d0ade6641c03cb68e1eab4afb5fb135e59f01fea825b7ce55f758","abstract_canon_sha256":"1e33efa0341b4bff7add3a19fd634dd036662a84e7824e291fc12a38a00e24a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:34.271693Z","signature_b64":"+HJDmlEAv7SUCykyGGfyYELqLdfwqb2MF/2aNySw9HtAINNAEsuWBU0MWm7xG0CEnxuaHz5laM3ncHmKN6FWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"712b9afe42165d8bf0dc94507b788e1666519fe384ef9133320e53ac362bc79d","last_reissued_at":"2026-05-18T03:07:34.271202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:34.271202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Approximating Vertex Expansion","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anand Louis, Prasad Raghavendra, Santosh Vempala","submitted_at":"2013-04-10T20:31:28Z","abstract_excerpt":"We study the complexity of approximating the vertex expansion of graphs $G = (V,E)$, defined as \\[ \\Phi^V := \\min_{S \\subset V} n \\cdot \\frac{|N(S)|}{|S| |V \\backslash S|}. \\]\n  We give a simple polynomial-time algorithm for finding a subset with vertex expansion $O(\\sqrt{OPT \\log d})$ where $d$ is the maximum degree of the graph. Our main result is an asymptotically matching lower bound: under the Small Set Expansion (SSE) hypothesis, it is hard to find a subset with expansion less than $C\\sqrt{OPT \\log d}$ for an absolute constant $C$. In particular, this implies for all constant $\\epsilon >"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3139","kind":"arxiv","version":3},"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.3139","created_at":"2026-05-18T03:07:34.271307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.3139v3","created_at":"2026-05-18T03:07:34.271307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3139","created_at":"2026-05-18T03:07:34.271307+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEVZV7SCCZOY","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEVZV7SCCZOYX4G4","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEVZV7SC","created_at":"2026-05-18T12:27:54.935989+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/OEVZV7SCCZOYX4G4SRIHW6EOCZ","json":"https://pith.science/pith/OEVZV7SCCZOYX4G4SRIHW6EOCZ.json","graph_json":"https://pith.science/api/pith-number/OEVZV7SCCZOYX4G4SRIHW6EOCZ/graph.json","events_json":"https://pith.science/api/pith-number/OEVZV7SCCZOYX4G4SRIHW6EOCZ/events.json","paper":"https://pith.science/paper/OEVZV7SC"},"agent_actions":{"view_html":"https://pith.science/pith/OEVZV7SCCZOYX4G4SRIHW6EOCZ","download_json":"https://pith.science/pith/OEVZV7SCCZOYX4G4SRIHW6EOCZ.json","view_paper":"https://pith.science/paper/OEVZV7SC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.3139&json=true","fetch_graph":"https://pith.science/api/pith-number/OEVZV7SCCZOYX4G4SRIHW6EOCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OEVZV7SCCZOYX4G4SRIHW6EOCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEVZV7SCCZOYX4G4SRIHW6EOCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEVZV7SCCZOYX4G4SRIHW6EOCZ/action/storage_attestation","attest_author":"https://pith.science/pith/OEVZV7SCCZOYX4G4SRIHW6EOCZ/action/author_attestation","sign_citation":"https://pith.science/pith/OEVZV7SCCZOYX4G4SRIHW6EOCZ/action/citation_signature","submit_replication":"https://pith.science/pith/OEVZV7SCCZOYX4G4SRIHW6EOCZ/action/replication_record"}},"created_at":"2026-05-18T03:07:34.271307+00:00","updated_at":"2026-05-18T03:07:34.271307+00:00"}