{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SK5IJURJLHUVPUYIQANDGAAYDM","short_pith_number":"pith:SK5IJURJ","canonical_record":{"source":{"id":"1408.5939","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-08-25T22:20:51Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"fc2f496b7508e6f1514e6244507284a10fb3a135ad961e7f67e37af95d9300b1","abstract_canon_sha256":"2966c2fb3277b01c0c77e3cbe92da64b8bc42409a38e155a589116af0bb4ace8"},"schema_version":"1.0"},"canonical_sha256":"92ba84d22959e957d308801a3300181b086459f5745dea565989d4f05814d3ae","source":{"kind":"arxiv","id":"1408.5939","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5939","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5939v2","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5939","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"SK5IJURJLHUV","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SK5IJURJLHUVPUYI","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SK5IJURJ","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SK5IJURJLHUVPUYIQANDGAAYDM","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5939","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-08-25T22:20:51Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"fc2f496b7508e6f1514e6244507284a10fb3a135ad961e7f67e37af95d9300b1","abstract_canon_sha256":"2966c2fb3277b01c0c77e3cbe92da64b8bc42409a38e155a589116af0bb4ace8"},"schema_version":"1.0"},"canonical_sha256":"92ba84d22959e957d308801a3300181b086459f5745dea565989d4f05814d3ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:51.632259Z","signature_b64":"8oeaH/D4cmmV9ZFilUjp5qs2YryHBVrTP0hpDXlZXKvL1zWPeRZ90G+k0KjoTUQ4iPRQf3OLsilqkQ9KagI2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92ba84d22959e957d308801a3300181b086459f5745dea565989d4f05814d3ae","last_reissued_at":"2026-05-18T01:36:51.631612Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:51.631612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5939","source_version":2,"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:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psiFBGaHft7WAPKTVBL58s9R4iGN5HPQafOhv7Agba6jJn82G9ugvl5zYY0kPW9jHXcjJO1hpNF4od7L/ACMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:13:10.634222Z"},"content_sha256":"0bae01824c7b2612387e9e570c35a56fd5834931699035cd7128a9b3bc5b1c50","schema_version":"1.0","event_id":"sha256:0bae01824c7b2612387e9e570c35a56fd5834931699035cd7128a9b3bc5b1c50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SK5IJURJLHUVPUYIQANDGAAYDM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Planar Induced Subgraphs of Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CG","authors_text":"David Eppstein, Glencora Borradaile, Pingan Zhu","submitted_at":"2014-08-25T22:20:51Z","abstract_excerpt":"We show that every graph has an induced pseudoforest of at least $n-m/4.5$ vertices, an induced partial 2-tree of at least $n-m/5$ vertices, and an induced planar subgraph of at least $n-m/5.2174$ vertices. These results are constructive, implying linear-time algorithms to find the respective induced subgraphs. We also show that the size of the largest $K_h$-minor-free graph in a given graph can sometimes be at most $n-m/6+o(m)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5939","kind":"arxiv","version":2},"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:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Db4MNhIarNpGPpcyVLl5+Mc/A0l2j6dhm3gA617GTzM2SNJHjoy492x9XXIQaV5PPqgGu214HPXP+HAJJt7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:13:10.634575Z"},"content_sha256":"f1c366cec19ac73f36ed19652424d6eb36b26f72277f5bbf5d4d3ab39a44f4fe","schema_version":"1.0","event_id":"sha256:f1c366cec19ac73f36ed19652424d6eb36b26f72277f5bbf5d4d3ab39a44f4fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SK5IJURJLHUVPUYIQANDGAAYDM/bundle.json","state_url":"https://pith.science/pith/SK5IJURJLHUVPUYIQANDGAAYDM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SK5IJURJLHUVPUYIQANDGAAYDM/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-27T18:13:10Z","links":{"resolver":"https://pith.science/pith/SK5IJURJLHUVPUYIQANDGAAYDM","bundle":"https://pith.science/pith/SK5IJURJLHUVPUYIQANDGAAYDM/bundle.json","state":"https://pith.science/pith/SK5IJURJLHUVPUYIQANDGAAYDM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SK5IJURJLHUVPUYIQANDGAAYDM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SK5IJURJLHUVPUYIQANDGAAYDM","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":"2966c2fb3277b01c0c77e3cbe92da64b8bc42409a38e155a589116af0bb4ace8","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-08-25T22:20:51Z","title_canon_sha256":"fc2f496b7508e6f1514e6244507284a10fb3a135ad961e7f67e37af95d9300b1"},"schema_version":"1.0","source":{"id":"1408.5939","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5939","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5939v2","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5939","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"SK5IJURJLHUV","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SK5IJURJLHUVPUYI","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SK5IJURJ","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:f1c366cec19ac73f36ed19652424d6eb36b26f72277f5bbf5d4d3ab39a44f4fe","target":"graph","created_at":"2026-05-18T01:36:51Z","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":"We show that every graph has an induced pseudoforest of at least $n-m/4.5$ vertices, an induced partial 2-tree of at least $n-m/5$ vertices, and an induced planar subgraph of at least $n-m/5.2174$ vertices. These results are constructive, implying linear-time algorithms to find the respective induced subgraphs. We also show that the size of the largest $K_h$-minor-free graph in a given graph can sometimes be at most $n-m/6+o(m)$.","authors_text":"David Eppstein, Glencora Borradaile, Pingan Zhu","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-08-25T22:20:51Z","title":"Planar Induced Subgraphs of Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5939","kind":"arxiv","version":2},"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:0bae01824c7b2612387e9e570c35a56fd5834931699035cd7128a9b3bc5b1c50","target":"record","created_at":"2026-05-18T01:36:51Z","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":"2966c2fb3277b01c0c77e3cbe92da64b8bc42409a38e155a589116af0bb4ace8","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-08-25T22:20:51Z","title_canon_sha256":"fc2f496b7508e6f1514e6244507284a10fb3a135ad961e7f67e37af95d9300b1"},"schema_version":"1.0","source":{"id":"1408.5939","kind":"arxiv","version":2}},"canonical_sha256":"92ba84d22959e957d308801a3300181b086459f5745dea565989d4f05814d3ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92ba84d22959e957d308801a3300181b086459f5745dea565989d4f05814d3ae","first_computed_at":"2026-05-18T01:36:51.631612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:51.631612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8oeaH/D4cmmV9ZFilUjp5qs2YryHBVrTP0hpDXlZXKvL1zWPeRZ90G+k0KjoTUQ4iPRQf3OLsilqkQ9KagI2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:51.632259Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5939","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bae01824c7b2612387e9e570c35a56fd5834931699035cd7128a9b3bc5b1c50","sha256:f1c366cec19ac73f36ed19652424d6eb36b26f72277f5bbf5d4d3ab39a44f4fe"],"state_sha256":"10829cb61d8c802395fad6cb87d1e75da59f0e9b6c8a32649f6b94f18ed39b03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1aeU7KYdID0c3fklrwspC/XNcEY5dV5X/9GpPbI+xcaHtghrcfbPme9eBeWbto6U29Wy9AOE47omHevG89ZUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:13:10.636417Z","bundle_sha256":"35f5ea2e1dc18a25ca22b847960f0bf9c3c331af0bb39bb65b498ec669b6cd2d"}}