{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HBP53CYJKYIXQA6PZGDFBREAHY","short_pith_number":"pith:HBP53CYJ","schema_version":"1.0","canonical_sha256":"385fdd8b0956117803cfc98650c4803e2e0c3f406d2928e453422e61c4d46671","source":{"kind":"arxiv","id":"2310.14587","version":2},"attestation_state":"computed","paper":{"title":"Large Search Model: Redefining Search Stack in the Era of LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Furu Wei, Liang Wang, Linjun Yang, Nan Yang, Rangan Majumder, Xiaolong Huang","submitted_at":"2023-10-23T05:52:09Z","abstract_excerpt":"Modern search engines are built on a stack of different components, including query understanding, retrieval, multi-stage ranking, and question answering, among others. These components are often optimized and deployed independently. In this paper, we introduce a novel conceptual framework called large search model, which redefines the conventional search stack by unifying search tasks with one large language model (LLM). All tasks are formulated as autoregressive text generation problems, allowing for the customization of tasks through the use of natural language prompts. This proposed framew"},"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":"2310.14587","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-10-23T05:52:09Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"db62670b2d93288056e8c91ba384f956deac1a347c900a6d0ab92ca82d2c3b54","abstract_canon_sha256":"d80d1a307fe6f34ae9b35368ff762decdd888f59e4b4fc23a80b560d2adad199"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:29.286758Z","signature_b64":"zhLfAsnA2imzJ2/+2wTkXCHdiMSvJWtjQ/dW1V+3FtYYEH4lUF8jCRqxfi74gQO9qA5yARKr/h3uh5vAYg5QAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"385fdd8b0956117803cfc98650c4803e2e0c3f406d2928e453422e61c4d46671","last_reissued_at":"2026-07-05T07:29:29.286118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:29.286118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Search Model: Redefining Search Stack in the Era of LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Furu Wei, Liang Wang, Linjun Yang, Nan Yang, Rangan Majumder, Xiaolong Huang","submitted_at":"2023-10-23T05:52:09Z","abstract_excerpt":"Modern search engines are built on a stack of different components, including query understanding, retrieval, multi-stage ranking, and question answering, among others. These components are often optimized and deployed independently. In this paper, we introduce a novel conceptual framework called large search model, which redefines the conventional search stack by unifying search tasks with one large language model (LLM). All tasks are formulated as autoregressive text generation problems, allowing for the customization of tasks through the use of natural language prompts. This proposed framew"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.14587","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/2310.14587/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":"2310.14587","created_at":"2026-07-05T07:29:29.286189+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.14587v2","created_at":"2026-07-05T07:29:29.286189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.14587","created_at":"2026-07-05T07:29:29.286189+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBP53CYJKYIX","created_at":"2026-07-05T07:29:29.286189+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBP53CYJKYIXQA6P","created_at":"2026-07-05T07:29:29.286189+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBP53CYJ","created_at":"2026-07-05T07:29:29.286189+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22180","citing_title":"ResRank: Unifying Retrieval and Listwise Reranking via End-to-End Joint Training with Residual Passage Compression","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HBP53CYJKYIXQA6PZGDFBREAHY","json":"https://pith.science/pith/HBP53CYJKYIXQA6PZGDFBREAHY.json","graph_json":"https://pith.science/api/pith-number/HBP53CYJKYIXQA6PZGDFBREAHY/graph.json","events_json":"https://pith.science/api/pith-number/HBP53CYJKYIXQA6PZGDFBREAHY/events.json","paper":"https://pith.science/paper/HBP53CYJ"},"agent_actions":{"view_html":"https://pith.science/pith/HBP53CYJKYIXQA6PZGDFBREAHY","download_json":"https://pith.science/pith/HBP53CYJKYIXQA6PZGDFBREAHY.json","view_paper":"https://pith.science/paper/HBP53CYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.14587&json=true","fetch_graph":"https://pith.science/api/pith-number/HBP53CYJKYIXQA6PZGDFBREAHY/graph.json","fetch_events":"https://pith.science/api/pith-number/HBP53CYJKYIXQA6PZGDFBREAHY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBP53CYJKYIXQA6PZGDFBREAHY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBP53CYJKYIXQA6PZGDFBREAHY/action/storage_attestation","attest_author":"https://pith.science/pith/HBP53CYJKYIXQA6PZGDFBREAHY/action/author_attestation","sign_citation":"https://pith.science/pith/HBP53CYJKYIXQA6PZGDFBREAHY/action/citation_signature","submit_replication":"https://pith.science/pith/HBP53CYJKYIXQA6PZGDFBREAHY/action/replication_record"}},"created_at":"2026-07-05T07:29:29.286189+00:00","updated_at":"2026-07-05T07:29:29.286189+00:00"}