{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:D7QJPLGJT6CSYVPDXFYPXP26OG","short_pith_number":"pith:D7QJPLGJ","canonical_record":{"source":{"id":"1412.2333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-07T09:29:42Z","cross_cats_sorted":[],"title_canon_sha256":"0b9ee6236a63c070f3d40e08292b01b0495c74255963b8cd236df85394e992dc","abstract_canon_sha256":"5042b9332fbc8bd506f1f612082d5eca903687e0484f315e5518276b841fd163"},"schema_version":"1.0"},"canonical_sha256":"1fe097acc99f852c55e3b970fbbf5e71bce2a17f6b2c7559b85eaecdace7b24a","source":{"kind":"arxiv","id":"1412.2333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2333","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2333v1","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2333","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"D7QJPLGJT6CS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D7QJPLGJT6CSYVPD","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D7QJPLGJ","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:D7QJPLGJT6CSYVPDXFYPXP26OG","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-07T09:29:42Z","cross_cats_sorted":[],"title_canon_sha256":"0b9ee6236a63c070f3d40e08292b01b0495c74255963b8cd236df85394e992dc","abstract_canon_sha256":"5042b9332fbc8bd506f1f612082d5eca903687e0484f315e5518276b841fd163"},"schema_version":"1.0"},"canonical_sha256":"1fe097acc99f852c55e3b970fbbf5e71bce2a17f6b2c7559b85eaecdace7b24a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:58.283418Z","signature_b64":"oyZjN9/oD24DaGmT9P5lgJb/gCKPHEWEgvsTl/PYjnIb7PSa7VOwjvgILz6Wa/oszrcVIiv5LH3/QS/XMLXwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fe097acc99f852c55e3b970fbbf5e71bce2a17f6b2c7559b85eaecdace7b24a","last_reissued_at":"2026-05-18T02:31:58.282796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:58.282796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2333","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-18T02:31:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zM+AC0pkGatXS1FNRnP6ZmXmL1ucGF/bdweikMl1v6+25uENfLcaF06V8ZMbqjHCa8O1dtIWOXXcpKDVClaoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:26:07.373965Z"},"content_sha256":"ff9368fc2c07a641739877e37c7a8c088e3df0ee1093da35760548a10fb67891","schema_version":"1.0","event_id":"sha256:ff9368fc2c07a641739877e37c7a8c088e3df0ee1093da35760548a10fb67891"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:D7QJPLGJT6CSYVPDXFYPXP26OG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum-weight Spanning Tree Construction in $O(\\log \\log \\log n)$ Rounds on the Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Sriram V. Pemmaraju, Vivek B. Sardeshmukh","submitted_at":"2014-12-07T09:29:42Z","abstract_excerpt":"This paper considers the \\textit{minimum spanning tree (MST)} problem in the Congested Clique model and presents an algorithm that runs in $O(\\log \\log \\log n)$ rounds, with high probability. Prior to this, the fastest MST algorithm in this model was a deterministic algorithm due to Lotker et al.~(SIAM J on Comp, 2005) from about a decade ago. A key step along the way to designing this MST algorithm is a \\textit{connectivity verification} algorithm that not only runs in $O(\\log \\log \\log n)$ rounds with high probability, but also has low message complexity. This allows the fast computation of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2333","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-18T02:31:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+UtmiVerf41gvrQhCA4dclfMIWQHhjC9WT+RKV6Wmvn8lX1xVoBUOEx6WPRgSzcnsEbdgqKYtFBGLAnCvM0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:26:07.374329Z"},"content_sha256":"070307395cdf1c019ded9ec38cdd7987dabf9d488bc4b472544c2de3da9b516d","schema_version":"1.0","event_id":"sha256:070307395cdf1c019ded9ec38cdd7987dabf9d488bc4b472544c2de3da9b516d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D7QJPLGJT6CSYVPDXFYPXP26OG/bundle.json","state_url":"https://pith.science/pith/D7QJPLGJT6CSYVPDXFYPXP26OG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D7QJPLGJT6CSYVPDXFYPXP26OG/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-23T00:26:07Z","links":{"resolver":"https://pith.science/pith/D7QJPLGJT6CSYVPDXFYPXP26OG","bundle":"https://pith.science/pith/D7QJPLGJT6CSYVPDXFYPXP26OG/bundle.json","state":"https://pith.science/pith/D7QJPLGJT6CSYVPDXFYPXP26OG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D7QJPLGJT6CSYVPDXFYPXP26OG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:D7QJPLGJT6CSYVPDXFYPXP26OG","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":"5042b9332fbc8bd506f1f612082d5eca903687e0484f315e5518276b841fd163","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-07T09:29:42Z","title_canon_sha256":"0b9ee6236a63c070f3d40e08292b01b0495c74255963b8cd236df85394e992dc"},"schema_version":"1.0","source":{"id":"1412.2333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2333","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2333v1","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2333","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"D7QJPLGJT6CS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D7QJPLGJT6CSYVPD","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D7QJPLGJ","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:070307395cdf1c019ded9ec38cdd7987dabf9d488bc4b472544c2de3da9b516d","target":"graph","created_at":"2026-05-18T02:31:58Z","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 considers the \\textit{minimum spanning tree (MST)} problem in the Congested Clique model and presents an algorithm that runs in $O(\\log \\log \\log n)$ rounds, with high probability. Prior to this, the fastest MST algorithm in this model was a deterministic algorithm due to Lotker et al.~(SIAM J on Comp, 2005) from about a decade ago. A key step along the way to designing this MST algorithm is a \\textit{connectivity verification} algorithm that not only runs in $O(\\log \\log \\log n)$ rounds with high probability, but also has low message complexity. This allows the fast computation of ","authors_text":"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-12-07T09:29:42Z","title":"Minimum-weight Spanning Tree Construction in $O(\\log \\log \\log n)$ Rounds on the Congested Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2333","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:ff9368fc2c07a641739877e37c7a8c088e3df0ee1093da35760548a10fb67891","target":"record","created_at":"2026-05-18T02:31:58Z","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":"5042b9332fbc8bd506f1f612082d5eca903687e0484f315e5518276b841fd163","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-07T09:29:42Z","title_canon_sha256":"0b9ee6236a63c070f3d40e08292b01b0495c74255963b8cd236df85394e992dc"},"schema_version":"1.0","source":{"id":"1412.2333","kind":"arxiv","version":1}},"canonical_sha256":"1fe097acc99f852c55e3b970fbbf5e71bce2a17f6b2c7559b85eaecdace7b24a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fe097acc99f852c55e3b970fbbf5e71bce2a17f6b2c7559b85eaecdace7b24a","first_computed_at":"2026-05-18T02:31:58.282796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:58.282796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oyZjN9/oD24DaGmT9P5lgJb/gCKPHEWEgvsTl/PYjnIb7PSa7VOwjvgILz6Wa/oszrcVIiv5LH3/QS/XMLXwCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:58.283418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff9368fc2c07a641739877e37c7a8c088e3df0ee1093da35760548a10fb67891","sha256:070307395cdf1c019ded9ec38cdd7987dabf9d488bc4b472544c2de3da9b516d"],"state_sha256":"c459488172808a603b9f579b1c74935c5e076dcff5eb968e20342b92608fcea9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9MtPQMa7Wiw5Tm+24KBmIz7NIDx/BLtCsTJ2wsV+arKP/MzLqkQKJkMcp0ZINY7LNJLpD/0hsd8s4MJpswjOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:26:07.376427Z","bundle_sha256":"895143bf6cbc9956b9b3636cc5c5304cd913095f7f613f1022a9127f1aebb0a1"}}