{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GYUG5Z7HSFCR46G7MFDJODKNYX","short_pith_number":"pith:GYUG5Z7H","canonical_record":{"source":{"id":"1307.7852","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CV","submitted_at":"2013-07-30T07:33:31Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"16f7a1db8bb665bfcdb18be9be047e8037e95e933a1412bb7394881e58809348","abstract_canon_sha256":"49c167f44b428ce502db7d684acb8e8e27894dfcbdbd1007579f70e137555a5b"},"schema_version":"1.0"},"canonical_sha256":"36286ee7e791451e78df6146970d4dc5fd5fb222d9e3ae1038c88a3c9148c0a9","source":{"kind":"arxiv","id":"1307.7852","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7852","created_at":"2026-05-18T03:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7852v1","created_at":"2026-05-18T03:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7852","created_at":"2026-05-18T03:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"GYUG5Z7HSFCR","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"GYUG5Z7HSFCR46G7","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"GYUG5Z7H","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GYUG5Z7HSFCR46G7MFDJODKNYX","target":"record","payload":{"canonical_record":{"source":{"id":"1307.7852","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CV","submitted_at":"2013-07-30T07:33:31Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"16f7a1db8bb665bfcdb18be9be047e8037e95e933a1412bb7394881e58809348","abstract_canon_sha256":"49c167f44b428ce502db7d684acb8e8e27894dfcbdbd1007579f70e137555a5b"},"schema_version":"1.0"},"canonical_sha256":"36286ee7e791451e78df6146970d4dc5fd5fb222d9e3ae1038c88a3c9148c0a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:13.328896Z","signature_b64":"5hM0qRbth2XQ57Aw3M9aURGb2OU5j9dJQneDUBMjOnJzGFPg+B6DQqSB8g80W70nftnQgCECLkxS7WSToEoLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36286ee7e791451e78df6146970d4dc5fd5fb222d9e3ae1038c88a3c9148c0a9","last_reissued_at":"2026-05-18T03:17:13.328125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:13.328125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.7852","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-18T03:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bC40jnANTsFSG5UPv/cTsaF9AykrYYfOfnZvC/dW6ngXL2l3CVuquCmaPmV5Cmmx4erLfpH8WPdZdLQrrsy1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:52:55.468189Z"},"content_sha256":"c77ee36f09d70c671836bba61b34de08e21e2c9b1d9cc16acc22040fdbec8408","schema_version":"1.0","event_id":"sha256:c77ee36f09d70c671836bba61b34de08e21e2c9b1d9cc16acc22040fdbec8408"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GYUG5Z7HSFCR46G7MFDJODKNYX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable $k$-NN graph construction","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Gang Zeng, Jingdong Wang, Jing Wang, Rui Gan, Shipeng Li, Zhuowen Tu","submitted_at":"2013-07-30T07:33:31Z","abstract_excerpt":"The $k$-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to construct $k$-NN graphs remains a challenge, especially for large-scale high-dimensional data. In this paper, we propose a new approach to construct approximate $k$-NN graphs with emphasis in: efficiency and accuracy. We hierarchically and randomly divide the data points into subsets and build an exact neighborhood graph over each subset, achieving a base approximate neighborhood graph; we then repeat this process for se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7852","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-18T03:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RiYQO7ykc5QIwfXH+GWRxjJHkXDkyzB712bBgkyQpkyIGszcdxceJyjHGsUHwngnCuzwmtDt/npLbamrIr3HBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:52:55.468983Z"},"content_sha256":"273d27057a4251d00de457be5b728d427b5b2e0ac0922168649ddca785107ef9","schema_version":"1.0","event_id":"sha256:273d27057a4251d00de457be5b728d427b5b2e0ac0922168649ddca785107ef9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYUG5Z7HSFCR46G7MFDJODKNYX/bundle.json","state_url":"https://pith.science/pith/GYUG5Z7HSFCR46G7MFDJODKNYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYUG5Z7HSFCR46G7MFDJODKNYX/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-05-31T16:52:55Z","links":{"resolver":"https://pith.science/pith/GYUG5Z7HSFCR46G7MFDJODKNYX","bundle":"https://pith.science/pith/GYUG5Z7HSFCR46G7MFDJODKNYX/bundle.json","state":"https://pith.science/pith/GYUG5Z7HSFCR46G7MFDJODKNYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYUG5Z7HSFCR46G7MFDJODKNYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GYUG5Z7HSFCR46G7MFDJODKNYX","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":"49c167f44b428ce502db7d684acb8e8e27894dfcbdbd1007579f70e137555a5b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CV","submitted_at":"2013-07-30T07:33:31Z","title_canon_sha256":"16f7a1db8bb665bfcdb18be9be047e8037e95e933a1412bb7394881e58809348"},"schema_version":"1.0","source":{"id":"1307.7852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7852","created_at":"2026-05-18T03:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7852v1","created_at":"2026-05-18T03:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7852","created_at":"2026-05-18T03:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"GYUG5Z7HSFCR","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"GYUG5Z7HSFCR46G7","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"GYUG5Z7H","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:273d27057a4251d00de457be5b728d427b5b2e0ac0922168649ddca785107ef9","target":"graph","created_at":"2026-05-18T03:17:13Z","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":"The $k$-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to construct $k$-NN graphs remains a challenge, especially for large-scale high-dimensional data. In this paper, we propose a new approach to construct approximate $k$-NN graphs with emphasis in: efficiency and accuracy. We hierarchically and randomly divide the data points into subsets and build an exact neighborhood graph over each subset, achieving a base approximate neighborhood graph; we then repeat this process for se","authors_text":"Gang Zeng, Jingdong Wang, Jing Wang, Rui Gan, Shipeng Li, Zhuowen Tu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CV","submitted_at":"2013-07-30T07:33:31Z","title":"Scalable $k$-NN graph construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7852","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:c77ee36f09d70c671836bba61b34de08e21e2c9b1d9cc16acc22040fdbec8408","target":"record","created_at":"2026-05-18T03:17:13Z","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":"49c167f44b428ce502db7d684acb8e8e27894dfcbdbd1007579f70e137555a5b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CV","submitted_at":"2013-07-30T07:33:31Z","title_canon_sha256":"16f7a1db8bb665bfcdb18be9be047e8037e95e933a1412bb7394881e58809348"},"schema_version":"1.0","source":{"id":"1307.7852","kind":"arxiv","version":1}},"canonical_sha256":"36286ee7e791451e78df6146970d4dc5fd5fb222d9e3ae1038c88a3c9148c0a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36286ee7e791451e78df6146970d4dc5fd5fb222d9e3ae1038c88a3c9148c0a9","first_computed_at":"2026-05-18T03:17:13.328125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:13.328125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5hM0qRbth2XQ57Aw3M9aURGb2OU5j9dJQneDUBMjOnJzGFPg+B6DQqSB8g80W70nftnQgCECLkxS7WSToEoLDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:13.328896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c77ee36f09d70c671836bba61b34de08e21e2c9b1d9cc16acc22040fdbec8408","sha256:273d27057a4251d00de457be5b728d427b5b2e0ac0922168649ddca785107ef9"],"state_sha256":"5d58c16edbaccd0d237ad9171cf02b62f4409e17a7ab45633e8ca1e58af905c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"joMy2n/CX4z/ThFVhwp774n4jINBQ4GSbpgvxAMbcLXoUHj0QqkHPa304CvnNFErdr3joNUrwV7gRBAo/82ODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:52:55.473797Z","bundle_sha256":"000ca2f2bc119f1711ec9621856a94c3e0b92fb6844bc2c5b2618a96c46a2d69"}}