{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XSTJTAX7LGWKNAHTXDBWHYWDBL","short_pith_number":"pith:XSTJTAX7","schema_version":"1.0","canonical_sha256":"bca69982ff59aca680f3b8c363e2c30ad940d6868ca9c177c5f3bcefcd069f6f","source":{"kind":"arxiv","id":"2007.02377","version":1},"attestation_state":"computed","paper":{"title":"New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Philip N. Klein, Vincent Cohen-Addad","submitted_at":"2020-07-05T16:26:27Z","abstract_excerpt":"The Sparsest Cut is a fundamental optimization problem that has been extensively studied. For planar inputs the problem is in $P$ and can be solved in $\\tilde{O}(n^3)$ time if all vertex weights are $1$. Despite a significant amount of effort, the best algorithms date back to the early 90's and can only achieve $O(\\log n)$-approximation in $\\tilde{O}(n)$ time or a constant factor approximation in $\\tilde{O}(n^2)$ time [Rao, STOC92]. Our main result is an $\\Omega(n^{2-\\epsilon})$ lower bound for Sparsest Cut even in planar graphs with unit vertex weights, under the $(min,+)$-Convolution conject"},"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":"2007.02377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-05T16:26:27Z","cross_cats_sorted":[],"title_canon_sha256":"536074a3e07d04b3a60cc91ce4efdc72b529cce26cd837b74ac912d523f92400","abstract_canon_sha256":"bef1755ec1b7a4461b5228d9ceac507ac5fdb020be14a7a623bce263d55acbcf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:21.753818Z","signature_b64":"UdjCbFWsXXGGnNlPVTsyLKSTf9Kaa7OJ1F0xLb/eNaEP7PdcQSq4i3cWwpaWMrzq2cXZclCo5pN4W7Ld9hBvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bca69982ff59aca680f3b8c363e2c30ad940d6868ca9c177c5f3bcefcd069f6f","last_reissued_at":"2026-07-05T01:16:21.753365Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:21.753365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Philip N. Klein, Vincent Cohen-Addad","submitted_at":"2020-07-05T16:26:27Z","abstract_excerpt":"The Sparsest Cut is a fundamental optimization problem that has been extensively studied. For planar inputs the problem is in $P$ and can be solved in $\\tilde{O}(n^3)$ time if all vertex weights are $1$. Despite a significant amount of effort, the best algorithms date back to the early 90's and can only achieve $O(\\log n)$-approximation in $\\tilde{O}(n)$ time or a constant factor approximation in $\\tilde{O}(n^2)$ time [Rao, STOC92]. Our main result is an $\\Omega(n^{2-\\epsilon})$ lower bound for Sparsest Cut even in planar graphs with unit vertex weights, under the $(min,+)$-Convolution conject"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02377","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.02377/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.02377","created_at":"2026-07-05T01:16:21.753417+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.02377v1","created_at":"2026-07-05T01:16:21.753417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02377","created_at":"2026-07-05T01:16:21.753417+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSTJTAX7LGWK","created_at":"2026-07-05T01:16:21.753417+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSTJTAX7LGWKNAHT","created_at":"2026-07-05T01:16:21.753417+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSTJTAX7","created_at":"2026-07-05T01:16:21.753417+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/XSTJTAX7LGWKNAHTXDBWHYWDBL","json":"https://pith.science/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL.json","graph_json":"https://pith.science/api/pith-number/XSTJTAX7LGWKNAHTXDBWHYWDBL/graph.json","events_json":"https://pith.science/api/pith-number/XSTJTAX7LGWKNAHTXDBWHYWDBL/events.json","paper":"https://pith.science/paper/XSTJTAX7"},"agent_actions":{"view_html":"https://pith.science/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL","download_json":"https://pith.science/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL.json","view_paper":"https://pith.science/paper/XSTJTAX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.02377&json=true","fetch_graph":"https://pith.science/api/pith-number/XSTJTAX7LGWKNAHTXDBWHYWDBL/graph.json","fetch_events":"https://pith.science/api/pith-number/XSTJTAX7LGWKNAHTXDBWHYWDBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL/action/storage_attestation","attest_author":"https://pith.science/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL/action/author_attestation","sign_citation":"https://pith.science/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL/action/citation_signature","submit_replication":"https://pith.science/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL/action/replication_record"}},"created_at":"2026-07-05T01:16:21.753417+00:00","updated_at":"2026-07-05T01:16:21.753417+00:00"}