{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B5FAZM5ACIDDX7BYA32NH2EQKW","short_pith_number":"pith:B5FAZM5A","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"},"canonical_sha256":"0f4a0cb3a012063bfc3806f4d3e89055b9f4cafa9a69506bfd9060ab1b91eb7d","source":{"kind":"arxiv","id":"1802.07090","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07090","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07090v1","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07090","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"B5FAZM5ACIDD","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B5FAZM5ACIDDX7BY","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B5FAZM5A","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B5FAZM5ACIDDX7BYA32NH2EQKW","target":"record","payload":{"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"},"canonical_sha256":"0f4a0cb3a012063bfc3806f4d3e89055b9f4cafa9a69506bfd9060ab1b91eb7d","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"},"source_kind":"arxiv","source_id":"1802.07090","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-18T00:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NxbNIWzNHomtClfUvAF/oNBUueZGhlQOa5RpbcE4dG7ELwfnFcgOdbwoF3/cfLq0UXj/VDYhCLVeE6Ny0qzaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:19:04.271269Z"},"content_sha256":"26b2fbe5278d4670d10b0a466a5b6a3e12c1846b27727183a6fbeb82bc5fc10d","schema_version":"1.0","event_id":"sha256:26b2fbe5278d4670d10b0a466a5b6a3e12c1846b27727183a6fbeb82bc5fc10d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B5FAZM5ACIDDX7BYA32NH2EQKW","target":"graph","payload":{"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"},"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-18T00:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVevvqVOeoW6EqvSfMSPgZAzT+W5qGZmgP4xNatLiX1j+kfXkMncSa4cY6WjCyfOM74iQT0YI76YTqaE22LPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:19:04.271916Z"},"content_sha256":"3f38f90979ebdcd9d9a9c5f6a98189fb50abc6c97d5df3eb9b6cb571b953da96","schema_version":"1.0","event_id":"sha256:3f38f90979ebdcd9d9a9c5f6a98189fb50abc6c97d5df3eb9b6cb571b953da96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5FAZM5ACIDDX7BYA32NH2EQKW/bundle.json","state_url":"https://pith.science/pith/B5FAZM5ACIDDX7BYA32NH2EQKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5FAZM5ACIDDX7BYA32NH2EQKW/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-06T03:19:04Z","links":{"resolver":"https://pith.science/pith/B5FAZM5ACIDDX7BYA32NH2EQKW","bundle":"https://pith.science/pith/B5FAZM5ACIDDX7BYA32NH2EQKW/bundle.json","state":"https://pith.science/pith/B5FAZM5ACIDDX7BYA32NH2EQKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5FAZM5ACIDDX7BYA32NH2EQKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B5FAZM5ACIDDX7BYA32NH2EQKW","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":"4c5b1b012c378ae7ec5a441f94dc625208bee8b2c805ae369056e9a0b9728757","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T12:43:05Z","title_canon_sha256":"30f76e2631ef3bed8312df5d1827ddc937f837307ba984d7964456f4f328b302"},"schema_version":"1.0","source":{"id":"1802.07090","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07090","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07090v1","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07090","created_at":"2026-05-18T00:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"B5FAZM5ACIDD","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B5FAZM5ACIDDX7BY","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B5FAZM5A","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:3f38f90979ebdcd9d9a9c5f6a98189fb50abc6c97d5df3eb9b6cb571b953da96","target":"graph","created_at":"2026-05-18T00:22:53Z","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":"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 ","authors_text":"Abhishek Sahu, Meirav Zehavi, R. Krithika, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T12:43:05Z","title":"The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07090","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:26b2fbe5278d4670d10b0a466a5b6a3e12c1846b27727183a6fbeb82bc5fc10d","target":"record","created_at":"2026-05-18T00:22:53Z","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":"4c5b1b012c378ae7ec5a441f94dc625208bee8b2c805ae369056e9a0b9728757","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T12:43:05Z","title_canon_sha256":"30f76e2631ef3bed8312df5d1827ddc937f837307ba984d7964456f4f328b302"},"schema_version":"1.0","source":{"id":"1802.07090","kind":"arxiv","version":1}},"canonical_sha256":"0f4a0cb3a012063bfc3806f4d3e89055b9f4cafa9a69506bfd9060ab1b91eb7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f4a0cb3a012063bfc3806f4d3e89055b9f4cafa9a69506bfd9060ab1b91eb7d","first_computed_at":"2026-05-18T00:22:53.580192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:53.580192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XN/1/AqOKdazRMTCq7ewnLfEU7BnPEdJ2wT6Swp9RCESb7nfM1F8Gw/062+S/WEQa0o75mSQjGIMrAeikNVnDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:53.580566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07090","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26b2fbe5278d4670d10b0a466a5b6a3e12c1846b27727183a6fbeb82bc5fc10d","sha256:3f38f90979ebdcd9d9a9c5f6a98189fb50abc6c97d5df3eb9b6cb571b953da96"],"state_sha256":"883e174330fbc44dbdeb6ebf8d29141bbf5b310864250be4b46f8c5767104178"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rsTMTsVAgURdaOyhUazC71a5iR352TfaXPH1m+GKt+sEBhjH011I4+H539PkDGeqQLCxYisCovqK01v7rryJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T03:19:04.274911Z","bundle_sha256":"b184e967a2ebac993993480d6d652220b01e3f937893d6c920fc3ccec0c36296"}}