{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RM22LSVCRI5L5UIKE22SYKRR65","short_pith_number":"pith:RM22LSVC","schema_version":"1.0","canonical_sha256":"8b35a5caa28a3abed10a26b52c2a31f74f26f6d1e1f6e15d319b9232a9c7a814","source":{"kind":"arxiv","id":"1305.7376","version":2},"attestation_state":"computed","paper":{"title":"Polynomial Gap Extensions of the Erd\\H{o}s-P\\'osa Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dimitrios M. Thilikos, Jean-Florent Raymond","submitted_at":"2013-05-31T12:29:13Z","abstract_excerpt":"Given a graph $H$, we denote by ${\\cal M}(H)$ all graphs that can be contracted to $H$. The following extension of the Erd\\H{o}s-P\\'osa Theorem holds: for every $h$-vertex planar graph $H$, there exists a function $f_{H}$ such that every graph $G$, either contains $k$ disjoint copies of graphs in ${\\cal M}(H)$, or contains a set of $f_{H}(k)$ vertices meeting every subgraph of $G$ that belongs in ${\\cal M}(H)$. In this paper we prove that this is the case for every graph $H$ of pathwidth at most 2 and, in particular, that $f_{H}(k) = 2^{O(h^2)}\\cdot k^{2}\\cdot \\log k$. As a main ingredient of "},"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":"1305.7376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-31T12:29:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c625838225a29972ea8d30013f61df5ffeb5817333b57894ec4d2bbdabf5417e","abstract_canon_sha256":"8ff65407bfe8134ac98fbc400d149204b89b83e1862743fecd5cd7228a54ea75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:23.254504Z","signature_b64":"FNz8Dzm6nIEdvBz2QC1/dEKB3iicSajWp5kHFWzz+LzizV9QTCe0r/7l+4jVtGof60vTWn9JQLxIjlTRvtcRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b35a5caa28a3abed10a26b52c2a31f74f26f6d1e1f6e15d319b9232a9c7a814","last_reissued_at":"2026-05-18T03:21:23.253907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:23.253907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Gap Extensions of the Erd\\H{o}s-P\\'osa Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dimitrios M. Thilikos, Jean-Florent Raymond","submitted_at":"2013-05-31T12:29:13Z","abstract_excerpt":"Given a graph $H$, we denote by ${\\cal M}(H)$ all graphs that can be contracted to $H$. The following extension of the Erd\\H{o}s-P\\'osa Theorem holds: for every $h$-vertex planar graph $H$, there exists a function $f_{H}$ such that every graph $G$, either contains $k$ disjoint copies of graphs in ${\\cal M}(H)$, or contains a set of $f_{H}(k)$ vertices meeting every subgraph of $G$ that belongs in ${\\cal M}(H)$. In this paper we prove that this is the case for every graph $H$ of pathwidth at most 2 and, in particular, that $f_{H}(k) = 2^{O(h^2)}\\cdot k^{2}\\cdot \\log k$. As a main ingredient of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.7376","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":"1305.7376","created_at":"2026-05-18T03:21:23.253989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.7376v2","created_at":"2026-05-18T03:21:23.253989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7376","created_at":"2026-05-18T03:21:23.253989+00:00"},{"alias_kind":"pith_short_12","alias_value":"RM22LSVCRI5L","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RM22LSVCRI5L5UIK","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RM22LSVC","created_at":"2026-05-18T12:27:59.945178+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/RM22LSVCRI5L5UIKE22SYKRR65","json":"https://pith.science/pith/RM22LSVCRI5L5UIKE22SYKRR65.json","graph_json":"https://pith.science/api/pith-number/RM22LSVCRI5L5UIKE22SYKRR65/graph.json","events_json":"https://pith.science/api/pith-number/RM22LSVCRI5L5UIKE22SYKRR65/events.json","paper":"https://pith.science/paper/RM22LSVC"},"agent_actions":{"view_html":"https://pith.science/pith/RM22LSVCRI5L5UIKE22SYKRR65","download_json":"https://pith.science/pith/RM22LSVCRI5L5UIKE22SYKRR65.json","view_paper":"https://pith.science/paper/RM22LSVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.7376&json=true","fetch_graph":"https://pith.science/api/pith-number/RM22LSVCRI5L5UIKE22SYKRR65/graph.json","fetch_events":"https://pith.science/api/pith-number/RM22LSVCRI5L5UIKE22SYKRR65/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RM22LSVCRI5L5UIKE22SYKRR65/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RM22LSVCRI5L5UIKE22SYKRR65/action/storage_attestation","attest_author":"https://pith.science/pith/RM22LSVCRI5L5UIKE22SYKRR65/action/author_attestation","sign_citation":"https://pith.science/pith/RM22LSVCRI5L5UIKE22SYKRR65/action/citation_signature","submit_replication":"https://pith.science/pith/RM22LSVCRI5L5UIKE22SYKRR65/action/replication_record"}},"created_at":"2026-05-18T03:21:23.253989+00:00","updated_at":"2026-05-18T03:21:23.253989+00:00"}