{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7WGXLA442N57SNYO2JN57J47YT","short_pith_number":"pith:7WGXLA44","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"},"canonical_sha256":"fd8d75839cd37bf9370ed25bdfa79fc4db91cfa1ea3daf71cbd1e55cd315ee93","source":{"kind":"arxiv","id":"1509.07404","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07404","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07404v1","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07404","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"pith_short_12","alias_value":"7WGXLA442N57","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7WGXLA442N57SNYO","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7WGXLA44","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7WGXLA442N57SNYO2JN57J47YT","target":"record","payload":{"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"},"canonical_sha256":"fd8d75839cd37bf9370ed25bdfa79fc4db91cfa1ea3daf71cbd1e55cd315ee93","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"},"source_kind":"arxiv","source_id":"1509.07404","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-05-18T01:32:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BT9wJWNzLvvn6nFlXItbA9eyNVZjJadgXWcMrlpHNhoDMXq9oIAT66HpMcYHPQQFpsJn0lYUDomsg+f5diQgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:28:12.439942Z"},"content_sha256":"b01201e05fd8676897f19f65038c64471691f9c9ae94cad738561db91f49e8dc","schema_version":"1.0","event_id":"sha256:b01201e05fd8676897f19f65038c64471691f9c9ae94cad738561db91f49e8dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7WGXLA442N57SNYO2JN57J47YT","target":"graph","payload":{"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"},"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-18T01:32:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0SOqaOvTAASYwL20QPP4Zuxp0RuOmpAUH9dV4Z1854g6x502mR3GtdtJ20LIiunY1FYyeF3zj6xwGGPFPXRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:28:12.440653Z"},"content_sha256":"f70f845e0eea3a7e0b19e298721c2a4adbb4571a5b681ff3504633115b7af5ca","schema_version":"1.0","event_id":"sha256:f70f845e0eea3a7e0b19e298721c2a4adbb4571a5b681ff3504633115b7af5ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WGXLA442N57SNYO2JN57J47YT/bundle.json","state_url":"https://pith.science/pith/7WGXLA442N57SNYO2JN57J47YT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WGXLA442N57SNYO2JN57J47YT/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-25T08:28:12Z","links":{"resolver":"https://pith.science/pith/7WGXLA442N57SNYO2JN57J47YT","bundle":"https://pith.science/pith/7WGXLA442N57SNYO2JN57J47YT/bundle.json","state":"https://pith.science/pith/7WGXLA442N57SNYO2JN57J47YT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WGXLA442N57SNYO2JN57J47YT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7WGXLA442N57SNYO2JN57J47YT","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":"8d0a14be3dfa4570b754606bf867c02441f0e9e61cb0310134cce7fb50d7535c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-24T15:16:06Z","title_canon_sha256":"e1a9a591d6353f7f95cfa82067eaa3475520259ad56a5b80838e5000b20b577d"},"schema_version":"1.0","source":{"id":"1509.07404","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07404","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07404v1","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07404","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"pith_short_12","alias_value":"7WGXLA442N57","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7WGXLA442N57SNYO","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7WGXLA44","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:f70f845e0eea3a7e0b19e298721c2a4adbb4571a5b681ff3504633115b7af5ca","target":"graph","created_at":"2026-05-18T01:32:09Z","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":"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","authors_text":"Christophe Paul, Dimitrios M. Thilikos, EunJung Kim, Ignasi Sau","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-24T15:16:06Z","title":"Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07404","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:b01201e05fd8676897f19f65038c64471691f9c9ae94cad738561db91f49e8dc","target":"record","created_at":"2026-05-18T01:32:09Z","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":"8d0a14be3dfa4570b754606bf867c02441f0e9e61cb0310134cce7fb50d7535c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-24T15:16:06Z","title_canon_sha256":"e1a9a591d6353f7f95cfa82067eaa3475520259ad56a5b80838e5000b20b577d"},"schema_version":"1.0","source":{"id":"1509.07404","kind":"arxiv","version":1}},"canonical_sha256":"fd8d75839cd37bf9370ed25bdfa79fc4db91cfa1ea3daf71cbd1e55cd315ee93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd8d75839cd37bf9370ed25bdfa79fc4db91cfa1ea3daf71cbd1e55cd315ee93","first_computed_at":"2026-05-18T01:32:09.097410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:09.097410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w17jXDfZTWRmERqKyK2vpf29BbkkRE6ioWbBEoLBhOHOaZL24oB0wJNgf/epRt3sMa6ZBK+/tA1tRruONzq4Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:09.098167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07404","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b01201e05fd8676897f19f65038c64471691f9c9ae94cad738561db91f49e8dc","sha256:f70f845e0eea3a7e0b19e298721c2a4adbb4571a5b681ff3504633115b7af5ca"],"state_sha256":"7314005d03d5d5bcc4ee5996c68a686f48f1dd775849af1bfebbc2802f06e65f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47DY3kT19TMYTrtW7OLEkGnXXhpnVtOoOo2cMyPJJnezBFvO0IaFjGKGAEgd4OhcFV2ljUTlcgSg6QK3lD5gBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:28:12.444609Z","bundle_sha256":"ecf4c82c1255786105b57acceb950fd51c6f9a3230d6e4e76f6fa62b201460d7"}}