{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MH4PW5LKH62U4LEXBJOPKYDP7A","short_pith_number":"pith:MH4PW5LK","schema_version":"1.0","canonical_sha256":"61f8fb756a3fb54e2c970a5cf5606ff817e340be4ae43c24d35024df9b793f16","source":{"kind":"arxiv","id":"2407.05883","version":2},"attestation_state":"computed","paper":{"title":"A coarse Erd\\H{o}s-P\\'{o}sa theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. Pascal Gollin, Jungho Ahn, O-joung Kwon, Tony Huynh","submitted_at":"2024-07-08T12:44:18Z","abstract_excerpt":"An induced packing of cycles in a graph is a set of vertex-disjoint cycles with no edges between them. We generalise the classic Erd\\H{o}s-P\\'osa theorem to induced packings of cycles. More specifically, we show that there exist functions $f(k,\\ell)=\\mathcal{O}(\\ell k\\log k)$ and $g(k)=\\mathcal{O}(k\\log k)$ such that for all integers $k\\geq1$ and $\\ell\\geq3$, every graph $G$ contains either an induced packing of $k$ cycles of length at least $\\ell$, not necessarily induced cycles, or sets $X_1$ and $X_2$ of vertices with $|X_1|\\leq f(k,\\ell)$ and $|X_2|\\leq g(k)$ such that, after removing the "},"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":"2407.05883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-07-08T12:44:18Z","cross_cats_sorted":[],"title_canon_sha256":"214f5700245049354d04bdbfe292d0c92b82d3ceb811e1c0fa802ac13ebd0caa","abstract_canon_sha256":"47b9b79e3a1ab98ae9d7241e237d222957f2fbc4e105d8d4f90cf3a9070c4e22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:59:17.266956Z","signature_b64":"77UVvAbDgkeZ3AkxlJDdvq8BP7IiJ7bqvNcLy2mGEhkjJ1KG6uabFH9pgANFK/vW8iGZDWIFbBGwYBMUJgKUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61f8fb756a3fb54e2c970a5cf5606ff817e340be4ae43c24d35024df9b793f16","last_reissued_at":"2026-07-05T09:59:17.266428Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:59:17.266428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A coarse Erd\\H{o}s-P\\'{o}sa theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. Pascal Gollin, Jungho Ahn, O-joung Kwon, Tony Huynh","submitted_at":"2024-07-08T12:44:18Z","abstract_excerpt":"An induced packing of cycles in a graph is a set of vertex-disjoint cycles with no edges between them. We generalise the classic Erd\\H{o}s-P\\'osa theorem to induced packings of cycles. More specifically, we show that there exist functions $f(k,\\ell)=\\mathcal{O}(\\ell k\\log k)$ and $g(k)=\\mathcal{O}(k\\log k)$ such that for all integers $k\\geq1$ and $\\ell\\geq3$, every graph $G$ contains either an induced packing of $k$ cycles of length at least $\\ell$, not necessarily induced cycles, or sets $X_1$ and $X_2$ of vertices with $|X_1|\\leq f(k,\\ell)$ and $|X_2|\\leq g(k)$ such that, after removing the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05883","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.05883/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":"2407.05883","created_at":"2026-07-05T09:59:17.266496+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.05883v2","created_at":"2026-07-05T09:59:17.266496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05883","created_at":"2026-07-05T09:59:17.266496+00:00"},{"alias_kind":"pith_short_12","alias_value":"MH4PW5LKH62U","created_at":"2026-07-05T09:59:17.266496+00:00"},{"alias_kind":"pith_short_16","alias_value":"MH4PW5LKH62U4LEX","created_at":"2026-07-05T09:59:17.266496+00:00"},{"alias_kind":"pith_short_8","alias_value":"MH4PW5LK","created_at":"2026-07-05T09:59:17.266496+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.04026","citing_title":"Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MH4PW5LKH62U4LEXBJOPKYDP7A","json":"https://pith.science/pith/MH4PW5LKH62U4LEXBJOPKYDP7A.json","graph_json":"https://pith.science/api/pith-number/MH4PW5LKH62U4LEXBJOPKYDP7A/graph.json","events_json":"https://pith.science/api/pith-number/MH4PW5LKH62U4LEXBJOPKYDP7A/events.json","paper":"https://pith.science/paper/MH4PW5LK"},"agent_actions":{"view_html":"https://pith.science/pith/MH4PW5LKH62U4LEXBJOPKYDP7A","download_json":"https://pith.science/pith/MH4PW5LKH62U4LEXBJOPKYDP7A.json","view_paper":"https://pith.science/paper/MH4PW5LK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.05883&json=true","fetch_graph":"https://pith.science/api/pith-number/MH4PW5LKH62U4LEXBJOPKYDP7A/graph.json","fetch_events":"https://pith.science/api/pith-number/MH4PW5LKH62U4LEXBJOPKYDP7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MH4PW5LKH62U4LEXBJOPKYDP7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MH4PW5LKH62U4LEXBJOPKYDP7A/action/storage_attestation","attest_author":"https://pith.science/pith/MH4PW5LKH62U4LEXBJOPKYDP7A/action/author_attestation","sign_citation":"https://pith.science/pith/MH4PW5LKH62U4LEXBJOPKYDP7A/action/citation_signature","submit_replication":"https://pith.science/pith/MH4PW5LKH62U4LEXBJOPKYDP7A/action/replication_record"}},"created_at":"2026-07-05T09:59:17.266496+00:00","updated_at":"2026-07-05T09:59:17.266496+00:00"}