{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YATDIVZXE4ZYOPCUYYMXYPUWBU","short_pith_number":"pith:YATDIVZX","canonical_record":{"source":{"id":"2607.17582","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-20T05:59:59Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"d8f62e83019c0b96a5154715227e4d873844248693e85f6bec4480f64ef7ed1e","abstract_canon_sha256":"250e3bd13bcff0b9679cfef6394f65f547a686d550dbd826359fc809007cfe55"},"schema_version":"1.0"},"canonical_sha256":"c0263457372733873c54c6197c3e960d1682a9166199e81a23b8faa0df460521","source":{"kind":"arxiv","id":"2607.17582","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.17582","created_at":"2026-07-21T01:21:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.17582v1","created_at":"2026-07-21T01:21:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17582","created_at":"2026-07-21T01:21:53Z"},{"alias_kind":"pith_short_12","alias_value":"YATDIVZXE4ZY","created_at":"2026-07-21T01:21:53Z"},{"alias_kind":"pith_short_16","alias_value":"YATDIVZXE4ZYOPCU","created_at":"2026-07-21T01:21:53Z"},{"alias_kind":"pith_short_8","alias_value":"YATDIVZX","created_at":"2026-07-21T01:21:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YATDIVZXE4ZYOPCUYYMXYPUWBU","target":"record","payload":{"canonical_record":{"source":{"id":"2607.17582","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-20T05:59:59Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"d8f62e83019c0b96a5154715227e4d873844248693e85f6bec4480f64ef7ed1e","abstract_canon_sha256":"250e3bd13bcff0b9679cfef6394f65f547a686d550dbd826359fc809007cfe55"},"schema_version":"1.0"},"canonical_sha256":"c0263457372733873c54c6197c3e960d1682a9166199e81a23b8faa0df460521","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:21:53.460155Z","signature_b64":"88CD982ciWdW6ZodpTCfAdAUYwq+H8/U+YBLqj8Ee3gN2HyCXFDj2sFyfEmPwbDUuMHPKJZ1PnJmTqtkrdeYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0263457372733873c54c6197c3e960d1682a9166199e81a23b8faa0df460521","last_reissued_at":"2026-07-21T01:21:53.459333Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:21:53.459333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.17582","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-07-21T01:21:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+eGaxNvuDMB68IhmnzRd8gar2t7Acf1bJvQzn7Ouk5brnZwIadLCYg9mMRyIbfKMcxbKvGeWcj1rueF+wvsbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T18:04:14.220022Z"},"content_sha256":"354747f94f13155239b0e8badba53d2c7565a389eaa142e8923798a210a5c5ed","schema_version":"1.0","event_id":"sha256:354747f94f13155239b0e8badba53d2c7565a389eaa142e8923798a210a5c5ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YATDIVZXE4ZYOPCUYYMXYPUWBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Jingbo Su, Yan Gu, Yihan Sun, Zheqi Shen, Zijin Wan","submitted_at":"2026-07-20T05:59:59Z","abstract_excerpt":"Approximate Nearest Neighbor Search (ANNS) plays a pivotal role in modern deep learning pipelines. Recently, many ANNS systems have been proposed to either provide broad functionality or reach high performance. However, it is yet difficult to achieve both with minimal programming efforts. We propose ANNLib to address the gap. ANNLib is a library that provides a programming framework for achieving high performance and flexible functionality in ANNS systems, based on popular graph-based ANNS algorithms. We carefully decouple and independently optimize both the algorithm and the data structure co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17582","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/2607.17582/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-21T01:21:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8IS+cOFaZcQ/wNBQm9OF6+Vj2LLO2sL9VeIbkDL6cZW9/wtZ+zb3s+BjRzDVcQujF9LSd4vs0eIb+qgZC5HTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T18:04:14.220578Z"},"content_sha256":"9a877677b7a8fc9b53ebea77dadff82d6f7974ac88e858c6a2e3c8145cdc53d7","schema_version":"1.0","event_id":"sha256:9a877677b7a8fc9b53ebea77dadff82d6f7974ac88e858c6a2e3c8145cdc53d7"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:YATDIVZXE4ZYOPCUYYMXYPUWBU","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.48550/arXiv.2206.01382) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Ninh Pham and Tao Liu. 2022. Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search. CoRRabs/2206.01382 (2022). https://doi.org/10.48550/arXiv.2206. 01382 arXiv:2206.01382","arxiv_id":"2607.17582","detector":"doi_compliance","evidence":{"ref_index":47,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.48550/arxiv.2206","reconstructed_doi":"10.48550/arXiv.2206.01382"},"severity":"advisory","ref_index":47,"audited_at":"2026-08-01T17:49:23.863743Z","event_type":"pith.integrity.v1","detected_doi":"10.48550/arXiv.2206.01382","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"af137ca043a740d4659eb6825980b274bf7e9dcc271bc6003c77bc761a7c3275","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":16321,"payload_sha256":"7283ab41d3dc3eb6ce75afc70a47d2fa6f62395b51b85dc3e3e2e1c535939bd9","signature_b64":"CssjLmMrx1dWkVJPOGR8fflOsVFwfni1xBt+xe1DyOjF6Gpa29+ObXTryvCk6uRKRoBjkH26eB41I3OYMdGGAw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T17:53:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bpKW9icb7ICBxL0m4Nj9jRBfF0yZW2ytnkD5ueRE8hYg9BKmHm08wFJhXnMvS319HeHtuzeVD6lX9sSIND4jAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T18:04:14.270834Z"},"content_sha256":"cc2c523dbd5cc03da2caa467ea7794a9fe9b0edc2acb634caeb30547af70faee","schema_version":"1.0","event_id":"sha256:cc2c523dbd5cc03da2caa467ea7794a9fe9b0edc2acb634caeb30547af70faee"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:YATDIVZXE4ZYOPCUYYMXYPUWBU","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1137/1.9781611977042.16 resolves to 'Parallel Nearest Neighbors in Low Dimensions with Batch Updates'. A reader following the printed text alone cannot reach it.","snippet":"Guy E. Blelloch and Magdalen Dobson. 2022. Parallel Nearest Neighbors in Low Dimensions with Batch Updates. InProceed- ings of the Symposium on Algorithm Engineering and Experi- ments (ALENEX). SIAM, 195–208. https://doi.org/10.1137/1. 9781","arxiv_id":"2607.17582","detector":"doi_compliance","evidence":{"ref_index":13,"verdict_class":"incontrovertible","resolved_title":"Parallel Nearest Neighbors in Low Dimensions with Batch Updates","printed_excerpt":"10.1137/1","reconstructed_doi":"10.1137/1.9781611977042.16"},"severity":"advisory","ref_index":13,"audited_at":"2026-08-01T17:49:23.863743Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/1.9781611977042.16","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"ac7bb39a243095b311280f71d94375d4a6a96c356c2fbdaec5b7f6dd5cf286bd","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Parallel Nearest Neighbors in Low Dimensions with Batch Updates","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":16320,"payload_sha256":"c7eca9ee124732ebd8916e9e653c9fd198b95a78037a6a13ae7727d3a46eec76","signature_b64":"2kfv/E4XI9aMEB1v+3NsIMUVOcoNjykM++oBppl8ewMvrodIn8RevYmZ+uRH/xsW7EnAStf6npHUbEupYTsaBA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T17:53:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0Jf4iCyFvpiFpVv6Ot5Ys2hNRIdG96zZMHwXKsRUlSKt2lk/F8c48/vHQ3FTZ2VYfPmx/TMSxrYvBPS8BVlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T18:04:14.271249Z"},"content_sha256":"32cb692aba699729f344079f5d6552a935ce3611de7224a36781172e3058ea19","schema_version":"1.0","event_id":"sha256:32cb692aba699729f344079f5d6552a935ce3611de7224a36781172e3058ea19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU/bundle.json","state_url":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU/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-04T18:04:14Z","links":{"resolver":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU","bundle":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU/bundle.json","state":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YATDIVZXE4ZYOPCUYYMXYPUWBU","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"250e3bd13bcff0b9679cfef6394f65f547a686d550dbd826359fc809007cfe55","cross_cats_sorted":["cs.IR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-20T05:59:59Z","title_canon_sha256":"d8f62e83019c0b96a5154715227e4d873844248693e85f6bec4480f64ef7ed1e"},"schema_version":"1.0","source":{"id":"2607.17582","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.17582","created_at":"2026-07-21T01:21:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.17582v1","created_at":"2026-07-21T01:21:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17582","created_at":"2026-07-21T01:21:53Z"},{"alias_kind":"pith_short_12","alias_value":"YATDIVZXE4ZY","created_at":"2026-07-21T01:21:53Z"},{"alias_kind":"pith_short_16","alias_value":"YATDIVZXE4ZYOPCU","created_at":"2026-07-21T01:21:53Z"},{"alias_kind":"pith_short_8","alias_value":"YATDIVZX","created_at":"2026-07-21T01:21:53Z"}],"graph_snapshots":[{"event_id":"sha256:9a877677b7a8fc9b53ebea77dadff82d6f7974ac88e858c6a2e3c8145cdc53d7","target":"graph","created_at":"2026-07-21T01:21:53Z","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/2607.17582/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Approximate Nearest Neighbor Search (ANNS) plays a pivotal role in modern deep learning pipelines. Recently, many ANNS systems have been proposed to either provide broad functionality or reach high performance. However, it is yet difficult to achieve both with minimal programming efforts. We propose ANNLib to address the gap. ANNLib is a library that provides a programming framework for achieving high performance and flexible functionality in ANNS systems, based on popular graph-based ANNS algorithms. We carefully decouple and independently optimize both the algorithm and the data structure co","authors_text":"Jingbo Su, Yan Gu, Yihan Sun, Zheqi Shen, Zijin Wan","cross_cats":["cs.IR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-20T05:59:59Z","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17582","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:354747f94f13155239b0e8badba53d2c7565a389eaa142e8923798a210a5c5ed","target":"record","created_at":"2026-07-21T01:21:53Z","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":"250e3bd13bcff0b9679cfef6394f65f547a686d550dbd826359fc809007cfe55","cross_cats_sorted":["cs.IR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-20T05:59:59Z","title_canon_sha256":"d8f62e83019c0b96a5154715227e4d873844248693e85f6bec4480f64ef7ed1e"},"schema_version":"1.0","source":{"id":"2607.17582","kind":"arxiv","version":1}},"canonical_sha256":"c0263457372733873c54c6197c3e960d1682a9166199e81a23b8faa0df460521","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0263457372733873c54c6197c3e960d1682a9166199e81a23b8faa0df460521","first_computed_at":"2026-07-21T01:21:53.459333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-21T01:21:53.459333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"88CD982ciWdW6ZodpTCfAdAUYwq+H8/U+YBLqj8Ee3gN2HyCXFDj2sFyfEmPwbDUuMHPKJZ1PnJmTqtkrdeYDQ==","signature_status":"signed_v1","signed_at":"2026-07-21T01:21:53.460155Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.17582","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:32cb692aba699729f344079f5d6552a935ce3611de7224a36781172e3058ea19","sha256:cc2c523dbd5cc03da2caa467ea7794a9fe9b0edc2acb634caeb30547af70faee"]}],"invalid_events":[],"applied_event_ids":["sha256:354747f94f13155239b0e8badba53d2c7565a389eaa142e8923798a210a5c5ed","sha256:9a877677b7a8fc9b53ebea77dadff82d6f7974ac88e858c6a2e3c8145cdc53d7"],"state_sha256":"72b8a25be99ec4908a9a60a7441cc4320799718bb84d86ebd4cfba26bae0dafa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYEch2/gcGffJs8lx5es00ogOXD6WPZHra97pN5T1N24PibzUWhUAsojmM5N2qfgWUAo8tF57zXn9rsXPILMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T18:04:14.274103Z","bundle_sha256":"ce82d713b8587429df7d09f04dd3eb96b9229d520cc0f6f78d4490300aada24a"}}