{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UKN7CHWIS3F5PLXUTKJZJMD54T","short_pith_number":"pith:UKN7CHWI","canonical_record":{"source":{"id":"1808.05809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-17T09:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"102d1e6521a947691dd6a828c3cd82958ac07fddd3a4f20f1ef6c0f92e19507a","abstract_canon_sha256":"61176368ad878368ba016f647af9ba45e777d01137d69a15d12986e30ceb435c"},"schema_version":"1.0"},"canonical_sha256":"a29bf11ec896cbd7aef49a9394b07de4e256e29e8b5b20a5208674129930d956","source":{"kind":"arxiv","id":"1808.05809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05809","created_at":"2026-05-18T00:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05809v1","created_at":"2026-05-18T00:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05809","created_at":"2026-05-18T00:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"UKN7CHWIS3F5","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UKN7CHWIS3F5PLXU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UKN7CHWI","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UKN7CHWIS3F5PLXUTKJZJMD54T","target":"record","payload":{"canonical_record":{"source":{"id":"1808.05809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-17T09:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"102d1e6521a947691dd6a828c3cd82958ac07fddd3a4f20f1ef6c0f92e19507a","abstract_canon_sha256":"61176368ad878368ba016f647af9ba45e777d01137d69a15d12986e30ceb435c"},"schema_version":"1.0"},"canonical_sha256":"a29bf11ec896cbd7aef49a9394b07de4e256e29e8b5b20a5208674129930d956","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:52.047082Z","signature_b64":"LtD9BzL9+rf/NOqS9VK09907OQL/ht7q/2uLTeQM9gNqGKrbLT5x0l9CR5Iy6qdIIlO4/AwHMvNKE3OP0kpjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a29bf11ec896cbd7aef49a9394b07de4e256e29e8b5b20a5208674129930d956","last_reissued_at":"2026-05-18T00:07:52.046449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:52.046449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.05809","source_version":1,"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:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5uk2udE1D9HyW6MXqc/1LTWJ0taf/vAUteEKMJmNnQLB4/NCbYQzKI5sDLBdnuELdEH0ot1OfNjQ2MYyzx3KDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:30:04.688063Z"},"content_sha256":"cf0f7d2b335635ef22f58fd2d67b83eca8dfc1a9553cc7f5598a7ba4300ae268","schema_version":"1.0","event_id":"sha256:cf0f7d2b335635ef22f58fd2d67b83eca8dfc1a9553cc7f5598a7ba4300ae268"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UKN7CHWIS3F5PLXUTKJZJMD54T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Distributed Weighted Set Cover Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gregory Schwartzman, Guy Even, Ken-ichi Kawarabayashi, Ran Ben-Basat","submitted_at":"2018-08-17T09:50:30Z","abstract_excerpt":"We present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank $f$. This problem is equivalent to the Minimum Weight Set Cover Problem in which the frequency of every element is bounded by $f$. The approximation factor of our algorithm is $(f+\\epsilon)$. Let $\\Delta$ denote the maximum degree in the hypergraph. Our algorithm runs in the CONGEST model and requires $O(\\log{\\Delta} / \\log \\log \\Delta)$ rounds, for constants $\\epsilon \\in (0,1]$ and $f\\in\\mathbb N^+$. This is the first distributed algorithm for this problem whos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05809","kind":"arxiv","version":1},"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:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wUTTh0lcAU6i8GuWZz+tifr8e74Yrdn0E5AssRQfEqiykFI5omKV4gYXzvkrpoWnfBsGY9hMWOCCvLAFAlNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:30:04.688431Z"},"content_sha256":"44082bedca267f0f6296154f0ae29a3568fb3e749a2ac9671944d9b1d39dc4a5","schema_version":"1.0","event_id":"sha256:44082bedca267f0f6296154f0ae29a3568fb3e749a2ac9671944d9b1d39dc4a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKN7CHWIS3F5PLXUTKJZJMD54T/bundle.json","state_url":"https://pith.science/pith/UKN7CHWIS3F5PLXUTKJZJMD54T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKN7CHWIS3F5PLXUTKJZJMD54T/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-03T03:30:04Z","links":{"resolver":"https://pith.science/pith/UKN7CHWIS3F5PLXUTKJZJMD54T","bundle":"https://pith.science/pith/UKN7CHWIS3F5PLXUTKJZJMD54T/bundle.json","state":"https://pith.science/pith/UKN7CHWIS3F5PLXUTKJZJMD54T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKN7CHWIS3F5PLXUTKJZJMD54T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UKN7CHWIS3F5PLXUTKJZJMD54T","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":"61176368ad878368ba016f647af9ba45e777d01137d69a15d12986e30ceb435c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-17T09:50:30Z","title_canon_sha256":"102d1e6521a947691dd6a828c3cd82958ac07fddd3a4f20f1ef6c0f92e19507a"},"schema_version":"1.0","source":{"id":"1808.05809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05809","created_at":"2026-05-18T00:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05809v1","created_at":"2026-05-18T00:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05809","created_at":"2026-05-18T00:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"UKN7CHWIS3F5","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UKN7CHWIS3F5PLXU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UKN7CHWI","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:44082bedca267f0f6296154f0ae29a3568fb3e749a2ac9671944d9b1d39dc4a5","target":"graph","created_at":"2026-05-18T00:07:52Z","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 time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank $f$. This problem is equivalent to the Minimum Weight Set Cover Problem in which the frequency of every element is bounded by $f$. The approximation factor of our algorithm is $(f+\\epsilon)$. Let $\\Delta$ denote the maximum degree in the hypergraph. Our algorithm runs in the CONGEST model and requires $O(\\log{\\Delta} / \\log \\log \\Delta)$ rounds, for constants $\\epsilon \\in (0,1]$ and $f\\in\\mathbb N^+$. This is the first distributed algorithm for this problem whos","authors_text":"Gregory Schwartzman, Guy Even, Ken-ichi Kawarabayashi, Ran Ben-Basat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-17T09:50:30Z","title":"Optimal Distributed Weighted Set Cover Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05809","kind":"arxiv","version":1},"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:cf0f7d2b335635ef22f58fd2d67b83eca8dfc1a9553cc7f5598a7ba4300ae268","target":"record","created_at":"2026-05-18T00:07:52Z","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":"61176368ad878368ba016f647af9ba45e777d01137d69a15d12986e30ceb435c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-17T09:50:30Z","title_canon_sha256":"102d1e6521a947691dd6a828c3cd82958ac07fddd3a4f20f1ef6c0f92e19507a"},"schema_version":"1.0","source":{"id":"1808.05809","kind":"arxiv","version":1}},"canonical_sha256":"a29bf11ec896cbd7aef49a9394b07de4e256e29e8b5b20a5208674129930d956","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a29bf11ec896cbd7aef49a9394b07de4e256e29e8b5b20a5208674129930d956","first_computed_at":"2026-05-18T00:07:52.046449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:52.046449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LtD9BzL9+rf/NOqS9VK09907OQL/ht7q/2uLTeQM9gNqGKrbLT5x0l9CR5Iy6qdIIlO4/AwHMvNKE3OP0kpjDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:52.047082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.05809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf0f7d2b335635ef22f58fd2d67b83eca8dfc1a9553cc7f5598a7ba4300ae268","sha256:44082bedca267f0f6296154f0ae29a3568fb3e749a2ac9671944d9b1d39dc4a5"],"state_sha256":"262f6e6a20cb3f305a5828e451f31422ef07f3f2f5e0fff9ced676428a60f254"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSXcYjR4STsIZCoOQd5j9NumhHhIQC8AlxkBY5bu33cVLzk18hRGgvHtfz/OC5LKuZ1QaTILYDMLMjvFUYBXDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:30:04.690460Z","bundle_sha256":"cab797b1fce3ee9d809ce9592521b2102359fa66c68a43ac09820a677a67dbc3"}}