{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QXJGGZSXM2AYMBIGAKC3HAWKUL","short_pith_number":"pith:QXJGGZSX","canonical_record":{"source":{"id":"1611.04546","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T20:07:06Z","cross_cats_sorted":[],"title_canon_sha256":"4aaed54d150e16fecf1990213369510a2a3aa2edd2100982e35bf3132d18e3de","abstract_canon_sha256":"ab4e7975b0be4563b3eba5aa6745acbd37d60b6b21baa2b35e5798760a17d039"},"schema_version":"1.0"},"canonical_sha256":"85d263665766818605060285b382caa2d30f0c67bc3c41e54136a5a33874cfa0","source":{"kind":"arxiv","id":"1611.04546","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04546","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04546v2","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04546","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"pith_short_12","alias_value":"QXJGGZSXM2AY","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QXJGGZSXM2AYMBIG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QXJGGZSX","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QXJGGZSXM2AYMBIGAKC3HAWKUL","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04546","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T20:07:06Z","cross_cats_sorted":[],"title_canon_sha256":"4aaed54d150e16fecf1990213369510a2a3aa2edd2100982e35bf3132d18e3de","abstract_canon_sha256":"ab4e7975b0be4563b3eba5aa6745acbd37d60b6b21baa2b35e5798760a17d039"},"schema_version":"1.0"},"canonical_sha256":"85d263665766818605060285b382caa2d30f0c67bc3c41e54136a5a33874cfa0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:03.755530Z","signature_b64":"p+cnpdh0NnIF2o4yhZzzJ4VFQLAapPW/1LMDuL5511MtIhF6wEOXqOdZp9q6jJEHVPjP5BghGuzjQiGomWPfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85d263665766818605060285b382caa2d30f0c67bc3c41e54136a5a33874cfa0","last_reissued_at":"2026-05-18T00:52:03.754910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:03.754910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04546","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-18T00:52:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c2JqktoCRnquE7DLiwJV45UuTbpetZsXyLXk5Bx6tFG6j/HIB+aRTMb91Wlnxj/oUvWtVgAA4OmAP7Y9u6KeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:16:20.492927Z"},"content_sha256":"c926ee8413ec8620bdb3e64190ad23866771ec804fc59dd9f01826ca0c22fb61","schema_version":"1.0","event_id":"sha256:c926ee8413ec8620bdb3e64190ad23866771ec804fc59dd9f01826ca0c22fb61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QXJGGZSXM2AYMBIGAKC3HAWKUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A better bound on the largest induced forests in triangle-free planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hung Le","submitted_at":"2016-11-14T20:07:06Z","abstract_excerpt":"It is well-known that there exists a triangle-free planar graph of $n$ verticess such that the largest induced forest has size at most $\\frac{5n}{8}$. Salavatipour proved that there is a forest of size at least $\\frac{5n}{9.41}$ in any triangle-free planar graph of $n$ vertices. Dross, Montassier and Pinlou improved Salavatipour's bound to $\\frac{5n}{9.17}$. In this work, we further improve the bound to $\\frac{5n}{9}$. Our technique is inspired by the recent ideas from Lukot'ka, Maz{\\'a}k and Zhu."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04546","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-18T00:52:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dH3NmbaHdStbfYkcGmyFeWS1WtHAObVhKUaRtm7rNxUPELWiOcJeyaiRiZVwYrpReB/DlXAQX/hY8IzejUiGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:16:20.493278Z"},"content_sha256":"a08cebf7f3e275b2a9557907fbae5203d5651812b6c55d5214b5452155505a1a","schema_version":"1.0","event_id":"sha256:a08cebf7f3e275b2a9557907fbae5203d5651812b6c55d5214b5452155505a1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL/bundle.json","state_url":"https://pith.science/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL/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-03T17:16:20Z","links":{"resolver":"https://pith.science/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL","bundle":"https://pith.science/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL/bundle.json","state":"https://pith.science/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QXJGGZSXM2AYMBIGAKC3HAWKUL","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":"ab4e7975b0be4563b3eba5aa6745acbd37d60b6b21baa2b35e5798760a17d039","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T20:07:06Z","title_canon_sha256":"4aaed54d150e16fecf1990213369510a2a3aa2edd2100982e35bf3132d18e3de"},"schema_version":"1.0","source":{"id":"1611.04546","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04546","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04546v2","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04546","created_at":"2026-05-18T00:52:03Z"},{"alias_kind":"pith_short_12","alias_value":"QXJGGZSXM2AY","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QXJGGZSXM2AYMBIG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QXJGGZSX","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:a08cebf7f3e275b2a9557907fbae5203d5651812b6c55d5214b5452155505a1a","target":"graph","created_at":"2026-05-18T00:52:03Z","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":"It is well-known that there exists a triangle-free planar graph of $n$ verticess such that the largest induced forest has size at most $\\frac{5n}{8}$. Salavatipour proved that there is a forest of size at least $\\frac{5n}{9.41}$ in any triangle-free planar graph of $n$ vertices. Dross, Montassier and Pinlou improved Salavatipour's bound to $\\frac{5n}{9.17}$. In this work, we further improve the bound to $\\frac{5n}{9}$. Our technique is inspired by the recent ideas from Lukot'ka, Maz{\\'a}k and Zhu.","authors_text":"Hung Le","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T20:07:06Z","title":"A better bound on the largest induced forests in triangle-free planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04546","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:c926ee8413ec8620bdb3e64190ad23866771ec804fc59dd9f01826ca0c22fb61","target":"record","created_at":"2026-05-18T00:52:03Z","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":"ab4e7975b0be4563b3eba5aa6745acbd37d60b6b21baa2b35e5798760a17d039","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T20:07:06Z","title_canon_sha256":"4aaed54d150e16fecf1990213369510a2a3aa2edd2100982e35bf3132d18e3de"},"schema_version":"1.0","source":{"id":"1611.04546","kind":"arxiv","version":2}},"canonical_sha256":"85d263665766818605060285b382caa2d30f0c67bc3c41e54136a5a33874cfa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85d263665766818605060285b382caa2d30f0c67bc3c41e54136a5a33874cfa0","first_computed_at":"2026-05-18T00:52:03.754910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:03.754910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p+cnpdh0NnIF2o4yhZzzJ4VFQLAapPW/1LMDuL5511MtIhF6wEOXqOdZp9q6jJEHVPjP5BghGuzjQiGomWPfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:03.755530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04546","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c926ee8413ec8620bdb3e64190ad23866771ec804fc59dd9f01826ca0c22fb61","sha256:a08cebf7f3e275b2a9557907fbae5203d5651812b6c55d5214b5452155505a1a"],"state_sha256":"4893045ad6550b84e67c2d74fdf8aa5ce11554c87649711b144e5c6bb7384438"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91CM6rKeYlHiNs26NrDn+IqBalUiG8iGedNzzrktLw/G85q7NlhiOokD/08idPYJIzYljcCetwdh4aFMK3ylBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:16:20.495281Z","bundle_sha256":"8ca4c80ad342d563e04d2ab794bb691a3933a21f215289b6a0e422b26cb25d4c"}}