{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7YAZVFIHKKDDYEAU7GAAJ4ESBY","short_pith_number":"pith:7YAZVFIH","schema_version":"1.0","canonical_sha256":"fe019a950752863c1014f98004f0920e1a614c691233a748d2f3a2a2181192da","source":{"kind":"arxiv","id":"2304.04918","version":2},"attestation_state":"computed","paper":{"title":"Explicit and Implicit Semantic Ranking Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Cheng Wu, Eric Clausen-Brown, Gord Lueck, Matthew Calderwood, Thomas Lin, Vishal Anand, Wen-wai Yim, Xiaofeng Zhu","submitted_at":"2023-04-11T01:10:49Z","abstract_excerpt":"The core challenge in numerous real-world applications is to match an inquiry to the best document from a mutable and finite set of candidates. Existing industry solutions, especially latency-constrained services, often rely on similarity algorithms that sacrifice quality for speed. In this paper we introduce a generic semantic learning-to-rank framework, Self-training Semantic Cross-attention Ranking (sRank). This transformer-based framework uses linear pairwise loss with mutable training batch sizes and achieves quality gains and high efficiency, and has been applied effectively to show gain"},"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":"2304.04918","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-04-11T01:10:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"923c25e2b926acaae6d15ae1992e10928db5861d8fd77d7895806d70b3c1e9ab","abstract_canon_sha256":"0f5c4c294109d63d7ba77c7285c836a6be8ecef3c180e0d3b12f2a9f558aae85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:08.816897Z","signature_b64":"izyS1QeGI3Ft/PhCaUamqC99H7yjhU4kL+hdMYhh9pWInjiz6Tq3EnP5iqklQH0da5yLea8FAzrP91VN/ROwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe019a950752863c1014f98004f0920e1a614c691233a748d2f3a2a2181192da","last_reissued_at":"2026-07-05T09:34:08.816420Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:08.816420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit and Implicit Semantic Ranking Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Cheng Wu, Eric Clausen-Brown, Gord Lueck, Matthew Calderwood, Thomas Lin, Vishal Anand, Wen-wai Yim, Xiaofeng Zhu","submitted_at":"2023-04-11T01:10:49Z","abstract_excerpt":"The core challenge in numerous real-world applications is to match an inquiry to the best document from a mutable and finite set of candidates. Existing industry solutions, especially latency-constrained services, often rely on similarity algorithms that sacrifice quality for speed. In this paper we introduce a generic semantic learning-to-rank framework, Self-training Semantic Cross-attention Ranking (sRank). This transformer-based framework uses linear pairwise loss with mutable training batch sizes and achieves quality gains and high efficiency, and has been applied effectively to show gain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.04918","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/2304.04918/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":"2304.04918","created_at":"2026-07-05T09:34:08.816481+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.04918v2","created_at":"2026-07-05T09:34:08.816481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.04918","created_at":"2026-07-05T09:34:08.816481+00:00"},{"alias_kind":"pith_short_12","alias_value":"7YAZVFIHKKDD","created_at":"2026-07-05T09:34:08.816481+00:00"},{"alias_kind":"pith_short_16","alias_value":"7YAZVFIHKKDDYEAU","created_at":"2026-07-05T09:34:08.816481+00:00"},{"alias_kind":"pith_short_8","alias_value":"7YAZVFIH","created_at":"2026-07-05T09:34:08.816481+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/7YAZVFIHKKDDYEAU7GAAJ4ESBY","json":"https://pith.science/pith/7YAZVFIHKKDDYEAU7GAAJ4ESBY.json","graph_json":"https://pith.science/api/pith-number/7YAZVFIHKKDDYEAU7GAAJ4ESBY/graph.json","events_json":"https://pith.science/api/pith-number/7YAZVFIHKKDDYEAU7GAAJ4ESBY/events.json","paper":"https://pith.science/paper/7YAZVFIH"},"agent_actions":{"view_html":"https://pith.science/pith/7YAZVFIHKKDDYEAU7GAAJ4ESBY","download_json":"https://pith.science/pith/7YAZVFIHKKDDYEAU7GAAJ4ESBY.json","view_paper":"https://pith.science/paper/7YAZVFIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.04918&json=true","fetch_graph":"https://pith.science/api/pith-number/7YAZVFIHKKDDYEAU7GAAJ4ESBY/graph.json","fetch_events":"https://pith.science/api/pith-number/7YAZVFIHKKDDYEAU7GAAJ4ESBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7YAZVFIHKKDDYEAU7GAAJ4ESBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7YAZVFIHKKDDYEAU7GAAJ4ESBY/action/storage_attestation","attest_author":"https://pith.science/pith/7YAZVFIHKKDDYEAU7GAAJ4ESBY/action/author_attestation","sign_citation":"https://pith.science/pith/7YAZVFIHKKDDYEAU7GAAJ4ESBY/action/citation_signature","submit_replication":"https://pith.science/pith/7YAZVFIHKKDDYEAU7GAAJ4ESBY/action/replication_record"}},"created_at":"2026-07-05T09:34:08.816481+00:00","updated_at":"2026-07-05T09:34:08.816481+00:00"}