{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TZASITFGSUEHMLMTKECWUFQSWA","short_pith_number":"pith:TZASITFG","canonical_record":{"source":{"id":"1408.2071","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-09T07:41:12Z","cross_cats_sorted":[],"title_canon_sha256":"06285fbd75c34a03d9dcabe2f6252fb8edd42b265282caab73c032bad212af72","abstract_canon_sha256":"44ec80e55f104f2b82942dbb19280fa8c7662ef90bdd4006483bfc5e2405b51b"},"schema_version":"1.0"},"canonical_sha256":"9e41244ca69508762d9351056a1612b02db92dfc6ca3abf353b1aaf1495bae06","source":{"kind":"arxiv","id":"1408.2071","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2071","created_at":"2026-05-18T00:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2071v2","created_at":"2026-05-18T00:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2071","created_at":"2026-05-18T00:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"TZASITFGSUEH","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TZASITFGSUEHMLMT","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TZASITFG","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TZASITFGSUEHMLMTKECWUFQSWA","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2071","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-09T07:41:12Z","cross_cats_sorted":[],"title_canon_sha256":"06285fbd75c34a03d9dcabe2f6252fb8edd42b265282caab73c032bad212af72","abstract_canon_sha256":"44ec80e55f104f2b82942dbb19280fa8c7662ef90bdd4006483bfc5e2405b51b"},"schema_version":"1.0"},"canonical_sha256":"9e41244ca69508762d9351056a1612b02db92dfc6ca3abf353b1aaf1495bae06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:06.683780Z","signature_b64":"evWEr4w8+Jvxh7sISN9F3hq0bzB1yXxQ5FPNDlIwWYXfXRrQ1qybmE43QNfD0q+tEDEBWfEmR4Ukb02PxOQuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e41244ca69508762d9351056a1612b02db92dfc6ca3abf353b1aaf1495bae06","last_reissued_at":"2026-05-18T00:06:06.683303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:06.683303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2071","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:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"75r5KAKSTLDi8ylphGCIPSLxB3QTMSQW0aGG+WYpIwZuSOEcBFYW+e1F9/UNVyaofmZfoR5SY5QmxRtjk+cTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:05:25.383713Z"},"content_sha256":"90ad25120aa14fa25af9ae50cc9e2bd6704a0ac1d0be812c5f5c8d4a9af990e8","schema_version":"1.0","event_id":"sha256:90ad25120aa14fa25af9ae50cc9e2bd6704a0ac1d0be812c5f5c8d4a9af990e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TZASITFGSUEHMLMTKECWUFQSWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Constant-Time Distributed Algorithms on a Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"James W. Hegeman, Sriram V. Pemmaraju, Vivek B. Sardeshmukh","submitted_at":"2014-08-09T07:41:12Z","abstract_excerpt":"This paper presents constant-time and near-constant-time distributed algorithms for a variety of problems in the congested clique model. We show how to compute a 3-ruling set in expected $O(\\log \\log \\log n)$ rounds and using this, we obtain a constant-approximation to metric facility location, also in expected $O(\\log \\log \\log n)$ rounds. In addition, assuming an input metric space of constant doubling dimension, we obtain constant-round algorithms to compute constant-factor approximations to the minimum spanning tree and the metric facility location problems. These results significantly imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2071","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:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yzO4EzHx3p0JsgAcZKBAf++lfV1UEF7hqNoEuYGgOWK55M/Mv2CQLr1DqQeUIQHnswcvYfJMYnl/BzwztnVyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:05:25.384178Z"},"content_sha256":"58ed87c5e61711b4c8e71aa8787116fb42ff2cdf371542c8b4f7af1dff271aea","schema_version":"1.0","event_id":"sha256:58ed87c5e61711b4c8e71aa8787116fb42ff2cdf371542c8b4f7af1dff271aea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA/bundle.json","state_url":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZASITFGSUEHMLMTKECWUFQSWA/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-22T22:05:25Z","links":{"resolver":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA","bundle":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA/bundle.json","state":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZASITFGSUEHMLMTKECWUFQSWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TZASITFGSUEHMLMTKECWUFQSWA","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":"44ec80e55f104f2b82942dbb19280fa8c7662ef90bdd4006483bfc5e2405b51b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-09T07:41:12Z","title_canon_sha256":"06285fbd75c34a03d9dcabe2f6252fb8edd42b265282caab73c032bad212af72"},"schema_version":"1.0","source":{"id":"1408.2071","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2071","created_at":"2026-05-18T00:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2071v2","created_at":"2026-05-18T00:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2071","created_at":"2026-05-18T00:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"TZASITFGSUEH","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TZASITFGSUEHMLMT","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TZASITFG","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:58ed87c5e61711b4c8e71aa8787116fb42ff2cdf371542c8b4f7af1dff271aea","target":"graph","created_at":"2026-05-18T00:06:06Z","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":"This paper presents constant-time and near-constant-time distributed algorithms for a variety of problems in the congested clique model. We show how to compute a 3-ruling set in expected $O(\\log \\log \\log n)$ rounds and using this, we obtain a constant-approximation to metric facility location, also in expected $O(\\log \\log \\log n)$ rounds. In addition, assuming an input metric space of constant doubling dimension, we obtain constant-round algorithms to compute constant-factor approximations to the minimum spanning tree and the metric facility location problems. These results significantly imp","authors_text":"James W. Hegeman, Sriram V. Pemmaraju, Vivek B. Sardeshmukh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-09T07:41:12Z","title":"Near-Constant-Time Distributed Algorithms on a Congested Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2071","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:90ad25120aa14fa25af9ae50cc9e2bd6704a0ac1d0be812c5f5c8d4a9af990e8","target":"record","created_at":"2026-05-18T00:06:06Z","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":"44ec80e55f104f2b82942dbb19280fa8c7662ef90bdd4006483bfc5e2405b51b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-09T07:41:12Z","title_canon_sha256":"06285fbd75c34a03d9dcabe2f6252fb8edd42b265282caab73c032bad212af72"},"schema_version":"1.0","source":{"id":"1408.2071","kind":"arxiv","version":2}},"canonical_sha256":"9e41244ca69508762d9351056a1612b02db92dfc6ca3abf353b1aaf1495bae06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e41244ca69508762d9351056a1612b02db92dfc6ca3abf353b1aaf1495bae06","first_computed_at":"2026-05-18T00:06:06.683303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:06.683303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"evWEr4w8+Jvxh7sISN9F3hq0bzB1yXxQ5FPNDlIwWYXfXRrQ1qybmE43QNfD0q+tEDEBWfEmR4Ukb02PxOQuAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:06.683780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2071","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90ad25120aa14fa25af9ae50cc9e2bd6704a0ac1d0be812c5f5c8d4a9af990e8","sha256:58ed87c5e61711b4c8e71aa8787116fb42ff2cdf371542c8b4f7af1dff271aea"],"state_sha256":"6a534b9f4780a636a5f4bf7bb0b47c9a45f5f4696da5d5e518dfd1efd2708164"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/83Q8ZxBbFLtudHxydFeY5KiefUiCvNfXTfLN19WYdJB3IDhQnE/OH1Ygl+4iVBXfBzUDoQAm/1MX9DGDk18Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:05:25.386752Z","bundle_sha256":"48dfc1f674587c22939a9d7505a429b02ae97bf9497450b2d4180710d69c599f"}}