{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:CMLQGTNPJPR6Q4ALAGNUUKNSUR","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":"c4c8d91b94c624be2d177d18ce44c100dc2b535f700bd6735c3a4b71f71df9ef","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-20T11:48:50Z","title_canon_sha256":"50b097f0bac414a31b49f3a4b612359a997f53506b2389fd8e54d6cdf644c747"},"schema_version":"1.0","source":{"id":"2205.10105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.10105","created_at":"2026-07-05T04:25:03Z"},{"alias_kind":"arxiv_version","alias_value":"2205.10105v1","created_at":"2026-07-05T04:25:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.10105","created_at":"2026-07-05T04:25:03Z"},{"alias_kind":"pith_short_12","alias_value":"CMLQGTNPJPR6","created_at":"2026-07-05T04:25:03Z"},{"alias_kind":"pith_short_16","alias_value":"CMLQGTNPJPR6Q4AL","created_at":"2026-07-05T04:25:03Z"},{"alias_kind":"pith_short_8","alias_value":"CMLQGTNP","created_at":"2026-07-05T04:25:03Z"}],"graph_snapshots":[{"event_id":"sha256:096ed217c7c4552dfab97fdb5bf325f85433a5b72facc6b6e50095ee61d2ad70","target":"graph","created_at":"2026-07-05T04:25:03Z","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/2205.10105/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Edge Multicut problem is a classical cut problem where given an undirected graph $G$, a set of pairs of vertices $\\mathcal{P}$, and a budget $k$, the goal is to determine if there is a set $S$ of at most $k$ edges such that for each $(s,t) \\in \\mathcal{P}$, $G-S$ has no path from $s$ to $t$. Edge Multicut has been relatively recently shown to be fixed-parameter tractable (FPT), parameterized by $k$, by Marx and Razgon [SICOMP 2014], and independently by Bousquet et al. [SICOMP 2018]. In the weighted version of the problem, called Weighted Edge Multicut one is additionally given a weight fu","authors_text":"D\\'aniel Marx, Esther Galby, Philipp Schepper, Prafullkumar Tale, Roohani Sharma","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-20T11:48:50Z","title":"Parameterized Complexity of Weighted Multicut in Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.10105","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:83585cd62f80880cbae9bc085cfbbae0bd9d9bc38421f8bab367bce65866920d","target":"record","created_at":"2026-07-05T04:25:03Z","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":"c4c8d91b94c624be2d177d18ce44c100dc2b535f700bd6735c3a4b71f71df9ef","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-20T11:48:50Z","title_canon_sha256":"50b097f0bac414a31b49f3a4b612359a997f53506b2389fd8e54d6cdf644c747"},"schema_version":"1.0","source":{"id":"2205.10105","kind":"arxiv","version":1}},"canonical_sha256":"1317034daf4be3e8700b019b4a29b2a469a133b5ce0caeddb25f466d98182e0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1317034daf4be3e8700b019b4a29b2a469a133b5ce0caeddb25f466d98182e0a","first_computed_at":"2026-07-05T04:25:03.261022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:25:03.261022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BxyOV9hm/JC2I75lKnUST2fJHhlJ1A8GLNOUzl+UjOwFMzwrwTVOuvny6qoQzEn3cYiHOkqLVnPcurkEiy8QDg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:25:03.261454Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.10105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83585cd62f80880cbae9bc085cfbbae0bd9d9bc38421f8bab367bce65866920d","sha256:096ed217c7c4552dfab97fdb5bf325f85433a5b72facc6b6e50095ee61d2ad70"],"state_sha256":"85a418b0075a1b5b69a05f3442234def6e868a796e956d748cdcc2068d7ae13f"}