{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HGPL7ZA7D56ZUEXE74PEX4FLJX","short_pith_number":"pith:HGPL7ZA7","schema_version":"1.0","canonical_sha256":"399ebfe41f1f7d9a12e4ff1e4bf0ab4dce8b506272a1f321846b42aec12297a5","source":{"kind":"arxiv","id":"1704.03970","version":2},"attestation_state":"computed","paper":{"title":"Efficient and Effective Tail Latency Minimization in Multi-Stage Retrieval Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Charles L. A. Clarke, Jimmy Lin, Joel Mackenzie, J. Shane Culpepper, Matt Crane, Roi Blanco","submitted_at":"2017-04-13T02:09:37Z","abstract_excerpt":"Scalable web search systems typically employ multi-stage retrieval architectures, where an initial stage generates a set of candidate documents that are then pruned and re-ranked. Since subsequent stages typically exploit a multitude of features of varying costs using machine-learned models, reducing the number of documents that are considered at each stage improves latency. In this work, we propose and validate a unified framework that can be used to predict a wide range of performance-sensitive parameters which minimize effectiveness loss, while simultaneously minimizing query latency, acros"},"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":"1704.03970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-04-13T02:09:37Z","cross_cats_sorted":[],"title_canon_sha256":"4d7de0d39185c86c539e5171435882ec1cef0b03a4b4f1139ff8747559bb7be4","abstract_canon_sha256":"d7608304e2d064aeb08bfe9f0cc00c4ee0a4dcce4555876e2f9fb675aa5ae512"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:25.509646Z","signature_b64":"o7WDkpasFgh/W2Pjk1PD69hG8coToN+EKaMDs4BMvf3dtNoq831R+G/LqC1dnMQyTxlxg9gN/zRmLAbWJJosAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"399ebfe41f1f7d9a12e4ff1e4bf0ab4dce8b506272a1f321846b42aec12297a5","last_reissued_at":"2026-05-18T00:28:25.508971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:25.508971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient and Effective Tail Latency Minimization in Multi-Stage Retrieval Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Charles L. A. Clarke, Jimmy Lin, Joel Mackenzie, J. Shane Culpepper, Matt Crane, Roi Blanco","submitted_at":"2017-04-13T02:09:37Z","abstract_excerpt":"Scalable web search systems typically employ multi-stage retrieval architectures, where an initial stage generates a set of candidate documents that are then pruned and re-ranked. Since subsequent stages typically exploit a multitude of features of varying costs using machine-learned models, reducing the number of documents that are considered at each stage improves latency. In this work, we propose and validate a unified framework that can be used to predict a wide range of performance-sensitive parameters which minimize effectiveness loss, while simultaneously minimizing query latency, acros"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03970","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":""},"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":"1704.03970","created_at":"2026-05-18T00:28:25.509057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03970v2","created_at":"2026-05-18T00:28:25.509057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03970","created_at":"2026-05-18T00:28:25.509057+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGPL7ZA7D56Z","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGPL7ZA7D56ZUEXE","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGPL7ZA7","created_at":"2026-05-18T12:31:18.294218+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/HGPL7ZA7D56ZUEXE74PEX4FLJX","json":"https://pith.science/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX.json","graph_json":"https://pith.science/api/pith-number/HGPL7ZA7D56ZUEXE74PEX4FLJX/graph.json","events_json":"https://pith.science/api/pith-number/HGPL7ZA7D56ZUEXE74PEX4FLJX/events.json","paper":"https://pith.science/paper/HGPL7ZA7"},"agent_actions":{"view_html":"https://pith.science/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX","download_json":"https://pith.science/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX.json","view_paper":"https://pith.science/paper/HGPL7ZA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03970&json=true","fetch_graph":"https://pith.science/api/pith-number/HGPL7ZA7D56ZUEXE74PEX4FLJX/graph.json","fetch_events":"https://pith.science/api/pith-number/HGPL7ZA7D56ZUEXE74PEX4FLJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX/action/storage_attestation","attest_author":"https://pith.science/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX/action/author_attestation","sign_citation":"https://pith.science/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX/action/citation_signature","submit_replication":"https://pith.science/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX/action/replication_record"}},"created_at":"2026-05-18T00:28:25.509057+00:00","updated_at":"2026-05-18T00:28:25.509057+00:00"}