{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KJMDHPUD6QM3WFNNGKN6LPRHVY","short_pith_number":"pith:KJMDHPUD","canonical_record":{"source":{"id":"1708.02323","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-07T22:21:24Z","cross_cats_sorted":[],"title_canon_sha256":"8eea4012236cef14abe29d52e7204f17c8d93a111ee0ca388f59ae5e7715d773","abstract_canon_sha256":"59ee83b027dd03aaf310aca31881e00a32e1a46c0a0aeff3dd1aadd529f53494"},"schema_version":"1.0"},"canonical_sha256":"525833be83f419bb15ad329be5be27ae2e8eb98df18c6825c99022ffc66e34bc","source":{"kind":"arxiv","id":"1708.02323","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02323","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02323v2","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02323","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"KJMDHPUD6QM3","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KJMDHPUD6QM3WFNN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KJMDHPUD","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KJMDHPUD6QM3WFNNGKN6LPRHVY","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02323","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-07T22:21:24Z","cross_cats_sorted":[],"title_canon_sha256":"8eea4012236cef14abe29d52e7204f17c8d93a111ee0ca388f59ae5e7715d773","abstract_canon_sha256":"59ee83b027dd03aaf310aca31881e00a32e1a46c0a0aeff3dd1aadd529f53494"},"schema_version":"1.0"},"canonical_sha256":"525833be83f419bb15ad329be5be27ae2e8eb98df18c6825c99022ffc66e34bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:08.816199Z","signature_b64":"TvtXEzzdFP8e5hdKjYFJ4a2Jrl6NnHkViXS9LhKtYigtfDGmRD/JdOM+jnL9T/DBgrUOB2QGejJii4tSpC3mCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"525833be83f419bb15ad329be5be27ae2e8eb98df18c6825c99022ffc66e34bc","last_reissued_at":"2026-05-18T00:19:08.815597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:08.815597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02323","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-18T00:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y6c5DU9CVkuEkrFa0nPA+a9SP8n1wbcWHTh+VA6PDk1dg61OO6wx2xVxGcMZvCyunMOx4s/UsptX/aOpQgaaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:01:02.319418Z"},"content_sha256":"d59ea9a42ed37ee547ce276ecd2e4a67c17c83d8675b35603f803dcd4c07708f","schema_version":"1.0","event_id":"sha256:d59ea9a42ed37ee547ce276ecd2e4a67c17c83d8675b35603f803dcd4c07708f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KJMDHPUD6QM3WFNNGKN6LPRHVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Odd Multiway Cut in Directed Acyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari","submitted_at":"2017-08-07T22:21:24Z","abstract_excerpt":"We investigate the odd multiway node (edge) cut problem where the input is a graph with a specified collection of terminal nodes and the goal is to find a smallest subset of nonterminal nodes (edges) to delete so that the terminal nodes do not have an odd length path between them. In an earlier work, Lokshtanov and Ramanujan showed that both odd multiway node cut and odd multiway edge cut are fixed-parameter tractable (FPT) when parameterized by the size of the solution in undirected graphs. In this work, we focus on directed acyclic graphs (DAGs) and design a fixed-parameter algorithm. Our ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02323","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-18T00:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JfagDNugVFZ2wyRB58KS8vMq9UkGJFuj1jkHSKe1268VXyS4Fa6ly4wTlMVx6I5qUcQwH0GqZZX2KQnkm4tDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:01:02.319835Z"},"content_sha256":"7f72cef06d0b07ca0bcaf11a699100af3eef29f336574c36c3b3d99e442bc0a0","schema_version":"1.0","event_id":"sha256:7f72cef06d0b07ca0bcaf11a699100af3eef29f336574c36c3b3d99e442bc0a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJMDHPUD6QM3WFNNGKN6LPRHVY/bundle.json","state_url":"https://pith.science/pith/KJMDHPUD6QM3WFNNGKN6LPRHVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJMDHPUD6QM3WFNNGKN6LPRHVY/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-25T03:01:02Z","links":{"resolver":"https://pith.science/pith/KJMDHPUD6QM3WFNNGKN6LPRHVY","bundle":"https://pith.science/pith/KJMDHPUD6QM3WFNNGKN6LPRHVY/bundle.json","state":"https://pith.science/pith/KJMDHPUD6QM3WFNNGKN6LPRHVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJMDHPUD6QM3WFNNGKN6LPRHVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KJMDHPUD6QM3WFNNGKN6LPRHVY","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":"59ee83b027dd03aaf310aca31881e00a32e1a46c0a0aeff3dd1aadd529f53494","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-07T22:21:24Z","title_canon_sha256":"8eea4012236cef14abe29d52e7204f17c8d93a111ee0ca388f59ae5e7715d773"},"schema_version":"1.0","source":{"id":"1708.02323","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02323","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02323v2","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02323","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"KJMDHPUD6QM3","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KJMDHPUD6QM3WFNN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KJMDHPUD","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:7f72cef06d0b07ca0bcaf11a699100af3eef29f336574c36c3b3d99e442bc0a0","target":"graph","created_at":"2026-05-18T00:19:08Z","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 investigate the odd multiway node (edge) cut problem where the input is a graph with a specified collection of terminal nodes and the goal is to find a smallest subset of nonterminal nodes (edges) to delete so that the terminal nodes do not have an odd length path between them. In an earlier work, Lokshtanov and Ramanujan showed that both odd multiway node cut and odd multiway edge cut are fixed-parameter tractable (FPT) when parameterized by the size of the solution in undirected graphs. In this work, we focus on directed acyclic graphs (DAGs) and design a fixed-parameter algorithm. Our ma","authors_text":"Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-07T22:21:24Z","title":"Odd Multiway Cut in Directed Acyclic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02323","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:d59ea9a42ed37ee547ce276ecd2e4a67c17c83d8675b35603f803dcd4c07708f","target":"record","created_at":"2026-05-18T00:19:08Z","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":"59ee83b027dd03aaf310aca31881e00a32e1a46c0a0aeff3dd1aadd529f53494","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-07T22:21:24Z","title_canon_sha256":"8eea4012236cef14abe29d52e7204f17c8d93a111ee0ca388f59ae5e7715d773"},"schema_version":"1.0","source":{"id":"1708.02323","kind":"arxiv","version":2}},"canonical_sha256":"525833be83f419bb15ad329be5be27ae2e8eb98df18c6825c99022ffc66e34bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"525833be83f419bb15ad329be5be27ae2e8eb98df18c6825c99022ffc66e34bc","first_computed_at":"2026-05-18T00:19:08.815597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:08.815597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TvtXEzzdFP8e5hdKjYFJ4a2Jrl6NnHkViXS9LhKtYigtfDGmRD/JdOM+jnL9T/DBgrUOB2QGejJii4tSpC3mCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:08.816199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02323","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d59ea9a42ed37ee547ce276ecd2e4a67c17c83d8675b35603f803dcd4c07708f","sha256:7f72cef06d0b07ca0bcaf11a699100af3eef29f336574c36c3b3d99e442bc0a0"],"state_sha256":"9681e53bd40977054443254fef277e21d1c39c5dd82067271cd0943d88a81154"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uwlwv9jQi3U9Wbe/1365PlsuiXHNrDBDA++9bEyyqbBOwC2bZPk0zAiX1SzYxrAbGdECFiIsdvhpaD4Id8xrDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:01:02.323441Z","bundle_sha256":"c8ec4dfac721d30ad6c2ed024e48aceaa6f04dc41dfb544b19a37be474611e6a"}}