{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VBXBG2E4SJY6MJ34SYRF3AWZPQ","short_pith_number":"pith:VBXBG2E4","schema_version":"1.0","canonical_sha256":"a86e13689c9271e6277c96225d82d97c1733a9c3781634c103e4726f0de42a96","source":{"kind":"arxiv","id":"2506.19743","version":1},"attestation_state":"computed","paper":{"title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Constantin Orasan, Diptesh Kanojia, Hadeel Saadany, Samarth Agrawal, Shenbin Qian, Swapnil Bhosale, Zhe Wu","submitted_at":"2025-06-24T16:02:02Z","abstract_excerpt":"E-commerce information retrieval (IR) systems struggle to simultaneously achieve high accuracy in interpreting complex user queries and maintain efficient processing of vast product catalogs. The dual challenge lies in precisely matching user intent with relevant products while managing the computational demands of real-time search across massive inventories. In this paper, we propose a Nested Embedding Approach to product Retrieval and Ranking, called NEAR$^2$, which can achieve up to $12$ times efficiency in embedding size at inference time while introducing no extra cost in training and imp"},"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":"2506.19743","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-06-24T16:02:02Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"f0802a7fc2401597d7a534562d4ae51a8f56096d99fb154f1fafe925690388b3","abstract_canon_sha256":"e04193f71a0d1ff5e6e1cf3308bed5fd8f9dc861313eae93981b3e13187cbd78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:26:37.999426Z","signature_b64":"uf5d03B3xGb1aKoBPTPuOPQPz+vuWoEs7PlBSqh3LG1tyUUTwfCh1itNqfRL2JuQNsDAu+yLVUYJB75jpLStBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a86e13689c9271e6277c96225d82d97c1733a9c3781634c103e4726f0de42a96","last_reissued_at":"2026-07-05T11:26:37.998963Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:26:37.998963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Constantin Orasan, Diptesh Kanojia, Hadeel Saadany, Samarth Agrawal, Shenbin Qian, Swapnil Bhosale, Zhe Wu","submitted_at":"2025-06-24T16:02:02Z","abstract_excerpt":"E-commerce information retrieval (IR) systems struggle to simultaneously achieve high accuracy in interpreting complex user queries and maintain efficient processing of vast product catalogs. The dual challenge lies in precisely matching user intent with relevant products while managing the computational demands of real-time search across massive inventories. In this paper, we propose a Nested Embedding Approach to product Retrieval and Ranking, called NEAR$^2$, which can achieve up to $12$ times efficiency in embedding size at inference time while introducing no extra cost in training and imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.19743","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/2506.19743/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":"2506.19743","created_at":"2026-07-05T11:26:37.999022+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.19743v1","created_at":"2026-07-05T11:26:37.999022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.19743","created_at":"2026-07-05T11:26:37.999022+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBXBG2E4SJY6","created_at":"2026-07-05T11:26:37.999022+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBXBG2E4SJY6MJ34","created_at":"2026-07-05T11:26:37.999022+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBXBG2E4","created_at":"2026-07-05T11:26:37.999022+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07364","citing_title":"Improving Search Suggestions for Alphanumeric Queries","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VBXBG2E4SJY6MJ34SYRF3AWZPQ","json":"https://pith.science/pith/VBXBG2E4SJY6MJ34SYRF3AWZPQ.json","graph_json":"https://pith.science/api/pith-number/VBXBG2E4SJY6MJ34SYRF3AWZPQ/graph.json","events_json":"https://pith.science/api/pith-number/VBXBG2E4SJY6MJ34SYRF3AWZPQ/events.json","paper":"https://pith.science/paper/VBXBG2E4"},"agent_actions":{"view_html":"https://pith.science/pith/VBXBG2E4SJY6MJ34SYRF3AWZPQ","download_json":"https://pith.science/pith/VBXBG2E4SJY6MJ34SYRF3AWZPQ.json","view_paper":"https://pith.science/paper/VBXBG2E4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.19743&json=true","fetch_graph":"https://pith.science/api/pith-number/VBXBG2E4SJY6MJ34SYRF3AWZPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/VBXBG2E4SJY6MJ34SYRF3AWZPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBXBG2E4SJY6MJ34SYRF3AWZPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBXBG2E4SJY6MJ34SYRF3AWZPQ/action/storage_attestation","attest_author":"https://pith.science/pith/VBXBG2E4SJY6MJ34SYRF3AWZPQ/action/author_attestation","sign_citation":"https://pith.science/pith/VBXBG2E4SJY6MJ34SYRF3AWZPQ/action/citation_signature","submit_replication":"https://pith.science/pith/VBXBG2E4SJY6MJ34SYRF3AWZPQ/action/replication_record"}},"created_at":"2026-07-05T11:26:37.999022+00:00","updated_at":"2026-07-05T11:26:37.999022+00:00"}