{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TZASITFGSUEHMLMTKECWUFQSWA","short_pith_number":"pith:TZASITFG","schema_version":"1.0","canonical_sha256":"9e41244ca69508762d9351056a1612b02db92dfc6ca3abf353b1aaf1495bae06","source":{"kind":"arxiv","id":"1408.2071","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.2071","created_at":"2026-05-18T00:06:06.683382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2071v2","created_at":"2026-05-18T00:06:06.683382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2071","created_at":"2026-05-18T00:06:06.683382+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZASITFGSUEH","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZASITFGSUEHMLMT","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZASITFG","created_at":"2026-05-18T12:28:52.271510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA","json":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA.json","graph_json":"https://pith.science/api/pith-number/TZASITFGSUEHMLMTKECWUFQSWA/graph.json","events_json":"https://pith.science/api/pith-number/TZASITFGSUEHMLMTKECWUFQSWA/events.json","paper":"https://pith.science/paper/TZASITFG"},"agent_actions":{"view_html":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA","download_json":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA.json","view_paper":"https://pith.science/paper/TZASITFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2071&json=true","fetch_graph":"https://pith.science/api/pith-number/TZASITFGSUEHMLMTKECWUFQSWA/graph.json","fetch_events":"https://pith.science/api/pith-number/TZASITFGSUEHMLMTKECWUFQSWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA/action/storage_attestation","attest_author":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA/action/author_attestation","sign_citation":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA/action/citation_signature","submit_replication":"https://pith.science/pith/TZASITFGSUEHMLMTKECWUFQSWA/action/replication_record"}},"created_at":"2026-05-18T00:06:06.683382+00:00","updated_at":"2026-05-18T00:06:06.683382+00:00"}