{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:CMLQGTNPJPR6Q4ALAGNUUKNSUR","short_pith_number":"pith:CMLQGTNP","canonical_record":{"source":{"id":"2205.10105","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-20T11:48:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"50b097f0bac414a31b49f3a4b612359a997f53506b2389fd8e54d6cdf644c747","abstract_canon_sha256":"c4c8d91b94c624be2d177d18ce44c100dc2b535f700bd6735c3a4b71f71df9ef"},"schema_version":"1.0"},"canonical_sha256":"1317034daf4be3e8700b019b4a29b2a469a133b5ce0caeddb25f466d98182e0a","source":{"kind":"arxiv","id":"2205.10105","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:CMLQGTNPJPR6Q4ALAGNUUKNSUR","target":"record","payload":{"canonical_record":{"source":{"id":"2205.10105","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-20T11:48:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"50b097f0bac414a31b49f3a4b612359a997f53506b2389fd8e54d6cdf644c747","abstract_canon_sha256":"c4c8d91b94c624be2d177d18ce44c100dc2b535f700bd6735c3a4b71f71df9ef"},"schema_version":"1.0"},"canonical_sha256":"1317034daf4be3e8700b019b4a29b2a469a133b5ce0caeddb25f466d98182e0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:03.261454Z","signature_b64":"BxyOV9hm/JC2I75lKnUST2fJHhlJ1A8GLNOUzl+UjOwFMzwrwTVOuvny6qoQzEn3cYiHOkqLVnPcurkEiy8QDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1317034daf4be3e8700b019b4a29b2a469a133b5ce0caeddb25f466d98182e0a","last_reissued_at":"2026-07-05T04:25:03.261022Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:03.261022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.10105","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-07-05T04:25:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYmItxlVoOSnyoC0odzf7TBSSdYczkC8J+KWMrQ96vGUQcsUmWsDrCX58NpnZuNHbfr/Lfzv2NiU3KkkSb3aCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:05:22.852946Z"},"content_sha256":"83585cd62f80880cbae9bc085cfbbae0bd9d9bc38421f8bab367bce65866920d","schema_version":"1.0","event_id":"sha256:83585cd62f80880cbae9bc085cfbbae0bd9d9bc38421f8bab367bce65866920d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:CMLQGTNPJPR6Q4ALAGNUUKNSUR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Weighted Multicut in Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Esther Galby, Philipp Schepper, Prafullkumar Tale, Roohani Sharma","submitted_at":"2022-05-20T11:48:50Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.10105","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.10105/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:25:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkW8E7SYiRr+t84evuExfxqCzOUQ9dv8q+7fRFfs6abTZ5o5YwThLyKcd3qZ9c8vNUTd0DHI9MN+caNhux0JBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:05:22.853708Z"},"content_sha256":"096ed217c7c4552dfab97fdb5bf325f85433a5b72facc6b6e50095ee61d2ad70","schema_version":"1.0","event_id":"sha256:096ed217c7c4552dfab97fdb5bf325f85433a5b72facc6b6e50095ee61d2ad70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMLQGTNPJPR6Q4ALAGNUUKNSUR/bundle.json","state_url":"https://pith.science/pith/CMLQGTNPJPR6Q4ALAGNUUKNSUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMLQGTNPJPR6Q4ALAGNUUKNSUR/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-08-03T17:05:22Z","links":{"resolver":"https://pith.science/pith/CMLQGTNPJPR6Q4ALAGNUUKNSUR","bundle":"https://pith.science/pith/CMLQGTNPJPR6Q4ALAGNUUKNSUR/bundle.json","state":"https://pith.science/pith/CMLQGTNPJPR6Q4ALAGNUUKNSUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMLQGTNPJPR6Q4ALAGNUUKNSUR/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ito8sPPi2jPsgv+cVaZ6RsGFeUKnJtxSbzgV9jOzK89apbwWFobPDT9ORTRtR2o4CV2hJAWRtPvYWwLIWpH9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:05:22.858455Z","bundle_sha256":"ccdca9eabfe26ff1eb4b355848978f2c94b26a2e675824903897977d814be038"}}