{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7WGXLA442N57SNYO2JN57J47YT","short_pith_number":"pith:7WGXLA44","schema_version":"1.0","canonical_sha256":"fd8d75839cd37bf9370ed25bdfa79fc4db91cfa1ea3daf71cbd1e55cd315ee93","source":{"kind":"arxiv","id":"1509.07404","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Dimitrios M. Thilikos, EunJung Kim, Ignasi Sau","submitted_at":"2015-09-24T15:16:06Z","abstract_excerpt":"In this paper we design {\\sf FPT}-algorithms for two parameterized problems. The first is \\textsc{List Digraph Homomorphism}: given two digraphs $G$ and $H$ and a list of allowed vertices of $H$ for every vertex of $G$, the question is whether there exists a homomorphism from $G$ to $H$ respecting the list constraints. The second problem is a variant of \\textsc{Multiway Cut}, namely \\textsc{Min-Max Multiway Cut}: given a graph $G$, a non-negative integer $\\ell$, and a set $T$ of $r$ terminals, the question is whether we can partition the vertices of $G$ into $r$ parts such that (a) each part c"},"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":"1509.07404","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-24T15:16:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e1a9a591d6353f7f95cfa82067eaa3475520259ad56a5b80838e5000b20b577d","abstract_canon_sha256":"8d0a14be3dfa4570b754606bf867c02441f0e9e61cb0310134cce7fb50d7535c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:09.098167Z","signature_b64":"w17jXDfZTWRmERqKyK2vpf29BbkkRE6ioWbBEoLBhOHOaZL24oB0wJNgf/epRt3sMa6ZBK+/tA1tRruONzq4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd8d75839cd37bf9370ed25bdfa79fc4db91cfa1ea3daf71cbd1e55cd315ee93","last_reissued_at":"2026-05-18T01:32:09.097410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:09.097410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Dimitrios M. Thilikos, EunJung Kim, Ignasi Sau","submitted_at":"2015-09-24T15:16:06Z","abstract_excerpt":"In this paper we design {\\sf FPT}-algorithms for two parameterized problems. The first is \\textsc{List Digraph Homomorphism}: given two digraphs $G$ and $H$ and a list of allowed vertices of $H$ for every vertex of $G$, the question is whether there exists a homomorphism from $G$ to $H$ respecting the list constraints. The second problem is a variant of \\textsc{Multiway Cut}, namely \\textsc{Min-Max Multiway Cut}: given a graph $G$, a non-negative integer $\\ell$, and a set $T$ of $r$ terminals, the question is whether we can partition the vertices of $G$ into $r$ parts such that (a) each part c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07404","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":""},"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":"1509.07404","created_at":"2026-05-18T01:32:09.097539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07404v1","created_at":"2026-05-18T01:32:09.097539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07404","created_at":"2026-05-18T01:32:09.097539+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WGXLA442N57","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WGXLA442N57SNYO","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WGXLA44","created_at":"2026-05-18T12:29:10.953037+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/7WGXLA442N57SNYO2JN57J47YT","json":"https://pith.science/pith/7WGXLA442N57SNYO2JN57J47YT.json","graph_json":"https://pith.science/api/pith-number/7WGXLA442N57SNYO2JN57J47YT/graph.json","events_json":"https://pith.science/api/pith-number/7WGXLA442N57SNYO2JN57J47YT/events.json","paper":"https://pith.science/paper/7WGXLA44"},"agent_actions":{"view_html":"https://pith.science/pith/7WGXLA442N57SNYO2JN57J47YT","download_json":"https://pith.science/pith/7WGXLA442N57SNYO2JN57J47YT.json","view_paper":"https://pith.science/paper/7WGXLA44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07404&json=true","fetch_graph":"https://pith.science/api/pith-number/7WGXLA442N57SNYO2JN57J47YT/graph.json","fetch_events":"https://pith.science/api/pith-number/7WGXLA442N57SNYO2JN57J47YT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WGXLA442N57SNYO2JN57J47YT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WGXLA442N57SNYO2JN57J47YT/action/storage_attestation","attest_author":"https://pith.science/pith/7WGXLA442N57SNYO2JN57J47YT/action/author_attestation","sign_citation":"https://pith.science/pith/7WGXLA442N57SNYO2JN57J47YT/action/citation_signature","submit_replication":"https://pith.science/pith/7WGXLA442N57SNYO2JN57J47YT/action/replication_record"}},"created_at":"2026-05-18T01:32:09.097539+00:00","updated_at":"2026-05-18T01:32:09.097539+00:00"}