{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EGHQAEB2RX6HLRDQG7HBJICXLR","short_pith_number":"pith:EGHQAEB2","canonical_record":{"source":{"id":"2606.03129","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T04:15:35Z","cross_cats_sorted":[],"title_canon_sha256":"77bf3576feb0c6d46fe8205290402db6bb7a68f8a1d6d275ebd4a9e3a789b92c","abstract_canon_sha256":"ef9a826110865c530719953387394d519af0680b39c67a3b3974adbf372bc4d1"},"schema_version":"1.0"},"canonical_sha256":"218f00103a8dfc75c47037ce14a0575c7e40eada383b0c1b42695eb139a5cf24","source":{"kind":"arxiv","id":"2606.03129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03129","created_at":"2026-06-03T01:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03129v1","created_at":"2026-06-03T01:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03129","created_at":"2026-06-03T01:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"EGHQAEB2RX6H","created_at":"2026-06-03T01:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"EGHQAEB2RX6HLRDQ","created_at":"2026-06-03T01:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"EGHQAEB2","created_at":"2026-06-03T01:05:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EGHQAEB2RX6HLRDQG7HBJICXLR","target":"record","payload":{"canonical_record":{"source":{"id":"2606.03129","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T04:15:35Z","cross_cats_sorted":[],"title_canon_sha256":"77bf3576feb0c6d46fe8205290402db6bb7a68f8a1d6d275ebd4a9e3a789b92c","abstract_canon_sha256":"ef9a826110865c530719953387394d519af0680b39c67a3b3974adbf372bc4d1"},"schema_version":"1.0"},"canonical_sha256":"218f00103a8dfc75c47037ce14a0575c7e40eada383b0c1b42695eb139a5cf24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:32.470221Z","signature_b64":"7pkj6orUFYy1Ry/Qiac5HBP5PVSMLLB8/PIdznMjLygfOB9yzakU6FHAlWAo1s13hRqI+xKqIbWIbAywD4HaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"218f00103a8dfc75c47037ce14a0575c7e40eada383b0c1b42695eb139a5cf24","last_reissued_at":"2026-06-03T01:05:32.469892Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:32.469892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.03129","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-06-03T01:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xgFysZnUysxlj8QJhWAGmU9bDrQ/+sFtrbcCv+zc32KlxXtFrJENIK9GIErYCNEqfYKt/gyOXWvBmo2jW44CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:24:20.020829Z"},"content_sha256":"063e887edbb4080d56048aaa9d87e339dc557e8d48e741a9bc0420e3fe1a7a40","schema_version":"1.0","event_id":"sha256:063e887edbb4080d56048aaa9d87e339dc557e8d48e741a9bc0420e3fe1a7a40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EGHQAEB2RX6HLRDQG7HBJICXLR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Metric Skiplists and Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rohin Garg, Xiangyun Ding, Yan Gu, Yihan Sun","submitted_at":"2026-06-02T04:15:35Z","abstract_excerpt":"The metric skip-list is a data structure designed for efficient nearest and $k$-nearest neighbor search in metric spaces. For many real-world datasets with reasonable distributions - specifically, those with a constant expansion rate - it supports $\\tilde{O}(n)$ construction time and $O(k\\log n)$ query time, where $n$ is the input size and $k$ is the number of nearest neighbors in queries. Notably, unlike alternative approaches, it does not require a bounded aspect ratio, making it more flexible for input data distributions. However, the inherently sequential nature of its original constructio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03129","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/2606.03129/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-06-03T01:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tFj/KKTL5aNLgkaYhqNBnd4i8HCgJ8gvUCwIrjE9lmO1+N6viNN3vFBF7MbJooauz1xKAea31upCubj0xj/cAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:24:20.021656Z"},"content_sha256":"64a6f72506d55d6f7b27c106de52cf185c6d6a7a4107c5b1510f878e8b3fa337","schema_version":"1.0","event_id":"sha256:64a6f72506d55d6f7b27c106de52cf185c6d6a7a4107c5b1510f878e8b3fa337"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EGHQAEB2RX6HLRDQG7HBJICXLR/bundle.json","state_url":"https://pith.science/pith/EGHQAEB2RX6HLRDQG7HBJICXLR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EGHQAEB2RX6HLRDQG7HBJICXLR/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-07T09:24:20Z","links":{"resolver":"https://pith.science/pith/EGHQAEB2RX6HLRDQG7HBJICXLR","bundle":"https://pith.science/pith/EGHQAEB2RX6HLRDQG7HBJICXLR/bundle.json","state":"https://pith.science/pith/EGHQAEB2RX6HLRDQG7HBJICXLR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EGHQAEB2RX6HLRDQG7HBJICXLR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EGHQAEB2RX6HLRDQG7HBJICXLR","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":"ef9a826110865c530719953387394d519af0680b39c67a3b3974adbf372bc4d1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T04:15:35Z","title_canon_sha256":"77bf3576feb0c6d46fe8205290402db6bb7a68f8a1d6d275ebd4a9e3a789b92c"},"schema_version":"1.0","source":{"id":"2606.03129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03129","created_at":"2026-06-03T01:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03129v1","created_at":"2026-06-03T01:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03129","created_at":"2026-06-03T01:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"EGHQAEB2RX6H","created_at":"2026-06-03T01:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"EGHQAEB2RX6HLRDQ","created_at":"2026-06-03T01:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"EGHQAEB2","created_at":"2026-06-03T01:05:32Z"}],"graph_snapshots":[{"event_id":"sha256:64a6f72506d55d6f7b27c106de52cf185c6d6a7a4107c5b1510f878e8b3fa337","target":"graph","created_at":"2026-06-03T01:05:32Z","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/2606.03129/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The metric skip-list is a data structure designed for efficient nearest and $k$-nearest neighbor search in metric spaces. For many real-world datasets with reasonable distributions - specifically, those with a constant expansion rate - it supports $\\tilde{O}(n)$ construction time and $O(k\\log n)$ query time, where $n$ is the input size and $k$ is the number of nearest neighbors in queries. Notably, unlike alternative approaches, it does not require a bounded aspect ratio, making it more flexible for input data distributions. However, the inherently sequential nature of its original constructio","authors_text":"Rohin Garg, Xiangyun Ding, Yan Gu, Yihan Sun","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03129","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:063e887edbb4080d56048aaa9d87e339dc557e8d48e741a9bc0420e3fe1a7a40","target":"record","created_at":"2026-06-03T01:05:32Z","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":"ef9a826110865c530719953387394d519af0680b39c67a3b3974adbf372bc4d1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T04:15:35Z","title_canon_sha256":"77bf3576feb0c6d46fe8205290402db6bb7a68f8a1d6d275ebd4a9e3a789b92c"},"schema_version":"1.0","source":{"id":"2606.03129","kind":"arxiv","version":1}},"canonical_sha256":"218f00103a8dfc75c47037ce14a0575c7e40eada383b0c1b42695eb139a5cf24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"218f00103a8dfc75c47037ce14a0575c7e40eada383b0c1b42695eb139a5cf24","first_computed_at":"2026-06-03T01:05:32.469892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:32.469892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7pkj6orUFYy1Ry/Qiac5HBP5PVSMLLB8/PIdznMjLygfOB9yzakU6FHAlWAo1s13hRqI+xKqIbWIbAywD4HaCg==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:32.470221Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.03129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:063e887edbb4080d56048aaa9d87e339dc557e8d48e741a9bc0420e3fe1a7a40","sha256:64a6f72506d55d6f7b27c106de52cf185c6d6a7a4107c5b1510f878e8b3fa337"],"state_sha256":"3306f7894903d61c3214997f4ce0fd0a34969f69293ed87feab7676f8ddb5855"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hRqxTYAkxFdALp5mBBUCPU43n8gu1gm8+KPKqn9hY35JwitpHZy7fRQwrkkvW3nbvbGOZEf5g2985CGj7ab1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:24:20.025201Z","bundle_sha256":"0f931e817962a78cd83fa50d1fe9a1f90649c6204881e6ba8a26ad3d3ed47a41"}}