{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5NKGVF4XQDEIQMRAWPJ74CZCEL","short_pith_number":"pith:5NKGVF4X","schema_version":"1.0","canonical_sha256":"eb546a979780c8883220b3d3fe0b2222e011019be6bbf36dcbb5b63405280a5c","source":{"kind":"arxiv","id":"1711.06397","version":1},"attestation_state":"computed","paper":{"title":"An $O^*(1.84^k)$ Parameterized Algorithm for the Multiterminal Cut Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jia-Hao Fan, Jianer Chen, Yixin Cao","submitted_at":"2017-11-17T04:26:10Z","abstract_excerpt":"We study the \\emph{multiterminal cut} problem, which, given an $n$-vertex graph whose edges are integer-weighted and a set of terminals, asks for a partition of the vertex set such that each terminal is in a distinct part, and the total weight of crossing edges is at most $k$. Our weapons shall be two classical results known for decades: \\emph{maximum volume minimum ($s,t$)-cuts} by [Ford and Fulkerson, \\emph{Flows in Networks}, 1962] and \\emph{isolating cuts} by [Dahlhaus et al., \\emph{SIAM J. Comp.} 23(4):864-894, 1994]. We sharpen these old weapons with the help of submodular functions, and"},"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":"1711.06397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T04:26:10Z","cross_cats_sorted":[],"title_canon_sha256":"5edeb4883ff05b1fb26e4710bc9286fb9633e7cc32fe1b22a119829f99809ccc","abstract_canon_sha256":"7902686f24a294da9e3443390f81ad567b4f0091ea78aac61e1914dc17b150cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:21.208238Z","signature_b64":"4NHJ3AWsHi78qjZPwMvyeOZ55lsU2G8tUusJew5j2hngNcHYaGnNybCb1FTHAIk3NOt00KcrbNPCLQ+7hjgQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb546a979780c8883220b3d3fe0b2222e011019be6bbf36dcbb5b63405280a5c","last_reissued_at":"2026-05-18T00:30:21.207672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:21.207672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An $O^*(1.84^k)$ Parameterized Algorithm for the Multiterminal Cut Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jia-Hao Fan, Jianer Chen, Yixin Cao","submitted_at":"2017-11-17T04:26:10Z","abstract_excerpt":"We study the \\emph{multiterminal cut} problem, which, given an $n$-vertex graph whose edges are integer-weighted and a set of terminals, asks for a partition of the vertex set such that each terminal is in a distinct part, and the total weight of crossing edges is at most $k$. Our weapons shall be two classical results known for decades: \\emph{maximum volume minimum ($s,t$)-cuts} by [Ford and Fulkerson, \\emph{Flows in Networks}, 1962] and \\emph{isolating cuts} by [Dahlhaus et al., \\emph{SIAM J. Comp.} 23(4):864-894, 1994]. We sharpen these old weapons with the help of submodular functions, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06397","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":""},"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":"1711.06397","created_at":"2026-05-18T00:30:21.207761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06397v1","created_at":"2026-05-18T00:30:21.207761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06397","created_at":"2026-05-18T00:30:21.207761+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NKGVF4XQDEI","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NKGVF4XQDEIQMRA","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NKGVF4X","created_at":"2026-05-18T12:31:00.734936+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/5NKGVF4XQDEIQMRAWPJ74CZCEL","json":"https://pith.science/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL.json","graph_json":"https://pith.science/api/pith-number/5NKGVF4XQDEIQMRAWPJ74CZCEL/graph.json","events_json":"https://pith.science/api/pith-number/5NKGVF4XQDEIQMRAWPJ74CZCEL/events.json","paper":"https://pith.science/paper/5NKGVF4X"},"agent_actions":{"view_html":"https://pith.science/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL","download_json":"https://pith.science/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL.json","view_paper":"https://pith.science/paper/5NKGVF4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06397&json=true","fetch_graph":"https://pith.science/api/pith-number/5NKGVF4XQDEIQMRAWPJ74CZCEL/graph.json","fetch_events":"https://pith.science/api/pith-number/5NKGVF4XQDEIQMRAWPJ74CZCEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL/action/storage_attestation","attest_author":"https://pith.science/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL/action/author_attestation","sign_citation":"https://pith.science/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL/action/citation_signature","submit_replication":"https://pith.science/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL/action/replication_record"}},"created_at":"2026-05-18T00:30:21.207761+00:00","updated_at":"2026-05-18T00:30:21.207761+00:00"}