{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QXJGGZSXM2AYMBIGAKC3HAWKUL","short_pith_number":"pith:QXJGGZSX","schema_version":"1.0","canonical_sha256":"85d263665766818605060285b382caa2d30f0c67bc3c41e54136a5a33874cfa0","source":{"kind":"arxiv","id":"1611.04546","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.04546","created_at":"2026-05-18T00:52:03.755002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.04546v2","created_at":"2026-05-18T00:52:03.755002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04546","created_at":"2026-05-18T00:52:03.755002+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXJGGZSXM2AY","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXJGGZSXM2AYMBIG","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXJGGZSX","created_at":"2026-05-18T12:30:41.710351+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/QXJGGZSXM2AYMBIGAKC3HAWKUL","json":"https://pith.science/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL.json","graph_json":"https://pith.science/api/pith-number/QXJGGZSXM2AYMBIGAKC3HAWKUL/graph.json","events_json":"https://pith.science/api/pith-number/QXJGGZSXM2AYMBIGAKC3HAWKUL/events.json","paper":"https://pith.science/paper/QXJGGZSX"},"agent_actions":{"view_html":"https://pith.science/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL","download_json":"https://pith.science/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL.json","view_paper":"https://pith.science/paper/QXJGGZSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.04546&json=true","fetch_graph":"https://pith.science/api/pith-number/QXJGGZSXM2AYMBIGAKC3HAWKUL/graph.json","fetch_events":"https://pith.science/api/pith-number/QXJGGZSXM2AYMBIGAKC3HAWKUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL/action/storage_attestation","attest_author":"https://pith.science/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL/action/author_attestation","sign_citation":"https://pith.science/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL/action/citation_signature","submit_replication":"https://pith.science/pith/QXJGGZSXM2AYMBIGAKC3HAWKUL/action/replication_record"}},"created_at":"2026-05-18T00:52:03.755002+00:00","updated_at":"2026-05-18T00:52:03.755002+00:00"}