{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UDGQKLQUFYF5P5LJQM7SSDCNF6","short_pith_number":"pith:UDGQKLQU","canonical_record":{"source":{"id":"1404.7006","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-28T14:41:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3984fd3a05c5041c5f1389f6639b98001bb7154271b5dfe21123655bd26a9f0a","abstract_canon_sha256":"b92fc4237035b7f21c567bd22d9d20984297580d7f6200c2f71352e570a0c69d"},"schema_version":"1.0"},"canonical_sha256":"a0cd052e142e0bd7f569833f290c4d2fa92d5043e50b9fa97ad7f7582bbfbcf7","source":{"kind":"arxiv","id":"1404.7006","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7006","created_at":"2026-05-18T01:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7006v2","created_at":"2026-05-18T01:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7006","created_at":"2026-05-18T01:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"UDGQKLQUFYF5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UDGQKLQUFYF5P5LJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UDGQKLQU","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UDGQKLQUFYF5P5LJQM7SSDCNF6","target":"record","payload":{"canonical_record":{"source":{"id":"1404.7006","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-28T14:41:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3984fd3a05c5041c5f1389f6639b98001bb7154271b5dfe21123655bd26a9f0a","abstract_canon_sha256":"b92fc4237035b7f21c567bd22d9d20984297580d7f6200c2f71352e570a0c69d"},"schema_version":"1.0"},"canonical_sha256":"a0cd052e142e0bd7f569833f290c4d2fa92d5043e50b9fa97ad7f7582bbfbcf7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:00.110411Z","signature_b64":"IWDmAohpfI4PkyDk16kbhYVFjRowbOl5JX7y3zwTiIWt58u0vQJYa7ffZeVWwZ8v+g3M5xJ7goAujEod+urxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0cd052e142e0bd7f569833f290c4d2fa92d5043e50b9fa97ad7f7582bbfbcf7","last_reissued_at":"2026-05-18T01:41:00.109971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:00.109971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.7006","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-05-18T01:41:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"niHpDX0Dl2d9FrjpuXx8rZRXEogsAeEcw5rZ9mkx5xWIUlHe5vVXTjYxmTqpoorahS+GjFGRXbQZ2tiNFXlnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:48:45.260511Z"},"content_sha256":"c448f05a4582694d94ef249dbd28e827823c8ff28dd7368e3da18e12772ca0c3","schema_version":"1.0","event_id":"sha256:c448f05a4582694d94ef249dbd28e827823c8ff28dd7368e3da18e12772ca0c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UDGQKLQUFYF5P5LJQM7SSDCNF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity Dichotomy for Steiner Multicut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Danny Hermelin, Erik Jan van Leeuwen, Karl Bringmann, Matthias Mnich","submitted_at":"2014-04-28T14:41:40Z","abstract_excerpt":"The Steiner Multicut problem asks, given an undirected graph G, terminals sets T1,...,Tt $\\subseteq$ V(G) of size at most p, and an integer k, whether there is a set S of at most k edges or nodes s.t. of each set Ti at least one pair of terminals is in different connected components of G \\ S. This problem generalizes several graph cut problems, in particular the Multicut problem (the case p = 2), which is fixed-parameter tractable for the parameter k [Marx and Razgon, Bousquet et al., STOC 2011].\n  We provide a dichotomy of the parameterized complexity of Steiner Multicut. That is, for any com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7006","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":""},"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-18T01:41:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DdsagdWLk7xPU1HxRbJqcJK8pZ/Pf6mgwkD7Lf17MxAynUMZfCYZhfcczkSg6LjJDzmivRw49291FyxRT3RAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:48:45.261119Z"},"content_sha256":"9c3251fe36584f47b9242703a2ae602178689efb06d1b6fd438fe4be69a92fe2","schema_version":"1.0","event_id":"sha256:9c3251fe36584f47b9242703a2ae602178689efb06d1b6fd438fe4be69a92fe2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UDGQKLQUFYF5P5LJQM7SSDCNF6/bundle.json","state_url":"https://pith.science/pith/UDGQKLQUFYF5P5LJQM7SSDCNF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UDGQKLQUFYF5P5LJQM7SSDCNF6/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-05-30T17:48:45Z","links":{"resolver":"https://pith.science/pith/UDGQKLQUFYF5P5LJQM7SSDCNF6","bundle":"https://pith.science/pith/UDGQKLQUFYF5P5LJQM7SSDCNF6/bundle.json","state":"https://pith.science/pith/UDGQKLQUFYF5P5LJQM7SSDCNF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UDGQKLQUFYF5P5LJQM7SSDCNF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UDGQKLQUFYF5P5LJQM7SSDCNF6","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":"b92fc4237035b7f21c567bd22d9d20984297580d7f6200c2f71352e570a0c69d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-28T14:41:40Z","title_canon_sha256":"3984fd3a05c5041c5f1389f6639b98001bb7154271b5dfe21123655bd26a9f0a"},"schema_version":"1.0","source":{"id":"1404.7006","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7006","created_at":"2026-05-18T01:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7006v2","created_at":"2026-05-18T01:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7006","created_at":"2026-05-18T01:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"UDGQKLQUFYF5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UDGQKLQUFYF5P5LJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UDGQKLQU","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:9c3251fe36584f47b9242703a2ae602178689efb06d1b6fd438fe4be69a92fe2","target":"graph","created_at":"2026-05-18T01:41:00Z","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 Steiner Multicut problem asks, given an undirected graph G, terminals sets T1,...,Tt $\\subseteq$ V(G) of size at most p, and an integer k, whether there is a set S of at most k edges or nodes s.t. of each set Ti at least one pair of terminals is in different connected components of G \\ S. This problem generalizes several graph cut problems, in particular the Multicut problem (the case p = 2), which is fixed-parameter tractable for the parameter k [Marx and Razgon, Bousquet et al., STOC 2011].\n  We provide a dichotomy of the parameterized complexity of Steiner Multicut. That is, for any com","authors_text":"Danny Hermelin, Erik Jan van Leeuwen, Karl Bringmann, Matthias Mnich","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-28T14:41:40Z","title":"Parameterized Complexity Dichotomy for Steiner Multicut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7006","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:c448f05a4582694d94ef249dbd28e827823c8ff28dd7368e3da18e12772ca0c3","target":"record","created_at":"2026-05-18T01:41:00Z","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":"b92fc4237035b7f21c567bd22d9d20984297580d7f6200c2f71352e570a0c69d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-28T14:41:40Z","title_canon_sha256":"3984fd3a05c5041c5f1389f6639b98001bb7154271b5dfe21123655bd26a9f0a"},"schema_version":"1.0","source":{"id":"1404.7006","kind":"arxiv","version":2}},"canonical_sha256":"a0cd052e142e0bd7f569833f290c4d2fa92d5043e50b9fa97ad7f7582bbfbcf7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0cd052e142e0bd7f569833f290c4d2fa92d5043e50b9fa97ad7f7582bbfbcf7","first_computed_at":"2026-05-18T01:41:00.109971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:00.109971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IWDmAohpfI4PkyDk16kbhYVFjRowbOl5JX7y3zwTiIWt58u0vQJYa7ffZeVWwZ8v+g3M5xJ7goAujEod+urxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:00.110411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.7006","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c448f05a4582694d94ef249dbd28e827823c8ff28dd7368e3da18e12772ca0c3","sha256:9c3251fe36584f47b9242703a2ae602178689efb06d1b6fd438fe4be69a92fe2"],"state_sha256":"c803a97ee5cf37c02e70d4f416bb21f687433631c334aff43ed87a15dc69b8e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uTRjm60gws/WTog65sr/eaxIzaoZhwDLnwjfJ/DJFc+wfi2ta5LMhQL6E1MIGQ0GlRQZf1OtYoWDDp/s5R0gBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:48:45.264389Z","bundle_sha256":"3beac4255ebc4a0887c9e5529413049c430ad0d73fad454a720dbb5a143ad6ca"}}