{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TBKRG32OA2LFPLIMQTWI4LFRXO","short_pith_number":"pith:TBKRG32O","schema_version":"1.0","canonical_sha256":"9855136f4e069657ad0c84ec8e2cb1bb8f6eba7635c5436445461d72315e9cef","source":{"kind":"arxiv","id":"1310.1493","version":3},"attestation_state":"computed","paper":{"title":"Gap Amplification for Small-Set Expansion via Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Prasad Raghavendra, Tselil Schramm","submitted_at":"2013-10-05T16:35:35Z","abstract_excerpt":"In this work, we achieve gap amplification for the Small-Set Expansion problem. Specifically, we show that an instance of the Small-Set Expansion Problem with completeness $\\epsilon$ and soundness $\\frac{1}{2}$ is at least as difficult as Small-Set Expansion with completeness $\\epsilon$ and soundness $f(\\epsilon)$, for any function $f(\\epsilon)$ which grows faster than $\\sqrt{\\epsilon}$. We achieve this amplification via random walks -- our gadget is the graph with adjacency matrix corresponding to a random walk on the original graph. An interesting feature of our reduction is that unlike gap "},"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":"1310.1493","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-05T16:35:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b6f2fbf877a587c18697bb082c4ec9a1d891d50d8e7295a36bc2064855d494a4","abstract_canon_sha256":"621db23beea4027a1e57efed995369b9e724d4ef354ad9a28afbbc15a1bc9123"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:27.265368Z","signature_b64":"So9mPwXBHiMNmKpNrrBm6qH8KQnMnE1PWfXCOqDZaIJhUmWmwY49Z0BllIvTOibDQbVJK46JZGgzk97mt/aiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9855136f4e069657ad0c84ec8e2cb1bb8f6eba7635c5436445461d72315e9cef","last_reissued_at":"2026-05-18T02:48:27.264683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:27.264683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gap Amplification for Small-Set Expansion via Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Prasad Raghavendra, Tselil Schramm","submitted_at":"2013-10-05T16:35:35Z","abstract_excerpt":"In this work, we achieve gap amplification for the Small-Set Expansion problem. Specifically, we show that an instance of the Small-Set Expansion Problem with completeness $\\epsilon$ and soundness $\\frac{1}{2}$ is at least as difficult as Small-Set Expansion with completeness $\\epsilon$ and soundness $f(\\epsilon)$, for any function $f(\\epsilon)$ which grows faster than $\\sqrt{\\epsilon}$. We achieve this amplification via random walks -- our gadget is the graph with adjacency matrix corresponding to a random walk on the original graph. An interesting feature of our reduction is that unlike gap "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1493","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":"1310.1493","created_at":"2026-05-18T02:48:27.264789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1493v3","created_at":"2026-05-18T02:48:27.264789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1493","created_at":"2026-05-18T02:48:27.264789+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBKRG32OA2LF","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBKRG32OA2LFPLIM","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBKRG32O","created_at":"2026-05-18T12:27:59.945178+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/TBKRG32OA2LFPLIMQTWI4LFRXO","json":"https://pith.science/pith/TBKRG32OA2LFPLIMQTWI4LFRXO.json","graph_json":"https://pith.science/api/pith-number/TBKRG32OA2LFPLIMQTWI4LFRXO/graph.json","events_json":"https://pith.science/api/pith-number/TBKRG32OA2LFPLIMQTWI4LFRXO/events.json","paper":"https://pith.science/paper/TBKRG32O"},"agent_actions":{"view_html":"https://pith.science/pith/TBKRG32OA2LFPLIMQTWI4LFRXO","download_json":"https://pith.science/pith/TBKRG32OA2LFPLIMQTWI4LFRXO.json","view_paper":"https://pith.science/paper/TBKRG32O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1493&json=true","fetch_graph":"https://pith.science/api/pith-number/TBKRG32OA2LFPLIMQTWI4LFRXO/graph.json","fetch_events":"https://pith.science/api/pith-number/TBKRG32OA2LFPLIMQTWI4LFRXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBKRG32OA2LFPLIMQTWI4LFRXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBKRG32OA2LFPLIMQTWI4LFRXO/action/storage_attestation","attest_author":"https://pith.science/pith/TBKRG32OA2LFPLIMQTWI4LFRXO/action/author_attestation","sign_citation":"https://pith.science/pith/TBKRG32OA2LFPLIMQTWI4LFRXO/action/citation_signature","submit_replication":"https://pith.science/pith/TBKRG32OA2LFPLIMQTWI4LFRXO/action/replication_record"}},"created_at":"2026-05-18T02:48:27.264789+00:00","updated_at":"2026-05-18T02:48:27.264789+00:00"}