{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TBR6B33N23HQWNQZMIPFURLZDO","short_pith_number":"pith:TBR6B33N","schema_version":"1.0","canonical_sha256":"9863e0ef6dd6cf0b3619621e5a45791b94ac59bb696695d39124ee67ceec6e2f","source":{"kind":"arxiv","id":"1904.00879","version":2},"attestation_state":"computed","paper":{"title":"Erd\\\"os-P\\'osa property of minor-models with prescribed vertex sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'aniel Marx, O-joung Kwon","submitted_at":"2019-04-01T14:23:38Z","abstract_excerpt":"A minor-model of a graph $H$ in a graph $G$ is a subgraph of $G$ that can be contracted to $H$. We prove that for a positive integer $\\ell$ and a non-empty planar graph $H$ with at least $\\ell-1$ connected components, there exists a function $f_{H, \\ell}:\\mathbb{N}\\rightarrow \\mathbb{R}$ satisfying the property that every graph $G$ with a family of vertex subsets $Z_1, \\ldots, Z_m$ contains either $k$ pairwise vertex-disjoint minor-models of $H$ each intersecting at least $\\ell$ sets among prescribed vertex sets, or a vertex subset of size at most $f_{H, \\ell}(k)$ that meets all such minor-mod"},"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":"1904.00879","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-01T14:23:38Z","cross_cats_sorted":[],"title_canon_sha256":"228893fd1bf9bade70a63e65f2a3677a3090d5881f0f5f8f649b077798e7419a","abstract_canon_sha256":"88a839a0c00b09a7043db2a11980a21d1b47edeb7479bcc5ee073b118bb6a5c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:20.103394Z","signature_b64":"lGsXOGbbQqbQGip8YDDQs3k3YWCfKZhbx8imZ7e+DHJ6n94LQrWA9BgI8Nf7O7lKw1OXplaZFnZpQxT0KNI/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9863e0ef6dd6cf0b3619621e5a45791b94ac59bb696695d39124ee67ceec6e2f","last_reissued_at":"2026-05-17T23:49:20.102774Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:20.102774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Erd\\\"os-P\\'osa property of minor-models with prescribed vertex sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'aniel Marx, O-joung Kwon","submitted_at":"2019-04-01T14:23:38Z","abstract_excerpt":"A minor-model of a graph $H$ in a graph $G$ is a subgraph of $G$ that can be contracted to $H$. We prove that for a positive integer $\\ell$ and a non-empty planar graph $H$ with at least $\\ell-1$ connected components, there exists a function $f_{H, \\ell}:\\mathbb{N}\\rightarrow \\mathbb{R}$ satisfying the property that every graph $G$ with a family of vertex subsets $Z_1, \\ldots, Z_m$ contains either $k$ pairwise vertex-disjoint minor-models of $H$ each intersecting at least $\\ell$ sets among prescribed vertex sets, or a vertex subset of size at most $f_{H, \\ell}(k)$ that meets all such minor-mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00879","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":"1904.00879","created_at":"2026-05-17T23:49:20.102872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.00879v2","created_at":"2026-05-17T23:49:20.102872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00879","created_at":"2026-05-17T23:49:20.102872+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBR6B33N23HQ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBR6B33N23HQWNQZ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBR6B33N","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10467","citing_title":"Colorful Minors","ref_index":67,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TBR6B33N23HQWNQZMIPFURLZDO","json":"https://pith.science/pith/TBR6B33N23HQWNQZMIPFURLZDO.json","graph_json":"https://pith.science/api/pith-number/TBR6B33N23HQWNQZMIPFURLZDO/graph.json","events_json":"https://pith.science/api/pith-number/TBR6B33N23HQWNQZMIPFURLZDO/events.json","paper":"https://pith.science/paper/TBR6B33N"},"agent_actions":{"view_html":"https://pith.science/pith/TBR6B33N23HQWNQZMIPFURLZDO","download_json":"https://pith.science/pith/TBR6B33N23HQWNQZMIPFURLZDO.json","view_paper":"https://pith.science/paper/TBR6B33N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.00879&json=true","fetch_graph":"https://pith.science/api/pith-number/TBR6B33N23HQWNQZMIPFURLZDO/graph.json","fetch_events":"https://pith.science/api/pith-number/TBR6B33N23HQWNQZMIPFURLZDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBR6B33N23HQWNQZMIPFURLZDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBR6B33N23HQWNQZMIPFURLZDO/action/storage_attestation","attest_author":"https://pith.science/pith/TBR6B33N23HQWNQZMIPFURLZDO/action/author_attestation","sign_citation":"https://pith.science/pith/TBR6B33N23HQWNQZMIPFURLZDO/action/citation_signature","submit_replication":"https://pith.science/pith/TBR6B33N23HQWNQZMIPFURLZDO/action/replication_record"}},"created_at":"2026-05-17T23:49:20.102872+00:00","updated_at":"2026-05-17T23:49:20.102872+00:00"}