{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EJWNCJD3HAQMCXSL7RCZVO3HKF","short_pith_number":"pith:EJWNCJD3","schema_version":"1.0","canonical_sha256":"226cd1247b3820c15e4bfc459abb675177706194d593336fdff8a9f8d60e19ae","source":{"kind":"arxiv","id":"1603.07588","version":1},"attestation_state":"computed","paper":{"title":"A tight Erd\\H{o}s-P\\'osa function for long cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andreas Noever, Felix Weissenberger, Frank Mousset, Nemanja \\v{S}kori\\'c","submitted_at":"2016-03-24T14:22:44Z","abstract_excerpt":"A classic result of Erd\\H{o}s and P\\'osa says that any graph contains either $k$ vertex-disjoint cycles or can be made acyclic by deleting at most $O(k \\log k)$ vertices. Here we generalize this result by showing that for all numbers $k$ and $l$ and for every graph $G$, either $G$ contains $k$ vertex-disjoint cycles of length at least $l$, or there exists a set $X$ of $\\mathcal O(kl+k\\log k)$ vertices that meets all cycles of length at least $l$ in $G$. As a corollary, the tree-width of any graph $G$ that does not contain $k$ vertex-disjoint cycles of length at least $l$ is of order $\\mathcal "},"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":"1603.07588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-24T14:22:44Z","cross_cats_sorted":[],"title_canon_sha256":"e80d22247a9e66a9789e9cda989689391af9e6608246fe938463a7b07b53a77a","abstract_canon_sha256":"557465d818dfb10a211a5ce5cd9a33dc676a0389470d78ffb852c6004cced563"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:20.473205Z","signature_b64":"UGKmQ2m+0Uck+dQBo8hRbZk83YBeC1sBHe6Kdh5qxi49wLDf9U5OdLEi8hxrfjJdi+b+sKMnMWB/qAST8qgMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"226cd1247b3820c15e4bfc459abb675177706194d593336fdff8a9f8d60e19ae","last_reissued_at":"2026-05-18T01:18:20.472524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:20.472524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A tight Erd\\H{o}s-P\\'osa function for long cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andreas Noever, Felix Weissenberger, Frank Mousset, Nemanja \\v{S}kori\\'c","submitted_at":"2016-03-24T14:22:44Z","abstract_excerpt":"A classic result of Erd\\H{o}s and P\\'osa says that any graph contains either $k$ vertex-disjoint cycles or can be made acyclic by deleting at most $O(k \\log k)$ vertices. Here we generalize this result by showing that for all numbers $k$ and $l$ and for every graph $G$, either $G$ contains $k$ vertex-disjoint cycles of length at least $l$, or there exists a set $X$ of $\\mathcal O(kl+k\\log k)$ vertices that meets all cycles of length at least $l$ in $G$. As a corollary, the tree-width of any graph $G$ that does not contain $k$ vertex-disjoint cycles of length at least $l$ is of order $\\mathcal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07588","kind":"arxiv","version":1},"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":"1603.07588","created_at":"2026-05-18T01:18:20.472639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07588v1","created_at":"2026-05-18T01:18:20.472639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07588","created_at":"2026-05-18T01:18:20.472639+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJWNCJD3HAQM","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJWNCJD3HAQMCXSL","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJWNCJD3","created_at":"2026-05-18T12:30:12.583610+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/EJWNCJD3HAQMCXSL7RCZVO3HKF","json":"https://pith.science/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF.json","graph_json":"https://pith.science/api/pith-number/EJWNCJD3HAQMCXSL7RCZVO3HKF/graph.json","events_json":"https://pith.science/api/pith-number/EJWNCJD3HAQMCXSL7RCZVO3HKF/events.json","paper":"https://pith.science/paper/EJWNCJD3"},"agent_actions":{"view_html":"https://pith.science/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF","download_json":"https://pith.science/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF.json","view_paper":"https://pith.science/paper/EJWNCJD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07588&json=true","fetch_graph":"https://pith.science/api/pith-number/EJWNCJD3HAQMCXSL7RCZVO3HKF/graph.json","fetch_events":"https://pith.science/api/pith-number/EJWNCJD3HAQMCXSL7RCZVO3HKF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF/action/storage_attestation","attest_author":"https://pith.science/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF/action/author_attestation","sign_citation":"https://pith.science/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF/action/citation_signature","submit_replication":"https://pith.science/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF/action/replication_record"}},"created_at":"2026-05-18T01:18:20.472639+00:00","updated_at":"2026-05-18T01:18:20.472639+00:00"}