{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RM22LSVCRI5L5UIKE22SYKRR65","short_pith_number":"pith:RM22LSVC","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"},"canonical_sha256":"8b35a5caa28a3abed10a26b52c2a31f74f26f6d1e1f6e15d319b9232a9c7a814","source":{"kind":"arxiv","id":"1305.7376","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.7376","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1305.7376v2","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7376","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"RM22LSVCRI5L","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RM22LSVCRI5L5UIK","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RM22LSVC","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RM22LSVCRI5L5UIKE22SYKRR65","target":"record","payload":{"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"},"canonical_sha256":"8b35a5caa28a3abed10a26b52c2a31f74f26f6d1e1f6e15d319b9232a9c7a814","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"},"source_kind":"arxiv","source_id":"1305.7376","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-18T03:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NNKpxh0JhenrjQx6ySUehgHka0bUjFgis8E9IPTN3moK3vgmddNLnZQfzE2y2nyIET/msYUIQbhbcmJXcBwIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:52.116188Z"},"content_sha256":"f76706ee8408eb8bf441f9c5f617790dfb4004bb99a5c7e9ca28269148a22af8","schema_version":"1.0","event_id":"sha256:f76706ee8408eb8bf441f9c5f617790dfb4004bb99a5c7e9ca28269148a22af8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RM22LSVCRI5L5UIKE22SYKRR65","target":"graph","payload":{"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"},"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-18T03:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ed6WsY5MP/WYHsJtnwjwQr3hpUfXJzvDJhTki4JuiaiIFjTsAtNdIZGwZ5IVT9CSsuJMaclOPR3WrIwuCaoNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:52.116806Z"},"content_sha256":"e6f269a618d5ce94188d0184718ceaa63b788228e454057f97f0a93ac8363eaf","schema_version":"1.0","event_id":"sha256:e6f269a618d5ce94188d0184718ceaa63b788228e454057f97f0a93ac8363eaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RM22LSVCRI5L5UIKE22SYKRR65/bundle.json","state_url":"https://pith.science/pith/RM22LSVCRI5L5UIKE22SYKRR65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RM22LSVCRI5L5UIKE22SYKRR65/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-25T18:59:52Z","links":{"resolver":"https://pith.science/pith/RM22LSVCRI5L5UIKE22SYKRR65","bundle":"https://pith.science/pith/RM22LSVCRI5L5UIKE22SYKRR65/bundle.json","state":"https://pith.science/pith/RM22LSVCRI5L5UIKE22SYKRR65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RM22LSVCRI5L5UIKE22SYKRR65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RM22LSVCRI5L5UIKE22SYKRR65","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":"8ff65407bfe8134ac98fbc400d149204b89b83e1862743fecd5cd7228a54ea75","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-31T12:29:13Z","title_canon_sha256":"c625838225a29972ea8d30013f61df5ffeb5817333b57894ec4d2bbdabf5417e"},"schema_version":"1.0","source":{"id":"1305.7376","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.7376","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1305.7376v2","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7376","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"RM22LSVCRI5L","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RM22LSVCRI5L5UIK","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RM22LSVC","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:e6f269a618d5ce94188d0184718ceaa63b788228e454057f97f0a93ac8363eaf","target":"graph","created_at":"2026-05-18T03:21:23Z","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":"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 ","authors_text":"Dimitrios M. Thilikos, Jean-Florent Raymond","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-31T12:29:13Z","title":"Polynomial Gap Extensions of the Erd\\H{o}s-P\\'osa Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.7376","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:f76706ee8408eb8bf441f9c5f617790dfb4004bb99a5c7e9ca28269148a22af8","target":"record","created_at":"2026-05-18T03:21:23Z","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":"8ff65407bfe8134ac98fbc400d149204b89b83e1862743fecd5cd7228a54ea75","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-31T12:29:13Z","title_canon_sha256":"c625838225a29972ea8d30013f61df5ffeb5817333b57894ec4d2bbdabf5417e"},"schema_version":"1.0","source":{"id":"1305.7376","kind":"arxiv","version":2}},"canonical_sha256":"8b35a5caa28a3abed10a26b52c2a31f74f26f6d1e1f6e15d319b9232a9c7a814","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b35a5caa28a3abed10a26b52c2a31f74f26f6d1e1f6e15d319b9232a9c7a814","first_computed_at":"2026-05-18T03:21:23.253907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:23.253907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FNz8Dzm6nIEdvBz2QC1/dEKB3iicSajWp5kHFWzz+LzizV9QTCe0r/7l+4jVtGof60vTWn9JQLxIjlTRvtcRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:23.254504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.7376","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f76706ee8408eb8bf441f9c5f617790dfb4004bb99a5c7e9ca28269148a22af8","sha256:e6f269a618d5ce94188d0184718ceaa63b788228e454057f97f0a93ac8363eaf"],"state_sha256":"bab0ad1579596f93fba5b1d567b4a60ae902287e28407fe47fdb3a4713cfd74c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFvtlwr9ufP9wIOWSrRF58ZIJgeDMR+PaqBy6hDULhLtLIKOJksgUnzYdDTHv7RYIAlh6qxjQG0x4LjFJPVUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:59:52.119697Z","bundle_sha256":"ede224ff4dec7ead9375bbad2b4fc3c720a86d2c25de96ac6c4efb1c43ebedc6"}}