{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EMU7SOBJI5FDNQYKVLB5G63GTJ","short_pith_number":"pith:EMU7SOBJ","schema_version":"1.0","canonical_sha256":"2329f93829474a36c30aaac3d37b669a48b9fe3485c894a2338b1a7861b911be","source":{"kind":"arxiv","id":"2508.01108","version":2},"attestation_state":"computed","paper":{"title":"Random-Access Ranked Retrieval and Similarity Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.DB"],"primary_cat":"cs.DS","authors_text":"Abolfazl Asudeh, Gautam Das, Mohsen Dehghankar, Raghav Mittal, Suraj Shetiya","submitted_at":"2025-08-01T23:03:42Z","abstract_excerpt":"We extend Random Access, a fundamental operation that enables efficient search and exploration algorithms, to the modern interactive data systems based on Ranked Retrieval and Similarity Search, where orderings are dynamically defined over a high-dimensional feature space. This extension enables efficient solutions for a wide range of applications, from data analytics tools and database systems to recommendation systems and machine learning. We formalize the Random-Access Ranked Retrieval (RAR) problem, and extend it to Similarity Search. Our algorithmic innovations include the development of "},"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":"2508.01108","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-08-01T23:03:42Z","cross_cats_sorted":["cs.CG","cs.DB"],"title_canon_sha256":"812f89da3bdb75dbd42c97cefe74c27cdcffa42df6b1f8947c580107aa8658e1","abstract_canon_sha256":"9cb7dd2f5d2cdd1f9d3c8ef456fba57e81dd7706ed5aee5db3ccac46a17907ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:01.293608Z","signature_b64":"aIhluDStGYrZF5ek8i2fhhgySgM/aGwmnTHqRHfefuEaOvQpuuij7IgQVE2rBMAQFCy9f+lKe+oX4F0r8Ny4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2329f93829474a36c30aaac3d37b669a48b9fe3485c894a2338b1a7861b911be","last_reissued_at":"2026-05-26T02:05:01.292638Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:01.292638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random-Access Ranked Retrieval and Similarity Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.DB"],"primary_cat":"cs.DS","authors_text":"Abolfazl Asudeh, Gautam Das, Mohsen Dehghankar, Raghav Mittal, Suraj Shetiya","submitted_at":"2025-08-01T23:03:42Z","abstract_excerpt":"We extend Random Access, a fundamental operation that enables efficient search and exploration algorithms, to the modern interactive data systems based on Ranked Retrieval and Similarity Search, where orderings are dynamically defined over a high-dimensional feature space. This extension enables efficient solutions for a wide range of applications, from data analytics tools and database systems to recommendation systems and machine learning. We formalize the Random-Access Ranked Retrieval (RAR) problem, and extend it to Similarity Search. Our algorithmic innovations include the development of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.01108","kind":"arxiv","version":2},"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/2508.01108/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":"2508.01108","created_at":"2026-05-26T02:05:01.292767+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.01108v2","created_at":"2026-05-26T02:05:01.292767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.01108","created_at":"2026-05-26T02:05:01.292767+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMU7SOBJI5FD","created_at":"2026-05-26T02:05:01.292767+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMU7SOBJI5FDNQYK","created_at":"2026-05-26T02:05:01.292767+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMU7SOBJ","created_at":"2026-05-26T02:05:01.292767+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/EMU7SOBJI5FDNQYKVLB5G63GTJ","json":"https://pith.science/pith/EMU7SOBJI5FDNQYKVLB5G63GTJ.json","graph_json":"https://pith.science/api/pith-number/EMU7SOBJI5FDNQYKVLB5G63GTJ/graph.json","events_json":"https://pith.science/api/pith-number/EMU7SOBJI5FDNQYKVLB5G63GTJ/events.json","paper":"https://pith.science/paper/EMU7SOBJ"},"agent_actions":{"view_html":"https://pith.science/pith/EMU7SOBJI5FDNQYKVLB5G63GTJ","download_json":"https://pith.science/pith/EMU7SOBJI5FDNQYKVLB5G63GTJ.json","view_paper":"https://pith.science/paper/EMU7SOBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.01108&json=true","fetch_graph":"https://pith.science/api/pith-number/EMU7SOBJI5FDNQYKVLB5G63GTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/EMU7SOBJI5FDNQYKVLB5G63GTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMU7SOBJI5FDNQYKVLB5G63GTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMU7SOBJI5FDNQYKVLB5G63GTJ/action/storage_attestation","attest_author":"https://pith.science/pith/EMU7SOBJI5FDNQYKVLB5G63GTJ/action/author_attestation","sign_citation":"https://pith.science/pith/EMU7SOBJI5FDNQYKVLB5G63GTJ/action/citation_signature","submit_replication":"https://pith.science/pith/EMU7SOBJI5FDNQYKVLB5G63GTJ/action/replication_record"}},"created_at":"2026-05-26T02:05:01.292767+00:00","updated_at":"2026-05-26T02:05:01.292767+00:00"}