{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OEVZV7SCCZOYX4G4SRIHW6EOCZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1e33efa0341b4bff7add3a19fd634dd036662a84e7824e291fc12a38a00e24a0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2013-04-10T20:31:28Z","title_canon_sha256":"9142c28b0e3d0ade6641c03cb68e1eab4afb5fb135e59f01fea825b7ce55f758"},"schema_version":"1.0","source":{"id":"1304.3139","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3139","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3139v3","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3139","created_at":"2026-05-18T03:07:34Z"},{"alias_kind":"pith_short_12","alias_value":"OEVZV7SCCZOY","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OEVZV7SCCZOYX4G4","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OEVZV7SC","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:178986fd44dc219d5d56cba8d58a7d323316c63d4c8ad28fc0784d833601d4c7","target":"graph","created_at":"2026-05-18T03:07:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 >","authors_text":"Anand Louis, Prasad Raghavendra, Santosh Vempala","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2013-04-10T20:31:28Z","title":"The Complexity of Approximating Vertex Expansion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3139","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9b021948af7d1d2a3adb9a83a39c799835586e9a5579356be85d3ea65adc3f83","target":"record","created_at":"2026-05-18T03:07:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1e33efa0341b4bff7add3a19fd634dd036662a84e7824e291fc12a38a00e24a0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2013-04-10T20:31:28Z","title_canon_sha256":"9142c28b0e3d0ade6641c03cb68e1eab4afb5fb135e59f01fea825b7ce55f758"},"schema_version":"1.0","source":{"id":"1304.3139","kind":"arxiv","version":3}},"canonical_sha256":"712b9afe42165d8bf0dc94507b788e1666519fe384ef9133320e53ac362bc79d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"712b9afe42165d8bf0dc94507b788e1666519fe384ef9133320e53ac362bc79d","first_computed_at":"2026-05-18T03:07:34.271202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:34.271202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+HJDmlEAv7SUCykyGGfyYELqLdfwqb2MF/2aNySw9HtAINNAEsuWBU0MWm7xG0CEnxuaHz5laM3ncHmKN6FWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:34.271693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.3139","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b021948af7d1d2a3adb9a83a39c799835586e9a5579356be85d3ea65adc3f83","sha256:178986fd44dc219d5d56cba8d58a7d323316c63d4c8ad28fc0784d833601d4c7"],"state_sha256":"fed5d9dd8256e4ef920b8ea6845f0ba1542a28b98416867d80d2fb4c029228d3"}