{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:X6JYF3OJPC2PHBXYTOUNB6TKCY","short_pith_number":"pith:X6JYF3OJ","schema_version":"1.0","canonical_sha256":"bf9382edc978b4f386f89ba8d0fa6a1625dfe81445469b7af893918e3e9477e3","source":{"kind":"arxiv","id":"2510.00566","version":4},"attestation_state":"computed","paper":{"title":"Panorama: Fast-Track Nearest Neighbors","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.LG","authors_text":"Akash Nayar, Alexis Schlomer, Jignesh M. Patel, Panagiotis Karras, Sayan Ranu, Vansh Ramani","submitted_at":"2025-10-01T06:38:45Z","abstract_excerpt":"Approximate Nearest-Neighbor Search (ANNS) pipelines for high-dimensional neural embeddings spend the bulk of their query time in candidate verification, making it the primary bottleneck in the search process. In this paper, we present PANORAMA, a state-of-the-art refinement technique that accelerates verification by exploiting the inherent spectral decay of these embeddings. Using PCA to compact signal energy, PANORAMA evaluates candidate distances incrementally, computing at each step a strict lower bound on the full-vector distance and dynamically pruning candidates the moment this bound ex"},"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":"2510.00566","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-10-01T06:38:45Z","cross_cats_sorted":["cs.AI","cs.DB"],"title_canon_sha256":"f8062900a21b76a245bd02d338a8c692742c2abba6c118e3a53ea23ba8ef7aac","abstract_canon_sha256":"c92b782a55c2270d3f5a5b7d3ef8510fa62d22328b41dab19228b5804ab9cab4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T00:15:50.103558Z","signature_b64":"RwB5Y5O2mhFTo6LzQ9MpWvaqbvmpjj8Xl5V8mpHjjwl3cJLIbzCRUdAA12Fcqps11wDV7X4vzwCf5BF7KQH9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf9382edc978b4f386f89ba8d0fa6a1625dfe81445469b7af893918e3e9477e3","last_reissued_at":"2026-07-07T00:15:50.102714Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T00:15:50.102714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Panorama: Fast-Track Nearest Neighbors","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.LG","authors_text":"Akash Nayar, Alexis Schlomer, Jignesh M. Patel, Panagiotis Karras, Sayan Ranu, Vansh Ramani","submitted_at":"2025-10-01T06:38:45Z","abstract_excerpt":"Approximate Nearest-Neighbor Search (ANNS) pipelines for high-dimensional neural embeddings spend the bulk of their query time in candidate verification, making it the primary bottleneck in the search process. In this paper, we present PANORAMA, a state-of-the-art refinement technique that accelerates verification by exploiting the inherent spectral decay of these embeddings. Using PCA to compact signal energy, PANORAMA evaluates candidate distances incrementally, computing at each step a strict lower bound on the full-vector distance and dynamically pruning candidates the moment this bound ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.00566","kind":"arxiv","version":4},"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/2510.00566/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":"2510.00566","created_at":"2026-07-07T00:15:50.102826+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.00566v4","created_at":"2026-07-07T00:15:50.102826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.00566","created_at":"2026-07-07T00:15:50.102826+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6JYF3OJPC2P","created_at":"2026-07-07T00:15:50.102826+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6JYF3OJPC2PHBXY","created_at":"2026-07-07T00:15:50.102826+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6JYF3OJ","created_at":"2026-07-07T00:15:50.102826+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/X6JYF3OJPC2PHBXYTOUNB6TKCY","json":"https://pith.science/pith/X6JYF3OJPC2PHBXYTOUNB6TKCY.json","graph_json":"https://pith.science/api/pith-number/X6JYF3OJPC2PHBXYTOUNB6TKCY/graph.json","events_json":"https://pith.science/api/pith-number/X6JYF3OJPC2PHBXYTOUNB6TKCY/events.json","paper":"https://pith.science/paper/X6JYF3OJ"},"agent_actions":{"view_html":"https://pith.science/pith/X6JYF3OJPC2PHBXYTOUNB6TKCY","download_json":"https://pith.science/pith/X6JYF3OJPC2PHBXYTOUNB6TKCY.json","view_paper":"https://pith.science/paper/X6JYF3OJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.00566&json=true","fetch_graph":"https://pith.science/api/pith-number/X6JYF3OJPC2PHBXYTOUNB6TKCY/graph.json","fetch_events":"https://pith.science/api/pith-number/X6JYF3OJPC2PHBXYTOUNB6TKCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6JYF3OJPC2PHBXYTOUNB6TKCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6JYF3OJPC2PHBXYTOUNB6TKCY/action/storage_attestation","attest_author":"https://pith.science/pith/X6JYF3OJPC2PHBXYTOUNB6TKCY/action/author_attestation","sign_citation":"https://pith.science/pith/X6JYF3OJPC2PHBXYTOUNB6TKCY/action/citation_signature","submit_replication":"https://pith.science/pith/X6JYF3OJPC2PHBXYTOUNB6TKCY/action/replication_record"}},"created_at":"2026-07-07T00:15:50.102826+00:00","updated_at":"2026-07-07T00:15:50.102826+00:00"}