{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6T62EMBXY7NPY3BR2EPQW3UN2P","short_pith_number":"pith:6T62EMBX","schema_version":"1.0","canonical_sha256":"f4fda23037c7dafc6c31d11f0b6e8dd3e3d14f362ecc93edba670310a7ae0454","source":{"kind":"arxiv","id":"2504.13446","version":1},"attestation_state":"computed","paper":{"title":"Approximate Reverse $k$-Ranks Queries in High Dimensions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daichi Amagata, Kazuyoshi Aoyama, Keito Kido, Sumio Fujita","submitted_at":"2025-04-18T03:56:07Z","abstract_excerpt":"Many objects are represented as high-dimensional vectors nowadays. In this setting, the relevance between two objects (vectors) is usually evaluated by their inner product. Recently, item-centric searches, which search for users relevant to query items, have received attention and find important applications, such as product promotion and market analysis. To support these applications, this paper considers reverse $k$-ranks queries. Given a query vector $\\mathbf{q}$, $k$, a set $\\mathbf{U}$ of user vectors, and a set $\\mathbf{P}$ of item vectors, this query retrieves the $k$ user vectors $\\mat"},"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":"2504.13446","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2025-04-18T03:56:07Z","cross_cats_sorted":[],"title_canon_sha256":"f9257c5b78924059f7ba11d51a2006115a47a9e4b833e06bfa6a5583464335e9","abstract_canon_sha256":"cc73deb663d61e5fe38de6f482de563c6e811533a02e487a18b74855a6360d58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:50:54.988065Z","signature_b64":"6qaMtZyN4eLeOYVazzd89ek1hxPSWJ1wyDQKoQpfhSRZFERem4uGVW7i4PXcJjg3NuzADIFQerj1Pexjoa5eBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4fda23037c7dafc6c31d11f0b6e8dd3e3d14f362ecc93edba670310a7ae0454","last_reissued_at":"2026-07-05T10:50:54.987419Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:50:54.987419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Reverse $k$-Ranks Queries in High Dimensions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daichi Amagata, Kazuyoshi Aoyama, Keito Kido, Sumio Fujita","submitted_at":"2025-04-18T03:56:07Z","abstract_excerpt":"Many objects are represented as high-dimensional vectors nowadays. In this setting, the relevance between two objects (vectors) is usually evaluated by their inner product. Recently, item-centric searches, which search for users relevant to query items, have received attention and find important applications, such as product promotion and market analysis. To support these applications, this paper considers reverse $k$-ranks queries. Given a query vector $\\mathbf{q}$, $k$, a set $\\mathbf{U}$ of user vectors, and a set $\\mathbf{P}$ of item vectors, this query retrieves the $k$ user vectors $\\mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.13446","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/2504.13446/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":"2504.13446","created_at":"2026-07-05T10:50:54.987494+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.13446v1","created_at":"2026-07-05T10:50:54.987494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.13446","created_at":"2026-07-05T10:50:54.987494+00:00"},{"alias_kind":"pith_short_12","alias_value":"6T62EMBXY7NP","created_at":"2026-07-05T10:50:54.987494+00:00"},{"alias_kind":"pith_short_16","alias_value":"6T62EMBXY7NPY3BR","created_at":"2026-07-05T10:50:54.987494+00:00"},{"alias_kind":"pith_short_8","alias_value":"6T62EMBX","created_at":"2026-07-05T10:50:54.987494+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/6T62EMBXY7NPY3BR2EPQW3UN2P","json":"https://pith.science/pith/6T62EMBXY7NPY3BR2EPQW3UN2P.json","graph_json":"https://pith.science/api/pith-number/6T62EMBXY7NPY3BR2EPQW3UN2P/graph.json","events_json":"https://pith.science/api/pith-number/6T62EMBXY7NPY3BR2EPQW3UN2P/events.json","paper":"https://pith.science/paper/6T62EMBX"},"agent_actions":{"view_html":"https://pith.science/pith/6T62EMBXY7NPY3BR2EPQW3UN2P","download_json":"https://pith.science/pith/6T62EMBXY7NPY3BR2EPQW3UN2P.json","view_paper":"https://pith.science/paper/6T62EMBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.13446&json=true","fetch_graph":"https://pith.science/api/pith-number/6T62EMBXY7NPY3BR2EPQW3UN2P/graph.json","fetch_events":"https://pith.science/api/pith-number/6T62EMBXY7NPY3BR2EPQW3UN2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6T62EMBXY7NPY3BR2EPQW3UN2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6T62EMBXY7NPY3BR2EPQW3UN2P/action/storage_attestation","attest_author":"https://pith.science/pith/6T62EMBXY7NPY3BR2EPQW3UN2P/action/author_attestation","sign_citation":"https://pith.science/pith/6T62EMBXY7NPY3BR2EPQW3UN2P/action/citation_signature","submit_replication":"https://pith.science/pith/6T62EMBXY7NPY3BR2EPQW3UN2P/action/replication_record"}},"created_at":"2026-07-05T10:50:54.987494+00:00","updated_at":"2026-07-05T10:50:54.987494+00:00"}