{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B5FAZM5ACIDDX7BYA32NH2EQKW","short_pith_number":"pith:B5FAZM5A","schema_version":"1.0","canonical_sha256":"0f4a0cb3a012063bfc3806f4d3e89055b9f4cafa9a69506bfd9060ab1b91eb7d","source":{"kind":"arxiv","id":"1802.07090","version":1},"attestation_state":"computed","paper":{"title":"The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abhishek Sahu, Meirav Zehavi, R. Krithika, Saket Saurabh","submitted_at":"2018-02-20T12:43:05Z","abstract_excerpt":"Given a directed graph $D$ on $n$ vertices and a positive integer $k$, the Arc-Disjoint Cycle Packing problem is to determine whether $D$ has $k$ arc-disjoint cycles. This problem is known to be W[1]-hard in general directed graphs. In this paper, we initiate a systematic study on the parameterized complexity of the problem restricted to tournaments. We show that the problem is fixed-parameter tractable and admits a polynomial kernel when parameterized by the solution size $k$. In particular, we show that it can be solved in $2^{\\mathcal{O}(k \\log k)} n^{\\mathcal{O}(1)}$ time and has a kernel "},"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":"1802.07090","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T12:43:05Z","cross_cats_sorted":[],"title_canon_sha256":"30f76e2631ef3bed8312df5d1827ddc937f837307ba984d7964456f4f328b302","abstract_canon_sha256":"4c5b1b012c378ae7ec5a441f94dc625208bee8b2c805ae369056e9a0b9728757"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:53.580566Z","signature_b64":"XN/1/AqOKdazRMTCq7ewnLfEU7BnPEdJ2wT6Swp9RCESb7nfM1F8Gw/062+S/WEQa0o75mSQjGIMrAeikNVnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f4a0cb3a012063bfc3806f4d3e89055b9f4cafa9a69506bfd9060ab1b91eb7d","last_reissued_at":"2026-05-18T00:22:53.580192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:53.580192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abhishek Sahu, Meirav Zehavi, R. Krithika, Saket Saurabh","submitted_at":"2018-02-20T12:43:05Z","abstract_excerpt":"Given a directed graph $D$ on $n$ vertices and a positive integer $k$, the Arc-Disjoint Cycle Packing problem is to determine whether $D$ has $k$ arc-disjoint cycles. This problem is known to be W[1]-hard in general directed graphs. In this paper, we initiate a systematic study on the parameterized complexity of the problem restricted to tournaments. We show that the problem is fixed-parameter tractable and admits a polynomial kernel when parameterized by the solution size $k$. In particular, we show that it can be solved in $2^{\\mathcal{O}(k \\log k)} n^{\\mathcal{O}(1)}$ time and has a kernel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07090","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":"1802.07090","created_at":"2026-05-18T00:22:53.580248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07090v1","created_at":"2026-05-18T00:22:53.580248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07090","created_at":"2026-05-18T00:22:53.580248+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5FAZM5ACIDD","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5FAZM5ACIDDX7BY","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5FAZM5A","created_at":"2026-05-18T12:32:13.499390+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/B5FAZM5ACIDDX7BYA32NH2EQKW","json":"https://pith.science/pith/B5FAZM5ACIDDX7BYA32NH2EQKW.json","graph_json":"https://pith.science/api/pith-number/B5FAZM5ACIDDX7BYA32NH2EQKW/graph.json","events_json":"https://pith.science/api/pith-number/B5FAZM5ACIDDX7BYA32NH2EQKW/events.json","paper":"https://pith.science/paper/B5FAZM5A"},"agent_actions":{"view_html":"https://pith.science/pith/B5FAZM5ACIDDX7BYA32NH2EQKW","download_json":"https://pith.science/pith/B5FAZM5ACIDDX7BYA32NH2EQKW.json","view_paper":"https://pith.science/paper/B5FAZM5A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07090&json=true","fetch_graph":"https://pith.science/api/pith-number/B5FAZM5ACIDDX7BYA32NH2EQKW/graph.json","fetch_events":"https://pith.science/api/pith-number/B5FAZM5ACIDDX7BYA32NH2EQKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5FAZM5ACIDDX7BYA32NH2EQKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5FAZM5ACIDDX7BYA32NH2EQKW/action/storage_attestation","attest_author":"https://pith.science/pith/B5FAZM5ACIDDX7BYA32NH2EQKW/action/author_attestation","sign_citation":"https://pith.science/pith/B5FAZM5ACIDDX7BYA32NH2EQKW/action/citation_signature","submit_replication":"https://pith.science/pith/B5FAZM5ACIDDX7BYA32NH2EQKW/action/replication_record"}},"created_at":"2026-05-18T00:22:53.580248+00:00","updated_at":"2026-05-18T00:22:53.580248+00:00"}