{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5NKGVF4XQDEIQMRAWPJ74CZCEL","short_pith_number":"pith:5NKGVF4X","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"},"canonical_sha256":"eb546a979780c8883220b3d3fe0b2222e011019be6bbf36dcbb5b63405280a5c","source":{"kind":"arxiv","id":"1711.06397","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06397","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06397v1","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06397","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"pith_short_12","alias_value":"5NKGVF4XQDEI","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5NKGVF4XQDEIQMRA","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5NKGVF4X","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5NKGVF4XQDEIQMRAWPJ74CZCEL","target":"record","payload":{"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"},"canonical_sha256":"eb546a979780c8883220b3d3fe0b2222e011019be6bbf36dcbb5b63405280a5c","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"},"source_kind":"arxiv","source_id":"1711.06397","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-05-18T00:30:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SCTQAtbbGSanbbla3FbBAR/PAHCo5dOhmc7R16IBBDWfugpkkaEpEr8gwHYB/flCMvPq0iC/nulXlW78YR6aAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:45:59.434792Z"},"content_sha256":"ff3d4e63d2281f16ae5bf8d9e9fac25934d4753dd5b376b1585a36368c743589","schema_version":"1.0","event_id":"sha256:ff3d4e63d2281f16ae5bf8d9e9fac25934d4753dd5b376b1585a36368c743589"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5NKGVF4XQDEIQMRAWPJ74CZCEL","target":"graph","payload":{"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"},"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-18T00:30:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s72xZTjlaMBDGaDdxEZ3A5YuOfxvdoACdG8CqvBVNVGfzYRuNDEijIgR1WnZfksrr91aCNhetJhCaiFB0b/nBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:45:59.435135Z"},"content_sha256":"973b2b6094b99b88c0276bc03f694a7b54339b2486ba264e825228dc29575a65","schema_version":"1.0","event_id":"sha256:973b2b6094b99b88c0276bc03f694a7b54339b2486ba264e825228dc29575a65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL/bundle.json","state_url":"https://pith.science/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL/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-06-03T04:45:59Z","links":{"resolver":"https://pith.science/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL","bundle":"https://pith.science/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL/bundle.json","state":"https://pith.science/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NKGVF4XQDEIQMRAWPJ74CZCEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5NKGVF4XQDEIQMRAWPJ74CZCEL","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":"7902686f24a294da9e3443390f81ad567b4f0091ea78aac61e1914dc17b150cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T04:26:10Z","title_canon_sha256":"5edeb4883ff05b1fb26e4710bc9286fb9633e7cc32fe1b22a119829f99809ccc"},"schema_version":"1.0","source":{"id":"1711.06397","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06397","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06397v1","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06397","created_at":"2026-05-18T00:30:21Z"},{"alias_kind":"pith_short_12","alias_value":"5NKGVF4XQDEI","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5NKGVF4XQDEIQMRA","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5NKGVF4X","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:973b2b6094b99b88c0276bc03f694a7b54339b2486ba264e825228dc29575a65","target":"graph","created_at":"2026-05-18T00:30:21Z","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 \\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","authors_text":"Jia-Hao Fan, Jianer Chen, Yixin Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T04:26:10Z","title":"An $O^*(1.84^k)$ Parameterized Algorithm for the Multiterminal Cut Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06397","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:ff3d4e63d2281f16ae5bf8d9e9fac25934d4753dd5b376b1585a36368c743589","target":"record","created_at":"2026-05-18T00:30:21Z","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":"7902686f24a294da9e3443390f81ad567b4f0091ea78aac61e1914dc17b150cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T04:26:10Z","title_canon_sha256":"5edeb4883ff05b1fb26e4710bc9286fb9633e7cc32fe1b22a119829f99809ccc"},"schema_version":"1.0","source":{"id":"1711.06397","kind":"arxiv","version":1}},"canonical_sha256":"eb546a979780c8883220b3d3fe0b2222e011019be6bbf36dcbb5b63405280a5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb546a979780c8883220b3d3fe0b2222e011019be6bbf36dcbb5b63405280a5c","first_computed_at":"2026-05-18T00:30:21.207672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:21.207672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4NHJ3AWsHi78qjZPwMvyeOZ55lsU2G8tUusJew5j2hngNcHYaGnNybCb1FTHAIk3NOt00KcrbNPCLQ+7hjgQBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:21.208238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06397","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff3d4e63d2281f16ae5bf8d9e9fac25934d4753dd5b376b1585a36368c743589","sha256:973b2b6094b99b88c0276bc03f694a7b54339b2486ba264e825228dc29575a65"],"state_sha256":"50305f5748a2ea00823bdf2bb4eb71fa998dd5f83cc71c8f2419069d6b8713ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/44A1eIWL2HrBVK2TG0jkGgVJWDHdc+tK8Fc+AFfn4EijxBE1TTMOcuCHOZ5jsGs7oA6EqZlWGa/FYhXKegCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:45:59.437043Z","bundle_sha256":"753054df33fd8fd57cdb0cd25688779c7841fab896df13aded8ae0503d678c73"}}