{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:3EH42HLHQDWYOO457OVT6FEEBB","short_pith_number":"pith:3EH42HLH","canonical_record":{"source":{"id":"2207.00514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-07-01T15:55:58Z","cross_cats_sorted":[],"title_canon_sha256":"7614ff0d9e114406854dcc84f566b855ef7e5263656dc06bb144f7102c419768","abstract_canon_sha256":"cad358c573fdf5acea8b8ae0c166bd092146059b92542ca7798f2d6d9bb6449a"},"schema_version":"1.0"},"canonical_sha256":"d90fcd1d6780ed873b9dfbab3f14840864c61b96117caf0db7fa865682e05b08","source":{"kind":"arxiv","id":"2207.00514","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.00514","created_at":"2026-07-05T06:48:31Z"},{"alias_kind":"arxiv_version","alias_value":"2207.00514v1","created_at":"2026-07-05T06:48:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.00514","created_at":"2026-07-05T06:48:31Z"},{"alias_kind":"pith_short_12","alias_value":"3EH42HLHQDWY","created_at":"2026-07-05T06:48:31Z"},{"alias_kind":"pith_short_16","alias_value":"3EH42HLHQDWYOO45","created_at":"2026-07-05T06:48:31Z"},{"alias_kind":"pith_short_8","alias_value":"3EH42HLH","created_at":"2026-07-05T06:48:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:3EH42HLHQDWYOO457OVT6FEEBB","target":"record","payload":{"canonical_record":{"source":{"id":"2207.00514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-07-01T15:55:58Z","cross_cats_sorted":[],"title_canon_sha256":"7614ff0d9e114406854dcc84f566b855ef7e5263656dc06bb144f7102c419768","abstract_canon_sha256":"cad358c573fdf5acea8b8ae0c166bd092146059b92542ca7798f2d6d9bb6449a"},"schema_version":"1.0"},"canonical_sha256":"d90fcd1d6780ed873b9dfbab3f14840864c61b96117caf0db7fa865682e05b08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:48:31.194203Z","signature_b64":"Gpy2IE7H+OMB+Zc8hMfek3DlucZTHxZ8edeAesHyaNvtfi24A9mbKHjWJjxhQZZUG+dgHgJvwYTSUiTyv9f5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d90fcd1d6780ed873b9dfbab3f14840864c61b96117caf0db7fa865682e05b08","last_reissued_at":"2026-07-05T06:48:31.193726Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:48:31.193726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.00514","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:48:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oSedw/iU8JS0riZBm+PHCNQvIPWKGHVlpJEoA8y+obJBwlx0HTkeSR15hiM+y4UhxJJrXuogWHgRNQ+4tZUtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T10:23:43.290432Z"},"content_sha256":"6e572f4a78285aa88e667fae259d721c927b7b7413c7ecf4add41260fd972481","schema_version":"1.0","event_id":"sha256:6e572f4a78285aa88e667fae259d721c927b7b7413c7ecf4add41260fd972481"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:3EH42HLHQDWYOO457OVT6FEEBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrey Prokopenko, Damien Lebrun-Grandi\\'e, Piyush Sao","submitted_at":"2022-07-01T15:55:58Z","abstract_excerpt":"Computing the Euclidean minimum spanning tree (EMST) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing EMST are known, designing an efficient GPU algorithm is challenging due to a complex branching structure, data dependencies, and load imbalances. In this paper, we propose a single-tree Bor\\r{u}vka-based algorithm for computing EMST on GPUs. We use an efficient nearest neighbor algorithm and reduce the number of the required distance calculations by avoiding traversing subtrees with leaf nodes in the same component. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.00514","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/2207.00514/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:48:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pftnKKrss6G8PeK0npk7bpUDlbkasWjYmDaoOD5oMwjvr16WoFfM2QGWhJDxiEs+g/q+vau/HCddxroNBbtsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T10:23:43.290992Z"},"content_sha256":"eedb642fd516bca2e36eccb77e8f5f2be61ac12f2d4d93926f4cc64650ba5d54","schema_version":"1.0","event_id":"sha256:eedb642fd516bca2e36eccb77e8f5f2be61ac12f2d4d93926f4cc64650ba5d54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3EH42HLHQDWYOO457OVT6FEEBB/bundle.json","state_url":"https://pith.science/pith/3EH42HLHQDWYOO457OVT6FEEBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3EH42HLHQDWYOO457OVT6FEEBB/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-21T10:23:43Z","links":{"resolver":"https://pith.science/pith/3EH42HLHQDWYOO457OVT6FEEBB","bundle":"https://pith.science/pith/3EH42HLHQDWYOO457OVT6FEEBB/bundle.json","state":"https://pith.science/pith/3EH42HLHQDWYOO457OVT6FEEBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3EH42HLHQDWYOO457OVT6FEEBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3EH42HLHQDWYOO457OVT6FEEBB","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":"cad358c573fdf5acea8b8ae0c166bd092146059b92542ca7798f2d6d9bb6449a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-07-01T15:55:58Z","title_canon_sha256":"7614ff0d9e114406854dcc84f566b855ef7e5263656dc06bb144f7102c419768"},"schema_version":"1.0","source":{"id":"2207.00514","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.00514","created_at":"2026-07-05T06:48:31Z"},{"alias_kind":"arxiv_version","alias_value":"2207.00514v1","created_at":"2026-07-05T06:48:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.00514","created_at":"2026-07-05T06:48:31Z"},{"alias_kind":"pith_short_12","alias_value":"3EH42HLHQDWY","created_at":"2026-07-05T06:48:31Z"},{"alias_kind":"pith_short_16","alias_value":"3EH42HLHQDWYOO45","created_at":"2026-07-05T06:48:31Z"},{"alias_kind":"pith_short_8","alias_value":"3EH42HLH","created_at":"2026-07-05T06:48:31Z"}],"graph_snapshots":[{"event_id":"sha256:eedb642fd516bca2e36eccb77e8f5f2be61ac12f2d4d93926f4cc64650ba5d54","target":"graph","created_at":"2026-07-05T06:48:31Z","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/2207.00514/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Computing the Euclidean minimum spanning tree (EMST) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing EMST are known, designing an efficient GPU algorithm is challenging due to a complex branching structure, data dependencies, and load imbalances. In this paper, we propose a single-tree Bor\\r{u}vka-based algorithm for computing EMST on GPUs. We use an efficient nearest neighbor algorithm and reduce the number of the required distance calculations by avoiding traversing subtrees with leaf nodes in the same component. ","authors_text":"Andrey Prokopenko, Damien Lebrun-Grandi\\'e, Piyush Sao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-07-01T15:55:58Z","title":"A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.00514","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:6e572f4a78285aa88e667fae259d721c927b7b7413c7ecf4add41260fd972481","target":"record","created_at":"2026-07-05T06:48:31Z","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":"cad358c573fdf5acea8b8ae0c166bd092146059b92542ca7798f2d6d9bb6449a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-07-01T15:55:58Z","title_canon_sha256":"7614ff0d9e114406854dcc84f566b855ef7e5263656dc06bb144f7102c419768"},"schema_version":"1.0","source":{"id":"2207.00514","kind":"arxiv","version":1}},"canonical_sha256":"d90fcd1d6780ed873b9dfbab3f14840864c61b96117caf0db7fa865682e05b08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d90fcd1d6780ed873b9dfbab3f14840864c61b96117caf0db7fa865682e05b08","first_computed_at":"2026-07-05T06:48:31.193726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:48:31.193726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gpy2IE7H+OMB+Zc8hMfek3DlucZTHxZ8edeAesHyaNvtfi24A9mbKHjWJjxhQZZUG+dgHgJvwYTSUiTyv9f5BA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:48:31.194203Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.00514","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e572f4a78285aa88e667fae259d721c927b7b7413c7ecf4add41260fd972481","sha256:eedb642fd516bca2e36eccb77e8f5f2be61ac12f2d4d93926f4cc64650ba5d54"],"state_sha256":"b290688dbd15bb764df3837e0cb5377b62131fd782cb1acada6f8440edad50b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J83nemfq1tY/zJ35Zl7FBk6CjR234W1gqwlm/gz2o94tiCPjiuUyj64UM/rKEEJqZiEpm0yxVW7XM9HEmK4uCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T10:23:43.295151Z","bundle_sha256":"2370dba6640caadabfdb813d59e8cfdf2eaa5e304dffe6f39b5f9155a1325a6e"}}