{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GN45PBBO5F532GY7FN7G4RKFNZ","short_pith_number":"pith:GN45PBBO","canonical_record":{"source":{"id":"1309.2729","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-11T04:15:30Z","cross_cats_sorted":[],"title_canon_sha256":"52fe4d23184bdc475cb750ddbeb1fdf150c018f3cc5c236554636c0a506a560b","abstract_canon_sha256":"b78efd306622ed39f4d94db3aaefd9f3253ffb41bba03f7ee083fc41202ba5b1"},"schema_version":"1.0"},"canonical_sha256":"3379d7842ee97bbd1b1f2b7e6e45456e7127cf5487f60433bdbbc1c3b5042887","source":{"kind":"arxiv","id":"1309.2729","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2729","created_at":"2026-05-18T02:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2729v3","created_at":"2026-05-18T02:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2729","created_at":"2026-05-18T02:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"GN45PBBO5F53","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GN45PBBO5F532GY7","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GN45PBBO","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GN45PBBO5F532GY7FN7G4RKFNZ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.2729","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-11T04:15:30Z","cross_cats_sorted":[],"title_canon_sha256":"52fe4d23184bdc475cb750ddbeb1fdf150c018f3cc5c236554636c0a506a560b","abstract_canon_sha256":"b78efd306622ed39f4d94db3aaefd9f3253ffb41bba03f7ee083fc41202ba5b1"},"schema_version":"1.0"},"canonical_sha256":"3379d7842ee97bbd1b1f2b7e6e45456e7127cf5487f60433bdbbc1c3b5042887","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:12.445356Z","signature_b64":"abBi4luMF6QBbgTB2IodSjpA/p0BjR0hjcL5w4s3vC1/1RAgzbQhW84ntuFzdxbKQMtNk3uRppUR594irCWACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3379d7842ee97bbd1b1f2b7e6e45456e7127cf5487f60433bdbbc1c3b5042887","last_reissued_at":"2026-05-18T02:52:12.444856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:12.444856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.2729","source_version":3,"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-18T02:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WwuAVkK62O6etIEP17mxWpiE45l7acQrw9TCw8wjhNF2XWbDcKPuntoVhTsyGuDelOeZnaU++QcMlq9BKbEIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:12:48.098752Z"},"content_sha256":"18c61ae7f8002fd411be8e2eae2c18da7f28885a636eba66ed7e3a779231634c","schema_version":"1.0","event_id":"sha256:18c61ae7f8002fd411be8e2eae2c18da7f28885a636eba66ed7e3a779231634c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GN45PBBO5F532GY7FN7G4RKFNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiway Cut, Pairwise Realizable Distributions, and Descending Thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ankit Sharma, Jan Vondr\\'ak","submitted_at":"2013-09-11T04:15:30Z","abstract_excerpt":"We design new approximation algorithms for the Multiway Cut problem, improving the previously known factor of 1.32388 [Buchbinder et al., 2013].\n  We proceed in three steps. First, we analyze the rounding scheme of Buchbinder et al., 2013 and design a modification that improves the approximation to (3+sqrt(5))/4 (approximately 1.309017). We also present a tight example showing that this is the best approximation one can achieve with the type of cuts considered by Buchbinder et al., 2013: (1) partitioning by exponential clocks, and (2) single-coordinate cuts with equal thresholds.\n  Then, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2729","kind":"arxiv","version":3},"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-18T02:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhAoSkIuku7/P8DvZmfySvPVBLP+7ONghft74N++tf4aj7wCiOJ3qgnlQ9yjU5nc9CU0IKlpfQ/uXfgK9RIsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:12:48.099384Z"},"content_sha256":"14efe50ff799ee04ce28e409e8b641ce81407705be980a7c2ec88e692500ef35","schema_version":"1.0","event_id":"sha256:14efe50ff799ee04ce28e409e8b641ce81407705be980a7c2ec88e692500ef35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GN45PBBO5F532GY7FN7G4RKFNZ/bundle.json","state_url":"https://pith.science/pith/GN45PBBO5F532GY7FN7G4RKFNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GN45PBBO5F532GY7FN7G4RKFNZ/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-30T13:12:48Z","links":{"resolver":"https://pith.science/pith/GN45PBBO5F532GY7FN7G4RKFNZ","bundle":"https://pith.science/pith/GN45PBBO5F532GY7FN7G4RKFNZ/bundle.json","state":"https://pith.science/pith/GN45PBBO5F532GY7FN7G4RKFNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GN45PBBO5F532GY7FN7G4RKFNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GN45PBBO5F532GY7FN7G4RKFNZ","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":"b78efd306622ed39f4d94db3aaefd9f3253ffb41bba03f7ee083fc41202ba5b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-11T04:15:30Z","title_canon_sha256":"52fe4d23184bdc475cb750ddbeb1fdf150c018f3cc5c236554636c0a506a560b"},"schema_version":"1.0","source":{"id":"1309.2729","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2729","created_at":"2026-05-18T02:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2729v3","created_at":"2026-05-18T02:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2729","created_at":"2026-05-18T02:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"GN45PBBO5F53","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GN45PBBO5F532GY7","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GN45PBBO","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:14efe50ff799ee04ce28e409e8b641ce81407705be980a7c2ec88e692500ef35","target":"graph","created_at":"2026-05-18T02:52: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":"We design new approximation algorithms for the Multiway Cut problem, improving the previously known factor of 1.32388 [Buchbinder et al., 2013].\n  We proceed in three steps. First, we analyze the rounding scheme of Buchbinder et al., 2013 and design a modification that improves the approximation to (3+sqrt(5))/4 (approximately 1.309017). We also present a tight example showing that this is the best approximation one can achieve with the type of cuts considered by Buchbinder et al., 2013: (1) partitioning by exponential clocks, and (2) single-coordinate cuts with equal thresholds.\n  Then, we pr","authors_text":"Ankit Sharma, Jan Vondr\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-11T04:15:30Z","title":"Multiway Cut, Pairwise Realizable Distributions, and Descending Thresholds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2729","kind":"arxiv","version":3},"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:18c61ae7f8002fd411be8e2eae2c18da7f28885a636eba66ed7e3a779231634c","target":"record","created_at":"2026-05-18T02:52: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":"b78efd306622ed39f4d94db3aaefd9f3253ffb41bba03f7ee083fc41202ba5b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-11T04:15:30Z","title_canon_sha256":"52fe4d23184bdc475cb750ddbeb1fdf150c018f3cc5c236554636c0a506a560b"},"schema_version":"1.0","source":{"id":"1309.2729","kind":"arxiv","version":3}},"canonical_sha256":"3379d7842ee97bbd1b1f2b7e6e45456e7127cf5487f60433bdbbc1c3b5042887","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3379d7842ee97bbd1b1f2b7e6e45456e7127cf5487f60433bdbbc1c3b5042887","first_computed_at":"2026-05-18T02:52:12.444856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:12.444856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"abBi4luMF6QBbgTB2IodSjpA/p0BjR0hjcL5w4s3vC1/1RAgzbQhW84ntuFzdxbKQMtNk3uRppUR594irCWACQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:12.445356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.2729","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18c61ae7f8002fd411be8e2eae2c18da7f28885a636eba66ed7e3a779231634c","sha256:14efe50ff799ee04ce28e409e8b641ce81407705be980a7c2ec88e692500ef35"],"state_sha256":"6dcdfcaeb3ba8fc125be5f8161f4c0901fa1a822e8f2b636d5bf091fe9209344"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aa1qYMyvw4Tc085UcOZbKW9cgKyB6TQN5PSf8tec9NbZ167L2CHmowlWMhToNNKaqpK+RlvupzCc+XZYxV7GAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:12:48.102343Z","bundle_sha256":"38423955ef4789cfe9fae9747726511625cbeb5ce754210e6469673ecb79c7be"}}