{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:L7ALIT55NXG3HYGO7GXS5M3OVC","short_pith_number":"pith:L7ALIT55","schema_version":"1.0","canonical_sha256":"5fc0b44fbd6dcdb3e0cef9af2eb36ea8ab8bce822aac80487b11644338526928","source":{"kind":"arxiv","id":"2605.27691","version":1},"attestation_state":"computed","paper":{"title":"SOLANET: Distributed Neighbor Graph Construction on GPU-Accelerated Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Benjamin W. Priest, Geoffrey Sanders, Grace J. Li, Keita Iwabuchi, Roger Pearce, Trevor Steil","submitted_at":"2026-05-26T21:13:00Z","abstract_excerpt":"Neighbor graphs capture relationships among data points and are widely used in data analytics and AI workloads. Many studies have explored approximate construction methods for single-node systems, including GPUs. However, extending this to distributed systems for larger data and further acceleration remains challenging due to irregular computation patterns.\n  We present SOLANET, a GPU-accelerated distributed neighbor graph construction toolkit. SOLANET first constructs local graphs on each GPU after data partitioning and then refines them via approximate nearest neighbor (ANN) searches over re"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.27691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-26T21:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"f5970854245c11fc8df208af8344dc5b2eed31a70fde7c8798ad40a5a7d869d9","abstract_canon_sha256":"d1690737fca0b70f442a772cc2ac9d5690c9e9a2a13893581cbc1fd5bdea2e0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:46.344937Z","signature_b64":"J54aPhIWCxyzN4E36Dl5o/8+1JVZJYlyH0cvwSfLDS8ldIo+rbvynu+TYArigV0eBbozSH3SyViRl3kJo/jiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fc0b44fbd6dcdb3e0cef9af2eb36ea8ab8bce822aac80487b11644338526928","last_reissued_at":"2026-05-28T01:04:46.344529Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:46.344529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SOLANET: Distributed Neighbor Graph Construction on GPU-Accelerated Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Benjamin W. Priest, Geoffrey Sanders, Grace J. Li, Keita Iwabuchi, Roger Pearce, Trevor Steil","submitted_at":"2026-05-26T21:13:00Z","abstract_excerpt":"Neighbor graphs capture relationships among data points and are widely used in data analytics and AI workloads. Many studies have explored approximate construction methods for single-node systems, including GPUs. However, extending this to distributed systems for larger data and further acceleration remains challenging due to irregular computation patterns.\n  We present SOLANET, a GPU-accelerated distributed neighbor graph construction toolkit. SOLANET first constructs local graphs on each GPU after data partitioning and then refines them via approximate nearest neighbor (ANN) searches over re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27691","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/2605.27691/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.27691","created_at":"2026-05-28T01:04:46.344589+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27691v1","created_at":"2026-05-28T01:04:46.344589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27691","created_at":"2026-05-28T01:04:46.344589+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7ALIT55NXG3","created_at":"2026-05-28T01:04:46.344589+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7ALIT55NXG3HYGO","created_at":"2026-05-28T01:04:46.344589+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7ALIT55","created_at":"2026-05-28T01:04:46.344589+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L7ALIT55NXG3HYGO7GXS5M3OVC","json":"https://pith.science/pith/L7ALIT55NXG3HYGO7GXS5M3OVC.json","graph_json":"https://pith.science/api/pith-number/L7ALIT55NXG3HYGO7GXS5M3OVC/graph.json","events_json":"https://pith.science/api/pith-number/L7ALIT55NXG3HYGO7GXS5M3OVC/events.json","paper":"https://pith.science/paper/L7ALIT55"},"agent_actions":{"view_html":"https://pith.science/pith/L7ALIT55NXG3HYGO7GXS5M3OVC","download_json":"https://pith.science/pith/L7ALIT55NXG3HYGO7GXS5M3OVC.json","view_paper":"https://pith.science/paper/L7ALIT55","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27691&json=true","fetch_graph":"https://pith.science/api/pith-number/L7ALIT55NXG3HYGO7GXS5M3OVC/graph.json","fetch_events":"https://pith.science/api/pith-number/L7ALIT55NXG3HYGO7GXS5M3OVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7ALIT55NXG3HYGO7GXS5M3OVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7ALIT55NXG3HYGO7GXS5M3OVC/action/storage_attestation","attest_author":"https://pith.science/pith/L7ALIT55NXG3HYGO7GXS5M3OVC/action/author_attestation","sign_citation":"https://pith.science/pith/L7ALIT55NXG3HYGO7GXS5M3OVC/action/citation_signature","submit_replication":"https://pith.science/pith/L7ALIT55NXG3HYGO7GXS5M3OVC/action/replication_record"}},"created_at":"2026-05-28T01:04:46.344589+00:00","updated_at":"2026-05-28T01:04:46.344589+00:00"}