{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NC6B3MQGTTMQPEGPAFSFOHQADA","short_pith_number":"pith:NC6B3MQG","canonical_record":{"source":{"id":"1612.00156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-01T06:09:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5f1b75f2d0aff53171ba1f9d05fdb7b36f8f960e40518676be945c39c7013a06","abstract_canon_sha256":"888a363f8563ce4a0d36650d81498eccc68d737b43f1fc7351883578a788d8c4"},"schema_version":"1.0"},"canonical_sha256":"68bc1db2069cd90790cf0164571e0018150b967fa6ba5745dcba7f01399cf999","source":{"kind":"arxiv","id":"1612.00156","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00156","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00156v2","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00156","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"pith_short_12","alias_value":"NC6B3MQGTTMQ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NC6B3MQGTTMQPEGP","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NC6B3MQG","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NC6B3MQGTTMQPEGPAFSFOHQADA","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00156","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-01T06:09:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5f1b75f2d0aff53171ba1f9d05fdb7b36f8f960e40518676be945c39c7013a06","abstract_canon_sha256":"888a363f8563ce4a0d36650d81498eccc68d737b43f1fc7351883578a788d8c4"},"schema_version":"1.0"},"canonical_sha256":"68bc1db2069cd90790cf0164571e0018150b967fa6ba5745dcba7f01399cf999","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:51.422555Z","signature_b64":"5erXugYl4guJRP7k3DaK1oN5TepUExcURaVRMsUUQJ7sbLR8TQiPtZaFdSIu0IuCgpNgEH5Wt7BG7bBqqW9OAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68bc1db2069cd90790cf0164571e0018150b967fa6ba5745dcba7f01399cf999","last_reissued_at":"2026-05-18T00:40:51.421809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:51.421809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00156","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:40:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vHhAALTVwqGuEfvS5GDRVypH9zVSffxaREMtSFIQVg8zKewAkj9E8MXeh0BJOaJvKbi71E3Nz+Adi4dLAYoEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:29:32.605139Z"},"content_sha256":"e2978048116b66ba89ad7baa965683c7e7055af58ee889fe66a054c62f329c4e","schema_version":"1.0","event_id":"sha256:e2978048116b66ba89ad7baa965683c7e7055af58ee889fe66a054c62f329c4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NC6B3MQGTTMQPEGPAFSFOHQADA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Global and fixed-terminal cuts in digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Chao Xu, Euiwoong Lee, Karthekeyan Chandrasekaran, Krist\\'of B\\'erczi, Tam\\'as Kir\\'aly","submitted_at":"2016-12-01T06:09:30Z","abstract_excerpt":"The computational complexity of multicut-like problems may vary significantly depending on whether the terminals are fixed or not. In this work we present a comprehensive study of this phenomenon in two types of cut problems in directed graphs: double cut and bicut.\n  1. The fixed-terminal edge-weighted double cut is known to be solvable efficiently. We show a tight approximability factor of $2$ for the fixed-terminal node-weighted double cut. We show that the global node-weighted double cut cannot be approximated to a factor smaller than $3/2$ under the Unique Games Conjecture (UGC).\n  2. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00156","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:40:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lDHemOj6hDCS51Qt49gdRg59MwSE9reVE8rJaU27sAqBMyyUg4KNl3VKXYHGetPnygDuQr+njYCmnTaVinQ7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:29:32.605889Z"},"content_sha256":"14cd687a54242d3047fa9b6d9e39b23a47115a7dd27de4013e87a2ee8a81f815","schema_version":"1.0","event_id":"sha256:14cd687a54242d3047fa9b6d9e39b23a47115a7dd27de4013e87a2ee8a81f815"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NC6B3MQGTTMQPEGPAFSFOHQADA/bundle.json","state_url":"https://pith.science/pith/NC6B3MQGTTMQPEGPAFSFOHQADA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NC6B3MQGTTMQPEGPAFSFOHQADA/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-23T08:29:32Z","links":{"resolver":"https://pith.science/pith/NC6B3MQGTTMQPEGPAFSFOHQADA","bundle":"https://pith.science/pith/NC6B3MQGTTMQPEGPAFSFOHQADA/bundle.json","state":"https://pith.science/pith/NC6B3MQGTTMQPEGPAFSFOHQADA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NC6B3MQGTTMQPEGPAFSFOHQADA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NC6B3MQGTTMQPEGPAFSFOHQADA","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":"888a363f8563ce4a0d36650d81498eccc68d737b43f1fc7351883578a788d8c4","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-01T06:09:30Z","title_canon_sha256":"5f1b75f2d0aff53171ba1f9d05fdb7b36f8f960e40518676be945c39c7013a06"},"schema_version":"1.0","source":{"id":"1612.00156","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00156","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00156v2","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00156","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"pith_short_12","alias_value":"NC6B3MQGTTMQ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NC6B3MQGTTMQPEGP","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NC6B3MQG","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:14cd687a54242d3047fa9b6d9e39b23a47115a7dd27de4013e87a2ee8a81f815","target":"graph","created_at":"2026-05-18T00:40:51Z","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":"The computational complexity of multicut-like problems may vary significantly depending on whether the terminals are fixed or not. In this work we present a comprehensive study of this phenomenon in two types of cut problems in directed graphs: double cut and bicut.\n  1. The fixed-terminal edge-weighted double cut is known to be solvable efficiently. We show a tight approximability factor of $2$ for the fixed-terminal node-weighted double cut. We show that the global node-weighted double cut cannot be approximated to a factor smaller than $3/2$ under the Unique Games Conjecture (UGC).\n  2. The","authors_text":"Chao Xu, Euiwoong Lee, Karthekeyan Chandrasekaran, Krist\\'of B\\'erczi, Tam\\'as Kir\\'aly","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-01T06:09:30Z","title":"Global and fixed-terminal cuts in digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00156","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:e2978048116b66ba89ad7baa965683c7e7055af58ee889fe66a054c62f329c4e","target":"record","created_at":"2026-05-18T00:40:51Z","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":"888a363f8563ce4a0d36650d81498eccc68d737b43f1fc7351883578a788d8c4","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-01T06:09:30Z","title_canon_sha256":"5f1b75f2d0aff53171ba1f9d05fdb7b36f8f960e40518676be945c39c7013a06"},"schema_version":"1.0","source":{"id":"1612.00156","kind":"arxiv","version":2}},"canonical_sha256":"68bc1db2069cd90790cf0164571e0018150b967fa6ba5745dcba7f01399cf999","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68bc1db2069cd90790cf0164571e0018150b967fa6ba5745dcba7f01399cf999","first_computed_at":"2026-05-18T00:40:51.421809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:51.421809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5erXugYl4guJRP7k3DaK1oN5TepUExcURaVRMsUUQJ7sbLR8TQiPtZaFdSIu0IuCgpNgEH5Wt7BG7bBqqW9OAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:51.422555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00156","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2978048116b66ba89ad7baa965683c7e7055af58ee889fe66a054c62f329c4e","sha256:14cd687a54242d3047fa9b6d9e39b23a47115a7dd27de4013e87a2ee8a81f815"],"state_sha256":"36d19f4910657214b48cf5b156d41806d2f12e98d1fa108a5c7e80e8b58d9302"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I41xyMEpUkxBS0+o3DkWpaDrpQozhFZR0hglVCcOeQao8sayw0iA20J59T0sD7lFECHBjUB8QDa0pg/vobfBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T08:29:32.609885Z","bundle_sha256":"0b809fa5c1dc57d1b2f2f1a13f14b6f41586ed515f32e198410d10ac6798d233"}}