{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KOOSUAEAYU2PMX2TBGM2CL3RZP","short_pith_number":"pith:KOOSUAEA","schema_version":"1.0","canonical_sha256":"539d2a0080c534f65f530999a12f71cbdb179b187d98ee901320297e55ab1f61","source":{"kind":"arxiv","id":"2406.19651","version":1},"attestation_state":"computed","paper":{"title":"CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Shixuan Sun, Shuhao Zhang, Xianzhi Zeng, Xinjing Hu, Xuanhua Shi, Zhuoyan Wu","submitted_at":"2024-06-28T04:46:11Z","abstract_excerpt":"Approximate K Nearest Neighbor (AKNN) algorithms play a pivotal role in various AI applications, including information retrieval, computer vision, and natural language processing. Although numerous AKNN algorithms and benchmarks have been developed recently to evaluate their effectiveness, the dynamic nature of real-world data presents significant challenges that existing benchmarks fail to address. Traditional benchmarks primarily assess retrieval effectiveness in static contexts and often overlook update efficiency, which is crucial for handling continuous data ingestion. This limitation res"},"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":"2406.19651","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-06-28T04:46:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f47b2ce9881ee7716230d53c37f35dc36d9f27da7c6e472a69d0f0a41623f0c2","abstract_canon_sha256":"5ee2db2e9a37a9eaa7ff10364f847357568bb5d926076eb09c08286f73e2ca2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:43.175467Z","signature_b64":"t9faNV840+Tjp1riFitM3QHp1Uumc3CgZ7qrYH21Z29glDgh4G5KJYaJglGM3EIh5WRcXWOqDznqY7pHix8lBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"539d2a0080c534f65f530999a12f71cbdb179b187d98ee901320297e55ab1f61","last_reissued_at":"2026-07-05T08:37:43.174985Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:43.174985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Shixuan Sun, Shuhao Zhang, Xianzhi Zeng, Xinjing Hu, Xuanhua Shi, Zhuoyan Wu","submitted_at":"2024-06-28T04:46:11Z","abstract_excerpt":"Approximate K Nearest Neighbor (AKNN) algorithms play a pivotal role in various AI applications, including information retrieval, computer vision, and natural language processing. Although numerous AKNN algorithms and benchmarks have been developed recently to evaluate their effectiveness, the dynamic nature of real-world data presents significant challenges that existing benchmarks fail to address. Traditional benchmarks primarily assess retrieval effectiveness in static contexts and often overlook update efficiency, which is crucial for handling continuous data ingestion. This limitation res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19651","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/2406.19651/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":"2406.19651","created_at":"2026-07-05T08:37:43.175039+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.19651v1","created_at":"2026-07-05T08:37:43.175039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19651","created_at":"2026-07-05T08:37:43.175039+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOOSUAEAYU2P","created_at":"2026-07-05T08:37:43.175039+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOOSUAEAYU2PMX2T","created_at":"2026-07-05T08:37:43.175039+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOOSUAEA","created_at":"2026-07-05T08:37:43.175039+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.27640","citing_title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KOOSUAEAYU2PMX2TBGM2CL3RZP","json":"https://pith.science/pith/KOOSUAEAYU2PMX2TBGM2CL3RZP.json","graph_json":"https://pith.science/api/pith-number/KOOSUAEAYU2PMX2TBGM2CL3RZP/graph.json","events_json":"https://pith.science/api/pith-number/KOOSUAEAYU2PMX2TBGM2CL3RZP/events.json","paper":"https://pith.science/paper/KOOSUAEA"},"agent_actions":{"view_html":"https://pith.science/pith/KOOSUAEAYU2PMX2TBGM2CL3RZP","download_json":"https://pith.science/pith/KOOSUAEAYU2PMX2TBGM2CL3RZP.json","view_paper":"https://pith.science/paper/KOOSUAEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.19651&json=true","fetch_graph":"https://pith.science/api/pith-number/KOOSUAEAYU2PMX2TBGM2CL3RZP/graph.json","fetch_events":"https://pith.science/api/pith-number/KOOSUAEAYU2PMX2TBGM2CL3RZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOOSUAEAYU2PMX2TBGM2CL3RZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOOSUAEAYU2PMX2TBGM2CL3RZP/action/storage_attestation","attest_author":"https://pith.science/pith/KOOSUAEAYU2PMX2TBGM2CL3RZP/action/author_attestation","sign_citation":"https://pith.science/pith/KOOSUAEAYU2PMX2TBGM2CL3RZP/action/citation_signature","submit_replication":"https://pith.science/pith/KOOSUAEAYU2PMX2TBGM2CL3RZP/action/replication_record"}},"created_at":"2026-07-05T08:37:43.175039+00:00","updated_at":"2026-07-05T08:37:43.175039+00:00"}