{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5CCEHQL4Q6EWF3TGXN2YN7TZGX","short_pith_number":"pith:5CCEHQL4","canonical_record":{"source":{"id":"1610.03897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-12T23:10:04Z","cross_cats_sorted":[],"title_canon_sha256":"40d480ba91686598d2d37dbbf756f91ec563bab369a126de939bce2cf6986732","abstract_canon_sha256":"88a32ebf1a63a77637ae1914022e8d1eb69a100acd7523ed959c2bf6ac111130"},"schema_version":"1.0"},"canonical_sha256":"e88443c17c878962ee66bb7586fe7935eb9fff53bbf80bc2c97da81c7d6da08d","source":{"kind":"arxiv","id":"1610.03897","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03897","created_at":"2026-05-18T01:01:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03897v2","created_at":"2026-05-18T01:01:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03897","created_at":"2026-05-18T01:01:59Z"},{"alias_kind":"pith_short_12","alias_value":"5CCEHQL4Q6EW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5CCEHQL4Q6EWF3TG","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5CCEHQL4","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5CCEHQL4Q6EWF3TGXN2YN7TZGX","target":"record","payload":{"canonical_record":{"source":{"id":"1610.03897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-12T23:10:04Z","cross_cats_sorted":[],"title_canon_sha256":"40d480ba91686598d2d37dbbf756f91ec563bab369a126de939bce2cf6986732","abstract_canon_sha256":"88a32ebf1a63a77637ae1914022e8d1eb69a100acd7523ed959c2bf6ac111130"},"schema_version":"1.0"},"canonical_sha256":"e88443c17c878962ee66bb7586fe7935eb9fff53bbf80bc2c97da81c7d6da08d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:59.726599Z","signature_b64":"HU9Lb40m7RobqzXLsVBygYf5DHr4gRdAcWzgp8+lyhiaIbcdYfH5Kcc7ZQ8GOdV4XdqWE8UEkVYeQDlAVZ3hCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e88443c17c878962ee66bb7586fe7935eb9fff53bbf80bc2c97da81c7d6da08d","last_reissued_at":"2026-05-18T01:01:59.726111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:59.726111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.03897","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-18T01:01:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZxlzpOwH1lTRmZ6ngL3xIyEa13uADlmy5GPrWv0MgpgTX6Db8Wops8ehXzuIAw/rqgrIackyoKa4Tk2UZgOXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:40:52.866165Z"},"content_sha256":"c555d3eb4c94cbc6509fbb11efe32c3810a669ca13d65efead4cd1f582a2efdd","schema_version":"1.0","event_id":"sha256:c555d3eb4c94cbc6509fbb11efe32c3810a669ca13d65efead4cd1f582a2efdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5CCEHQL4Q6EWF3TGXN2YN7TZGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Super-fast MST Algorithms in the Congested Clique using $o(m)$ Messages","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":"2016-10-12T23:10:04Z","abstract_excerpt":"In a sequence of recent results (PODC 2015 and PODC 2016), the running time of the fastest algorithm for the \\emph{minimum spanning tree (MST)} problem in the \\emph{Congested Clique} model was first improved to $O(\\log \\log \\log n)$ from $O(\\log \\log n)$ (Hegeman et al., PODC 2015) and then to $O(\\log^* n)$ (Ghaffari and Parter, PODC 2016). All of these algorithms use $\\Theta(n^2)$ messages independent of the number of edges in the input graph.\n  This paper positively answers a question raised in Hegeman et al., and presents the first \"super-fast\" MST algorithm with $o(m)$ message complexity f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03897","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-18T01:01:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2rrFhlrHKhizaoNz43bKEBol2nepU46LQDk/hnxRJH+YkCetWZ+mqmz5DU2teIJ29WQmyiePjmsPmkbvXi0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:40:52.866529Z"},"content_sha256":"a65d8db880699eb657a5cb5eee310bc35182cbdc26d65967ba92a8f0cedb05fc","schema_version":"1.0","event_id":"sha256:a65d8db880699eb657a5cb5eee310bc35182cbdc26d65967ba92a8f0cedb05fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX/bundle.json","state_url":"https://pith.science/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX/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-22T20:40:52Z","links":{"resolver":"https://pith.science/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX","bundle":"https://pith.science/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX/bundle.json","state":"https://pith.science/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5CCEHQL4Q6EWF3TGXN2YN7TZGX","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":"88a32ebf1a63a77637ae1914022e8d1eb69a100acd7523ed959c2bf6ac111130","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-12T23:10:04Z","title_canon_sha256":"40d480ba91686598d2d37dbbf756f91ec563bab369a126de939bce2cf6986732"},"schema_version":"1.0","source":{"id":"1610.03897","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03897","created_at":"2026-05-18T01:01:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03897v2","created_at":"2026-05-18T01:01:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03897","created_at":"2026-05-18T01:01:59Z"},{"alias_kind":"pith_short_12","alias_value":"5CCEHQL4Q6EW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5CCEHQL4Q6EWF3TG","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5CCEHQL4","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:a65d8db880699eb657a5cb5eee310bc35182cbdc26d65967ba92a8f0cedb05fc","target":"graph","created_at":"2026-05-18T01:01:59Z","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":"In a sequence of recent results (PODC 2015 and PODC 2016), the running time of the fastest algorithm for the \\emph{minimum spanning tree (MST)} problem in the \\emph{Congested Clique} model was first improved to $O(\\log \\log \\log n)$ from $O(\\log \\log n)$ (Hegeman et al., PODC 2015) and then to $O(\\log^* n)$ (Ghaffari and Parter, PODC 2016). All of these algorithms use $\\Theta(n^2)$ messages independent of the number of edges in the input graph.\n  This paper positively answers a question raised in Hegeman et al., and presents the first \"super-fast\" MST algorithm with $o(m)$ message complexity f","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":"2016-10-12T23:10:04Z","title":"Super-fast MST Algorithms in the Congested Clique using $o(m)$ Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03897","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:c555d3eb4c94cbc6509fbb11efe32c3810a669ca13d65efead4cd1f582a2efdd","target":"record","created_at":"2026-05-18T01:01:59Z","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":"88a32ebf1a63a77637ae1914022e8d1eb69a100acd7523ed959c2bf6ac111130","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-12T23:10:04Z","title_canon_sha256":"40d480ba91686598d2d37dbbf756f91ec563bab369a126de939bce2cf6986732"},"schema_version":"1.0","source":{"id":"1610.03897","kind":"arxiv","version":2}},"canonical_sha256":"e88443c17c878962ee66bb7586fe7935eb9fff53bbf80bc2c97da81c7d6da08d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e88443c17c878962ee66bb7586fe7935eb9fff53bbf80bc2c97da81c7d6da08d","first_computed_at":"2026-05-18T01:01:59.726111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:59.726111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HU9Lb40m7RobqzXLsVBygYf5DHr4gRdAcWzgp8+lyhiaIbcdYfH5Kcc7ZQ8GOdV4XdqWE8UEkVYeQDlAVZ3hCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:59.726599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03897","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c555d3eb4c94cbc6509fbb11efe32c3810a669ca13d65efead4cd1f582a2efdd","sha256:a65d8db880699eb657a5cb5eee310bc35182cbdc26d65967ba92a8f0cedb05fc"],"state_sha256":"ddf7a3318a91fb319d345177e92450d5494ca207f4e0ad106fbf2201e11dbdde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"meaUm85r9EkkTDxyRtOkVE/ukRWSk2xxDUe7b8oracHyFoVRDAtxnptTHp75a9odFNice28LHwy8P8ip+ApXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T20:40:52.868573Z","bundle_sha256":"84d2db391169e9991776348095d86560bc140110a954dbd0218b7b857b2eb19a"}}