{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IVXWA4DCXU7NQSDQAWOD754YQF","short_pith_number":"pith:IVXWA4DC","schema_version":"1.0","canonical_sha256":"456f607062bd3ed84870059c3ff798814dfe19a4dc7e7ae62c153c4f57d6065c","source":{"kind":"arxiv","id":"1409.1348","version":1},"attestation_state":"computed","paper":{"title":"Large induced forests in planar graphs with girth 4 or 5","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Fran\\c{c}ois Dross, Mickael Montassier","submitted_at":"2014-09-04T07:51:15Z","abstract_excerpt":"We give here some new lower bounds on the order of a largest induced forest in planar graphs with girth $4$ and $5$. In particular we prove that a triangle-free planar graph of order $n$ admits an induced forest of order at least $\\frac{6n+7}{11}$ , improving the lower bound of Salavatipour [M. R. Salavatipour, Large induced forests in triangle-free planar graphs, Graphs and Combinatorics, 22:113-126, 2006]. We also prove that a planar graph of order $n$ and girth at least $5$ admits an induced forest of order at least $\\frac{44n+50}{69}$."},"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":"1409.1348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-04T07:51:15Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ae7cc53d0104dc102458c253e4c20041f857920c3b44b93fa8eb589092bedaba","abstract_canon_sha256":"07a2f713b29ddc3c9e863666dc38f574085a5f39d6e46793330594f3f7f0ea72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:27.168265Z","signature_b64":"sEP+0QWnZ45RHV8kpg9TMiMO7wV4PNaQKPSA5rlCI5g+NPgD67FqTsakUA/DgStufPQmxnwE7LPwR9oSkUcDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"456f607062bd3ed84870059c3ff798814dfe19a4dc7e7ae62c153c4f57d6065c","last_reissued_at":"2026-05-18T02:43:27.165152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:27.165152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large induced forests in planar graphs with girth 4 or 5","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Fran\\c{c}ois Dross, Mickael Montassier","submitted_at":"2014-09-04T07:51:15Z","abstract_excerpt":"We give here some new lower bounds on the order of a largest induced forest in planar graphs with girth $4$ and $5$. In particular we prove that a triangle-free planar graph of order $n$ admits an induced forest of order at least $\\frac{6n+7}{11}$ , improving the lower bound of Salavatipour [M. R. Salavatipour, Large induced forests in triangle-free planar graphs, Graphs and Combinatorics, 22:113-126, 2006]. We also prove that a planar graph of order $n$ and girth at least $5$ admits an induced forest of order at least $\\frac{44n+50}{69}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1348","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.1348","created_at":"2026-05-18T02:43:27.167544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.1348v1","created_at":"2026-05-18T02:43:27.167544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1348","created_at":"2026-05-18T02:43:27.167544+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVXWA4DCXU7N","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVXWA4DCXU7NQSDQ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVXWA4DC","created_at":"2026-05-18T12:28:33.132498+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/IVXWA4DCXU7NQSDQAWOD754YQF","json":"https://pith.science/pith/IVXWA4DCXU7NQSDQAWOD754YQF.json","graph_json":"https://pith.science/api/pith-number/IVXWA4DCXU7NQSDQAWOD754YQF/graph.json","events_json":"https://pith.science/api/pith-number/IVXWA4DCXU7NQSDQAWOD754YQF/events.json","paper":"https://pith.science/paper/IVXWA4DC"},"agent_actions":{"view_html":"https://pith.science/pith/IVXWA4DCXU7NQSDQAWOD754YQF","download_json":"https://pith.science/pith/IVXWA4DCXU7NQSDQAWOD754YQF.json","view_paper":"https://pith.science/paper/IVXWA4DC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.1348&json=true","fetch_graph":"https://pith.science/api/pith-number/IVXWA4DCXU7NQSDQAWOD754YQF/graph.json","fetch_events":"https://pith.science/api/pith-number/IVXWA4DCXU7NQSDQAWOD754YQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVXWA4DCXU7NQSDQAWOD754YQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVXWA4DCXU7NQSDQAWOD754YQF/action/storage_attestation","attest_author":"https://pith.science/pith/IVXWA4DCXU7NQSDQAWOD754YQF/action/author_attestation","sign_citation":"https://pith.science/pith/IVXWA4DCXU7NQSDQAWOD754YQF/action/citation_signature","submit_replication":"https://pith.science/pith/IVXWA4DCXU7NQSDQAWOD754YQF/action/replication_record"}},"created_at":"2026-05-18T02:43:27.167544+00:00","updated_at":"2026-05-18T02:43:27.167544+00:00"}