{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KJCLNYELP4M5R7FSTX63XHY3UZ","short_pith_number":"pith:KJCLNYEL","schema_version":"1.0","canonical_sha256":"5244b6e08b7f19d8fcb29dfdbb9f1ba66d799312c2cae8eb954e54d5550b9604","source":{"kind":"arxiv","id":"1810.06848","version":2},"attestation_state":"computed","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\\}$"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.06848","created_at":"2026-05-17T23:41:17.776891+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06848v2","created_at":"2026-05-17T23:41:17.776891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06848","created_at":"2026-05-17T23:41:17.776891+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJCLNYELP4M5","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJCLNYELP4M5R7FS","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJCLNYEL","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ","json":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ.json","graph_json":"https://pith.science/api/pith-number/KJCLNYELP4M5R7FSTX63XHY3UZ/graph.json","events_json":"https://pith.science/api/pith-number/KJCLNYELP4M5R7FSTX63XHY3UZ/events.json","paper":"https://pith.science/paper/KJCLNYEL"},"agent_actions":{"view_html":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ","download_json":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ.json","view_paper":"https://pith.science/paper/KJCLNYEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06848&json=true","fetch_graph":"https://pith.science/api/pith-number/KJCLNYELP4M5R7FSTX63XHY3UZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KJCLNYELP4M5R7FSTX63XHY3UZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ/action/storage_attestation","attest_author":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ/action/author_attestation","sign_citation":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ/action/citation_signature","submit_replication":"https://pith.science/pith/KJCLNYELP4M5R7FSTX63XHY3UZ/action/replication_record"}},"created_at":"2026-05-17T23:41:17.776891+00:00","updated_at":"2026-05-17T23:41:17.776891+00:00"}