{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HIT6JUFJQOEQBYD4ERNBGMKMCF","short_pith_number":"pith:HIT6JUFJ","canonical_record":{"source":{"id":"1902.09377","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-25T15:45:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"32083c86f54bf5910b3df0e74f4877196f7555ecbd9f5de9b54da25d72a074e9","abstract_canon_sha256":"7f3d1df7bb7bf931cfb4ea1c7222451b3b7c35606d18d78f482b4705db935514"},"schema_version":"1.0"},"canonical_sha256":"3a27e4d0a9838900e07c245a13314c117d3da00a7ae59fe38e96005f6986e598","source":{"kind":"arxiv","id":"1902.09377","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09377","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09377v2","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09377","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"HIT6JUFJQOEQ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HIT6JUFJQOEQBYD4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HIT6JUFJ","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HIT6JUFJQOEQBYD4ERNBGMKMCF","target":"record","payload":{"canonical_record":{"source":{"id":"1902.09377","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-25T15:45:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"32083c86f54bf5910b3df0e74f4877196f7555ecbd9f5de9b54da25d72a074e9","abstract_canon_sha256":"7f3d1df7bb7bf931cfb4ea1c7222451b3b7c35606d18d78f482b4705db935514"},"schema_version":"1.0"},"canonical_sha256":"3a27e4d0a9838900e07c245a13314c117d3da00a7ae59fe38e96005f6986e598","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:42.464805Z","signature_b64":"g5e8R+waQUABGVjK68OIZh7Qt+XIQ959tAqpqD5rHXOBYmyNFXR5et9C/7v/jxcg0mLanSsL4sffotut1aUNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a27e4d0a9838900e07c245a13314c117d3da00a7ae59fe38e96005f6986e598","last_reissued_at":"2026-05-17T23:44:42.464292Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:42.464292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.09377","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-17T23:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t5WwnYc4ItKPoFTX772nT00X9qS8oZSKwc6Ezc1e1CBYS40gMCTPQNxHgcWANY3HaCOr6+v6vrZWxD2VKsp6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:04:13.798922Z"},"content_sha256":"521571ec7575cc1eb203f69b3d422e4b5fb52c86995a7590b81259f17ae56fa8","schema_version":"1.0","event_id":"sha256:521571ec7575cc1eb203f69b3d422e4b5fb52c86995a7590b81259f17ae56fa8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HIT6JUFJQOEQBYD4ERNBGMKMCF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Distributed Covering Algorithms","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":"2019-02-25T15:45:13Z","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)$. 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 N^+$. This is the first distributed algorithm for this problem whose running time does not depend on the vertex weights nor the number of v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09377","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-17T23:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYmv4J9AdIn0zLCBRnJbfsCfAhM8axU/qpYXfC63qvcAm1Rf9UN/y4MLIo0VvN8Fk/pPrblWMosbISxpPxueDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:04:13.799269Z"},"content_sha256":"fef86149e66cd998e2464401de29c2f24764c7c8186cb65be00e8b8887c96c10","schema_version":"1.0","event_id":"sha256:fef86149e66cd998e2464401de29c2f24764c7c8186cb65be00e8b8887c96c10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HIT6JUFJQOEQBYD4ERNBGMKMCF/bundle.json","state_url":"https://pith.science/pith/HIT6JUFJQOEQBYD4ERNBGMKMCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HIT6JUFJQOEQBYD4ERNBGMKMCF/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-03T01:04:13Z","links":{"resolver":"https://pith.science/pith/HIT6JUFJQOEQBYD4ERNBGMKMCF","bundle":"https://pith.science/pith/HIT6JUFJQOEQBYD4ERNBGMKMCF/bundle.json","state":"https://pith.science/pith/HIT6JUFJQOEQBYD4ERNBGMKMCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HIT6JUFJQOEQBYD4ERNBGMKMCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HIT6JUFJQOEQBYD4ERNBGMKMCF","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":"7f3d1df7bb7bf931cfb4ea1c7222451b3b7c35606d18d78f482b4705db935514","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-25T15:45:13Z","title_canon_sha256":"32083c86f54bf5910b3df0e74f4877196f7555ecbd9f5de9b54da25d72a074e9"},"schema_version":"1.0","source":{"id":"1902.09377","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09377","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09377v2","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09377","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"HIT6JUFJQOEQ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HIT6JUFJQOEQBYD4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HIT6JUFJ","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:fef86149e66cd998e2464401de29c2f24764c7c8186cb65be00e8b8887c96c10","target":"graph","created_at":"2026-05-17T23:44:42Z","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)$. 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 N^+$. This is the first distributed algorithm for this problem whose running time does not depend on the vertex weights nor the number of v","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":"2019-02-25T15:45:13Z","title":"Optimal Distributed Covering Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09377","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:521571ec7575cc1eb203f69b3d422e4b5fb52c86995a7590b81259f17ae56fa8","target":"record","created_at":"2026-05-17T23:44:42Z","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":"7f3d1df7bb7bf931cfb4ea1c7222451b3b7c35606d18d78f482b4705db935514","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-25T15:45:13Z","title_canon_sha256":"32083c86f54bf5910b3df0e74f4877196f7555ecbd9f5de9b54da25d72a074e9"},"schema_version":"1.0","source":{"id":"1902.09377","kind":"arxiv","version":2}},"canonical_sha256":"3a27e4d0a9838900e07c245a13314c117d3da00a7ae59fe38e96005f6986e598","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a27e4d0a9838900e07c245a13314c117d3da00a7ae59fe38e96005f6986e598","first_computed_at":"2026-05-17T23:44:42.464292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:42.464292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g5e8R+waQUABGVjK68OIZh7Qt+XIQ959tAqpqD5rHXOBYmyNFXR5et9C/7v/jxcg0mLanSsL4sffotut1aUNBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:42.464805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.09377","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:521571ec7575cc1eb203f69b3d422e4b5fb52c86995a7590b81259f17ae56fa8","sha256:fef86149e66cd998e2464401de29c2f24764c7c8186cb65be00e8b8887c96c10"],"state_sha256":"d84f9f2dc4b07ca07ba3f5b22fa15aa05d62d663ae3a871e163fbdcde969fcca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N8fFBq/qug8LIuFsU6msHOBS6TP4QYJvRws9HheLw+sBV8QEMew4EscUHQcxs4RzndWr9yYDsr41BXOnkdn/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:04:13.801337Z","bundle_sha256":"a0683fb76ec3f74312d8d95486fb81199e982cfe401cbfe07227bb4cda01eddf"}}