{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:47U4QABVKFLSKKD6T7ZT7LLLT3","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":"9d901b2e7dbf82c64d87e49f611b1d2d5f5f7d7ddee20a1ea52d8890edc561c4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-04T15:29:17Z","title_canon_sha256":"ff8e58c7ec4b9361960a75e04f7e5ad0d8ab15caa5e9e62226c24d8a2032269e"},"schema_version":"1.0","source":{"id":"1707.01037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01037","created_at":"2026-05-18T00:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01037v1","created_at":"2026-05-18T00:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01037","created_at":"2026-05-18T00:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"47U4QABVKFLS","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"47U4QABVKFLSKKD6","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"47U4QABV","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:be86c0afd0fd3a91c9614068cac244f016d174113cd449ea1c18dc31c7bfe93c","target":"graph","created_at":"2026-05-18T00:40:56Z","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":"The Cycle Packing problem asks whether a given undirected graph $G=(V,E)$ contains $k$ vertex-disjoint cycles. Since the publication of the classic Erd\\H{o}s-P\\'osa theorem in 1965, this problem received significant scientific attention in the fields of Graph Theory and Algorithm Design. In particular, this problem is one of the first problems studied in the framework of Parameterized Complexity. The non-uniform fixed-parameter tractability of Cycle Packing follows from the Robertson-Seymour theorem, a fact already observed by Fellows and Langston in the 1980s. In 1994, Bodlaender showed that ","authors_text":"Amer E. Mouawad, Daniel Lokshtanov, Meirav Zehavi, Saket Saurabh","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-04T15:29:17Z","title":"Packing Cycles Faster Than Erd\\H{o}s-P\\'osa"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01037","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:d3f63be6add7a9a3f6d15a0da40947d68a903845321c789bda9fc499be47adaa","target":"record","created_at":"2026-05-18T00:40:56Z","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":"9d901b2e7dbf82c64d87e49f611b1d2d5f5f7d7ddee20a1ea52d8890edc561c4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-04T15:29:17Z","title_canon_sha256":"ff8e58c7ec4b9361960a75e04f7e5ad0d8ab15caa5e9e62226c24d8a2032269e"},"schema_version":"1.0","source":{"id":"1707.01037","kind":"arxiv","version":1}},"canonical_sha256":"e7e9c80035515725287e9ff33fad6b9edfaf784098172c352e8569bc4284335a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7e9c80035515725287e9ff33fad6b9edfaf784098172c352e8569bc4284335a","first_computed_at":"2026-05-18T00:40:56.329380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:56.329380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rthKPkTam7ZzJG9XWxCgqYzrN7MRJJXhohtdxqSbj+y62ueSeT/zQNHubGF7RxrID6F9WXkxWtz6TFdvsP32Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:56.330079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3f63be6add7a9a3f6d15a0da40947d68a903845321c789bda9fc499be47adaa","sha256:be86c0afd0fd3a91c9614068cac244f016d174113cd449ea1c18dc31c7bfe93c"],"state_sha256":"7c8def9c41493b943afb4579191b66a6c3ea69e6e85a87f1afe787f68809d9f4"}