{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:XSTJTAX7LGWKNAHTXDBWHYWDBL","short_pith_number":"pith:XSTJTAX7","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"},"canonical_sha256":"bca69982ff59aca680f3b8c363e2c30ad940d6868ca9c177c5f3bcefcd069f6f","source":{"kind":"arxiv","id":"2007.02377","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.02377","created_at":"2026-07-05T01:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"2007.02377v1","created_at":"2026-07-05T01:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02377","created_at":"2026-07-05T01:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"XSTJTAX7LGWK","created_at":"2026-07-05T01:16:21Z"},{"alias_kind":"pith_short_16","alias_value":"XSTJTAX7LGWKNAHT","created_at":"2026-07-05T01:16:21Z"},{"alias_kind":"pith_short_8","alias_value":"XSTJTAX7","created_at":"2026-07-05T01:16:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:XSTJTAX7LGWKNAHTXDBWHYWDBL","target":"record","payload":{"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"},"canonical_sha256":"bca69982ff59aca680f3b8c363e2c30ad940d6868ca9c177c5f3bcefcd069f6f","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"},"source_kind":"arxiv","source_id":"2007.02377","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oW64ojnCi0Tih55mGozrq/w9KOwOuhZVMNRJNcO9bZ1Rl0DpAfftS/lsiNw+5YxBEsgaxx+mwMaZ0LauCcyKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T12:24:59.383654Z"},"content_sha256":"33d5f700b2110c1a67402d37fa189586a245442cab083760e5e287cba17629db","schema_version":"1.0","event_id":"sha256:33d5f700b2110c1a67402d37fa189586a245442cab083760e5e287cba17629db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:XSTJTAX7LGWKNAHTXDBWHYWDBL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jdoWfYCOoNEOzZFPakG/EO8Y4Gg0PVveaSD14HDtUUi//BJSFS2erlSrphSWwd4mwru28JEsgKAfyZyB0TN2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T12:24:59.384205Z"},"content_sha256":"902928746fe5c41ebc2a05e188647301d77b3c9cc1fcc424fc9de866f1577910","schema_version":"1.0","event_id":"sha256:902928746fe5c41ebc2a05e188647301d77b3c9cc1fcc424fc9de866f1577910"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL/bundle.json","state_url":"https://pith.science/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-02T12:24:59Z","links":{"resolver":"https://pith.science/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL","bundle":"https://pith.science/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL/bundle.json","state":"https://pith.science/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSTJTAX7LGWKNAHTXDBWHYWDBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XSTJTAX7LGWKNAHTXDBWHYWDBL","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":"bef1755ec1b7a4461b5228d9ceac507ac5fdb020be14a7a623bce263d55acbcf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-05T16:26:27Z","title_canon_sha256":"536074a3e07d04b3a60cc91ce4efdc72b529cce26cd837b74ac912d523f92400"},"schema_version":"1.0","source":{"id":"2007.02377","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.02377","created_at":"2026-07-05T01:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"2007.02377v1","created_at":"2026-07-05T01:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02377","created_at":"2026-07-05T01:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"XSTJTAX7LGWK","created_at":"2026-07-05T01:16:21Z"},{"alias_kind":"pith_short_16","alias_value":"XSTJTAX7LGWKNAHT","created_at":"2026-07-05T01:16:21Z"},{"alias_kind":"pith_short_8","alias_value":"XSTJTAX7","created_at":"2026-07-05T01:16:21Z"}],"graph_snapshots":[{"event_id":"sha256:902928746fe5c41ebc2a05e188647301d77b3c9cc1fcc424fc9de866f1577910","target":"graph","created_at":"2026-07-05T01:16:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.02377/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Amir Abboud, Philip N. Klein, Vincent Cohen-Addad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-05T16:26:27Z","title":"New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02377","kind":"arxiv","version":1},"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:33d5f700b2110c1a67402d37fa189586a245442cab083760e5e287cba17629db","target":"record","created_at":"2026-07-05T01:16:21Z","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":"bef1755ec1b7a4461b5228d9ceac507ac5fdb020be14a7a623bce263d55acbcf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-05T16:26:27Z","title_canon_sha256":"536074a3e07d04b3a60cc91ce4efdc72b529cce26cd837b74ac912d523f92400"},"schema_version":"1.0","source":{"id":"2007.02377","kind":"arxiv","version":1}},"canonical_sha256":"bca69982ff59aca680f3b8c363e2c30ad940d6868ca9c177c5f3bcefcd069f6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bca69982ff59aca680f3b8c363e2c30ad940d6868ca9c177c5f3bcefcd069f6f","first_computed_at":"2026-07-05T01:16:21.753365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:16:21.753365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UdjCbFWsXXGGnNlPVTsyLKSTf9Kaa7OJ1F0xLb/eNaEP7PdcQSq4i3cWwpaWMrzq2cXZclCo5pN4W7Ld9hBvAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:16:21.753818Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.02377","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33d5f700b2110c1a67402d37fa189586a245442cab083760e5e287cba17629db","sha256:902928746fe5c41ebc2a05e188647301d77b3c9cc1fcc424fc9de866f1577910"],"state_sha256":"726bec48cb01a4844158291e429d39599ae01cab8460846116cac5c0d421c684"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FqcBryV0V3snL1x3IQzk+NObL07LM17jwu3LyjqESDvivSpq3Nrde25wz75hqjFjzQq0v/Y5hxg2j5DGpp8RCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-02T12:24:59.389169Z","bundle_sha256":"06fe63f1b4cac508b7d9e71680de6f7a1d0196a851d971f7f8befacd5989c893"}}