{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:JJR7JG7EJU5H4QC3BDGWBXGAWU","short_pith_number":"pith:JJR7JG7E","canonical_record":{"source":{"id":"2308.00503","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-01T12:36:58Z","cross_cats_sorted":[],"title_canon_sha256":"8d7286bef78b3a2edf95250c2a52515f3f558db077e918418b52110aea907ef4","abstract_canon_sha256":"690989cb8ff21452be1ca2e395ecfbfb90028e301e5a0bf24f2a96b4b6a63149"},"schema_version":"1.0"},"canonical_sha256":"4a63f49be44d3a7e405b08cd60dcc0b539d28ab1749c894ea0cc62c245590b3c","source":{"kind":"arxiv","id":"2308.00503","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.00503","created_at":"2026-07-05T06:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"2308.00503v1","created_at":"2026-07-05T06:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.00503","created_at":"2026-07-05T06:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"JJR7JG7EJU5H","created_at":"2026-07-05T06:36:48Z"},{"alias_kind":"pith_short_16","alias_value":"JJR7JG7EJU5H4QC3","created_at":"2026-07-05T06:36:48Z"},{"alias_kind":"pith_short_8","alias_value":"JJR7JG7E","created_at":"2026-07-05T06:36:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:JJR7JG7EJU5H4QC3BDGWBXGAWU","target":"record","payload":{"canonical_record":{"source":{"id":"2308.00503","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-01T12:36:58Z","cross_cats_sorted":[],"title_canon_sha256":"8d7286bef78b3a2edf95250c2a52515f3f558db077e918418b52110aea907ef4","abstract_canon_sha256":"690989cb8ff21452be1ca2e395ecfbfb90028e301e5a0bf24f2a96b4b6a63149"},"schema_version":"1.0"},"canonical_sha256":"4a63f49be44d3a7e405b08cd60dcc0b539d28ab1749c894ea0cc62c245590b3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:36:48.361195Z","signature_b64":"YFIgpc+yw7bdSKk6zLRYMGN6LlYrDN3HEoGuAPBes0a5DpZDyBfBJd+aoBUSCwy4wB2fL/h/Dop5N6SLWSU0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a63f49be44d3a7e405b08cd60dcc0b539d28ab1749c894ea0cc62c245590b3c","last_reissued_at":"2026-07-05T06:36:48.360792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:36:48.360792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.00503","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-05T06:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RF2cc2K3HeGNb7QBvzOzjyN2N7iunf3jPZ4gaIdj7fUZ03cqV992XwVGTKYNiUOSWQTHvAB0hjBISDJsbq0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T11:40:58.536848Z"},"content_sha256":"dfa609903fd1888afe0a4b394d192db998f2e47571deb2866a6c6137ba983d27","schema_version":"1.0","event_id":"sha256:dfa609903fd1888afe0a4b394d192db998f2e47571deb2866a6c6137ba983d27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:JJR7JG7EJU5H4QC3BDGWBXGAWU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Peilin Zhong, Rajesh Jayaram, Shyam Narayanan, Vahab Mirrokni","submitted_at":"2023-08-01T12:36:58Z","abstract_excerpt":"We study the classic Euclidean Minimum Spanning Tree (MST) problem in the Massively Parallel Computation (MPC) model. Given a set $X \\subset \\mathbb{R}^d$ of $n$ points, the goal is to produce a spanning tree for $X$ with weight within a small factor of optimal. Euclidean MST is one of the most fundamental hierarchical geometric clustering algorithms, and with the proliferation of enormous high-dimensional data sets, such as massive transformer-based embeddings, there is now a critical demand for efficient distributed algorithms to cluster such data sets.\n  In low-dimensional space, where $d ="},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.00503","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/2308.00503/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-05T06:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ABABOhVJk06wUe58hR07ktSKGxJhAo0I3bQIzvMBYDUlEKWLySIHDWuQBBgNetRBB8KZyYI79wKPM++h2WmmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T11:40:58.537340Z"},"content_sha256":"17b09281010df6565fa0bb7e191f7ca3600e01c46f29dd3d83e980d1e0731e6a","schema_version":"1.0","event_id":"sha256:17b09281010df6565fa0bb7e191f7ca3600e01c46f29dd3d83e980d1e0731e6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJR7JG7EJU5H4QC3BDGWBXGAWU/bundle.json","state_url":"https://pith.science/pith/JJR7JG7EJU5H4QC3BDGWBXGAWU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJR7JG7EJU5H4QC3BDGWBXGAWU/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-08-21T11:40:58Z","links":{"resolver":"https://pith.science/pith/JJR7JG7EJU5H4QC3BDGWBXGAWU","bundle":"https://pith.science/pith/JJR7JG7EJU5H4QC3BDGWBXGAWU/bundle.json","state":"https://pith.science/pith/JJR7JG7EJU5H4QC3BDGWBXGAWU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJR7JG7EJU5H4QC3BDGWBXGAWU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JJR7JG7EJU5H4QC3BDGWBXGAWU","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":"690989cb8ff21452be1ca2e395ecfbfb90028e301e5a0bf24f2a96b4b6a63149","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-01T12:36:58Z","title_canon_sha256":"8d7286bef78b3a2edf95250c2a52515f3f558db077e918418b52110aea907ef4"},"schema_version":"1.0","source":{"id":"2308.00503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.00503","created_at":"2026-07-05T06:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"2308.00503v1","created_at":"2026-07-05T06:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.00503","created_at":"2026-07-05T06:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"JJR7JG7EJU5H","created_at":"2026-07-05T06:36:48Z"},{"alias_kind":"pith_short_16","alias_value":"JJR7JG7EJU5H4QC3","created_at":"2026-07-05T06:36:48Z"},{"alias_kind":"pith_short_8","alias_value":"JJR7JG7E","created_at":"2026-07-05T06:36:48Z"}],"graph_snapshots":[{"event_id":"sha256:17b09281010df6565fa0bb7e191f7ca3600e01c46f29dd3d83e980d1e0731e6a","target":"graph","created_at":"2026-07-05T06:36:48Z","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/2308.00503/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the classic Euclidean Minimum Spanning Tree (MST) problem in the Massively Parallel Computation (MPC) model. Given a set $X \\subset \\mathbb{R}^d$ of $n$ points, the goal is to produce a spanning tree for $X$ with weight within a small factor of optimal. Euclidean MST is one of the most fundamental hierarchical geometric clustering algorithms, and with the proliferation of enormous high-dimensional data sets, such as massive transformer-based embeddings, there is now a critical demand for efficient distributed algorithms to cluster such data sets.\n  In low-dimensional space, where $d =","authors_text":"Peilin Zhong, Rajesh Jayaram, Shyam Narayanan, Vahab Mirrokni","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-01T12:36:58Z","title":"Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.00503","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:dfa609903fd1888afe0a4b394d192db998f2e47571deb2866a6c6137ba983d27","target":"record","created_at":"2026-07-05T06:36:48Z","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":"690989cb8ff21452be1ca2e395ecfbfb90028e301e5a0bf24f2a96b4b6a63149","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-01T12:36:58Z","title_canon_sha256":"8d7286bef78b3a2edf95250c2a52515f3f558db077e918418b52110aea907ef4"},"schema_version":"1.0","source":{"id":"2308.00503","kind":"arxiv","version":1}},"canonical_sha256":"4a63f49be44d3a7e405b08cd60dcc0b539d28ab1749c894ea0cc62c245590b3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a63f49be44d3a7e405b08cd60dcc0b539d28ab1749c894ea0cc62c245590b3c","first_computed_at":"2026-07-05T06:36:48.360792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:36:48.360792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YFIgpc+yw7bdSKk6zLRYMGN6LlYrDN3HEoGuAPBes0a5DpZDyBfBJd+aoBUSCwy4wB2fL/h/Dop5N6SLWSU0Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:36:48.361195Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.00503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfa609903fd1888afe0a4b394d192db998f2e47571deb2866a6c6137ba983d27","sha256:17b09281010df6565fa0bb7e191f7ca3600e01c46f29dd3d83e980d1e0731e6a"],"state_sha256":"dba3ed8f20d10777f0d8719ec6166cc4f4d9219bb2ebf21d0bce3f2d9ed923d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5IUbB/Ed6Ovl3fQglHMYoL/DGuyRCc/V9pj++kIQkYnAmjZvjG8l6rVUJZ2f2S983bbt5sVnEehHRnlcQZFrDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T11:40:58.541700Z","bundle_sha256":"45e6c75fb4a0460cc3a171903998c4c23f5525b13bb543dfa9d2c7856310a2b9"}}