{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EJWNCJD3HAQMCXSL7RCZVO3HKF","short_pith_number":"pith:EJWNCJD3","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"},"canonical_sha256":"226cd1247b3820c15e4bfc459abb675177706194d593336fdff8a9f8d60e19ae","source":{"kind":"arxiv","id":"1603.07588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07588","created_at":"2026-05-18T01:18:20Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07588v1","created_at":"2026-05-18T01:18:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07588","created_at":"2026-05-18T01:18:20Z"},{"alias_kind":"pith_short_12","alias_value":"EJWNCJD3HAQM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EJWNCJD3HAQMCXSL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EJWNCJD3","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EJWNCJD3HAQMCXSL7RCZVO3HKF","target":"record","payload":{"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"},"canonical_sha256":"226cd1247b3820c15e4bfc459abb675177706194d593336fdff8a9f8d60e19ae","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"},"source_kind":"arxiv","source_id":"1603.07588","source_version":1,"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-18T01:18:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKISGMY6X3vJLqAEDzp1DOXa447sH/F98IN3fz6bF+9iHymHQoVwFW2y5xynjzfGvZC6Mw9AKOOWep4eU0F+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:00:50.568626Z"},"content_sha256":"2c4f4d4e8013111f34d7af606a02ea7e0a34f2daa47001788328b8643b40ce27","schema_version":"1.0","event_id":"sha256:2c4f4d4e8013111f34d7af606a02ea7e0a34f2daa47001788328b8643b40ce27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EJWNCJD3HAQMCXSL7RCZVO3HKF","target":"graph","payload":{"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"},"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-18T01:18:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BFrG3qwxqpsZnDQgscahpPB3PM9JCzKiAJY+d90+0wTkzzQxwidU4hRIAJtGreqqIVJika7UG8Xb7fNDXz8EAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:00:50.569261Z"},"content_sha256":"53121b3ccd2daf2aa38ada908f995115b3ea21b5001ace5488012daca7c41e2f","schema_version":"1.0","event_id":"sha256:53121b3ccd2daf2aa38ada908f995115b3ea21b5001ace5488012daca7c41e2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF/bundle.json","state_url":"https://pith.science/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF/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-25T19:00:50Z","links":{"resolver":"https://pith.science/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF","bundle":"https://pith.science/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF/bundle.json","state":"https://pith.science/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJWNCJD3HAQMCXSL7RCZVO3HKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EJWNCJD3HAQMCXSL7RCZVO3HKF","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":"557465d818dfb10a211a5ce5cd9a33dc676a0389470d78ffb852c6004cced563","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-24T14:22:44Z","title_canon_sha256":"e80d22247a9e66a9789e9cda989689391af9e6608246fe938463a7b07b53a77a"},"schema_version":"1.0","source":{"id":"1603.07588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07588","created_at":"2026-05-18T01:18:20Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07588v1","created_at":"2026-05-18T01:18:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07588","created_at":"2026-05-18T01:18:20Z"},{"alias_kind":"pith_short_12","alias_value":"EJWNCJD3HAQM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EJWNCJD3HAQMCXSL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EJWNCJD3","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:53121b3ccd2daf2aa38ada908f995115b3ea21b5001ace5488012daca7c41e2f","target":"graph","created_at":"2026-05-18T01:18:20Z","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":"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 ","authors_text":"Andreas Noever, Felix Weissenberger, Frank Mousset, Nemanja \\v{S}kori\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-24T14:22:44Z","title":"A tight Erd\\H{o}s-P\\'osa function for long cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07588","kind":"arxiv","version":1},"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:2c4f4d4e8013111f34d7af606a02ea7e0a34f2daa47001788328b8643b40ce27","target":"record","created_at":"2026-05-18T01:18:20Z","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":"557465d818dfb10a211a5ce5cd9a33dc676a0389470d78ffb852c6004cced563","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-24T14:22:44Z","title_canon_sha256":"e80d22247a9e66a9789e9cda989689391af9e6608246fe938463a7b07b53a77a"},"schema_version":"1.0","source":{"id":"1603.07588","kind":"arxiv","version":1}},"canonical_sha256":"226cd1247b3820c15e4bfc459abb675177706194d593336fdff8a9f8d60e19ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"226cd1247b3820c15e4bfc459abb675177706194d593336fdff8a9f8d60e19ae","first_computed_at":"2026-05-18T01:18:20.472524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:20.472524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UGKmQ2m+0Uck+dQBo8hRbZk83YBeC1sBHe6Kdh5qxi49wLDf9U5OdLEi8hxrfjJdi+b+sKMnMWB/qAST8qgMDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:20.473205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c4f4d4e8013111f34d7af606a02ea7e0a34f2daa47001788328b8643b40ce27","sha256:53121b3ccd2daf2aa38ada908f995115b3ea21b5001ace5488012daca7c41e2f"],"state_sha256":"daf0aa791bc47aef403b4e4a415445a7265ded76b09bee9e71521fc795db03c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnQjHWVgZf+S2bUqoIfKthkEG0s9NhFsBGyP8R8ozRj0xzeLEEJNINv3UlX89a0lmfW+s9/fxXulTfhdMi5xAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:00:50.572926Z","bundle_sha256":"d7025519602a0e65f776ef9c0add9a5266c46ea206289e725de6c565352362b2"}}