{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GIDAR2IRYBJUDETM6BKSHHROP4","short_pith_number":"pith:GIDAR2IR","schema_version":"1.0","canonical_sha256":"320608e911c05341926cf055239e2e7f025a20105289724db5501e2b1760a167","source":{"kind":"arxiv","id":"2410.17641","version":1},"attestation_state":"computed","paper":{"title":"Fixed-Parameter Tractability of Hedge Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh, Tuukka Korhonen","submitted_at":"2024-10-23T07:58:33Z","abstract_excerpt":"In the Hedge Cut problem, the edges of a graph are partitioned into groups called hedges, and the question is what is the minimum number of hedges to delete to disconnect the graph. Ghaffari, Karger, and Panigrahi [SODA 2017] showed that Hedge Cut can be solved in quasipolynomial-time, raising the hope for a polynomial time algorithm. Jaffke, Lima, Masar\\'ik, Pilipczuk, and Souza [SODA 2023] complemented this result by showing that assuming the Exponential Time Hypothesis (ETH), no polynomial-time algorithm exists. In this paper, we show that Hedge Cut is fixed-parameter tractable parameterize"},"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.17641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-23T07:58:33Z","cross_cats_sorted":[],"title_canon_sha256":"ca2da7d27acc2af195d567a0259f27d98c8a2cefc04744a8da1f208d6a0aa9ae","abstract_canon_sha256":"e691d999f5aab56834c04acc00a7999d0191cf0073804339510b936232be3b40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:24:42.088620Z","signature_b64":"R0BOWRCiLUX9sn36ucw7vkY2IFQbj9//Z9OIZ/83p832VDRUemZDh7Ta9abfvXjEmtqZeTUk4TSX9KT5PpdxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"320608e911c05341926cf055239e2e7f025a20105289724db5501e2b1760a167","last_reissued_at":"2026-07-05T09:24:42.088177Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:24:42.088177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-Parameter Tractability of Hedge Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh, Tuukka Korhonen","submitted_at":"2024-10-23T07:58:33Z","abstract_excerpt":"In the Hedge Cut problem, the edges of a graph are partitioned into groups called hedges, and the question is what is the minimum number of hedges to delete to disconnect the graph. Ghaffari, Karger, and Panigrahi [SODA 2017] showed that Hedge Cut can be solved in quasipolynomial-time, raising the hope for a polynomial time algorithm. Jaffke, Lima, Masar\\'ik, Pilipczuk, and Souza [SODA 2023] complemented this result by showing that assuming the Exponential Time Hypothesis (ETH), no polynomial-time algorithm exists. In this paper, we show that Hedge Cut is fixed-parameter tractable parameterize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.17641","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.17641/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.17641","created_at":"2026-07-05T09:24:42.088240+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.17641v1","created_at":"2026-07-05T09:24:42.088240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.17641","created_at":"2026-07-05T09:24:42.088240+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIDAR2IRYBJU","created_at":"2026-07-05T09:24:42.088240+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIDAR2IRYBJUDETM","created_at":"2026-07-05T09:24:42.088240+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIDAR2IR","created_at":"2026-07-05T09:24:42.088240+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24845","citing_title":"A Near-Optimal Parallel Algorithm for Finding Matroid Bases","ref_index":110,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03979","citing_title":"An $\\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases","ref_index":111,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4","json":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4.json","graph_json":"https://pith.science/api/pith-number/GIDAR2IRYBJUDETM6BKSHHROP4/graph.json","events_json":"https://pith.science/api/pith-number/GIDAR2IRYBJUDETM6BKSHHROP4/events.json","paper":"https://pith.science/paper/GIDAR2IR"},"agent_actions":{"view_html":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4","download_json":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4.json","view_paper":"https://pith.science/paper/GIDAR2IR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.17641&json=true","fetch_graph":"https://pith.science/api/pith-number/GIDAR2IRYBJUDETM6BKSHHROP4/graph.json","fetch_events":"https://pith.science/api/pith-number/GIDAR2IRYBJUDETM6BKSHHROP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4/action/storage_attestation","attest_author":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4/action/author_attestation","sign_citation":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4/action/citation_signature","submit_replication":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4/action/replication_record"}},"created_at":"2026-07-05T09:24:42.088240+00:00","updated_at":"2026-07-05T09:24:42.088240+00:00"}