{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:U6E56VBICTYG7KJPOFAHJ7YOXD","short_pith_number":"pith:U6E56VBI","schema_version":"1.0","canonical_sha256":"a789df542814f06fa92f714074ff0eb8dd4b0de5e9222093d621c57ef56ed2d1","source":{"kind":"arxiv","id":"1411.6554","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.6554","created_at":"2026-05-18T01:20:47.305026+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6554v4","created_at":"2026-05-18T01:20:47.305026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6554","created_at":"2026-05-18T01:20:47.305026+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6E56VBICTYG","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6E56VBICTYG7KJP","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6E56VBI","created_at":"2026-05-18T12:28:52.271510+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/U6E56VBICTYG7KJPOFAHJ7YOXD","json":"https://pith.science/pith/U6E56VBICTYG7KJPOFAHJ7YOXD.json","graph_json":"https://pith.science/api/pith-number/U6E56VBICTYG7KJPOFAHJ7YOXD/graph.json","events_json":"https://pith.science/api/pith-number/U6E56VBICTYG7KJPOFAHJ7YOXD/events.json","paper":"https://pith.science/paper/U6E56VBI"},"agent_actions":{"view_html":"https://pith.science/pith/U6E56VBICTYG7KJPOFAHJ7YOXD","download_json":"https://pith.science/pith/U6E56VBICTYG7KJPOFAHJ7YOXD.json","view_paper":"https://pith.science/paper/U6E56VBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6554&json=true","fetch_graph":"https://pith.science/api/pith-number/U6E56VBICTYG7KJPOFAHJ7YOXD/graph.json","fetch_events":"https://pith.science/api/pith-number/U6E56VBICTYG7KJPOFAHJ7YOXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6E56VBICTYG7KJPOFAHJ7YOXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6E56VBICTYG7KJPOFAHJ7YOXD/action/storage_attestation","attest_author":"https://pith.science/pith/U6E56VBICTYG7KJPOFAHJ7YOXD/action/author_attestation","sign_citation":"https://pith.science/pith/U6E56VBICTYG7KJPOFAHJ7YOXD/action/citation_signature","submit_replication":"https://pith.science/pith/U6E56VBICTYG7KJPOFAHJ7YOXD/action/replication_record"}},"created_at":"2026-05-18T01:20:47.305026+00:00","updated_at":"2026-05-18T01:20:47.305026+00:00"}