{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PXQN264DGPWH3NY3ST3XHFUDLW","short_pith_number":"pith:PXQN264D","canonical_record":{"source":{"id":"1910.00887","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-02T11:45:52Z","cross_cats_sorted":[],"title_canon_sha256":"2f612bd2af9616742c6b59e81044df8e4a54e7e2635542c385430b16c9c65874","abstract_canon_sha256":"acb257525c080267c4650696ecbd6101c4a8926fc4c85a3c8d05152c39528e50"},"schema_version":"1.0"},"canonical_sha256":"7de0dd7b8333ec7db71b94f77396835db1768281fbf58e38b177ab5753d713ed","source":{"kind":"arxiv","id":"1910.00887","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.00887","created_at":"2026-07-05T03:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1910.00887v8","created_at":"2026-07-05T03:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.00887","created_at":"2026-07-05T03:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"PXQN264DGPWH","created_at":"2026-07-05T03:48:35Z"},{"alias_kind":"pith_short_16","alias_value":"PXQN264DGPWH3NY3","created_at":"2026-07-05T03:48:35Z"},{"alias_kind":"pith_short_8","alias_value":"PXQN264D","created_at":"2026-07-05T03:48:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PXQN264DGPWH3NY3ST3XHFUDLW","target":"record","payload":{"canonical_record":{"source":{"id":"1910.00887","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-02T11:45:52Z","cross_cats_sorted":[],"title_canon_sha256":"2f612bd2af9616742c6b59e81044df8e4a54e7e2635542c385430b16c9c65874","abstract_canon_sha256":"acb257525c080267c4650696ecbd6101c4a8926fc4c85a3c8d05152c39528e50"},"schema_version":"1.0"},"canonical_sha256":"7de0dd7b8333ec7db71b94f77396835db1768281fbf58e38b177ab5753d713ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:35.394516Z","signature_b64":"6/sf9jkdRLZJr59Lc+LEEgy+8nHNEo9zj+L6WBR823SuE+LuXTuS02Xf0n7ZIU7OJ6et2tTBTzuM1QrzDFCxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7de0dd7b8333ec7db71b94f77396835db1768281fbf58e38b177ab5753d713ed","last_reissued_at":"2026-07-05T03:48:35.394061Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:35.394061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.00887","source_version":8,"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-05T03:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v2y6btL0oY9GxcgIkPysgonXs+hw7KtrSHTDUtF78wwG1HjR8tUbsh9K5cU/sXl1e30OPE5MB3ZybyCsy/nrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T05:59:33.172899Z"},"content_sha256":"fd313cdf56fb64e16af545da2c40f6a0fe5cd2c0147171743d3c236aba4880ba","schema_version":"1.0","event_id":"sha256:fd313cdf56fb64e16af545da2c40f6a0fe5cd2c0147171743d3c236aba4880ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PXQN264DGPWH3NY3ST3XHFUDLW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle","submitted_at":"2019-10-02T11:45:52Z","abstract_excerpt":"The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex Set (SFVS) both ask for a vertex set of minimum total weight, that for NMC disconnects a given set of terminals, and for SFVS intersects all cycles containing a vertex of a given set. We design a meta-algorithm that allows to solve both problems in time $2^{O(rw^3)}\\cdot n^{4}$, $2^{O(q^2\\log(q))}\\cdot n^{4}$, and $n^{O(k^2)}$ where $rw$ is the rank-width, $q$ the $\\mathbb{Q}$-rank-width, and $k$ the mim-width of a given decomposition. This answers in the affirmative an open question raised by Jaffke et al. (Alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.00887","kind":"arxiv","version":8},"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/1910.00887/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-05T03:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vW3RIiOhQ3Chz3q1OrXs8ZkWeU9hZTnejgyPnIAA2IsN73ZNEsqbRLOfH6CseFL7lvzawnHTuyZrhLCy1WMHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-24T05:59:33.173275Z"},"content_sha256":"90a19fc8a52654ed250e38cc673b98ed964de0dbaa9376d38ec640e6978e5c6e","schema_version":"1.0","event_id":"sha256:90a19fc8a52654ed250e38cc673b98ed964de0dbaa9376d38ec640e6978e5c6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXQN264DGPWH3NY3ST3XHFUDLW/bundle.json","state_url":"https://pith.science/pith/PXQN264DGPWH3NY3ST3XHFUDLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXQN264DGPWH3NY3ST3XHFUDLW/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-07-24T05:59:33Z","links":{"resolver":"https://pith.science/pith/PXQN264DGPWH3NY3ST3XHFUDLW","bundle":"https://pith.science/pith/PXQN264DGPWH3NY3ST3XHFUDLW/bundle.json","state":"https://pith.science/pith/PXQN264DGPWH3NY3ST3XHFUDLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXQN264DGPWH3NY3ST3XHFUDLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PXQN264DGPWH3NY3ST3XHFUDLW","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":"acb257525c080267c4650696ecbd6101c4a8926fc4c85a3c8d05152c39528e50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-02T11:45:52Z","title_canon_sha256":"2f612bd2af9616742c6b59e81044df8e4a54e7e2635542c385430b16c9c65874"},"schema_version":"1.0","source":{"id":"1910.00887","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.00887","created_at":"2026-07-05T03:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1910.00887v8","created_at":"2026-07-05T03:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.00887","created_at":"2026-07-05T03:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"PXQN264DGPWH","created_at":"2026-07-05T03:48:35Z"},{"alias_kind":"pith_short_16","alias_value":"PXQN264DGPWH3NY3","created_at":"2026-07-05T03:48:35Z"},{"alias_kind":"pith_short_8","alias_value":"PXQN264D","created_at":"2026-07-05T03:48:35Z"}],"graph_snapshots":[{"event_id":"sha256:90a19fc8a52654ed250e38cc673b98ed964de0dbaa9376d38ec640e6978e5c6e","target":"graph","created_at":"2026-07-05T03:48:35Z","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/1910.00887/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex Set (SFVS) both ask for a vertex set of minimum total weight, that for NMC disconnects a given set of terminals, and for SFVS intersects all cycles containing a vertex of a given set. We design a meta-algorithm that allows to solve both problems in time $2^{O(rw^3)}\\cdot n^{4}$, $2^{O(q^2\\log(q))}\\cdot n^{4}$, and $n^{O(k^2)}$ where $rw$ is the rank-width, $q$ the $\\mathbb{Q}$-rank-width, and $k$ the mim-width of a given decomposition. This answers in the affirmative an open question raised by Jaffke et al. (Alg","authors_text":"Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-02T11:45:52Z","title":"Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.00887","kind":"arxiv","version":8},"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:fd313cdf56fb64e16af545da2c40f6a0fe5cd2c0147171743d3c236aba4880ba","target":"record","created_at":"2026-07-05T03:48:35Z","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":"acb257525c080267c4650696ecbd6101c4a8926fc4c85a3c8d05152c39528e50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-02T11:45:52Z","title_canon_sha256":"2f612bd2af9616742c6b59e81044df8e4a54e7e2635542c385430b16c9c65874"},"schema_version":"1.0","source":{"id":"1910.00887","kind":"arxiv","version":8}},"canonical_sha256":"7de0dd7b8333ec7db71b94f77396835db1768281fbf58e38b177ab5753d713ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7de0dd7b8333ec7db71b94f77396835db1768281fbf58e38b177ab5753d713ed","first_computed_at":"2026-07-05T03:48:35.394061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:48:35.394061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6/sf9jkdRLZJr59Lc+LEEgy+8nHNEo9zj+L6WBR823SuE+LuXTuS02Xf0n7ZIU7OJ6et2tTBTzuM1QrzDFCxAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:48:35.394516Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.00887","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd313cdf56fb64e16af545da2c40f6a0fe5cd2c0147171743d3c236aba4880ba","sha256:90a19fc8a52654ed250e38cc673b98ed964de0dbaa9376d38ec640e6978e5c6e"],"state_sha256":"24c63ba32189d16e708da866f1fd8e4957a71d9517796508abb0661deff16936"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spi4unGgVyahgU/RDcm3FByCtJmzWB+n7xFp7syy0sESaqH86Asftl0lhaSvoys6X7LmJ7vRrGX+deRUc7bVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-24T05:59:33.175959Z","bundle_sha256":"6a86a94a9c8d223052baf8283a188941500275cad6edfefc94d45285fefbc8d5"}}