{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:U6E56VBICTYG7KJPOFAHJ7YOXD","short_pith_number":"pith:U6E56VBI","canonical_record":{"source":{"id":"1411.6554","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T18:15:00Z","cross_cats_sorted":[],"title_canon_sha256":"65d7ac2ea3616921a30659768799785c30926dcadfa5bf816a7002bfc062a4c4","abstract_canon_sha256":"e68fcf53a670411c82ee41c96ae3f8c017b0dd192d41e6edf40cc4dffb9f3a80"},"schema_version":"1.0"},"canonical_sha256":"a789df542814f06fa92f714074ff0eb8dd4b0de5e9222093d621c57ef56ed2d1","source":{"kind":"arxiv","id":"1411.6554","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6554","created_at":"2026-05-18T01:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6554v4","created_at":"2026-05-18T01:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6554","created_at":"2026-05-18T01:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"U6E56VBICTYG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U6E56VBICTYG7KJP","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U6E56VBI","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:U6E56VBICTYG7KJPOFAHJ7YOXD","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6554","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T18:15:00Z","cross_cats_sorted":[],"title_canon_sha256":"65d7ac2ea3616921a30659768799785c30926dcadfa5bf816a7002bfc062a4c4","abstract_canon_sha256":"e68fcf53a670411c82ee41c96ae3f8c017b0dd192d41e6edf40cc4dffb9f3a80"},"schema_version":"1.0"},"canonical_sha256":"a789df542814f06fa92f714074ff0eb8dd4b0de5e9222093d621c57ef56ed2d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:47.305531Z","signature_b64":"7Yu8+0PhFQGN0I5pQhhstBQ2hRWi1q0aZvzkGjGU8muIGboiyRlZLQEbJSyVnPwVJuLWOTOHBUGOaZtEyB4ZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a789df542814f06fa92f714074ff0eb8dd4b0de5e9222093d621c57ef56ed2d1","last_reissued_at":"2026-05-18T01:20:47.304944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:47.304944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6554","source_version":4,"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:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mn1N8DEg7u7/0zsu+CXe6jxa75w52lDmiVcKW039ZZp7wm8SnzwATYBYHXSNWjs1Jme/3kOaWvaTq6rC93eAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:44:57.506736Z"},"content_sha256":"f1d7dd2c8cfe81816476c03e7619bc46ac5cd4d6d5c6fd7428ccc684861c7a2d","schema_version":"1.0","event_id":"sha256:f1d7dd2c8cfe81816476c03e7619bc46ac5cd4d6d5c6fd7428ccc684861c7a2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:U6E56VBICTYG7KJPOFAHJ7YOXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parity linkage and the Erd\\H{o}s-P\\'osa property of odd cycles through prescribed vertices in highly connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Joos","submitted_at":"2014-11-24T18:15:00Z","abstract_excerpt":"We show the following for every sufficiently connected graph $G$, any vertex subset $S$ of $G$, and given integer $k$: there are $k$ disjoint odd cycles in $G$ each containing a vertex of $S$ or there is set $X$ of at most $2k-2$ vertices such that $G-X$ does not contain any odd cycle that contains a vertex of $S$. We prove this via an extension of Kawarabayashi and Reed's result about parity-$k$-linked graphs (Combinatorica 29, 215-225). From this result it is easy to deduce several other well known results about the Erd\\H{o}s-P\\'osa property of odd cycles in highly connected graphs. This str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6554","kind":"arxiv","version":4},"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:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ejygzeIKfWMvv/Z3hbqAPUFegfm9qFlYSpUU1YLiD4+DYMlwiogZYJL5lVDQECiIxcuo/z1x2LaHhIeYbfiUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:44:57.507100Z"},"content_sha256":"a372a8bcad23ac3a38ed7262a36cfa0e515c0364be7433b3105028473e42293c","schema_version":"1.0","event_id":"sha256:a372a8bcad23ac3a38ed7262a36cfa0e515c0364be7433b3105028473e42293c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6E56VBICTYG7KJPOFAHJ7YOXD/bundle.json","state_url":"https://pith.science/pith/U6E56VBICTYG7KJPOFAHJ7YOXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6E56VBICTYG7KJPOFAHJ7YOXD/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-04T02:44:57Z","links":{"resolver":"https://pith.science/pith/U6E56VBICTYG7KJPOFAHJ7YOXD","bundle":"https://pith.science/pith/U6E56VBICTYG7KJPOFAHJ7YOXD/bundle.json","state":"https://pith.science/pith/U6E56VBICTYG7KJPOFAHJ7YOXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6E56VBICTYG7KJPOFAHJ7YOXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:U6E56VBICTYG7KJPOFAHJ7YOXD","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":"e68fcf53a670411c82ee41c96ae3f8c017b0dd192d41e6edf40cc4dffb9f3a80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T18:15:00Z","title_canon_sha256":"65d7ac2ea3616921a30659768799785c30926dcadfa5bf816a7002bfc062a4c4"},"schema_version":"1.0","source":{"id":"1411.6554","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6554","created_at":"2026-05-18T01:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6554v4","created_at":"2026-05-18T01:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6554","created_at":"2026-05-18T01:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"U6E56VBICTYG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U6E56VBICTYG7KJP","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U6E56VBI","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:a372a8bcad23ac3a38ed7262a36cfa0e515c0364be7433b3105028473e42293c","target":"graph","created_at":"2026-05-18T01:20:47Z","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 show the following for every sufficiently connected graph $G$, any vertex subset $S$ of $G$, and given integer $k$: there are $k$ disjoint odd cycles in $G$ each containing a vertex of $S$ or there is set $X$ of at most $2k-2$ vertices such that $G-X$ does not contain any odd cycle that contains a vertex of $S$. We prove this via an extension of Kawarabayashi and Reed's result about parity-$k$-linked graphs (Combinatorica 29, 215-225). From this result it is easy to deduce several other well known results about the Erd\\H{o}s-P\\'osa property of odd cycles in highly connected graphs. This str","authors_text":"Felix Joos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T18:15:00Z","title":"Parity linkage and the Erd\\H{o}s-P\\'osa property of odd cycles through prescribed vertices in highly connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6554","kind":"arxiv","version":4},"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:f1d7dd2c8cfe81816476c03e7619bc46ac5cd4d6d5c6fd7428ccc684861c7a2d","target":"record","created_at":"2026-05-18T01:20:47Z","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":"e68fcf53a670411c82ee41c96ae3f8c017b0dd192d41e6edf40cc4dffb9f3a80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-24T18:15:00Z","title_canon_sha256":"65d7ac2ea3616921a30659768799785c30926dcadfa5bf816a7002bfc062a4c4"},"schema_version":"1.0","source":{"id":"1411.6554","kind":"arxiv","version":4}},"canonical_sha256":"a789df542814f06fa92f714074ff0eb8dd4b0de5e9222093d621c57ef56ed2d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a789df542814f06fa92f714074ff0eb8dd4b0de5e9222093d621c57ef56ed2d1","first_computed_at":"2026-05-18T01:20:47.304944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:47.304944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Yu8+0PhFQGN0I5pQhhstBQ2hRWi1q0aZvzkGjGU8muIGboiyRlZLQEbJSyVnPwVJuLWOTOHBUGOaZtEyB4ZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:47.305531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6554","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1d7dd2c8cfe81816476c03e7619bc46ac5cd4d6d5c6fd7428ccc684861c7a2d","sha256:a372a8bcad23ac3a38ed7262a36cfa0e515c0364be7433b3105028473e42293c"],"state_sha256":"26d8dc94671f72a8f4fceacbaff162280439dd58e108e5791d9aae63d372599c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RS9VRsE08q1blO5qE6QGgzLBjn2Nj+yaldkzjephfQjoXG66K1DEn7Pr9JGnTu559puifNRkphTfS9bMm8hTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T02:44:57.509050Z","bundle_sha256":"bbb4c46ca4542163f7e04f0a4b3e4d1a151b8c0a6f833aacff68397245a17e76"}}