{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CIHFO6GUZXYPK35AMYJYAPWCR4","short_pith_number":"pith:CIHFO6GU","canonical_record":{"source":{"id":"1807.09735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-25T17:28:44Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d3236791dcbb6698c1b0e50d9784bfa73615f267b8918093519f06834046a339","abstract_canon_sha256":"7cf86f4eca71583864fee13d02bbde7e2b8fc1e755645c3bce339989b5e8e498"},"schema_version":"1.0"},"canonical_sha256":"120e5778d4cdf0f56fa06613803ec28f2156ba354e55c7fe197ca4839c7fdeff","source":{"kind":"arxiv","id":"1807.09735","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09735","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09735v2","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09735","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"CIHFO6GUZXYP","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CIHFO6GUZXYPK35A","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CIHFO6GU","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CIHFO6GUZXYPK35AMYJYAPWCR4","target":"record","payload":{"canonical_record":{"source":{"id":"1807.09735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-25T17:28:44Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d3236791dcbb6698c1b0e50d9784bfa73615f267b8918093519f06834046a339","abstract_canon_sha256":"7cf86f4eca71583864fee13d02bbde7e2b8fc1e755645c3bce339989b5e8e498"},"schema_version":"1.0"},"canonical_sha256":"120e5778d4cdf0f56fa06613803ec28f2156ba354e55c7fe197ca4839c7fdeff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:12.986017Z","signature_b64":"MmU9iDt5IWQqf8v+CQlbxBQcsfHc5nJ4TmgFdZkpKB6oQrlbBKY8Tjwc6Iq5UuTlkvPuvpDwilLtikROj30cCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"120e5778d4cdf0f56fa06613803ec28f2156ba354e55c7fe197ca4839c7fdeff","last_reissued_at":"2026-05-18T00:00:12.985389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:12.985389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.09735","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:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4kZu0HSIsYJhHJXibovhz+3F7fxnFoXvxX7OGHr3zDEVDerDDaNFoTWXYrOe7LmjwYslCtADRAE2YxX1lfqnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:39:08.710893Z"},"content_sha256":"4e59f12b33e63f63d0168e6156bae2253cc4a1b107a90fd9e15c93fc71c8c7f1","schema_version":"1.0","event_id":"sha256:4e59f12b33e63f63d0168e6156bae2253cc4a1b107a90fd9e15c93fc71c8c7f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CIHFO6GUZXYPK35AMYJYAPWCR4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving the Integrality Gap for Multiway Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Karthekeyan Chandrasekaran, Krist\\'of B\\'erczi, Tam\\'as Kir\\'aly, Vivek Madan","submitted_at":"2018-07-25T17:28:44Z","abstract_excerpt":"In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of $k$ terminal nodes, and the goal is to partition the node set of the graph into $k$ non-empty parts each containing exactly one terminal so that the total weight of the edges crossing the partition is minimized. The multiway cut problem for $k\\ge 3$ is APX-hard. For arbitrary $k$, the best-known approximation factor is $1.2965$ due to [Sharma and Vondr\\'{a}k, 2014] while the best known inapproximability factor is $1.2$ due to [Angelidakis, Makarychev and Manurangsi, 2017]. In this w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09735","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:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJjk09GNAqz7qv8UlCu7yEaEWdtg3qNIe9iJfKdRLWTm2z6HmRRqoQloJFwJLXlrTWJbL3dfRiTv9v/5nqZ/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T15:39:08.711578Z"},"content_sha256":"cdf73dd26fb79768c1137683f3d1e921e7540edeb97f10d488a39cfbe195474c","schema_version":"1.0","event_id":"sha256:cdf73dd26fb79768c1137683f3d1e921e7540edeb97f10d488a39cfbe195474c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CIHFO6GUZXYPK35AMYJYAPWCR4/bundle.json","state_url":"https://pith.science/pith/CIHFO6GUZXYPK35AMYJYAPWCR4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CIHFO6GUZXYPK35AMYJYAPWCR4/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-23T15:39:08Z","links":{"resolver":"https://pith.science/pith/CIHFO6GUZXYPK35AMYJYAPWCR4","bundle":"https://pith.science/pith/CIHFO6GUZXYPK35AMYJYAPWCR4/bundle.json","state":"https://pith.science/pith/CIHFO6GUZXYPK35AMYJYAPWCR4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CIHFO6GUZXYPK35AMYJYAPWCR4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CIHFO6GUZXYPK35AMYJYAPWCR4","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":"7cf86f4eca71583864fee13d02bbde7e2b8fc1e755645c3bce339989b5e8e498","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-25T17:28:44Z","title_canon_sha256":"d3236791dcbb6698c1b0e50d9784bfa73615f267b8918093519f06834046a339"},"schema_version":"1.0","source":{"id":"1807.09735","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09735","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09735v2","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09735","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"CIHFO6GUZXYP","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CIHFO6GUZXYPK35A","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CIHFO6GU","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:cdf73dd26fb79768c1137683f3d1e921e7540edeb97f10d488a39cfbe195474c","target":"graph","created_at":"2026-05-18T00:00:12Z","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 the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of $k$ terminal nodes, and the goal is to partition the node set of the graph into $k$ non-empty parts each containing exactly one terminal so that the total weight of the edges crossing the partition is minimized. The multiway cut problem for $k\\ge 3$ is APX-hard. For arbitrary $k$, the best-known approximation factor is $1.2965$ due to [Sharma and Vondr\\'{a}k, 2014] while the best known inapproximability factor is $1.2$ due to [Angelidakis, Makarychev and Manurangsi, 2017]. In this w","authors_text":"Karthekeyan Chandrasekaran, Krist\\'of B\\'erczi, Tam\\'as Kir\\'aly, Vivek Madan","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-25T17:28:44Z","title":"Improving the Integrality Gap for Multiway Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09735","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:4e59f12b33e63f63d0168e6156bae2253cc4a1b107a90fd9e15c93fc71c8c7f1","target":"record","created_at":"2026-05-18T00:00:12Z","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":"7cf86f4eca71583864fee13d02bbde7e2b8fc1e755645c3bce339989b5e8e498","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-25T17:28:44Z","title_canon_sha256":"d3236791dcbb6698c1b0e50d9784bfa73615f267b8918093519f06834046a339"},"schema_version":"1.0","source":{"id":"1807.09735","kind":"arxiv","version":2}},"canonical_sha256":"120e5778d4cdf0f56fa06613803ec28f2156ba354e55c7fe197ca4839c7fdeff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"120e5778d4cdf0f56fa06613803ec28f2156ba354e55c7fe197ca4839c7fdeff","first_computed_at":"2026-05-18T00:00:12.985389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:12.985389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MmU9iDt5IWQqf8v+CQlbxBQcsfHc5nJ4TmgFdZkpKB6oQrlbBKY8Tjwc6Iq5UuTlkvPuvpDwilLtikROj30cCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:12.986017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09735","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e59f12b33e63f63d0168e6156bae2253cc4a1b107a90fd9e15c93fc71c8c7f1","sha256:cdf73dd26fb79768c1137683f3d1e921e7540edeb97f10d488a39cfbe195474c"],"state_sha256":"c21736ac6b79b77cbdab794bdb781a8c78c1eef6f75d87ace2eb53ee141157bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgWCgiyxU9QFjJVdzc060KZpBqxcZU+CR2gEVKuE1o1AoamK2uGqaTOfsal7Shc+JESifGlhezE3LcQqUDwmCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T15:39:08.715402Z","bundle_sha256":"66d30dada2709e4e3524cb54de69c0db459627c9653c97caef1c78fd39d5a872"}}