{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YZ2EOIJ4Q47BPXZ2KAXHV6DXIO","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":"d8dfe8e8fbd2c3a2b0196bd628a62316cd19b2363f3fb86aa69f217b5d8cbfab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-12T14:57:47Z","title_canon_sha256":"076248fe4695081bda703a1479e60fa23315b4a036943bf63e05281a8f6bd9fa"},"schema_version":"1.0","source":{"id":"1304.3653","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3653","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3653v1","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3653","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"YZ2EOIJ4Q47B","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YZ2EOIJ4Q47BPXZ2","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YZ2EOIJ4","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:d0dd4d8843d6026988553c8e471c71603de6d8de8f0015aaee6ee470db154e71","target":"graph","created_at":"2026-05-18T03:28:06Z","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":"We study the {\\sc multicut on trees} and the {\\sc generalized multiway Cut on trees} problems. For the {\\sc multicut on trees} problem, we present a parameterized algorithm that runs in time $O^{*}(\\rho^k)$, where $\\rho = \\sqrt{\\sqrt{2} + 1} \\approx 1.555$ is the positive root of the polynomial $x^4-2x^2-1$. This improves the current-best algorithm of Chen et al. that runs in time $O^{*}(1.619^k)$. For the {\\sc generalized multiway cut on trees} problem, we show that this problem is solvable in polynomial time if the number of terminal sets is fixed; this answers an open question posed in a re","authors_text":"Binhai Zhu, Boting Yang, Fenghui Zhang, Ge Xia, Guohui Lin, Iyad Kanj, Jinhui Xu, Peng Zhang, Tian Liu, Weitian Tong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-12T14:57:47Z","title":"Algorithms for Cut Problems on Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3653","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:1c599344a5879d781096735fc7473ff14bf9428dacf0b7a1200606a5802a9852","target":"record","created_at":"2026-05-18T03:28:06Z","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":"d8dfe8e8fbd2c3a2b0196bd628a62316cd19b2363f3fb86aa69f217b5d8cbfab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-12T14:57:47Z","title_canon_sha256":"076248fe4695081bda703a1479e60fa23315b4a036943bf63e05281a8f6bd9fa"},"schema_version":"1.0","source":{"id":"1304.3653","kind":"arxiv","version":1}},"canonical_sha256":"c67447213c873e17df3a502e7af87743b617ebce35f680f37fd89b0c2187e9d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c67447213c873e17df3a502e7af87743b617ebce35f680f37fd89b0c2187e9d6","first_computed_at":"2026-05-18T03:28:06.953810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:06.953810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZbruKmrTtGy58uQDcxNLntgAwo+/DQKYRR1xufGZ6jgyzXtEOXJM8xSSvwUBBSg1hlBhxczMDaaIB201e1PnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:06.954687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.3653","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c599344a5879d781096735fc7473ff14bf9428dacf0b7a1200606a5802a9852","sha256:d0dd4d8843d6026988553c8e471c71603de6d8de8f0015aaee6ee470db154e71"],"state_sha256":"d9d3b54fd31bc62b17d1589831855b741483ff0d95737e9d0a0e2c26cb05f9d5"}