{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YATDIVZXE4ZYOPCUYYMXYPUWBU","short_pith_number":"pith:YATDIVZX","schema_version":"1.0","canonical_sha256":"c0263457372733873c54c6197c3e960d1682a9166199e81a23b8faa0df460521","source":{"kind":"arxiv","id":"2607.17582","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.17582","created_at":"2026-07-21T01:21:53.459751+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.17582v1","created_at":"2026-07-21T01:21:53.459751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17582","created_at":"2026-07-21T01:21:53.459751+00:00"},{"alias_kind":"pith_short_12","alias_value":"YATDIVZXE4ZY","created_at":"2026-07-21T01:21:53.459751+00:00"},{"alias_kind":"pith_short_16","alias_value":"YATDIVZXE4ZYOPCU","created_at":"2026-07-21T01:21:53.459751+00:00"},{"alias_kind":"pith_short_8","alias_value":"YATDIVZX","created_at":"2026-07-21T01:21:53.459751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU","json":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU.json","graph_json":"https://pith.science/api/pith-number/YATDIVZXE4ZYOPCUYYMXYPUWBU/graph.json","events_json":"https://pith.science/api/pith-number/YATDIVZXE4ZYOPCUYYMXYPUWBU/events.json","paper":"https://pith.science/paper/YATDIVZX"},"agent_actions":{"view_html":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU","download_json":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU.json","view_paper":"https://pith.science/paper/YATDIVZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.17582&json=true","fetch_graph":"https://pith.science/api/pith-number/YATDIVZXE4ZYOPCUYYMXYPUWBU/graph.json","fetch_events":"https://pith.science/api/pith-number/YATDIVZXE4ZYOPCUYYMXYPUWBU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU/action/storage_attestation","attest_author":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU/action/author_attestation","sign_citation":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU/action/citation_signature","submit_replication":"https://pith.science/pith/YATDIVZXE4ZYOPCUYYMXYPUWBU/action/replication_record"}},"created_at":"2026-07-21T01:21:53.459751+00:00","updated_at":"2026-07-21T01:21:53.459751+00:00"}