{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:723VEBLRXWLTPDAC6V5LIPAIHT","short_pith_number":"pith:723VEBLR","schema_version":"1.0","canonical_sha256":"feb7520571bd97378c02f57ab43c083cdfb04d3da9cbd29465a1e611e1dd4672","source":{"kind":"arxiv","id":"1806.08283","version":1},"attestation_state":"computed","paper":{"title":"Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Markus Chimani, Tilo Wiedera","submitted_at":"2018-06-21T15:02:58Z","abstract_excerpt":"The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph $H$ of a given graph $G$ such that $H$ has maximum edge cardinality. For more than two decades, the only known non-trivial exact algorithm was based on integer linear programming and Kuratowski's famous planarity criterion. We build upon this approach and present new constraint classes, together with a lifting of the polyhedron, to obtain provably stronger LP-relaxations, and in turn faster algorithms in practice. The new constraints take Euler's polyhedron formula as a starting point and combine it with considering cycles "},"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":"1806.08283","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T15:02:58Z","cross_cats_sorted":[],"title_canon_sha256":"b8dbbc61c19269d9e39c154f5a4bee4e6e93f38cce2da2693302c2b4225778b1","abstract_canon_sha256":"91f61c251c7b6d29c7cc397ec1852ef41d38a6492c8ad37eacc91ddf54673cd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:41.499078Z","signature_b64":"UViS4g9Ct8RI5ONZmeNUegqkO5b6qGvKP4j30XQg/pWyj/DTXESEfRtvseOqAqLZffBrAbIwK0Ys1QDKjq0dBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"feb7520571bd97378c02f57ab43c083cdfb04d3da9cbd29465a1e611e1dd4672","last_reissued_at":"2026-05-18T00:12:41.498430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:41.498430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Markus Chimani, Tilo Wiedera","submitted_at":"2018-06-21T15:02:58Z","abstract_excerpt":"The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph $H$ of a given graph $G$ such that $H$ has maximum edge cardinality. For more than two decades, the only known non-trivial exact algorithm was based on integer linear programming and Kuratowski's famous planarity criterion. We build upon this approach and present new constraint classes, together with a lifting of the polyhedron, to obtain provably stronger LP-relaxations, and in turn faster algorithms in practice. The new constraints take Euler's polyhedron formula as a starting point and combine it with considering cycles "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08283","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":"1806.08283","created_at":"2026-05-18T00:12:41.498528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08283v1","created_at":"2026-05-18T00:12:41.498528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08283","created_at":"2026-05-18T00:12:41.498528+00:00"},{"alias_kind":"pith_short_12","alias_value":"723VEBLRXWLT","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"723VEBLRXWLTPDAC","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"723VEBLR","created_at":"2026-05-18T12:32:11.075285+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/723VEBLRXWLTPDAC6V5LIPAIHT","json":"https://pith.science/pith/723VEBLRXWLTPDAC6V5LIPAIHT.json","graph_json":"https://pith.science/api/pith-number/723VEBLRXWLTPDAC6V5LIPAIHT/graph.json","events_json":"https://pith.science/api/pith-number/723VEBLRXWLTPDAC6V5LIPAIHT/events.json","paper":"https://pith.science/paper/723VEBLR"},"agent_actions":{"view_html":"https://pith.science/pith/723VEBLRXWLTPDAC6V5LIPAIHT","download_json":"https://pith.science/pith/723VEBLRXWLTPDAC6V5LIPAIHT.json","view_paper":"https://pith.science/paper/723VEBLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08283&json=true","fetch_graph":"https://pith.science/api/pith-number/723VEBLRXWLTPDAC6V5LIPAIHT/graph.json","fetch_events":"https://pith.science/api/pith-number/723VEBLRXWLTPDAC6V5LIPAIHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/723VEBLRXWLTPDAC6V5LIPAIHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/723VEBLRXWLTPDAC6V5LIPAIHT/action/storage_attestation","attest_author":"https://pith.science/pith/723VEBLRXWLTPDAC6V5LIPAIHT/action/author_attestation","sign_citation":"https://pith.science/pith/723VEBLRXWLTPDAC6V5LIPAIHT/action/citation_signature","submit_replication":"https://pith.science/pith/723VEBLRXWLTPDAC6V5LIPAIHT/action/replication_record"}},"created_at":"2026-05-18T00:12:41.498528+00:00","updated_at":"2026-05-18T00:12:41.498528+00:00"}