{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2PVINO55E6LK67DH2YVME4I3MX","short_pith_number":"pith:2PVINO55","canonical_record":{"source":{"id":"1309.5478","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2013-09-21T14:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"2e9e6f3cbd1fbef9e68460da4cc123df30a737cea402f24c9afd72ae45bf8b2a","abstract_canon_sha256":"6f6779ea4b500ca26f26b7c56124a5c537a59d54fc2e519b931d572df6c6ca63"},"schema_version":"1.0"},"canonical_sha256":"d3ea86bbbd2796af7c67d62ac2711b65c25257ca6e9bf4dd411fc9a5fa6f81fe","source":{"kind":"arxiv","id":"1309.5478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5478","created_at":"2026-05-18T01:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5478v1","created_at":"2026-05-18T01:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5478","created_at":"2026-05-18T01:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"2PVINO55E6LK","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2PVINO55E6LK67DH","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2PVINO55","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2PVINO55E6LK67DH2YVME4I3MX","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5478","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2013-09-21T14:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"2e9e6f3cbd1fbef9e68460da4cc123df30a737cea402f24c9afd72ae45bf8b2a","abstract_canon_sha256":"6f6779ea4b500ca26f26b7c56124a5c537a59d54fc2e519b931d572df6c6ca63"},"schema_version":"1.0"},"canonical_sha256":"d3ea86bbbd2796af7c67d62ac2711b65c25257ca6e9bf4dd411fc9a5fa6f81fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:47:34.668715Z","signature_b64":"jnaXwL287gBe5jswu4Dq/PJSYer8Wro1bmAUMeZXu7e0X/FMueLyASgka4DUS2ZSFn0sXOX59PnMRApKa4jDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3ea86bbbd2796af7c67d62ac2711b65c25257ca6e9bf4dd411fc9a5fa6f81fe","last_reissued_at":"2026-05-18T01:47:34.668149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:47:34.668149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5478","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-05-18T01:47:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IojrlIZrHZDPCZ7gCrcTrIxw8of1vdnaSX885NeL8UahvZyoHJYQhJsqt7THdlAFThtWTD5HgY4G6oNt3+kIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:37:49.819884Z"},"content_sha256":"86f79e271fe596564a0fa1ce5865827b055f4a1240a8a80c095e1b8a1e54dc96","schema_version":"1.0","event_id":"sha256:86f79e271fe596564a0fa1ce5865827b055f4a1240a8a80c095e1b8a1e54dc96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2PVINO55E6LK67DH2YVME4I3MX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast $k$-NNG construction with GPU-based quick multi-select","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ali Dashti, Ivan Komarov, Roshan D'Souza","submitted_at":"2013-09-21T14:00:32Z","abstract_excerpt":"In this paper we describe a new brute force algorithm for building the $k$-Nearest Neighbor Graph ($k$-NNG). The $k$-NNG algorithm has many applications in areas such as machine learning, bio-informatics, and clustering analysis. While there are very efficient algorithms for data of low dimensions, for high dimensional data the brute force search is the best algorithm. There are two main parts to the algorithm: the first part is finding the distances between the input vectors which may be formulated as a matrix multiplication problem. The second is the selection of the $k$-NNs for each of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5478","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":""},"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:47:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1bgxuGhW/1Zp/AWpQTnHIBCZsgbb0RRUcH9RLFiOHWKkwKFLib8TcCfFR+8GIbst/zTH5sGx3lwsT+hPIWvfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:37:49.820227Z"},"content_sha256":"085fdcdb3b871b4bed6116d38392b295ebc3065d73bb1cc201df3193f7146719","schema_version":"1.0","event_id":"sha256:085fdcdb3b871b4bed6116d38392b295ebc3065d73bb1cc201df3193f7146719"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PVINO55E6LK67DH2YVME4I3MX/bundle.json","state_url":"https://pith.science/pith/2PVINO55E6LK67DH2YVME4I3MX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PVINO55E6LK67DH2YVME4I3MX/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-03T02:37:49Z","links":{"resolver":"https://pith.science/pith/2PVINO55E6LK67DH2YVME4I3MX","bundle":"https://pith.science/pith/2PVINO55E6LK67DH2YVME4I3MX/bundle.json","state":"https://pith.science/pith/2PVINO55E6LK67DH2YVME4I3MX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PVINO55E6LK67DH2YVME4I3MX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2PVINO55E6LK67DH2YVME4I3MX","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":"6f6779ea4b500ca26f26b7c56124a5c537a59d54fc2e519b931d572df6c6ca63","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2013-09-21T14:00:32Z","title_canon_sha256":"2e9e6f3cbd1fbef9e68460da4cc123df30a737cea402f24c9afd72ae45bf8b2a"},"schema_version":"1.0","source":{"id":"1309.5478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5478","created_at":"2026-05-18T01:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5478v1","created_at":"2026-05-18T01:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5478","created_at":"2026-05-18T01:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"2PVINO55E6LK","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2PVINO55E6LK67DH","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2PVINO55","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:085fdcdb3b871b4bed6116d38392b295ebc3065d73bb1cc201df3193f7146719","target":"graph","created_at":"2026-05-18T01:47:34Z","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 this paper we describe a new brute force algorithm for building the $k$-Nearest Neighbor Graph ($k$-NNG). The $k$-NNG algorithm has many applications in areas such as machine learning, bio-informatics, and clustering analysis. While there are very efficient algorithms for data of low dimensions, for high dimensional data the brute force search is the best algorithm. There are two main parts to the algorithm: the first part is finding the distances between the input vectors which may be formulated as a matrix multiplication problem. The second is the selection of the $k$-NNs for each of the ","authors_text":"Ali Dashti, Ivan Komarov, Roshan D'Souza","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2013-09-21T14:00:32Z","title":"Fast $k$-NNG construction with GPU-based quick multi-select"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5478","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:86f79e271fe596564a0fa1ce5865827b055f4a1240a8a80c095e1b8a1e54dc96","target":"record","created_at":"2026-05-18T01:47:34Z","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":"6f6779ea4b500ca26f26b7c56124a5c537a59d54fc2e519b931d572df6c6ca63","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2013-09-21T14:00:32Z","title_canon_sha256":"2e9e6f3cbd1fbef9e68460da4cc123df30a737cea402f24c9afd72ae45bf8b2a"},"schema_version":"1.0","source":{"id":"1309.5478","kind":"arxiv","version":1}},"canonical_sha256":"d3ea86bbbd2796af7c67d62ac2711b65c25257ca6e9bf4dd411fc9a5fa6f81fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3ea86bbbd2796af7c67d62ac2711b65c25257ca6e9bf4dd411fc9a5fa6f81fe","first_computed_at":"2026-05-18T01:47:34.668149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:47:34.668149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jnaXwL287gBe5jswu4Dq/PJSYer8Wro1bmAUMeZXu7e0X/FMueLyASgka4DUS2ZSFn0sXOX59PnMRApKa4jDAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:47:34.668715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86f79e271fe596564a0fa1ce5865827b055f4a1240a8a80c095e1b8a1e54dc96","sha256:085fdcdb3b871b4bed6116d38392b295ebc3065d73bb1cc201df3193f7146719"],"state_sha256":"4c030550e1f6acf26283ee575283f9332fc70b2981129872930aa392aee2eeb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4TUZhyXOwS/xw1F/xe8INZqLJQ1ekHcSJhMdjBzthN+UXzso+lqDcbqxuWcAc1ootO1tnOHvQXvimHoZqWLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:37:49.822162Z","bundle_sha256":"258c88dcd639c29d89b4bcdc18d87e4751084e6930abe3ffd55dd22c3ebf8ca3"}}