{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YN4ZTYNXGMQ332YYBOSNPNXAWM","short_pith_number":"pith:YN4ZTYNX","canonical_record":{"source":{"id":"1804.01308","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-04T09:01:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"debc6c2325d9c8833da13b76c824881d7c615dc93abe1122daf2e247f7f905d8","abstract_canon_sha256":"64f079c55610486b1fefcd12b02137e598b827b2abcaea9094a9aac4ce16b6c6"},"schema_version":"1.0"},"canonical_sha256":"c37999e1b73321bdeb180ba4d7b6e0b303b63da6a02d76055c41b66075b8f302","source":{"kind":"arxiv","id":"1804.01308","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01308","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01308v3","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01308","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"pith_short_12","alias_value":"YN4ZTYNXGMQ3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YN4ZTYNXGMQ332YY","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YN4ZTYNX","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YN4ZTYNXGMQ332YYBOSNPNXAWM","target":"record","payload":{"canonical_record":{"source":{"id":"1804.01308","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-04T09:01:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"debc6c2325d9c8833da13b76c824881d7c615dc93abe1122daf2e247f7f905d8","abstract_canon_sha256":"64f079c55610486b1fefcd12b02137e598b827b2abcaea9094a9aac4ce16b6c6"},"schema_version":"1.0"},"canonical_sha256":"c37999e1b73321bdeb180ba4d7b6e0b303b63da6a02d76055c41b66075b8f302","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:09.580298Z","signature_b64":"twE36T1vypQL1LlZYWVm89Q1ceIklBAkzPbdthqSx3QF6mQMtlivMM5WPCStfSh8nJ0M0seh7HNOVyPYLaB3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c37999e1b73321bdeb180ba4d7b6e0b303b63da6a02d76055c41b66075b8f302","last_reissued_at":"2026-05-18T00:15:09.579814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:09.579814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.01308","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-18T00:15:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U6ImZlvKLAG9/Y4bi7xtm+TSpkfZNvCof1qVpSc8OagdcRsRCn78jnhQxp1ey+T5kYeDVxS4XPyaU6L+DzL0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:19:37.146988Z"},"content_sha256":"16fbb86508a47aeb46973f7b6648cef6864b54b528dd56f9fbbc7709f50200b7","schema_version":"1.0","event_id":"sha256:16fbb86508a47aeb46973f7b6648cef6864b54b528dd56f9fbbc7709f50200b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YN4ZTYNXGMQ332YYBOSNPNXAWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\\log n\\log\\Delta / \\log^2\\log\\Delta)$ Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gregory Schwartzman, Guy Even, Ken-ichi Kawarabayashi, Ran Ben-Basat","submitted_at":"2018-04-04T09:01:44Z","abstract_excerpt":"We present a deterministic distributed $2$-approximation algorithm for the Minimum Weight Vertex Cover problem in the CONGEST model whose round complexity is $O(\\log n \\log \\Delta / \\log^2 \\log \\Delta)$. This improves over the currently best known deterministic 2-approximation implied by [KVY94]. Our solution generalizes the $(2+\\epsilon)$-approximation algorithm of [BCS17], improving the dependency on $\\epsilon^{-1}$ from linear to logarithmic. In addition, for every $\\epsilon=(\\log \\Delta)^{-c}$, where $c\\geq 1$ is a constant, our algorithm computes a $(2+\\epsilon)$-approximation in $O(\\log "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01308","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-18T00:15:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x43Akw7M3Un3Y1H8e1R9cUpKnyvp/mwV1r7IUJkJScM8Xg5DoYXtsEn89zFlb2PRepxge179KWcV55dmphuEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:19:37.147355Z"},"content_sha256":"4e429b9e9ca4eead3794b523282ae9e75685246daa94455c4af479dd6b04dd05","schema_version":"1.0","event_id":"sha256:4e429b9e9ca4eead3794b523282ae9e75685246daa94455c4af479dd6b04dd05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM/bundle.json","state_url":"https://pith.science/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM/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-06-02T22:19:37Z","links":{"resolver":"https://pith.science/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM","bundle":"https://pith.science/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM/bundle.json","state":"https://pith.science/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YN4ZTYNXGMQ332YYBOSNPNXAWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YN4ZTYNXGMQ332YYBOSNPNXAWM","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":"64f079c55610486b1fefcd12b02137e598b827b2abcaea9094a9aac4ce16b6c6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-04T09:01:44Z","title_canon_sha256":"debc6c2325d9c8833da13b76c824881d7c615dc93abe1122daf2e247f7f905d8"},"schema_version":"1.0","source":{"id":"1804.01308","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01308","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01308v3","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01308","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"pith_short_12","alias_value":"YN4ZTYNXGMQ3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YN4ZTYNXGMQ332YY","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YN4ZTYNX","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:4e429b9e9ca4eead3794b523282ae9e75685246daa94455c4af479dd6b04dd05","target":"graph","created_at":"2026-05-18T00:15:09Z","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 present a deterministic distributed $2$-approximation algorithm for the Minimum Weight Vertex Cover problem in the CONGEST model whose round complexity is $O(\\log n \\log \\Delta / \\log^2 \\log \\Delta)$. This improves over the currently best known deterministic 2-approximation implied by [KVY94]. Our solution generalizes the $(2+\\epsilon)$-approximation algorithm of [BCS17], improving the dependency on $\\epsilon^{-1}$ from linear to logarithmic. In addition, for every $\\epsilon=(\\log \\Delta)^{-c}$, where $c\\geq 1$ is a constant, our algorithm computes a $(2+\\epsilon)$-approximation in $O(\\log ","authors_text":"Gregory Schwartzman, Guy Even, Ken-ichi Kawarabayashi, Ran Ben-Basat","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-04T09:01:44Z","title":"A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\\log n\\log\\Delta / \\log^2\\log\\Delta)$ Rounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01308","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:16fbb86508a47aeb46973f7b6648cef6864b54b528dd56f9fbbc7709f50200b7","target":"record","created_at":"2026-05-18T00:15:09Z","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":"64f079c55610486b1fefcd12b02137e598b827b2abcaea9094a9aac4ce16b6c6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-04T09:01:44Z","title_canon_sha256":"debc6c2325d9c8833da13b76c824881d7c615dc93abe1122daf2e247f7f905d8"},"schema_version":"1.0","source":{"id":"1804.01308","kind":"arxiv","version":3}},"canonical_sha256":"c37999e1b73321bdeb180ba4d7b6e0b303b63da6a02d76055c41b66075b8f302","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c37999e1b73321bdeb180ba4d7b6e0b303b63da6a02d76055c41b66075b8f302","first_computed_at":"2026-05-18T00:15:09.579814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:09.579814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"twE36T1vypQL1LlZYWVm89Q1ceIklBAkzPbdthqSx3QF6mQMtlivMM5WPCStfSh8nJ0M0seh7HNOVyPYLaB3Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:09.580298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01308","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16fbb86508a47aeb46973f7b6648cef6864b54b528dd56f9fbbc7709f50200b7","sha256:4e429b9e9ca4eead3794b523282ae9e75685246daa94455c4af479dd6b04dd05"],"state_sha256":"bb21be359b10373a41fc2507f4387ab135d24afbe6e9734052305d995013de9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H4f3WJHB1LMBL2FZAKPJfKKTzGdaS/h0aaa4oCx9FSLHfX4tmbsGKVSzltBv3L2qpd8KBF4nqLgEEAaiFG/xCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:19:37.149406Z","bundle_sha256":"b311e1f5cd289f584d9b6e05885cb3d87209c61b6f6f823f0c45219af0260c17"}}