{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ARPKGQHAJYLPU43CLOVKK2ODQN","short_pith_number":"pith:ARPKGQHA","schema_version":"1.0","canonical_sha256":"045ea340e04e16fa73625baaa569c38351e89f9906695b1c59d61767cad7c719","source":{"kind":"arxiv","id":"1304.3365","version":1},"attestation_state":"computed","paper":{"title":"Towards a better approximation for sparsest cut?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ali Kemal Sinop, Rong Ge, Sanjeev Arora","submitted_at":"2013-04-11T16:51:07Z","abstract_excerpt":"We give a new $(1+\\epsilon)$-approximation for sparsest cut problem on graphs where small sets expand significantly more than the sparsest cut (sets of size $n/r$ expand by a factor $\\sqrt{\\log n\\log r}$ bigger, for some small $r$; this condition holds for many natural graph families). We give two different algorithms. One involves Guruswami-Sinop rounding on the level-$r$ Lasserre relaxation. The other is combinatorial and involves a new notion called {\\em Small Set Expander Flows} (inspired by the {\\em expander flows} of ARV) which we show exists in the input graph. Both algorithms run in ti"},"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.3365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-11T16:51:07Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e70e8e1335204f5317662c65b74dd924221e3890b5d3b7ac75248d6d9bc89f23","abstract_canon_sha256":"7d3e9ca1b80ee90681abe91cebca843f52254e69951c11138b31e9a07446acaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:17.908535Z","signature_b64":"kkgtNxf847pqLrPGL9Dt6/CYAdNxFnu670AzrjrJPnO6xb0xehDRqNzA1vPaR0yK0KS/rg8gSy6wzi9GDm6pBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"045ea340e04e16fa73625baaa569c38351e89f9906695b1c59d61767cad7c719","last_reissued_at":"2026-05-18T03:28:17.907997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:17.907997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a better approximation for sparsest cut?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ali Kemal Sinop, Rong Ge, Sanjeev Arora","submitted_at":"2013-04-11T16:51:07Z","abstract_excerpt":"We give a new $(1+\\epsilon)$-approximation for sparsest cut problem on graphs where small sets expand significantly more than the sparsest cut (sets of size $n/r$ expand by a factor $\\sqrt{\\log n\\log r}$ bigger, for some small $r$; this condition holds for many natural graph families). We give two different algorithms. One involves Guruswami-Sinop rounding on the level-$r$ Lasserre relaxation. The other is combinatorial and involves a new notion called {\\em Small Set Expander Flows} (inspired by the {\\em expander flows} of ARV) which we show exists in the input graph. Both algorithms run in ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3365","kind":"arxiv","version":1},"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.3365","created_at":"2026-05-18T03:28:17.908078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.3365v1","created_at":"2026-05-18T03:28:17.908078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3365","created_at":"2026-05-18T03:28:17.908078+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARPKGQHAJYLP","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARPKGQHAJYLPU43C","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARPKGQHA","created_at":"2026-05-18T12:27:38.830355+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/ARPKGQHAJYLPU43CLOVKK2ODQN","json":"https://pith.science/pith/ARPKGQHAJYLPU43CLOVKK2ODQN.json","graph_json":"https://pith.science/api/pith-number/ARPKGQHAJYLPU43CLOVKK2ODQN/graph.json","events_json":"https://pith.science/api/pith-number/ARPKGQHAJYLPU43CLOVKK2ODQN/events.json","paper":"https://pith.science/paper/ARPKGQHA"},"agent_actions":{"view_html":"https://pith.science/pith/ARPKGQHAJYLPU43CLOVKK2ODQN","download_json":"https://pith.science/pith/ARPKGQHAJYLPU43CLOVKK2ODQN.json","view_paper":"https://pith.science/paper/ARPKGQHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.3365&json=true","fetch_graph":"https://pith.science/api/pith-number/ARPKGQHAJYLPU43CLOVKK2ODQN/graph.json","fetch_events":"https://pith.science/api/pith-number/ARPKGQHAJYLPU43CLOVKK2ODQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARPKGQHAJYLPU43CLOVKK2ODQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARPKGQHAJYLPU43CLOVKK2ODQN/action/storage_attestation","attest_author":"https://pith.science/pith/ARPKGQHAJYLPU43CLOVKK2ODQN/action/author_attestation","sign_citation":"https://pith.science/pith/ARPKGQHAJYLPU43CLOVKK2ODQN/action/citation_signature","submit_replication":"https://pith.science/pith/ARPKGQHAJYLPU43CLOVKK2ODQN/action/replication_record"}},"created_at":"2026-05-18T03:28:17.908078+00:00","updated_at":"2026-05-18T03:28:17.908078+00:00"}