{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YOFG3MYNEHN3756BBK4DJJDLUX","short_pith_number":"pith:YOFG3MYN","schema_version":"1.0","canonical_sha256":"c38a6db30d21dbbff7c10ab834a46ba5e1bbd98fa26f6be4bff0bcc39a5fcfda","source":{"kind":"arxiv","id":"1602.06836","version":2},"attestation_state":"computed","paper":{"title":"Long induced paths in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray, Laetitia Lemoine, Louis Esperet","submitted_at":"2016-02-22T16:02:28Z","abstract_excerpt":"We prove that every 3-connected planar graph on $n$ vertices contains an induced path on $\\Omega(\\log n)$ vertices, which is best possible and improves the best known lower bound by a multiplicative factor of $\\log \\log n$. We deduce that any planar graph (or more generally, any graph embeddable on a fixed surface) with a path on $n$ vertices, also contains an induced path on $\\Omega(\\sqrt{\\log n})$ vertices. We conjecture that for any $k$, there is a contant $c(k)$ such that any $k$-degenerate graph with a path on $n$ vertices also contains an induced path on $\\Omega((\\log n)^{c(k)})$ vertice"},"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":"1602.06836","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-22T16:02:28Z","cross_cats_sorted":[],"title_canon_sha256":"6ba957565266457f942ab70b382c844f823381e5fff6592ba098d83cee5defe1","abstract_canon_sha256":"cc9c4e686575810c8a4481813fe8e1f05ae20970dde62bc085ed9a8ea5176b47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:42.762894Z","signature_b64":"Spl0TF3rHqt9S1oKYVykYNIqX23EM4RIigH6bFdHKzafiOoXDVzNeHIbwnHQ4ozsLARQpqPJBD/8t1YLDMqGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c38a6db30d21dbbff7c10ab834a46ba5e1bbd98fa26f6be4bff0bcc39a5fcfda","last_reissued_at":"2026-05-18T00:54:42.762375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:42.762375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long induced paths in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray, Laetitia Lemoine, Louis Esperet","submitted_at":"2016-02-22T16:02:28Z","abstract_excerpt":"We prove that every 3-connected planar graph on $n$ vertices contains an induced path on $\\Omega(\\log n)$ vertices, which is best possible and improves the best known lower bound by a multiplicative factor of $\\log \\log n$. We deduce that any planar graph (or more generally, any graph embeddable on a fixed surface) with a path on $n$ vertices, also contains an induced path on $\\Omega(\\sqrt{\\log n})$ vertices. We conjecture that for any $k$, there is a contant $c(k)$ such that any $k$-degenerate graph with a path on $n$ vertices also contains an induced path on $\\Omega((\\log n)^{c(k)})$ vertice"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06836","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":"1602.06836","created_at":"2026-05-18T00:54:42.762459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.06836v2","created_at":"2026-05-18T00:54:42.762459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06836","created_at":"2026-05-18T00:54:42.762459+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOFG3MYNEHN3","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOFG3MYNEHN3756B","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOFG3MYN","created_at":"2026-05-18T12:30:53.716459+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/YOFG3MYNEHN3756BBK4DJJDLUX","json":"https://pith.science/pith/YOFG3MYNEHN3756BBK4DJJDLUX.json","graph_json":"https://pith.science/api/pith-number/YOFG3MYNEHN3756BBK4DJJDLUX/graph.json","events_json":"https://pith.science/api/pith-number/YOFG3MYNEHN3756BBK4DJJDLUX/events.json","paper":"https://pith.science/paper/YOFG3MYN"},"agent_actions":{"view_html":"https://pith.science/pith/YOFG3MYNEHN3756BBK4DJJDLUX","download_json":"https://pith.science/pith/YOFG3MYNEHN3756BBK4DJJDLUX.json","view_paper":"https://pith.science/paper/YOFG3MYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.06836&json=true","fetch_graph":"https://pith.science/api/pith-number/YOFG3MYNEHN3756BBK4DJJDLUX/graph.json","fetch_events":"https://pith.science/api/pith-number/YOFG3MYNEHN3756BBK4DJJDLUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOFG3MYNEHN3756BBK4DJJDLUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOFG3MYNEHN3756BBK4DJJDLUX/action/storage_attestation","attest_author":"https://pith.science/pith/YOFG3MYNEHN3756BBK4DJJDLUX/action/author_attestation","sign_citation":"https://pith.science/pith/YOFG3MYNEHN3756BBK4DJJDLUX/action/citation_signature","submit_replication":"https://pith.science/pith/YOFG3MYNEHN3756BBK4DJJDLUX/action/replication_record"}},"created_at":"2026-05-18T00:54:42.762459+00:00","updated_at":"2026-05-18T00:54:42.762459+00:00"}