{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KJCLNYELP4M5R7FSTX63XHY3UZ","short_pith_number":"pith:KJCLNYEL","canonical_record":{"source":{"id":"1810.06848","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-16T07:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"848d3a47b7211cc74343ea2bb4bac099afbc3e1d9c32ab3c91faaae7130b0ad0","abstract_canon_sha256":"cf9f36dfe97443aab3b61cfc804857eb6f5eda4e6b932c45c3a1d6a1388c03a3"},"schema_version":"1.0"},"canonical_sha256":"5244b6e08b7f19d8fcb29dfdbb9f1ba66d799312c2cae8eb954e54d5550b9604","source":{"kind":"arxiv","id":"1810.06848","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06848","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06848v2","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06848","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"KJCLNYELP4M5","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KJCLNYELP4M5R7FS","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KJCLNYEL","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KJCLNYELP4M5R7FSTX63XHY3UZ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.06848","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-16T07:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"848d3a47b7211cc74343ea2bb4bac099afbc3e1d9c32ab3c91faaae7130b0ad0","abstract_canon_sha256":"cf9f36dfe97443aab3b61cfc804857eb6f5eda4e6b932c45c3a1d6a1388c03a3"},"schema_version":"1.0"},"canonical_sha256":"5244b6e08b7f19d8fcb29dfdbb9f1ba66d799312c2cae8eb954e54d5550b9604","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:17.777296Z","signature_b64":"AFKnArhGOpCV3QJAJgnm3fD/vAVRgGV/ihhRUVRqfmzo8IFqapqWKneBYacDddG1iVO5J7Hebute7W3Kh+NmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5244b6e08b7f19d8fcb29dfdbb9f1ba66d799312c2cae8eb954e54d5550b9604","last_reissued_at":"2026-05-17T23:41:17.776812Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:17.776812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.06848","source_version":2,"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-17T23:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9rPGFfAJjJjzdhsk06M4v5tOcWuMsGe1Jcc860t3t4pRRRqo/QUx/uiHOAT6JmAb1j6lUaIiHHU+B/5NuOKLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T21:19:01.819172Z"},"content_sha256":"a79f8b987f8319317de9bc8fbcb47c1e29d90213f302f43351d51369f513751b","schema_version":"1.0","event_id":"sha256:a79f8b987f8319317de9bc8fbcb47c1e29d90213f302f43351d51369f513751b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KJCLNYELP4M5R7FSTX63XHY3UZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-budgeted directed cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Magnus Wahlstr\\\"om, Marcin Pilipczuk, Shaohua Li, Stefan Kratsch","submitted_at":"2018-10-16T07:35:19Z","abstract_excerpt":"We study multi-budgeted variants of the classic minimum cut problem and graph separation problems that turned out to be important in parameterized complexity: Skew Multicut and Directed Feedback Arc Set. In our generalization, we assign colors $1,2,...,\\ell$ to some edges and give separate budgets $k_{1},k_{2},...,k_{\\ell}$. Let $E_{i}$ be the set of edges of color $i$. The solution $C$ for the multi-budgeted variant of a graph separation problem not only needs to satisfy the usual separation requirements, but also needs to satisfy that $|C\\cap E_{i}|\\leq k_{i}$ for every $i\\in \\{1,...,\\ell\\}$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06848","kind":"arxiv","version":2},"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-17T23:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmiF4aKyXiELSHGfRAt/d5ig+RVp27VVy3Pi1Dq0WibtIbw+ZMCEn3VBMiqKXChDx7qpPc+d32ikSj3YQCHDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T21:19:01.819858Z"},"content_sha256":"3a427e5bfd0cfbab71a29e7da416e41f091d137d9015decb17ddba51281c048e","schema_version":"1.0","event_id":"sha256:3a427e5bfd0cfbab71a29e7da416e41f091d137d9015decb17ddba51281c048e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ/bundle.json","state_url":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJCLNYELP4M5R7FSTX63XHY3UZ/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-05-18T21:19:01Z","links":{"resolver":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ","bundle":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ/bundle.json","state":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJCLNYELP4M5R7FSTX63XHY3UZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KJCLNYELP4M5R7FSTX63XHY3UZ","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":"cf9f36dfe97443aab3b61cfc804857eb6f5eda4e6b932c45c3a1d6a1388c03a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-16T07:35:19Z","title_canon_sha256":"848d3a47b7211cc74343ea2bb4bac099afbc3e1d9c32ab3c91faaae7130b0ad0"},"schema_version":"1.0","source":{"id":"1810.06848","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06848","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06848v2","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06848","created_at":"2026-05-17T23:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"KJCLNYELP4M5","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KJCLNYELP4M5R7FS","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KJCLNYEL","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:3a427e5bfd0cfbab71a29e7da416e41f091d137d9015decb17ddba51281c048e","target":"graph","created_at":"2026-05-17T23:41:17Z","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 multi-budgeted variants of the classic minimum cut problem and graph separation problems that turned out to be important in parameterized complexity: Skew Multicut and Directed Feedback Arc Set. In our generalization, we assign colors $1,2,...,\\ell$ to some edges and give separate budgets $k_{1},k_{2},...,k_{\\ell}$. Let $E_{i}$ be the set of edges of color $i$. The solution $C$ for the multi-budgeted variant of a graph separation problem not only needs to satisfy the usual separation requirements, but also needs to satisfy that $|C\\cap E_{i}|\\leq k_{i}$ for every $i\\in \\{1,...,\\ell\\}$","authors_text":"D\\'aniel Marx, Magnus Wahlstr\\\"om, Marcin Pilipczuk, Shaohua Li, Stefan Kratsch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-16T07:35:19Z","title":"Multi-budgeted directed cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06848","kind":"arxiv","version":2},"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:a79f8b987f8319317de9bc8fbcb47c1e29d90213f302f43351d51369f513751b","target":"record","created_at":"2026-05-17T23:41:17Z","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":"cf9f36dfe97443aab3b61cfc804857eb6f5eda4e6b932c45c3a1d6a1388c03a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-16T07:35:19Z","title_canon_sha256":"848d3a47b7211cc74343ea2bb4bac099afbc3e1d9c32ab3c91faaae7130b0ad0"},"schema_version":"1.0","source":{"id":"1810.06848","kind":"arxiv","version":2}},"canonical_sha256":"5244b6e08b7f19d8fcb29dfdbb9f1ba66d799312c2cae8eb954e54d5550b9604","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5244b6e08b7f19d8fcb29dfdbb9f1ba66d799312c2cae8eb954e54d5550b9604","first_computed_at":"2026-05-17T23:41:17.776812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:17.776812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AFKnArhGOpCV3QJAJgnm3fD/vAVRgGV/ihhRUVRqfmzo8IFqapqWKneBYacDddG1iVO5J7Hebute7W3Kh+NmDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:17.777296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06848","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a79f8b987f8319317de9bc8fbcb47c1e29d90213f302f43351d51369f513751b","sha256:3a427e5bfd0cfbab71a29e7da416e41f091d137d9015decb17ddba51281c048e"],"state_sha256":"95e05c1c35f2d8c47e898cef390bf0b15f2f5ae215a7a8aa4d4ec218bb407eed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1WALZMEriR0g3Bmo2QHAlXXhhDD3UqnkVoaNk3zCqAf6wDZoGrb1JO1K4BvobTlErLFitG18S555SvWz/aaCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T21:19:01.822023Z","bundle_sha256":"3bec46170402bd0bc75ca2987c69ee7c308f231993ed1652b6258cd627f45dda"}}