{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:GIDAR2IRYBJUDETM6BKSHHROP4","short_pith_number":"pith:GIDAR2IR","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"},"canonical_sha256":"320608e911c05341926cf055239e2e7f025a20105289724db5501e2b1760a167","source":{"kind":"arxiv","id":"2410.17641","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.17641","created_at":"2026-07-05T09:24:42Z"},{"alias_kind":"arxiv_version","alias_value":"2410.17641v1","created_at":"2026-07-05T09:24:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.17641","created_at":"2026-07-05T09:24:42Z"},{"alias_kind":"pith_short_12","alias_value":"GIDAR2IRYBJU","created_at":"2026-07-05T09:24:42Z"},{"alias_kind":"pith_short_16","alias_value":"GIDAR2IRYBJUDETM","created_at":"2026-07-05T09:24:42Z"},{"alias_kind":"pith_short_8","alias_value":"GIDAR2IR","created_at":"2026-07-05T09:24:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:GIDAR2IRYBJUDETM6BKSHHROP4","target":"record","payload":{"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"},"canonical_sha256":"320608e911c05341926cf055239e2e7f025a20105289724db5501e2b1760a167","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"},"source_kind":"arxiv","source_id":"2410.17641","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-07-05T09:24:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GcUcUuQ5Wf+H9bb1Vgs8eN055dXUme2grJMzDzIps6ZwRlrzhMsiRT7c3yu0DbPdOO8cTO67EoaBnX3gnPlrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:41:09.558592Z"},"content_sha256":"baef7ddd0fe78defa3cffb1b7d7fbd6617e076c8dc49429f1ac237fb5d7be3c1","schema_version":"1.0","event_id":"sha256:baef7ddd0fe78defa3cffb1b7d7fbd6617e076c8dc49429f1ac237fb5d7be3c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:GIDAR2IRYBJUDETM6BKSHHROP4","target":"graph","payload":{"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"},"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:24:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nAQE9hLRizesG41Hc3kw5kchn1z39CT3eh9XffG0OGubDRYeoyiaphczpodqdpumgqwVCrFYDU0X9lvHH7QICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:41:09.559109Z"},"content_sha256":"27dc47ab3d193b3542c59e5e09c2e12a2427d089e0f2d84b331ea2f3c2e25157","schema_version":"1.0","event_id":"sha256:27dc47ab3d193b3542c59e5e09c2e12a2427d089e0f2d84b331ea2f3c2e25157"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4/bundle.json","state_url":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIDAR2IRYBJUDETM6BKSHHROP4/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:41:09Z","links":{"resolver":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4","bundle":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4/bundle.json","state":"https://pith.science/pith/GIDAR2IRYBJUDETM6BKSHHROP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIDAR2IRYBJUDETM6BKSHHROP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GIDAR2IRYBJUDETM6BKSHHROP4","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":"e691d999f5aab56834c04acc00a7999d0191cf0073804339510b936232be3b40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-23T07:58:33Z","title_canon_sha256":"ca2da7d27acc2af195d567a0259f27d98c8a2cefc04744a8da1f208d6a0aa9ae"},"schema_version":"1.0","source":{"id":"2410.17641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.17641","created_at":"2026-07-05T09:24:42Z"},{"alias_kind":"arxiv_version","alias_value":"2410.17641v1","created_at":"2026-07-05T09:24:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.17641","created_at":"2026-07-05T09:24:42Z"},{"alias_kind":"pith_short_12","alias_value":"GIDAR2IRYBJU","created_at":"2026-07-05T09:24:42Z"},{"alias_kind":"pith_short_16","alias_value":"GIDAR2IRYBJUDETM","created_at":"2026-07-05T09:24:42Z"},{"alias_kind":"pith_short_8","alias_value":"GIDAR2IR","created_at":"2026-07-05T09:24:42Z"}],"graph_snapshots":[{"event_id":"sha256:27dc47ab3d193b3542c59e5e09c2e12a2427d089e0f2d84b331ea2f3c2e25157","target":"graph","created_at":"2026-07-05T09:24:42Z","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.17641/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh, Tuukka Korhonen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-23T07:58:33Z","title":"Fixed-Parameter Tractability of Hedge Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.17641","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:baef7ddd0fe78defa3cffb1b7d7fbd6617e076c8dc49429f1ac237fb5d7be3c1","target":"record","created_at":"2026-07-05T09:24:42Z","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":"e691d999f5aab56834c04acc00a7999d0191cf0073804339510b936232be3b40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-23T07:58:33Z","title_canon_sha256":"ca2da7d27acc2af195d567a0259f27d98c8a2cefc04744a8da1f208d6a0aa9ae"},"schema_version":"1.0","source":{"id":"2410.17641","kind":"arxiv","version":1}},"canonical_sha256":"320608e911c05341926cf055239e2e7f025a20105289724db5501e2b1760a167","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"320608e911c05341926cf055239e2e7f025a20105289724db5501e2b1760a167","first_computed_at":"2026-07-05T09:24:42.088177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:24:42.088177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R0BOWRCiLUX9sn36ucw7vkY2IFQbj9//Z9OIZ/83p832VDRUemZDh7Ta9abfvXjEmtqZeTUk4TSX9KT5PpdxAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:24:42.088620Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.17641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:baef7ddd0fe78defa3cffb1b7d7fbd6617e076c8dc49429f1ac237fb5d7be3c1","sha256:27dc47ab3d193b3542c59e5e09c2e12a2427d089e0f2d84b331ea2f3c2e25157"],"state_sha256":"4322dcefeb8cf7b009650259a5ea5ad535e32d4b7b06e9b72c41306b76383e03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8BXyA+u78Aq4CA1RbFxjzESpQ7xSLgV7D95JwA5VGwQClzj5MrjBli9IB6aZW1bUJ4pf2TQQXYl+5vcIswpUBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:41:09.564682Z","bundle_sha256":"e06106f4b26916b0ba352aeb8ae5bc6ab31bd7277229eed635d0d5c1e4364ee2"}}