{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HOOHIM5XGCVQ2JY6UQ54MEYFBK","short_pith_number":"pith:HOOHIM5X","schema_version":"1.0","canonical_sha256":"3b9c7433b730ab0d271ea43bc613050a96f3ae113120a761be5f6bd5d3b63e27","source":{"kind":"arxiv","id":"2402.13858","version":1},"attestation_state":"computed","paper":{"title":"Diversity-Aware $k$-Maximum Inner Product Search Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.IR","authors_text":"Anthony K. H. Tung, Qiang Huang, Yanhao Wang, Yiqun Sun","submitted_at":"2024-02-21T15:09:51Z","abstract_excerpt":"The $k$-Maximum Inner Product Search ($k$MIPS) serves as a foundational component in recommender systems and various data mining tasks. However, while most existing $k$MIPS approaches prioritize the efficient retrieval of highly relevant items for users, they often neglect an equally pivotal facet of search results: \\emph{diversity}. To bridge this gap, we revisit and refine the diversity-aware $k$MIPS (D$k$MIPS) problem by incorporating two well-known diversity objectives -- minimizing the average and maximum pairwise item similarities within the results -- into the original relevance objecti"},"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":"2402.13858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-02-21T15:09:51Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"292f0fdd5b71a74a2bf14e9384666a193887e43902c235d65058bf014caf7cb3","abstract_canon_sha256":"a04e75822de3da2597756f516a38e1eb6ae2a7c2f10c3e09bb10e13b951ca7fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:47:49.711228Z","signature_b64":"RNJAaor6ewDqkO6Ne7NLWfldx7Ydc7d8luYaqbFpsYWnGwgifvURN0G4Iq/Nd36UcIKG2w6woCBBI+nuYJmuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b9c7433b730ab0d271ea43bc613050a96f3ae113120a761be5f6bd5d3b63e27","last_reissued_at":"2026-07-05T07:47:49.710637Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:47:49.710637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diversity-Aware $k$-Maximum Inner Product Search Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.IR","authors_text":"Anthony K. H. Tung, Qiang Huang, Yanhao Wang, Yiqun Sun","submitted_at":"2024-02-21T15:09:51Z","abstract_excerpt":"The $k$-Maximum Inner Product Search ($k$MIPS) serves as a foundational component in recommender systems and various data mining tasks. However, while most existing $k$MIPS approaches prioritize the efficient retrieval of highly relevant items for users, they often neglect an equally pivotal facet of search results: \\emph{diversity}. To bridge this gap, we revisit and refine the diversity-aware $k$MIPS (D$k$MIPS) problem by incorporating two well-known diversity objectives -- minimizing the average and maximum pairwise item similarities within the results -- into the original relevance objecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.13858","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/2402.13858/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":"2402.13858","created_at":"2026-07-05T07:47:49.710698+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.13858v1","created_at":"2026-07-05T07:47:49.710698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.13858","created_at":"2026-07-05T07:47:49.710698+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOOHIM5XGCVQ","created_at":"2026-07-05T07:47:49.710698+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOOHIM5XGCVQ2JY6","created_at":"2026-07-05T07:47:49.710698+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOOHIM5X","created_at":"2026-07-05T07:47:49.710698+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11864","citing_title":"Very Efficient Listwise Multimodal Reranking for Long Documents","ref_index":77,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HOOHIM5XGCVQ2JY6UQ54MEYFBK","json":"https://pith.science/pith/HOOHIM5XGCVQ2JY6UQ54MEYFBK.json","graph_json":"https://pith.science/api/pith-number/HOOHIM5XGCVQ2JY6UQ54MEYFBK/graph.json","events_json":"https://pith.science/api/pith-number/HOOHIM5XGCVQ2JY6UQ54MEYFBK/events.json","paper":"https://pith.science/paper/HOOHIM5X"},"agent_actions":{"view_html":"https://pith.science/pith/HOOHIM5XGCVQ2JY6UQ54MEYFBK","download_json":"https://pith.science/pith/HOOHIM5XGCVQ2JY6UQ54MEYFBK.json","view_paper":"https://pith.science/paper/HOOHIM5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.13858&json=true","fetch_graph":"https://pith.science/api/pith-number/HOOHIM5XGCVQ2JY6UQ54MEYFBK/graph.json","fetch_events":"https://pith.science/api/pith-number/HOOHIM5XGCVQ2JY6UQ54MEYFBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOOHIM5XGCVQ2JY6UQ54MEYFBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOOHIM5XGCVQ2JY6UQ54MEYFBK/action/storage_attestation","attest_author":"https://pith.science/pith/HOOHIM5XGCVQ2JY6UQ54MEYFBK/action/author_attestation","sign_citation":"https://pith.science/pith/HOOHIM5XGCVQ2JY6UQ54MEYFBK/action/citation_signature","submit_replication":"https://pith.science/pith/HOOHIM5XGCVQ2JY6UQ54MEYFBK/action/replication_record"}},"created_at":"2026-07-05T07:47:49.710698+00:00","updated_at":"2026-07-05T07:47:49.710698+00:00"}