{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TONST737DQZ2DUI25GXRMQWAZ3","short_pith_number":"pith:TONST737","canonical_record":{"source":{"id":"2509.07789","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2025-09-09T14:23:30Z","cross_cats_sorted":[],"title_canon_sha256":"69ef3400d3f79f6be078dc88ea4774f0fa97a12a390587ca70f225acbce4a8c7","abstract_canon_sha256":"c6e64cb412379132a49b4087a1798a2e5eb931dd547dcedfae3f709804cf777b"},"schema_version":"1.0"},"canonical_sha256":"9b9b29ff7f1c33a1d11ae9af1642c0cee2e987bcf37b79de48a6545c89f42bee","source":{"kind":"arxiv","id":"2509.07789","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.07789","created_at":"2026-07-05T12:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"2509.07789v1","created_at":"2026-07-05T12:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.07789","created_at":"2026-07-05T12:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"TONST737DQZ2","created_at":"2026-07-05T12:07:28Z"},{"alias_kind":"pith_short_16","alias_value":"TONST737DQZ2DUI2","created_at":"2026-07-05T12:07:28Z"},{"alias_kind":"pith_short_8","alias_value":"TONST737","created_at":"2026-07-05T12:07:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TONST737DQZ2DUI25GXRMQWAZ3","target":"record","payload":{"canonical_record":{"source":{"id":"2509.07789","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2025-09-09T14:23:30Z","cross_cats_sorted":[],"title_canon_sha256":"69ef3400d3f79f6be078dc88ea4774f0fa97a12a390587ca70f225acbce4a8c7","abstract_canon_sha256":"c6e64cb412379132a49b4087a1798a2e5eb931dd547dcedfae3f709804cf777b"},"schema_version":"1.0"},"canonical_sha256":"9b9b29ff7f1c33a1d11ae9af1642c0cee2e987bcf37b79de48a6545c89f42bee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:28.399558Z","signature_b64":"Dho1n7ADQXUyVJqR6i4k/lKo7wvW5zhMUyUmet3nPV6lYcABgYgg/ZQwEkH6oRbuz7aBZdVvT65NPHOBzoEWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b9b29ff7f1c33a1d11ae9af1642c0cee2e987bcf37b79de48a6545c89f42bee","last_reissued_at":"2026-07-05T12:07:28.399071Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:28.399071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.07789","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-05T12:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kpQ3UsbzC+hu4fXUj/3eGyIYX4Namys62asnfy85zkLujBWeCvbnuNLC3jgWCagOehT6BY2VtKUNh9sM2YG6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T12:06:50.334021Z"},"content_sha256":"9d7dd5ab78957acaa69a19d226d8d3855048e80aac625eb813e8795484c80d9d","schema_version":"1.0","event_id":"sha256:9d7dd5ab78957acaa69a19d226d8d3855048e80aac625eb813e8795484c80d9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TONST737DQZ2DUI25GXRMQWAZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jiayang Shi, Weiguo Zheng, Yuzheng Cai","submitted_at":"2025-09-09T14:23:30Z","abstract_excerpt":"For a given dataset $\\mathcal{D}$ and structured label $f$, the goal of Filtered Approximate Nearest Neighbor Search (FANNS) algorithms is to find top-$k$ points closest to a query that satisfy label constraints, while ensuring both recall and QPS (Queries Per Second). In recent years, many FANNS algorithms have been proposed. However, the lack of a systematic investigation makes it difficult to understand their relative strengths and weaknesses. Additionally, we found that: (1) FANNS algorithms have coupled, dataset-dependent parameters, leading to biased comparisons. (2) Key impact factors a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.07789","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/2509.07789/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-05T12:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"isHK7k4fkDVhWCvO0yiA/tXV6hTJAGqoKiaxiHHYXTVEkCzyI+293nU33COKgQFmsXVm32lyDamNI761J8ECAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T12:06:50.334401Z"},"content_sha256":"7fd67667e8a223006af51acb8dcd50775bba6d04aef43b180561bdf274ff4eb4","schema_version":"1.0","event_id":"sha256:7fd67667e8a223006af51acb8dcd50775bba6d04aef43b180561bdf274ff4eb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TONST737DQZ2DUI25GXRMQWAZ3/bundle.json","state_url":"https://pith.science/pith/TONST737DQZ2DUI25GXRMQWAZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TONST737DQZ2DUI25GXRMQWAZ3/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-07-13T12:06:50Z","links":{"resolver":"https://pith.science/pith/TONST737DQZ2DUI25GXRMQWAZ3","bundle":"https://pith.science/pith/TONST737DQZ2DUI25GXRMQWAZ3/bundle.json","state":"https://pith.science/pith/TONST737DQZ2DUI25GXRMQWAZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TONST737DQZ2DUI25GXRMQWAZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TONST737DQZ2DUI25GXRMQWAZ3","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":"c6e64cb412379132a49b4087a1798a2e5eb931dd547dcedfae3f709804cf777b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2025-09-09T14:23:30Z","title_canon_sha256":"69ef3400d3f79f6be078dc88ea4774f0fa97a12a390587ca70f225acbce4a8c7"},"schema_version":"1.0","source":{"id":"2509.07789","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.07789","created_at":"2026-07-05T12:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"2509.07789v1","created_at":"2026-07-05T12:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.07789","created_at":"2026-07-05T12:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"TONST737DQZ2","created_at":"2026-07-05T12:07:28Z"},{"alias_kind":"pith_short_16","alias_value":"TONST737DQZ2DUI2","created_at":"2026-07-05T12:07:28Z"},{"alias_kind":"pith_short_8","alias_value":"TONST737","created_at":"2026-07-05T12:07:28Z"}],"graph_snapshots":[{"event_id":"sha256:7fd67667e8a223006af51acb8dcd50775bba6d04aef43b180561bdf274ff4eb4","target":"graph","created_at":"2026-07-05T12:07:28Z","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/2509.07789/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a given dataset $\\mathcal{D}$ and structured label $f$, the goal of Filtered Approximate Nearest Neighbor Search (FANNS) algorithms is to find top-$k$ points closest to a query that satisfy label constraints, while ensuring both recall and QPS (Queries Per Second). In recent years, many FANNS algorithms have been proposed. However, the lack of a systematic investigation makes it difficult to understand their relative strengths and weaknesses. Additionally, we found that: (1) FANNS algorithms have coupled, dataset-dependent parameters, leading to biased comparisons. (2) Key impact factors a","authors_text":"Jiayang Shi, Weiguo Zheng, Yuzheng Cai","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.07789","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:9d7dd5ab78957acaa69a19d226d8d3855048e80aac625eb813e8795484c80d9d","target":"record","created_at":"2026-07-05T12:07:28Z","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":"c6e64cb412379132a49b4087a1798a2e5eb931dd547dcedfae3f709804cf777b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2025-09-09T14:23:30Z","title_canon_sha256":"69ef3400d3f79f6be078dc88ea4774f0fa97a12a390587ca70f225acbce4a8c7"},"schema_version":"1.0","source":{"id":"2509.07789","kind":"arxiv","version":1}},"canonical_sha256":"9b9b29ff7f1c33a1d11ae9af1642c0cee2e987bcf37b79de48a6545c89f42bee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b9b29ff7f1c33a1d11ae9af1642c0cee2e987bcf37b79de48a6545c89f42bee","first_computed_at":"2026-07-05T12:07:28.399071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:07:28.399071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dho1n7ADQXUyVJqR6i4k/lKo7wvW5zhMUyUmet3nPV6lYcABgYgg/ZQwEkH6oRbuz7aBZdVvT65NPHOBzoEWCA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:07:28.399558Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.07789","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d7dd5ab78957acaa69a19d226d8d3855048e80aac625eb813e8795484c80d9d","sha256:7fd67667e8a223006af51acb8dcd50775bba6d04aef43b180561bdf274ff4eb4"],"state_sha256":"fb58e3c16d131ce0ae59ec395e1be22ce5e52ba5e980461e9a43872605f267cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DqalpeHsqalLV7Trskbwst5sAFkdUsfhWxeEbk59gso0foEz/D2LZ+STX7i+gJXAzfs905TsxP9MHWTU/aB8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T12:06:50.336405Z","bundle_sha256":"1a0bf700eabe0639f818252c77a23c424ae4162ec91bcff82f4279d309ff36e8"}}