{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EUHXF4W6GDIXBHNZ6KU366HZ5F","short_pith_number":"pith:EUHXF4W6","canonical_record":{"source":{"id":"1707.00143","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-01T11:52:37Z","cross_cats_sorted":[],"title_canon_sha256":"a05bc977421387bad2cbbd9a57910bb3264c78db889f3f4924ce6af5ee795d4f","abstract_canon_sha256":"2ab991593f9e3877e12f34d627e23dfbe621efc63cdd3cbceebad77b6ea09ed2"},"schema_version":"1.0"},"canonical_sha256":"250f72f2de30d1709db9f2a9bf78f9e9663a57ec1b463d29837e0d78df2d1f8d","source":{"kind":"arxiv","id":"1707.00143","version":10},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00143","created_at":"2026-07-05T11:32:10Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00143v10","created_at":"2026-07-05T11:32:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00143","created_at":"2026-07-05T11:32:10Z"},{"alias_kind":"pith_short_12","alias_value":"EUHXF4W6GDIX","created_at":"2026-07-05T11:32:10Z"},{"alias_kind":"pith_short_16","alias_value":"EUHXF4W6GDIXBHNZ","created_at":"2026-07-05T11:32:10Z"},{"alias_kind":"pith_short_8","alias_value":"EUHXF4W6","created_at":"2026-07-05T11:32:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EUHXF4W6GDIXBHNZ6KU366HZ5F","target":"record","payload":{"canonical_record":{"source":{"id":"1707.00143","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-01T11:52:37Z","cross_cats_sorted":[],"title_canon_sha256":"a05bc977421387bad2cbbd9a57910bb3264c78db889f3f4924ce6af5ee795d4f","abstract_canon_sha256":"2ab991593f9e3877e12f34d627e23dfbe621efc63cdd3cbceebad77b6ea09ed2"},"schema_version":"1.0"},"canonical_sha256":"250f72f2de30d1709db9f2a9bf78f9e9663a57ec1b463d29837e0d78df2d1f8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:10.980539Z","signature_b64":"gqqX3BMI7PHnRd0YHpN+EetXmg13PPzOYyPeY17c6TFHyTHDM/L/chtBbuB53WtJpM7DCMEPYF/5ZIlwvWEjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"250f72f2de30d1709db9f2a9bf78f9e9663a57ec1b463d29837e0d78df2d1f8d","last_reissued_at":"2026-07-05T11:32:10.980043Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:10.980043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.00143","source_version":10,"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-05T11:32:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADGI2z8v+2egftFiM1qkJq1GIn7NdueP/CdpEccb7/VZampoMVpL/FkSloUiFpNosPtiA1Wy+qfNCnnl/5TZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:20:20.846507Z"},"content_sha256":"6563fdbfded03566a78803a07a5a4b2a9df1d2bc476168295b9a7a203bdedfaf","schema_version":"1.0","event_id":"sha256:6563fdbfded03566a78803a07a5a4b2a9df1d2bc476168295b9a7a203bdedfaf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EUHXF4W6GDIXBHNZ6KU366HZ5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Changxu Wang, Chao Xiang, Cong Fu, Deng Cai","submitted_at":"2017-07-01T11:52:37Z","abstract_excerpt":"Approximate nearest neighbor search (ANNS) is a fundamental problem in databases and data mining. A scalable ANNS algorithm should be both memory-efficient and fast. Some early graph-based approaches have shown attractive theoretical guarantees on search time complexity, but they all suffer from the problem of high indexing time complexity. Recently, some graph-based methods have been proposed to reduce indexing complexity by approximating the traditional graphs; these methods have achieved revolutionary performance on million-scale datasets. Yet, they still can not scale to billion-node datab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00143","kind":"arxiv","version":10},"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/1707.00143/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-05T11:32:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMHto28iPFncejTClDEsDFOQaEWbg7LU3myKnw7UnfCzIQeujbMextvJAjvnu7DoBBI56Hrwi3VEbpyxVwJRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:20:20.847351Z"},"content_sha256":"a55dd935e77ea4168fff40799217b3b11be9674223b89248c9cfc39d7e0d9e22","schema_version":"1.0","event_id":"sha256:a55dd935e77ea4168fff40799217b3b11be9674223b89248c9cfc39d7e0d9e22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F/bundle.json","state_url":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F/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-08T20:20:20Z","links":{"resolver":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F","bundle":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F/bundle.json","state":"https://pith.science/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUHXF4W6GDIXBHNZ6KU366HZ5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EUHXF4W6GDIXBHNZ6KU366HZ5F","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":"2ab991593f9e3877e12f34d627e23dfbe621efc63cdd3cbceebad77b6ea09ed2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-01T11:52:37Z","title_canon_sha256":"a05bc977421387bad2cbbd9a57910bb3264c78db889f3f4924ce6af5ee795d4f"},"schema_version":"1.0","source":{"id":"1707.00143","kind":"arxiv","version":10}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00143","created_at":"2026-07-05T11:32:10Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00143v10","created_at":"2026-07-05T11:32:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00143","created_at":"2026-07-05T11:32:10Z"},{"alias_kind":"pith_short_12","alias_value":"EUHXF4W6GDIX","created_at":"2026-07-05T11:32:10Z"},{"alias_kind":"pith_short_16","alias_value":"EUHXF4W6GDIXBHNZ","created_at":"2026-07-05T11:32:10Z"},{"alias_kind":"pith_short_8","alias_value":"EUHXF4W6","created_at":"2026-07-05T11:32:10Z"}],"graph_snapshots":[{"event_id":"sha256:a55dd935e77ea4168fff40799217b3b11be9674223b89248c9cfc39d7e0d9e22","target":"graph","created_at":"2026-07-05T11:32:10Z","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/1707.00143/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Approximate nearest neighbor search (ANNS) is a fundamental problem in databases and data mining. A scalable ANNS algorithm should be both memory-efficient and fast. Some early graph-based approaches have shown attractive theoretical guarantees on search time complexity, but they all suffer from the problem of high indexing time complexity. Recently, some graph-based methods have been proposed to reduce indexing complexity by approximating the traditional graphs; these methods have achieved revolutionary performance on million-scale datasets. Yet, they still can not scale to billion-node datab","authors_text":"Changxu Wang, Chao Xiang, Cong Fu, Deng Cai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00143","kind":"arxiv","version":10},"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:6563fdbfded03566a78803a07a5a4b2a9df1d2bc476168295b9a7a203bdedfaf","target":"record","created_at":"2026-07-05T11:32:10Z","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":"2ab991593f9e3877e12f34d627e23dfbe621efc63cdd3cbceebad77b6ea09ed2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-01T11:52:37Z","title_canon_sha256":"a05bc977421387bad2cbbd9a57910bb3264c78db889f3f4924ce6af5ee795d4f"},"schema_version":"1.0","source":{"id":"1707.00143","kind":"arxiv","version":10}},"canonical_sha256":"250f72f2de30d1709db9f2a9bf78f9e9663a57ec1b463d29837e0d78df2d1f8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"250f72f2de30d1709db9f2a9bf78f9e9663a57ec1b463d29837e0d78df2d1f8d","first_computed_at":"2026-07-05T11:32:10.980043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:32:10.980043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gqqX3BMI7PHnRd0YHpN+EetXmg13PPzOYyPeY17c6TFHyTHDM/L/chtBbuB53WtJpM7DCMEPYF/5ZIlwvWEjAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:32:10.980539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00143","source_kind":"arxiv","source_version":10}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6563fdbfded03566a78803a07a5a4b2a9df1d2bc476168295b9a7a203bdedfaf","sha256:a55dd935e77ea4168fff40799217b3b11be9674223b89248c9cfc39d7e0d9e22"],"state_sha256":"66ab16a36fbb252be7d33f7d882d90982f596fb3638b0dc27f8f1ce85b707115"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c1gI0dBMruzeoLPIrHlfnZDtkhB24C8GM98EumKwa/hVEt5vV0CgTZSCu9OKWr1UfZUcmhskl97qpzjrDo9NCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:20:20.852090Z","bundle_sha256":"2dedd72f078983ff2655d94bb02829710b1933d88d4ca972d0ee133bf7c65741"}}