{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:47U4QABVKFLSKKD6T7ZT7LLLT3","short_pith_number":"pith:47U4QABV","canonical_record":{"source":{"id":"1707.01037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-04T15:29:17Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ff8e58c7ec4b9361960a75e04f7e5ad0d8ab15caa5e9e62226c24d8a2032269e","abstract_canon_sha256":"9d901b2e7dbf82c64d87e49f611b1d2d5f5f7d7ddee20a1ea52d8890edc561c4"},"schema_version":"1.0"},"canonical_sha256":"e7e9c80035515725287e9ff33fad6b9edfaf784098172c352e8569bc4284335a","source":{"kind":"arxiv","id":"1707.01037","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:47U4QABVKFLSKKD6T7ZT7LLLT3","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-04T15:29:17Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ff8e58c7ec4b9361960a75e04f7e5ad0d8ab15caa5e9e62226c24d8a2032269e","abstract_canon_sha256":"9d901b2e7dbf82c64d87e49f611b1d2d5f5f7d7ddee20a1ea52d8890edc561c4"},"schema_version":"1.0"},"canonical_sha256":"e7e9c80035515725287e9ff33fad6b9edfaf784098172c352e8569bc4284335a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:56.330079Z","signature_b64":"rthKPkTam7ZzJG9XWxCgqYzrN7MRJJXhohtdxqSbj+y62ueSeT/zQNHubGF7RxrID6F9WXkxWtz6TFdvsP32Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7e9c80035515725287e9ff33fad6b9edfaf784098172c352e8569bc4284335a","last_reissued_at":"2026-05-18T00:40:56.329380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:56.329380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01037","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:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rkp0zIWQKJjlSbXYTAmu+uD09flxmfVRGoowFciE1HaPDA1sHIe6Hn4TNDsOiGTtpEWDO3+X/Wek86ZdK+giBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:58:12.147217Z"},"content_sha256":"d3f63be6add7a9a3f6d15a0da40947d68a903845321c789bda9fc499be47adaa","schema_version":"1.0","event_id":"sha256:d3f63be6add7a9a3f6d15a0da40947d68a903845321c789bda9fc499be47adaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:47U4QABVKFLSKKD6T7ZT7LLLT3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing Cycles Faster Than Erd\\H{o}s-P\\'osa","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Amer E. Mouawad, Daniel Lokshtanov, Meirav Zehavi, Saket Saurabh","submitted_at":"2017-07-04T15:29:17Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01037","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:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+yd9lwyFTNeb6tFUrSi6ssbCTEPnKJ05Y+o8whrx1cj/QE63BcOyM6Ekh4TQDnDqaAYTFKIrcq1GHuPhH9Y/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:58:12.147885Z"},"content_sha256":"be86c0afd0fd3a91c9614068cac244f016d174113cd449ea1c18dc31c7bfe93c","schema_version":"1.0","event_id":"sha256:be86c0afd0fd3a91c9614068cac244f016d174113cd449ea1c18dc31c7bfe93c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/47U4QABVKFLSKKD6T7ZT7LLLT3/bundle.json","state_url":"https://pith.science/pith/47U4QABVKFLSKKD6T7ZT7LLLT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/47U4QABVKFLSKKD6T7ZT7LLLT3/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-05T21:58:12Z","links":{"resolver":"https://pith.science/pith/47U4QABVKFLSKKD6T7ZT7LLLT3","bundle":"https://pith.science/pith/47U4QABVKFLSKKD6T7ZT7LLLT3/bundle.json","state":"https://pith.science/pith/47U4QABVKFLSKKD6T7ZT7LLLT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/47U4QABVKFLSKKD6T7ZT7LLLT3/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IsWwqR28wLYb6xFr+OX+ToE6DkahA3IThn4eCTCRYmt2IsPFzvIjqx1RLZxnzNK0qHM8SEo5+K/F/NmVHW6oDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:58:12.151143Z","bundle_sha256":"aaffcc6cfd1ee2bd0a14f5d7d448dc9e1c9c0de0c6b87178a623444bdba7cebb"}}