{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Z247U4X3UQLQFB3AWOMQX5H4N7","short_pith_number":"pith:Z247U4X3","canonical_record":{"source":{"id":"1608.07505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-26T16:21:15Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ee5fad77f51694e24690317bb67fbe760e8ae286ebc613555e95ff8868e97e9f","abstract_canon_sha256":"95e524dab4bc091f532723a0d696a7b10e4ecc4f274adb674b016febcb9cea8d"},"schema_version":"1.0"},"canonical_sha256":"ceb9fa72fba417028760b3990bf4fc6fd96467088d90e2fe0684517f620a13d2","source":{"kind":"arxiv","id":"1608.07505","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07505","created_at":"2026-05-18T01:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07505v1","created_at":"2026-05-18T01:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07505","created_at":"2026-05-18T01:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"Z247U4X3UQLQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z247U4X3UQLQFB3A","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z247U4X3","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Z247U4X3UQLQFB3AWOMQX5H4N7","target":"record","payload":{"canonical_record":{"source":{"id":"1608.07505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-26T16:21:15Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ee5fad77f51694e24690317bb67fbe760e8ae286ebc613555e95ff8868e97e9f","abstract_canon_sha256":"95e524dab4bc091f532723a0d696a7b10e4ecc4f274adb674b016febcb9cea8d"},"schema_version":"1.0"},"canonical_sha256":"ceb9fa72fba417028760b3990bf4fc6fd96467088d90e2fe0684517f620a13d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:52.881751Z","signature_b64":"4dbrJYZN2CGdyGgapUjQpX91jbq/57KLS+NjbVR2WnoPYmf/FUIWiHI0iwhG14SI2Ht1qyEVteLTyt/Y15eWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceb9fa72fba417028760b3990bf4fc6fd96467088d90e2fe0684517f620a13d2","last_reissued_at":"2026-05-18T01:07:52.881353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:52.881353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.07505","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-18T01:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5p+s8eF7Ix/SNHdY0LnAYP7L/0MIqOLKZDUo+5/FDVknN6jd34KhA3BTSF3DdbxeUjH0akzK2DeGK/DcdWKzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:56:42.363403Z"},"content_sha256":"63d9bbaccc8d908ffcc266185960da679db9b694e0f8466b7c43155b4297eaa3","schema_version":"1.0","event_id":"sha256:63d9bbaccc8d908ffcc266185960da679db9b694e0f8466b7c43155b4297eaa3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Z247U4X3UQLQFB3AWOMQX5H4N7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on the Practicality of Maximal Planar Subgraph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Karsten Klein, Markus Chimani, Tilo Wiedera","submitted_at":"2016-08-26T16:21:15Z","abstract_excerpt":"Given a graph $G$, the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of $G$ with the maximum number of edges. There are several heuristic, approximative, and exact algorithms to tackle the problem, but---to the best of our knowledge---they have never been compared competitively in practice. We report on an exploratory study on the relative merits of the diverse approaches, focusing on practical runtime, solution quality, and implementation complexity. Surprisingly, a seemingly only theoretically strong approximation forms the building block of the strongest choice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07505","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-18T01:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2dX0yLAEFktyKBs4FBGpYX3L+l7ygfIPJuAk77srdcHkqbGcKXhfKVqvwQf4EBLmSYIYzu0qeExRPuBV2musAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:56:42.364055Z"},"content_sha256":"22a4851f7cb69dec07d61cfe5d993dc0dd74e0c5667c1528673bc38dfc089b49","schema_version":"1.0","event_id":"sha256:22a4851f7cb69dec07d61cfe5d993dc0dd74e0c5667c1528673bc38dfc089b49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z247U4X3UQLQFB3AWOMQX5H4N7/bundle.json","state_url":"https://pith.science/pith/Z247U4X3UQLQFB3AWOMQX5H4N7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z247U4X3UQLQFB3AWOMQX5H4N7/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-06T16:56:42Z","links":{"resolver":"https://pith.science/pith/Z247U4X3UQLQFB3AWOMQX5H4N7","bundle":"https://pith.science/pith/Z247U4X3UQLQFB3AWOMQX5H4N7/bundle.json","state":"https://pith.science/pith/Z247U4X3UQLQFB3AWOMQX5H4N7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z247U4X3UQLQFB3AWOMQX5H4N7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Z247U4X3UQLQFB3AWOMQX5H4N7","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":"95e524dab4bc091f532723a0d696a7b10e4ecc4f274adb674b016febcb9cea8d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-26T16:21:15Z","title_canon_sha256":"ee5fad77f51694e24690317bb67fbe760e8ae286ebc613555e95ff8868e97e9f"},"schema_version":"1.0","source":{"id":"1608.07505","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07505","created_at":"2026-05-18T01:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07505v1","created_at":"2026-05-18T01:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07505","created_at":"2026-05-18T01:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"Z247U4X3UQLQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z247U4X3UQLQFB3A","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z247U4X3","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:22a4851f7cb69dec07d61cfe5d993dc0dd74e0c5667c1528673bc38dfc089b49","target":"graph","created_at":"2026-05-18T01:07:52Z","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":"Given a graph $G$, the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of $G$ with the maximum number of edges. There are several heuristic, approximative, and exact algorithms to tackle the problem, but---to the best of our knowledge---they have never been compared competitively in practice. We report on an exploratory study on the relative merits of the diverse approaches, focusing on practical runtime, solution quality, and implementation complexity. Surprisingly, a seemingly only theoretically strong approximation forms the building block of the strongest choice.","authors_text":"Karsten Klein, Markus Chimani, Tilo Wiedera","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-26T16:21:15Z","title":"A Note on the Practicality of Maximal Planar Subgraph Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07505","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:63d9bbaccc8d908ffcc266185960da679db9b694e0f8466b7c43155b4297eaa3","target":"record","created_at":"2026-05-18T01:07:52Z","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":"95e524dab4bc091f532723a0d696a7b10e4ecc4f274adb674b016febcb9cea8d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-26T16:21:15Z","title_canon_sha256":"ee5fad77f51694e24690317bb67fbe760e8ae286ebc613555e95ff8868e97e9f"},"schema_version":"1.0","source":{"id":"1608.07505","kind":"arxiv","version":1}},"canonical_sha256":"ceb9fa72fba417028760b3990bf4fc6fd96467088d90e2fe0684517f620a13d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ceb9fa72fba417028760b3990bf4fc6fd96467088d90e2fe0684517f620a13d2","first_computed_at":"2026-05-18T01:07:52.881353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:52.881353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4dbrJYZN2CGdyGgapUjQpX91jbq/57KLS+NjbVR2WnoPYmf/FUIWiHI0iwhG14SI2Ht1qyEVteLTyt/Y15eWDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:52.881751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07505","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63d9bbaccc8d908ffcc266185960da679db9b694e0f8466b7c43155b4297eaa3","sha256:22a4851f7cb69dec07d61cfe5d993dc0dd74e0c5667c1528673bc38dfc089b49"],"state_sha256":"78c126cfd50b82fca3139adb04cd407cf69b8c617dd5f022da19784b544fbf6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1NoNNk3o7uHBpM4t8yypJO7cGeDuegQT1oyBxIzYv5wHDuaMZ5sdHvhBgEYhVFfqJSNATmS/dURGDcR0v423AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:56:42.367906Z","bundle_sha256":"021916759b867273971affc498a16936cda1e0259305a92a7be1df8841bb1fc9"}}