{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A3HBZN7VL7WRMPO6MGTF2SHROG","short_pith_number":"pith:A3HBZN7V","canonical_record":{"source":{"id":"1412.2894","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-09T09:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"3e76aa011ec0227a5294a7106f980559a8f842f3628d8f1a6316051e3ac49c2e","abstract_canon_sha256":"e959d7a509ef0e73897e296371df52fe2e29582d303690842af73fdc9f22d190"},"schema_version":"1.0"},"canonical_sha256":"06ce1cb7f55fed163dde61a65d48f17193acad6b63e6592636619aed20de8942","source":{"kind":"arxiv","id":"1412.2894","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2894","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2894v2","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2894","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"A3HBZN7VL7WR","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A3HBZN7VL7WRMPO6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A3HBZN7V","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A3HBZN7VL7WRMPO6MGTF2SHROG","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2894","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-09T09:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"3e76aa011ec0227a5294a7106f980559a8f842f3628d8f1a6316051e3ac49c2e","abstract_canon_sha256":"e959d7a509ef0e73897e296371df52fe2e29582d303690842af73fdc9f22d190"},"schema_version":"1.0"},"canonical_sha256":"06ce1cb7f55fed163dde61a65d48f17193acad6b63e6592636619aed20de8942","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:03.775995Z","signature_b64":"aZdGp4sUJThGg7XV3Ft7nzSasV883oWLytR2KZdUETEk3rpQPPq/9Fj2nwNIIYhrBGFWdzLbZ8br2Ev/RIknCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06ce1cb7f55fed163dde61a65d48f17193acad6b63e6592636619aed20de8942","last_reissued_at":"2026-05-18T02:18:03.775270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:03.775270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2894","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-18T02:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uk2OQFw9uiNXl49oF18ZFyTXWuKsJYPwolZkrUVOu/tO3o+jW8RvefKw/f7dNvsPs66kPL4BqPQTtxw5H7oxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:04:00.795799Z"},"content_sha256":"2d5c9354373e379fb5a490cbe828a6a131376c5e062b76143801ef42b5c19ec3","schema_version":"1.0","event_id":"sha256:2d5c9354373e379fb5a490cbe828a6a131376c5e062b76143801ef42b5c19ec3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A3HBZN7VL7WRMPO6MGTF2SHROG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Long cycles through prescribed vertices have the Erd\\H{o}s-P\\'osa property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Joos, Henning Bruhn, Oliver Schaudt","submitted_at":"2014-12-09T09:50:13Z","abstract_excerpt":"We prove that for every graph, any vertex subset $S$, and given integers $k,\\ell$: there are $k$ disjoint cycles of length at least $\\ell$ that each contain at least one vertex from $S$, or a vertex set of size $O(\\ell \\cdot k \\log k)$ that meets all such cycles. This generalises previous results of Fiorini and Hendrickx and of Pontecorvi and Wollan.\n  In addition, we describe an algorithm for our main result that runs in $O(k \\log k \\cdot s^2 \\cdot (f(\\ell) \\cdot n+m))$ time, where $s$ denotes the cardinality of $S$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2894","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-18T02:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tItjZbxCbPNi+PnF9/kphviCTgLh+I6XIQIYLhb0Cwz5CnflXEF1Ps+cvSRca8luz4txxxaEuT3aoW1M/8BJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:04:00.796146Z"},"content_sha256":"265b056d88d4744e3bc2e98fb4a5f21e85c57fcef959bc804cb48a07ed0c1eb5","schema_version":"1.0","event_id":"sha256:265b056d88d4744e3bc2e98fb4a5f21e85c57fcef959bc804cb48a07ed0c1eb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3HBZN7VL7WRMPO6MGTF2SHROG/bundle.json","state_url":"https://pith.science/pith/A3HBZN7VL7WRMPO6MGTF2SHROG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3HBZN7VL7WRMPO6MGTF2SHROG/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-06-04T06:04:00Z","links":{"resolver":"https://pith.science/pith/A3HBZN7VL7WRMPO6MGTF2SHROG","bundle":"https://pith.science/pith/A3HBZN7VL7WRMPO6MGTF2SHROG/bundle.json","state":"https://pith.science/pith/A3HBZN7VL7WRMPO6MGTF2SHROG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3HBZN7VL7WRMPO6MGTF2SHROG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A3HBZN7VL7WRMPO6MGTF2SHROG","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":"e959d7a509ef0e73897e296371df52fe2e29582d303690842af73fdc9f22d190","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-09T09:50:13Z","title_canon_sha256":"3e76aa011ec0227a5294a7106f980559a8f842f3628d8f1a6316051e3ac49c2e"},"schema_version":"1.0","source":{"id":"1412.2894","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2894","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2894v2","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2894","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"A3HBZN7VL7WR","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A3HBZN7VL7WRMPO6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A3HBZN7V","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:265b056d88d4744e3bc2e98fb4a5f21e85c57fcef959bc804cb48a07ed0c1eb5","target":"graph","created_at":"2026-05-18T02:18:03Z","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":"We prove that for every graph, any vertex subset $S$, and given integers $k,\\ell$: there are $k$ disjoint cycles of length at least $\\ell$ that each contain at least one vertex from $S$, or a vertex set of size $O(\\ell \\cdot k \\log k)$ that meets all such cycles. This generalises previous results of Fiorini and Hendrickx and of Pontecorvi and Wollan.\n  In addition, we describe an algorithm for our main result that runs in $O(k \\log k \\cdot s^2 \\cdot (f(\\ell) \\cdot n+m))$ time, where $s$ denotes the cardinality of $S$.","authors_text":"Felix Joos, Henning Bruhn, Oliver Schaudt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-09T09:50:13Z","title":"Long cycles through prescribed vertices have the Erd\\H{o}s-P\\'osa property"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2894","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:2d5c9354373e379fb5a490cbe828a6a131376c5e062b76143801ef42b5c19ec3","target":"record","created_at":"2026-05-18T02:18:03Z","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":"e959d7a509ef0e73897e296371df52fe2e29582d303690842af73fdc9f22d190","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-09T09:50:13Z","title_canon_sha256":"3e76aa011ec0227a5294a7106f980559a8f842f3628d8f1a6316051e3ac49c2e"},"schema_version":"1.0","source":{"id":"1412.2894","kind":"arxiv","version":2}},"canonical_sha256":"06ce1cb7f55fed163dde61a65d48f17193acad6b63e6592636619aed20de8942","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06ce1cb7f55fed163dde61a65d48f17193acad6b63e6592636619aed20de8942","first_computed_at":"2026-05-18T02:18:03.775270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:03.775270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aZdGp4sUJThGg7XV3Ft7nzSasV883oWLytR2KZdUETEk3rpQPPq/9Fj2nwNIIYhrBGFWdzLbZ8br2Ev/RIknCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:03.775995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2894","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d5c9354373e379fb5a490cbe828a6a131376c5e062b76143801ef42b5c19ec3","sha256:265b056d88d4744e3bc2e98fb4a5f21e85c57fcef959bc804cb48a07ed0c1eb5"],"state_sha256":"2dd63a464e2714935bbd602d941b9633133d699e0a519459c4c73482b6093f11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C1mtbs5zXGoBtL1eO1DsKlVNg3Hu3/wJsd/3JJOZ8QbH4Y10r4AeuOjH6lkHBPmmc6GR2a+i0F7QtsL+v16+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:04:00.798169Z","bundle_sha256":"ac9cbb2bd3bb340edb03c5780bc54868041e67f46f26b93383d51f3fc535137f"}}