{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:723VEBLRXWLTPDAC6V5LIPAIHT","short_pith_number":"pith:723VEBLR","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"},"canonical_sha256":"feb7520571bd97378c02f57ab43c083cdfb04d3da9cbd29465a1e611e1dd4672","source":{"kind":"arxiv","id":"1806.08283","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08283","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08283v1","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08283","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"723VEBLRXWLT","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"723VEBLRXWLTPDAC","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"723VEBLR","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:723VEBLRXWLTPDAC6V5LIPAIHT","target":"record","payload":{"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"},"canonical_sha256":"feb7520571bd97378c02f57ab43c083cdfb04d3da9cbd29465a1e611e1dd4672","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"},"source_kind":"arxiv","source_id":"1806.08283","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-05-18T00:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E9sQVzQh5KzYC8+eVhaJMk3ssVBNekgebzT2+83/hnjH7c+r/zqg0L8JnGAKrZ9v/FxdX94DfNHfyztZdS+8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:40:18.908382Z"},"content_sha256":"aaac4519c1583095de9600843f6478a2e5f2412b67b5fc3317f48c285cdb4a7b","schema_version":"1.0","event_id":"sha256:aaac4519c1583095de9600843f6478a2e5f2412b67b5fc3317f48c285cdb4a7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:723VEBLRXWLTPDAC6V5LIPAIHT","target":"graph","payload":{"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"},"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-05-18T00:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YBlCkM92unstmmprOmGT7F0oIllRbuOwqMnrBLEe+Aw3KiZ7B1YQ+o67vlxoaQ8+ii6nOWTYFmnkfFyy6OFlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:40:18.909111Z"},"content_sha256":"33127d20801441d9cfce8a96221a6aa2892c4fa93bd80db44d59b16ce63bf0fa","schema_version":"1.0","event_id":"sha256:33127d20801441d9cfce8a96221a6aa2892c4fa93bd80db44d59b16ce63bf0fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/723VEBLRXWLTPDAC6V5LIPAIHT/bundle.json","state_url":"https://pith.science/pith/723VEBLRXWLTPDAC6V5LIPAIHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/723VEBLRXWLTPDAC6V5LIPAIHT/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-06-06T23:40:18Z","links":{"resolver":"https://pith.science/pith/723VEBLRXWLTPDAC6V5LIPAIHT","bundle":"https://pith.science/pith/723VEBLRXWLTPDAC6V5LIPAIHT/bundle.json","state":"https://pith.science/pith/723VEBLRXWLTPDAC6V5LIPAIHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/723VEBLRXWLTPDAC6V5LIPAIHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:723VEBLRXWLTPDAC6V5LIPAIHT","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":"91f61c251c7b6d29c7cc397ec1852ef41d38a6492c8ad37eacc91ddf54673cd0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T15:02:58Z","title_canon_sha256":"b8dbbc61c19269d9e39c154f5a4bee4e6e93f38cce2da2693302c2b4225778b1"},"schema_version":"1.0","source":{"id":"1806.08283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08283","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08283v1","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08283","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"723VEBLRXWLT","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"723VEBLRXWLTPDAC","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"723VEBLR","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:33127d20801441d9cfce8a96221a6aa2892c4fa93bd80db44d59b16ce63bf0fa","target":"graph","created_at":"2026-05-18T00:12:41Z","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"},"paper":{"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 ","authors_text":"Markus Chimani, Tilo Wiedera","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T15:02:58Z","title":"Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08283","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:aaac4519c1583095de9600843f6478a2e5f2412b67b5fc3317f48c285cdb4a7b","target":"record","created_at":"2026-05-18T00:12:41Z","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":"91f61c251c7b6d29c7cc397ec1852ef41d38a6492c8ad37eacc91ddf54673cd0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T15:02:58Z","title_canon_sha256":"b8dbbc61c19269d9e39c154f5a4bee4e6e93f38cce2da2693302c2b4225778b1"},"schema_version":"1.0","source":{"id":"1806.08283","kind":"arxiv","version":1}},"canonical_sha256":"feb7520571bd97378c02f57ab43c083cdfb04d3da9cbd29465a1e611e1dd4672","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"feb7520571bd97378c02f57ab43c083cdfb04d3da9cbd29465a1e611e1dd4672","first_computed_at":"2026-05-18T00:12:41.498430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:41.498430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UViS4g9Ct8RI5ONZmeNUegqkO5b6qGvKP4j30XQg/pWyj/DTXESEfRtvseOqAqLZffBrAbIwK0Ys1QDKjq0dBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:41.499078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaac4519c1583095de9600843f6478a2e5f2412b67b5fc3317f48c285cdb4a7b","sha256:33127d20801441d9cfce8a96221a6aa2892c4fa93bd80db44d59b16ce63bf0fa"],"state_sha256":"dd939f69f31ca97dd819665b63a869c88f30233c7e51445839a2569d46c86665"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8OZDVCTmJnknaXnibKLUrboMttqT/xzEePmg7NLXxREzsUPKweRghZQJ+BaNrx+gq9mmtyAUcu9fyaYnLneNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:40:18.913483Z","bundle_sha256":"614f75770a759da072df87426accfb5e56ee9cdf267dd8be615433effa95ca4f"}}