{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NC6B3MQGTTMQPEGPAFSFOHQADA","short_pith_number":"pith:NC6B3MQG","schema_version":"1.0","canonical_sha256":"68bc1db2069cd90790cf0164571e0018150b967fa6ba5745dcba7f01399cf999","source":{"kind":"arxiv","id":"1612.00156","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.00156","created_at":"2026-05-18T00:40:51.421928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00156v2","created_at":"2026-05-18T00:40:51.421928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00156","created_at":"2026-05-18T00:40:51.421928+00:00"},{"alias_kind":"pith_short_12","alias_value":"NC6B3MQGTTMQ","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NC6B3MQGTTMQPEGP","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NC6B3MQG","created_at":"2026-05-18T12:30:32.724797+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/NC6B3MQGTTMQPEGPAFSFOHQADA","json":"https://pith.science/pith/NC6B3MQGTTMQPEGPAFSFOHQADA.json","graph_json":"https://pith.science/api/pith-number/NC6B3MQGTTMQPEGPAFSFOHQADA/graph.json","events_json":"https://pith.science/api/pith-number/NC6B3MQGTTMQPEGPAFSFOHQADA/events.json","paper":"https://pith.science/paper/NC6B3MQG"},"agent_actions":{"view_html":"https://pith.science/pith/NC6B3MQGTTMQPEGPAFSFOHQADA","download_json":"https://pith.science/pith/NC6B3MQGTTMQPEGPAFSFOHQADA.json","view_paper":"https://pith.science/paper/NC6B3MQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00156&json=true","fetch_graph":"https://pith.science/api/pith-number/NC6B3MQGTTMQPEGPAFSFOHQADA/graph.json","fetch_events":"https://pith.science/api/pith-number/NC6B3MQGTTMQPEGPAFSFOHQADA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NC6B3MQGTTMQPEGPAFSFOHQADA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NC6B3MQGTTMQPEGPAFSFOHQADA/action/storage_attestation","attest_author":"https://pith.science/pith/NC6B3MQGTTMQPEGPAFSFOHQADA/action/author_attestation","sign_citation":"https://pith.science/pith/NC6B3MQGTTMQPEGPAFSFOHQADA/action/citation_signature","submit_replication":"https://pith.science/pith/NC6B3MQGTTMQPEGPAFSFOHQADA/action/replication_record"}},"created_at":"2026-05-18T00:40:51.421928+00:00","updated_at":"2026-05-18T00:40:51.421928+00:00"}