{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3H4PHQUBLLAVGW3HZR2ZCS2WOU","short_pith_number":"pith:3H4PHQUB","schema_version":"1.0","canonical_sha256":"d9f8f3c2815ac1535b67cc75914b56753093bfcf010cfefce2b7690079a253a0","source":{"kind":"arxiv","id":"2410.18878","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.18878","created_at":"2026-07-05T09:25:49.499634+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.18878v2","created_at":"2026-07-05T09:25:49.499634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18878","created_at":"2026-07-05T09:25:49.499634+00:00"},{"alias_kind":"pith_short_12","alias_value":"3H4PHQUBLLAV","created_at":"2026-07-05T09:25:49.499634+00:00"},{"alias_kind":"pith_short_16","alias_value":"3H4PHQUBLLAVGW3H","created_at":"2026-07-05T09:25:49.499634+00:00"},{"alias_kind":"pith_short_8","alias_value":"3H4PHQUB","created_at":"2026-07-05T09:25:49.499634+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/3H4PHQUBLLAVGW3HZR2ZCS2WOU","json":"https://pith.science/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU.json","graph_json":"https://pith.science/api/pith-number/3H4PHQUBLLAVGW3HZR2ZCS2WOU/graph.json","events_json":"https://pith.science/api/pith-number/3H4PHQUBLLAVGW3HZR2ZCS2WOU/events.json","paper":"https://pith.science/paper/3H4PHQUB"},"agent_actions":{"view_html":"https://pith.science/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU","download_json":"https://pith.science/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU.json","view_paper":"https://pith.science/paper/3H4PHQUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.18878&json=true","fetch_graph":"https://pith.science/api/pith-number/3H4PHQUBLLAVGW3HZR2ZCS2WOU/graph.json","fetch_events":"https://pith.science/api/pith-number/3H4PHQUBLLAVGW3HZR2ZCS2WOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU/action/storage_attestation","attest_author":"https://pith.science/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU/action/author_attestation","sign_citation":"https://pith.science/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU/action/citation_signature","submit_replication":"https://pith.science/pith/3H4PHQUBLLAVGW3HZR2ZCS2WOU/action/replication_record"}},"created_at":"2026-07-05T09:25:49.499634+00:00","updated_at":"2026-07-05T09:25:49.499634+00:00"}