{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KEKQM3WUAWUJWNUBIGAWPVQZ4C","short_pith_number":"pith:KEKQM3WU","schema_version":"1.0","canonical_sha256":"5115066ed405a89b3681418167d619e0bd3517c651abee073ea051ed3f2d2e41","source":{"kind":"arxiv","id":"1112.4109","version":4},"attestation_state":"computed","paper":{"title":"Approximating Non-Uniform Sparsest Cut via Generalized Spectra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Kemal Sinop, Venkatesan Guruswami","submitted_at":"2011-12-18T02:41:12Z","abstract_excerpt":"We give an approximation algorithm for non-uniform sparsest cut with the following guarantee: For any $\\epsilon,\\delta \\in (0,1)$, given cost and demand graphs with edge weights $C, D$ respectively, we can find a set $T\\subseteq V$ with $\\frac{C(T,V\\setminus T)}{D(T,V\\setminus T)}$ at most $\\frac{1+\\epsilon}{\\delta}$ times the optimal non-uniform sparsest cut value, in time $2^{r/(\\delta\\epsilon)}\\poly(n)$ provided $\\lambda_r \\ge \\Phi^*/(1-\\delta)$. Here $\\lambda_r$ is the $r$'th smallest generalized eigenvalue of the Laplacian matrices of cost and demand graphs; $C(T,V\\setminus T)$ (resp. $D("},"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":"1112.4109","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-18T02:41:12Z","cross_cats_sorted":[],"title_canon_sha256":"1d85e41a1a4167ec86c2d6eaa302c85b06a715e55e8c89ff4444930841b69513","abstract_canon_sha256":"a4e1e24e983d85ebf28590e40f50a38e9bdbd3ee172289b9a9ba7d7feb4236f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:27.140103Z","signature_b64":"S2xpwz7Ys4pxV4Q771bvfRiB4NLCXiSrUvf1xLD6zDacWSS/PPQODg6i+Q4TS1ySP7vkGCmIdlr4S47ui4JqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5115066ed405a89b3681418167d619e0bd3517c651abee073ea051ed3f2d2e41","last_reissued_at":"2026-05-18T02:21:27.139477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:27.139477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Non-Uniform Sparsest Cut via Generalized Spectra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Kemal Sinop, Venkatesan Guruswami","submitted_at":"2011-12-18T02:41:12Z","abstract_excerpt":"We give an approximation algorithm for non-uniform sparsest cut with the following guarantee: For any $\\epsilon,\\delta \\in (0,1)$, given cost and demand graphs with edge weights $C, D$ respectively, we can find a set $T\\subseteq V$ with $\\frac{C(T,V\\setminus T)}{D(T,V\\setminus T)}$ at most $\\frac{1+\\epsilon}{\\delta}$ times the optimal non-uniform sparsest cut value, in time $2^{r/(\\delta\\epsilon)}\\poly(n)$ provided $\\lambda_r \\ge \\Phi^*/(1-\\delta)$. Here $\\lambda_r$ is the $r$'th smallest generalized eigenvalue of the Laplacian matrices of cost and demand graphs; $C(T,V\\setminus T)$ (resp. $D("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4109","kind":"arxiv","version":4},"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":"1112.4109","created_at":"2026-05-18T02:21:27.139569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.4109v4","created_at":"2026-05-18T02:21:27.139569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4109","created_at":"2026-05-18T02:21:27.139569+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEKQM3WUAWUJ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEKQM3WUAWUJWNUB","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEKQM3WU","created_at":"2026-05-18T12:26:32.869790+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/KEKQM3WUAWUJWNUBIGAWPVQZ4C","json":"https://pith.science/pith/KEKQM3WUAWUJWNUBIGAWPVQZ4C.json","graph_json":"https://pith.science/api/pith-number/KEKQM3WUAWUJWNUBIGAWPVQZ4C/graph.json","events_json":"https://pith.science/api/pith-number/KEKQM3WUAWUJWNUBIGAWPVQZ4C/events.json","paper":"https://pith.science/paper/KEKQM3WU"},"agent_actions":{"view_html":"https://pith.science/pith/KEKQM3WUAWUJWNUBIGAWPVQZ4C","download_json":"https://pith.science/pith/KEKQM3WUAWUJWNUBIGAWPVQZ4C.json","view_paper":"https://pith.science/paper/KEKQM3WU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.4109&json=true","fetch_graph":"https://pith.science/api/pith-number/KEKQM3WUAWUJWNUBIGAWPVQZ4C/graph.json","fetch_events":"https://pith.science/api/pith-number/KEKQM3WUAWUJWNUBIGAWPVQZ4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEKQM3WUAWUJWNUBIGAWPVQZ4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEKQM3WUAWUJWNUBIGAWPVQZ4C/action/storage_attestation","attest_author":"https://pith.science/pith/KEKQM3WUAWUJWNUBIGAWPVQZ4C/action/author_attestation","sign_citation":"https://pith.science/pith/KEKQM3WUAWUJWNUBIGAWPVQZ4C/action/citation_signature","submit_replication":"https://pith.science/pith/KEKQM3WUAWUJWNUBIGAWPVQZ4C/action/replication_record"}},"created_at":"2026-05-18T02:21:27.139569+00:00","updated_at":"2026-05-18T02:21:27.139569+00:00"}