{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L5PFQMDUUVZ37CJKCTXLTWUW7K","short_pith_number":"pith:L5PFQMDU","schema_version":"1.0","canonical_sha256":"5f5e583074a573bf892a14eeb9da96faab4019db07d1648bd413229b79566691","source":{"kind":"arxiv","id":"1807.04969","version":5},"attestation_state":"computed","paper":{"title":"A tight Erd\\H{o}s-P\\'osa function for planar minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gwena\\\"el Joret, Jean-Florent Raymond, Tony Huynh, Wouter Cames van Batenburg","submitted_at":"2018-07-13T08:24:29Z","abstract_excerpt":"Let $H$ be a planar graph. By a classical result of Robertson and Seymour, there is a function $f:\\mathbb{N} \\to \\mathbb{R}$ such that for all $k \\in \\mathbb{N}$ and all graphs $G$, either $G$ contains $k$ vertex-disjoint subgraphs each containing $H$ as a minor, or there is a subset $X$ of at most $f(k)$ vertices such that $G-X$ has no $H$-minor. We prove that this remains true with $f(k) = c k \\log k$ for some constant $c=c(H)$. This bound is best possible, up to the value of $c$, and improves upon a recent result of Chekuri and Chuzhoy [STOC 2013], who established this with $f(k) = c k \\log"},"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":"1807.04969","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T08:24:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f1828a41dcff1c5c3a19b7292b781c47ee2281e29ed8be3bc8ea036a730aa765","abstract_canon_sha256":"422fe9915ded2d60aa4cc25edde180f5a8ca16e6d1834a4f4f1053cfb154b6b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:14:29.163171Z","signature_b64":"W55O7IZnejbXomsbaBn1lU7nZ3JEbRGb18UXVZeI1Ch8+pl4B7OIhHb95fbAQg+ZQiM0d9c7ytwyXkH/jDeqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f5e583074a573bf892a14eeb9da96faab4019db07d1648bd413229b79566691","last_reissued_at":"2026-07-05T00:14:29.162801Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:14:29.162801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A tight Erd\\H{o}s-P\\'osa function for planar minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gwena\\\"el Joret, Jean-Florent Raymond, Tony Huynh, Wouter Cames van Batenburg","submitted_at":"2018-07-13T08:24:29Z","abstract_excerpt":"Let $H$ be a planar graph. By a classical result of Robertson and Seymour, there is a function $f:\\mathbb{N} \\to \\mathbb{R}$ such that for all $k \\in \\mathbb{N}$ and all graphs $G$, either $G$ contains $k$ vertex-disjoint subgraphs each containing $H$ as a minor, or there is a subset $X$ of at most $f(k)$ vertices such that $G-X$ has no $H$-minor. We prove that this remains true with $f(k) = c k \\log k$ for some constant $c=c(H)$. This bound is best possible, up to the value of $c$, and improves upon a recent result of Chekuri and Chuzhoy [STOC 2013], who established this with $f(k) = c k \\log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04969","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1807.04969/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1807.04969","created_at":"2026-07-05T00:14:29.162852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04969v5","created_at":"2026-07-05T00:14:29.162852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04969","created_at":"2026-07-05T00:14:29.162852+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5PFQMDUUVZ3","created_at":"2026-07-05T00:14:29.162852+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5PFQMDUUVZ37CJK","created_at":"2026-07-05T00:14:29.162852+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5PFQMDU","created_at":"2026-07-05T00:14:29.162852+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/L5PFQMDUUVZ37CJKCTXLTWUW7K","json":"https://pith.science/pith/L5PFQMDUUVZ37CJKCTXLTWUW7K.json","graph_json":"https://pith.science/api/pith-number/L5PFQMDUUVZ37CJKCTXLTWUW7K/graph.json","events_json":"https://pith.science/api/pith-number/L5PFQMDUUVZ37CJKCTXLTWUW7K/events.json","paper":"https://pith.science/paper/L5PFQMDU"},"agent_actions":{"view_html":"https://pith.science/pith/L5PFQMDUUVZ37CJKCTXLTWUW7K","download_json":"https://pith.science/pith/L5PFQMDUUVZ37CJKCTXLTWUW7K.json","view_paper":"https://pith.science/paper/L5PFQMDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04969&json=true","fetch_graph":"https://pith.science/api/pith-number/L5PFQMDUUVZ37CJKCTXLTWUW7K/graph.json","fetch_events":"https://pith.science/api/pith-number/L5PFQMDUUVZ37CJKCTXLTWUW7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5PFQMDUUVZ37CJKCTXLTWUW7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5PFQMDUUVZ37CJKCTXLTWUW7K/action/storage_attestation","attest_author":"https://pith.science/pith/L5PFQMDUUVZ37CJKCTXLTWUW7K/action/author_attestation","sign_citation":"https://pith.science/pith/L5PFQMDUUVZ37CJKCTXLTWUW7K/action/citation_signature","submit_replication":"https://pith.science/pith/L5PFQMDUUVZ37CJKCTXLTWUW7K/action/replication_record"}},"created_at":"2026-07-05T00:14:29.162852+00:00","updated_at":"2026-07-05T00:14:29.162852+00:00"}