{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3H4PHQUBLLAVGW3HZR2ZCS2WOU","short_pith_number":"pith:3H4PHQUB","canonical_record":{"source":{"id":"2410.18878","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-24T16:08:41Z","cross_cats_sorted":[],"title_canon_sha256":"431909e97fdc9f321590e65b12a0cba167ac7df0115f20e5c02b8dacd83b9acc","abstract_canon_sha256":"5fc097c44dffcb222326724ea91fa2f438ec41373eac1b0ea4a98bc461eb6f5d"},"schema_version":"1.0"},"canonical_sha256":"d9f8f3c2815ac1535b67cc75914b56753093bfcf010cfefce2b7690079a253a0","source":{"kind":"arxiv","id":"2410.18878","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.18878","created_at":"2026-07-05T09:25:49Z"},{"alias_kind":"arxiv_version","alias_value":"2410.18878v2","created_at":"2026-07-05T09:25:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18878","created_at":"2026-07-05T09:25:49Z"},{"alias_kind":"pith_short_12","alias_value":"3H4PHQUBLLAV","created_at":"2026-07-05T09:25:49Z"},{"alias_kind":"pith_short_16","alias_value":"3H4PHQUBLLAVGW3H","created_at":"2026-07-05T09:25:49Z"},{"alias_kind":"pith_short_8","alias_value":"3H4PHQUB","created_at":"2026-07-05T09:25:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3H4PHQUBLLAVGW3HZR2ZCS2WOU","target":"record","payload":{"canonical_record":{"source":{"id":"2410.18878","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-24T16:08:41Z","cross_cats_sorted":[],"title_canon_sha256":"431909e97fdc9f321590e65b12a0cba167ac7df0115f20e5c02b8dacd83b9acc","abstract_canon_sha256":"5fc097c44dffcb222326724ea91fa2f438ec41373eac1b0ea4a98bc461eb6f5d"},"schema_version":"1.0"},"canonical_sha256":"d9f8f3c2815ac1535b67cc75914b56753093bfcf010cfefce2b7690079a253a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:25:49.500020Z","signature_b64":"LAKolUWW5U571YBZA2ro05ZX0WhBsE1q2FqlZHW/95p8LFr980LDK4sVsfh4s7S5AC0O7wtn6+iYh1HkKlCSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9f8f3c2815ac1535b67cc75914b56753093bfcf010cfefce2b7690079a253a0","last_reissued_at":"2026-07-05T09:25:49.499568Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:25:49.499568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.18878","source_version":2,"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-07-05T09:25:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z17dfEjUPNAq5Bm0Io4dlFYuzUV3mEyicpIYzB2ALnFtSP3NyStHZFkAsz7MH45SrbSx//sZoCA+6++4A+K0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:39:53.454206Z"},"content_sha256":"64241aadc9e9703965afc5a455ae651b31e4362404cbc49557e78e904e578098","schema_version":"1.0","event_id":"sha256:64241aadc9e9703965afc5a455ae651b31e4362404cbc49557e78e904e578098"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3H4PHQUBLLAVGW3HZR2ZCS2WOU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing Short Cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fahad Panolan, Fedor V. Fomin, Kirill Simonov, Matthias Bentert, M. S. Ramanujan, Petr A. Golovach, Saket Saurabh, Tuukka Korhonen, William Lochet","submitted_at":"2024-10-24T16:08:41Z","abstract_excerpt":"Cycle packing is a fundamental problem in optimization, graph theory, and algorithms. Motivated by recent advancements in finding vertex-disjoint paths between a specified set of vertices that either minimize the total length of the paths [Bj\\\"orklund, Husfeldt, ICALP 2014; Mari, Mukherjee, Pilipczuk, and Sankowski, SODA 2024] or request the paths to be shortest [Lochet, SODA 2021], we consider the following cycle packing problems: Min-Sum Cycle Packing and Shortest Cycle Packing.\n  In Min-Sum Cycle Packing, we try to find, in a weighted undirected graph, $k$ vertex-disjoint cycles of minimum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.18878","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.18878/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:25:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mIgAg7L94G9UWq5Ign8C3Cy3XBX8iOXAmUy6fs0Yiafc4bFaWiXcji6a9gD7WQa8mmN6dz56UZqKcdy09lODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:39:53.454765Z"},"content_sha256":"10f486f1f5a71d30fcc2c6fe264d517ff6bbd7df4f0f87229a841e56a811c95a","schema_version":"1.0","event_id":"sha256:10f486f1f5a71d30fcc2c6fe264d517ff6bbd7df4f0f87229a841e56a811c95a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU/bundle.json","state_url":"https://pith.science/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU/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-08-14T06:39:53Z","links":{"resolver":"https://pith.science/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU","bundle":"https://pith.science/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU/bundle.json","state":"https://pith.science/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3H4PHQUBLLAVGW3HZR2ZCS2WOU","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":"5fc097c44dffcb222326724ea91fa2f438ec41373eac1b0ea4a98bc461eb6f5d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-24T16:08:41Z","title_canon_sha256":"431909e97fdc9f321590e65b12a0cba167ac7df0115f20e5c02b8dacd83b9acc"},"schema_version":"1.0","source":{"id":"2410.18878","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.18878","created_at":"2026-07-05T09:25:49Z"},{"alias_kind":"arxiv_version","alias_value":"2410.18878v2","created_at":"2026-07-05T09:25:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18878","created_at":"2026-07-05T09:25:49Z"},{"alias_kind":"pith_short_12","alias_value":"3H4PHQUBLLAV","created_at":"2026-07-05T09:25:49Z"},{"alias_kind":"pith_short_16","alias_value":"3H4PHQUBLLAVGW3H","created_at":"2026-07-05T09:25:49Z"},{"alias_kind":"pith_short_8","alias_value":"3H4PHQUB","created_at":"2026-07-05T09:25:49Z"}],"graph_snapshots":[{"event_id":"sha256:10f486f1f5a71d30fcc2c6fe264d517ff6bbd7df4f0f87229a841e56a811c95a","target":"graph","created_at":"2026-07-05T09:25:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.18878/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cycle packing is a fundamental problem in optimization, graph theory, and algorithms. Motivated by recent advancements in finding vertex-disjoint paths between a specified set of vertices that either minimize the total length of the paths [Bj\\\"orklund, Husfeldt, ICALP 2014; Mari, Mukherjee, Pilipczuk, and Sankowski, SODA 2024] or request the paths to be shortest [Lochet, SODA 2021], we consider the following cycle packing problems: Min-Sum Cycle Packing and Shortest Cycle Packing.\n  In Min-Sum Cycle Packing, we try to find, in a weighted undirected graph, $k$ vertex-disjoint cycles of minimum ","authors_text":"Fahad Panolan, Fedor V. Fomin, Kirill Simonov, Matthias Bentert, M. S. Ramanujan, Petr A. Golovach, Saket Saurabh, Tuukka Korhonen, William Lochet","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-24T16:08:41Z","title":"Packing Short Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.18878","kind":"arxiv","version":2},"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:64241aadc9e9703965afc5a455ae651b31e4362404cbc49557e78e904e578098","target":"record","created_at":"2026-07-05T09:25:49Z","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":"5fc097c44dffcb222326724ea91fa2f438ec41373eac1b0ea4a98bc461eb6f5d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-24T16:08:41Z","title_canon_sha256":"431909e97fdc9f321590e65b12a0cba167ac7df0115f20e5c02b8dacd83b9acc"},"schema_version":"1.0","source":{"id":"2410.18878","kind":"arxiv","version":2}},"canonical_sha256":"d9f8f3c2815ac1535b67cc75914b56753093bfcf010cfefce2b7690079a253a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9f8f3c2815ac1535b67cc75914b56753093bfcf010cfefce2b7690079a253a0","first_computed_at":"2026-07-05T09:25:49.499568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:25:49.499568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LAKolUWW5U571YBZA2ro05ZX0WhBsE1q2FqlZHW/95p8LFr980LDK4sVsfh4s7S5AC0O7wtn6+iYh1HkKlCSCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:25:49.500020Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.18878","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64241aadc9e9703965afc5a455ae651b31e4362404cbc49557e78e904e578098","sha256:10f486f1f5a71d30fcc2c6fe264d517ff6bbd7df4f0f87229a841e56a811c95a"],"state_sha256":"a8d169b42e6ccaed43b526a8272d5b2a3ae290313bddfe8030f8da179b642c29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vn2itSPu5K/FV7smNSPx0AwA0yeWv8d0EPTD/F+cGRJneYLTcpYqwclQPAaXceO/Yf0LbWdxIdxPrTnVcsOuCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:39:53.460346Z","bundle_sha256":"938efd2c2c86299fcc33ff07d3889e86dec1dc1f60834a652d99c0a81c1f54e6"}}