{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZYYMIFT2EZTOEO3SF54OFMTQGQ","short_pith_number":"pith:ZYYMIFT2","canonical_record":{"source":{"id":"2002.06762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-17T04:08:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d5e8bd0b526b8ff677546e5d474ce46a2be7a32c778a49b6de7647ffe3517c2e","abstract_canon_sha256":"d5f094b9130eb3724e4ff2e267dfe01bcd6d348ef5571c29f327b6d955cbb8b8"},"schema_version":"1.0"},"canonical_sha256":"ce30c4167a2666e23b722f78e2b2703424cead3e45b7ba5f74e142b8d8351392","source":{"kind":"arxiv","id":"2002.06762","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.06762","created_at":"2026-07-05T00:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"2002.06762v1","created_at":"2026-07-05T00:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.06762","created_at":"2026-07-05T00:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZYYMIFT2EZTO","created_at":"2026-07-05T00:41:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZYYMIFT2EZTOEO3S","created_at":"2026-07-05T00:41:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZYYMIFT2","created_at":"2026-07-05T00:41:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZYYMIFT2EZTOEO3SF54OFMTQGQ","target":"record","payload":{"canonical_record":{"source":{"id":"2002.06762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-17T04:08:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d5e8bd0b526b8ff677546e5d474ce46a2be7a32c778a49b6de7647ffe3517c2e","abstract_canon_sha256":"d5f094b9130eb3724e4ff2e267dfe01bcd6d348ef5571c29f327b6d955cbb8b8"},"schema_version":"1.0"},"canonical_sha256":"ce30c4167a2666e23b722f78e2b2703424cead3e45b7ba5f74e142b8d8351392","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:41:09.043641Z","signature_b64":"BCOqZdTGwvPDYUDQCUeLxZOBRrikjCq5+oLBhUge4UJE0O49FfeYbaHDs/63ZFEMBtG/CS7X3/DqDP/JFRNsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce30c4167a2666e23b722f78e2b2703424cead3e45b7ba5f74e142b8d8351392","last_reissued_at":"2026-07-05T00:41:09.043295Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:41:09.043295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.06762","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-07-05T00:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BPEAue6bkCuvN7vUt25pPfbf3UCaO6WN2JVcggLpota7e89QWZnHbLvPUYlxxVfaifcnSmG10lNa6mIHdgWOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:02:40.734035Z"},"content_sha256":"a3cc6f1deef82ef5e103dd08bbdf10af0094cc52f505cebbdd85f8672279bf70","schema_version":"1.0","event_id":"sha256:a3cc6f1deef82ef5e103dd08bbdf10af0094cc52f505cebbdd85f8672279bf70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZYYMIFT2EZTOEO3SF54OFMTQGQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How fast can you update your MST? (Dynamic algorithms for cluster computing)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Lawrence Li, Seth Gilbert","submitted_at":"2020-02-17T04:08:14Z","abstract_excerpt":"Imagine a large graph that is being processed by a cluster of computers, e.g., described by the $k$-machine model or the Massively Parallel Computation Model. The graph, however, is not static; instead it is receiving a constant stream of updates. How fast can the cluster process the stream of updates? The fundamental question we want to ask in this paper is whether we can update the graph fast enough to keep up with the stream. We focus specifically on the problem of maintaining a minimum spanning tree (MST), and we give an algorithm for the $k$-machine model that can process $O(k)$ graph upd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.06762","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.06762/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VN1+WjVsFqhUCcZ1GnShQaOpJlW0qI2a511LEqViMdlNVTicml+4UDlbHqJuo5ZDJSuEdfsO43Nem5nEC7MVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:02:40.734460Z"},"content_sha256":"4904542b46410417f926d2c283964668be2500d5cb05aecf3b56fd8fbef0495d","schema_version":"1.0","event_id":"sha256:4904542b46410417f926d2c283964668be2500d5cb05aecf3b56fd8fbef0495d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYYMIFT2EZTOEO3SF54OFMTQGQ/bundle.json","state_url":"https://pith.science/pith/ZYYMIFT2EZTOEO3SF54OFMTQGQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYYMIFT2EZTOEO3SF54OFMTQGQ/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-07-06T10:02:40Z","links":{"resolver":"https://pith.science/pith/ZYYMIFT2EZTOEO3SF54OFMTQGQ","bundle":"https://pith.science/pith/ZYYMIFT2EZTOEO3SF54OFMTQGQ/bundle.json","state":"https://pith.science/pith/ZYYMIFT2EZTOEO3SF54OFMTQGQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYYMIFT2EZTOEO3SF54OFMTQGQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZYYMIFT2EZTOEO3SF54OFMTQGQ","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":"d5f094b9130eb3724e4ff2e267dfe01bcd6d348ef5571c29f327b6d955cbb8b8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-17T04:08:14Z","title_canon_sha256":"d5e8bd0b526b8ff677546e5d474ce46a2be7a32c778a49b6de7647ffe3517c2e"},"schema_version":"1.0","source":{"id":"2002.06762","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.06762","created_at":"2026-07-05T00:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"2002.06762v1","created_at":"2026-07-05T00:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.06762","created_at":"2026-07-05T00:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZYYMIFT2EZTO","created_at":"2026-07-05T00:41:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZYYMIFT2EZTOEO3S","created_at":"2026-07-05T00:41:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZYYMIFT2","created_at":"2026-07-05T00:41:09Z"}],"graph_snapshots":[{"event_id":"sha256:4904542b46410417f926d2c283964668be2500d5cb05aecf3b56fd8fbef0495d","target":"graph","created_at":"2026-07-05T00:41:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.06762/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Imagine a large graph that is being processed by a cluster of computers, e.g., described by the $k$-machine model or the Massively Parallel Computation Model. The graph, however, is not static; instead it is receiving a constant stream of updates. How fast can the cluster process the stream of updates? The fundamental question we want to ask in this paper is whether we can update the graph fast enough to keep up with the stream. We focus specifically on the problem of maintaining a minimum spanning tree (MST), and we give an algorithm for the $k$-machine model that can process $O(k)$ graph upd","authors_text":"Lawrence Li, Seth Gilbert","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-17T04:08:14Z","title":"How fast can you update your MST? (Dynamic algorithms for cluster computing)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.06762","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:a3cc6f1deef82ef5e103dd08bbdf10af0094cc52f505cebbdd85f8672279bf70","target":"record","created_at":"2026-07-05T00:41:09Z","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":"d5f094b9130eb3724e4ff2e267dfe01bcd6d348ef5571c29f327b6d955cbb8b8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-17T04:08:14Z","title_canon_sha256":"d5e8bd0b526b8ff677546e5d474ce46a2be7a32c778a49b6de7647ffe3517c2e"},"schema_version":"1.0","source":{"id":"2002.06762","kind":"arxiv","version":1}},"canonical_sha256":"ce30c4167a2666e23b722f78e2b2703424cead3e45b7ba5f74e142b8d8351392","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce30c4167a2666e23b722f78e2b2703424cead3e45b7ba5f74e142b8d8351392","first_computed_at":"2026-07-05T00:41:09.043295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:41:09.043295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BCOqZdTGwvPDYUDQCUeLxZOBRrikjCq5+oLBhUge4UJE0O49FfeYbaHDs/63ZFEMBtG/CS7X3/DqDP/JFRNsAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:41:09.043641Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.06762","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3cc6f1deef82ef5e103dd08bbdf10af0094cc52f505cebbdd85f8672279bf70","sha256:4904542b46410417f926d2c283964668be2500d5cb05aecf3b56fd8fbef0495d"],"state_sha256":"542dfaf23f41b9c844252108ea427de903c0d9e763db99d4a728ebf508b3be7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCyJzXjyNxmMKLmtZzdF0u2y/ZUPFgTMng/jLC1uCDxssIZSsDuABaOFPrlhKezS9QXisPa7E7RgJPMQTKeXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T10:02:40.736412Z","bundle_sha256":"cb87247b573f90b97e3a66e40a31af5e2f9a55b829c8a6e2c81675405a079eff"}}