{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YOFG3MYNEHN3756BBK4DJJDLUX","short_pith_number":"pith:YOFG3MYN","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"},"canonical_sha256":"c38a6db30d21dbbff7c10ab834a46ba5e1bbd98fa26f6be4bff0bcc39a5fcfda","source":{"kind":"arxiv","id":"1602.06836","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06836","created_at":"2026-05-18T00:54:42Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06836v2","created_at":"2026-05-18T00:54:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06836","created_at":"2026-05-18T00:54:42Z"},{"alias_kind":"pith_short_12","alias_value":"YOFG3MYNEHN3","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YOFG3MYNEHN3756B","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YOFG3MYN","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YOFG3MYNEHN3756BBK4DJJDLUX","target":"record","payload":{"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"},"canonical_sha256":"c38a6db30d21dbbff7c10ab834a46ba5e1bbd98fa26f6be4bff0bcc39a5fcfda","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"},"source_kind":"arxiv","source_id":"1602.06836","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:54:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNoYn30LETYLJBmlWL6SXNyZbIrUB/zktmsttSzomqPhhgezaUui2AxL6tKobm9tfuM/BG0B7CBPbcDdjDsgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:01:49.670661Z"},"content_sha256":"ae60384a40d5eff2a2260fe63201f89fc19918eccf3324b49e637f710f3f26f7","schema_version":"1.0","event_id":"sha256:ae60384a40d5eff2a2260fe63201f89fc19918eccf3324b49e637f710f3f26f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YOFG3MYNEHN3756BBK4DJJDLUX","target":"graph","payload":{"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"},"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:54:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTblc4atMcU+2fsiAmWrPjhn+yqFk9fHftrYr0CWQ66ZatZh+rnng0/LNh7k/tEL151DODUbefJU+p9h2bnGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:01:49.671300Z"},"content_sha256":"0ed11244b333afb44dc075279e21e76bc318db6f3683872a19e426a11bb5d1ae","schema_version":"1.0","event_id":"sha256:0ed11244b333afb44dc075279e21e76bc318db6f3683872a19e426a11bb5d1ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOFG3MYNEHN3756BBK4DJJDLUX/bundle.json","state_url":"https://pith.science/pith/YOFG3MYNEHN3756BBK4DJJDLUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOFG3MYNEHN3756BBK4DJJDLUX/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-05-30T20:01:49Z","links":{"resolver":"https://pith.science/pith/YOFG3MYNEHN3756BBK4DJJDLUX","bundle":"https://pith.science/pith/YOFG3MYNEHN3756BBK4DJJDLUX/bundle.json","state":"https://pith.science/pith/YOFG3MYNEHN3756BBK4DJJDLUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOFG3MYNEHN3756BBK4DJJDLUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YOFG3MYNEHN3756BBK4DJJDLUX","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":"cc9c4e686575810c8a4481813fe8e1f05ae20970dde62bc085ed9a8ea5176b47","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-22T16:02:28Z","title_canon_sha256":"6ba957565266457f942ab70b382c844f823381e5fff6592ba098d83cee5defe1"},"schema_version":"1.0","source":{"id":"1602.06836","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06836","created_at":"2026-05-18T00:54:42Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06836v2","created_at":"2026-05-18T00:54:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06836","created_at":"2026-05-18T00:54:42Z"},{"alias_kind":"pith_short_12","alias_value":"YOFG3MYNEHN3","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YOFG3MYNEHN3756B","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YOFG3MYN","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:0ed11244b333afb44dc075279e21e76bc318db6f3683872a19e426a11bb5d1ae","target":"graph","created_at":"2026-05-18T00:54:42Z","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":"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","authors_text":"Fr\\'ed\\'eric Maffray, Laetitia Lemoine, Louis Esperet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-22T16:02:28Z","title":"Long induced paths in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06836","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:ae60384a40d5eff2a2260fe63201f89fc19918eccf3324b49e637f710f3f26f7","target":"record","created_at":"2026-05-18T00:54:42Z","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":"cc9c4e686575810c8a4481813fe8e1f05ae20970dde62bc085ed9a8ea5176b47","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-22T16:02:28Z","title_canon_sha256":"6ba957565266457f942ab70b382c844f823381e5fff6592ba098d83cee5defe1"},"schema_version":"1.0","source":{"id":"1602.06836","kind":"arxiv","version":2}},"canonical_sha256":"c38a6db30d21dbbff7c10ab834a46ba5e1bbd98fa26f6be4bff0bcc39a5fcfda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c38a6db30d21dbbff7c10ab834a46ba5e1bbd98fa26f6be4bff0bcc39a5fcfda","first_computed_at":"2026-05-18T00:54:42.762375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:42.762375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Spl0TF3rHqt9S1oKYVykYNIqX23EM4RIigH6bFdHKzafiOoXDVzNeHIbwnHQ4ozsLARQpqPJBD/8t1YLDMqGAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:42.762894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06836","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae60384a40d5eff2a2260fe63201f89fc19918eccf3324b49e637f710f3f26f7","sha256:0ed11244b333afb44dc075279e21e76bc318db6f3683872a19e426a11bb5d1ae"],"state_sha256":"4df93c885bad9f88f76de533a97cf8d78f0cff82946298e142788b36d727df57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OA0iwxNxqAz7C3ZUlrhEMWab7uVG+Bq9Lj2fr4acEwjCS4bM6jO/jHKNh/vqpDtRo1p3OMXjS9p8Ic9v1UNPBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:01:49.674452Z","bundle_sha256":"b522d80abdb04f2f1c36a52c726b42c43708b2f435463ab30c651edb5ad7378b"}}