{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AE2YVQSESVO574WQ4GZVEXZQ7P","short_pith_number":"pith:AE2YVQSE","schema_version":"1.0","canonical_sha256":"01358ac244955ddff2d0e1b3525f30fbcd007da7dd81a2a986f1edc590cf9c8e","source":{"kind":"arxiv","id":"1705.11133","version":1},"attestation_state":"computed","paper":{"title":"A lower bound on the order of the largest induced linear forest in triangle-free planar graphs","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":"2017-05-31T15:10:13Z","abstract_excerpt":"We prove that every triangle-free planar graph of order $n$ and size $m$ has an induced linear forest with at least $\\frac{9n - 2m}{11}$ vertices, and thus at least $\\frac{5n + 8}{11}$ vertices. Furthermore, we show that there are triangle-free planar graphs on $n$ vertices whose largest induced linear forest has order $\\lceil \\frac{n}{2} \\rceil + 1$."},"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":"1705.11133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-31T15:10:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d9260c51c208129f2644e7d7bc4c2d775d40335b1034810359b7707b92805539","abstract_canon_sha256":"ce464cb9dada09d3690472e53d11bded52b576c317685d5ea4b2a830a2b856a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:19.155426Z","signature_b64":"C9MZ3eXsAZ46KfWnzZ6Qzk2k8+HnFwmC9Q2gMEThtmRHB4sAyK1NNFOM76kv1i3tDymTMaDLILSMsl/siLAzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01358ac244955ddff2d0e1b3525f30fbcd007da7dd81a2a986f1edc590cf9c8e","last_reissued_at":"2026-05-18T00:43:19.154775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:19.154775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound on the order of the largest induced linear forest in triangle-free planar graphs","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":"2017-05-31T15:10:13Z","abstract_excerpt":"We prove that every triangle-free planar graph of order $n$ and size $m$ has an induced linear forest with at least $\\frac{9n - 2m}{11}$ vertices, and thus at least $\\frac{5n + 8}{11}$ vertices. Furthermore, we show that there are triangle-free planar graphs on $n$ vertices whose largest induced linear forest has order $\\lceil \\frac{n}{2} \\rceil + 1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.11133","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":"1705.11133","created_at":"2026-05-18T00:43:19.154868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.11133v1","created_at":"2026-05-18T00:43:19.154868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.11133","created_at":"2026-05-18T00:43:19.154868+00:00"},{"alias_kind":"pith_short_12","alias_value":"AE2YVQSESVO5","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AE2YVQSESVO574WQ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AE2YVQSE","created_at":"2026-05-18T12:31:05.417338+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/AE2YVQSESVO574WQ4GZVEXZQ7P","json":"https://pith.science/pith/AE2YVQSESVO574WQ4GZVEXZQ7P.json","graph_json":"https://pith.science/api/pith-number/AE2YVQSESVO574WQ4GZVEXZQ7P/graph.json","events_json":"https://pith.science/api/pith-number/AE2YVQSESVO574WQ4GZVEXZQ7P/events.json","paper":"https://pith.science/paper/AE2YVQSE"},"agent_actions":{"view_html":"https://pith.science/pith/AE2YVQSESVO574WQ4GZVEXZQ7P","download_json":"https://pith.science/pith/AE2YVQSESVO574WQ4GZVEXZQ7P.json","view_paper":"https://pith.science/paper/AE2YVQSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.11133&json=true","fetch_graph":"https://pith.science/api/pith-number/AE2YVQSESVO574WQ4GZVEXZQ7P/graph.json","fetch_events":"https://pith.science/api/pith-number/AE2YVQSESVO574WQ4GZVEXZQ7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AE2YVQSESVO574WQ4GZVEXZQ7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AE2YVQSESVO574WQ4GZVEXZQ7P/action/storage_attestation","attest_author":"https://pith.science/pith/AE2YVQSESVO574WQ4GZVEXZQ7P/action/author_attestation","sign_citation":"https://pith.science/pith/AE2YVQSESVO574WQ4GZVEXZQ7P/action/citation_signature","submit_replication":"https://pith.science/pith/AE2YVQSESVO574WQ4GZVEXZQ7P/action/replication_record"}},"created_at":"2026-05-18T00:43:19.154868+00:00","updated_at":"2026-05-18T00:43:19.154868+00:00"}