{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HGPL7ZA7D56ZUEXE74PEX4FLJX","short_pith_number":"pith:HGPL7ZA7","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"},"canonical_sha256":"399ebfe41f1f7d9a12e4ff1e4bf0ab4dce8b506272a1f321846b42aec12297a5","source":{"kind":"arxiv","id":"1704.03970","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03970","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03970v2","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03970","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"pith_short_12","alias_value":"HGPL7ZA7D56Z","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGPL7ZA7D56ZUEXE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGPL7ZA7","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HGPL7ZA7D56ZUEXE74PEX4FLJX","target":"record","payload":{"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"},"canonical_sha256":"399ebfe41f1f7d9a12e4ff1e4bf0ab4dce8b506272a1f321846b42aec12297a5","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"},"source_kind":"arxiv","source_id":"1704.03970","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxAE8zA/G4ZXMmXDnIF5q26vGIBY2VsC2sDOCRpuT5xiT4AxLzFbb9kI1oYVsfMM1sRO1NqH4APVJopiWrCfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:10:08.395201Z"},"content_sha256":"67607faa51786d2de86bc7a374e5d7d7a26fff184ef9b4e777a72356ea028cb1","schema_version":"1.0","event_id":"sha256:67607faa51786d2de86bc7a374e5d7d7a26fff184ef9b4e777a72356ea028cb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HGPL7ZA7D56ZUEXE74PEX4FLJX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVt3c5ks4e5uS47odCGDvAUu9KofYZZ4qRF10sEzLmGg/mo53kpuWKmAdCW49Lu53uGzczk2b/u6ToDtbPm6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:10:08.395564Z"},"content_sha256":"2d872e116c9571c894f8923bd952f9e68b8ed6fdadc6b5ef310653833f09d384","schema_version":"1.0","event_id":"sha256:2d872e116c9571c894f8923bd952f9e68b8ed6fdadc6b5ef310653833f09d384"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX/bundle.json","state_url":"https://pith.science/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T16:10:08Z","links":{"resolver":"https://pith.science/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX","bundle":"https://pith.science/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX/bundle.json","state":"https://pith.science/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGPL7ZA7D56ZUEXE74PEX4FLJX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HGPL7ZA7D56ZUEXE74PEX4FLJX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d7608304e2d064aeb08bfe9f0cc00c4ee0a4dcce4555876e2f9fb675aa5ae512","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-04-13T02:09:37Z","title_canon_sha256":"4d7de0d39185c86c539e5171435882ec1cef0b03a4b4f1139ff8747559bb7be4"},"schema_version":"1.0","source":{"id":"1704.03970","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03970","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03970v2","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03970","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"pith_short_12","alias_value":"HGPL7ZA7D56Z","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGPL7ZA7D56ZUEXE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGPL7ZA7","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:2d872e116c9571c894f8923bd952f9e68b8ed6fdadc6b5ef310653833f09d384","target":"graph","created_at":"2026-05-18T00:28:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Charles L. A. Clarke, Jimmy Lin, Joel Mackenzie, J. Shane Culpepper, Matt Crane, Roi Blanco","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-04-13T02:09:37Z","title":"Efficient and Effective Tail Latency Minimization in Multi-Stage Retrieval Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03970","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:67607faa51786d2de86bc7a374e5d7d7a26fff184ef9b4e777a72356ea028cb1","target":"record","created_at":"2026-05-18T00:28:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d7608304e2d064aeb08bfe9f0cc00c4ee0a4dcce4555876e2f9fb675aa5ae512","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-04-13T02:09:37Z","title_canon_sha256":"4d7de0d39185c86c539e5171435882ec1cef0b03a4b4f1139ff8747559bb7be4"},"schema_version":"1.0","source":{"id":"1704.03970","kind":"arxiv","version":2}},"canonical_sha256":"399ebfe41f1f7d9a12e4ff1e4bf0ab4dce8b506272a1f321846b42aec12297a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"399ebfe41f1f7d9a12e4ff1e4bf0ab4dce8b506272a1f321846b42aec12297a5","first_computed_at":"2026-05-18T00:28:25.508971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:25.508971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o7WDkpasFgh/W2Pjk1PD69hG8coToN+EKaMDs4BMvf3dtNoq831R+G/LqC1dnMQyTxlxg9gN/zRmLAbWJJosAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:25.509646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03970","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67607faa51786d2de86bc7a374e5d7d7a26fff184ef9b4e777a72356ea028cb1","sha256:2d872e116c9571c894f8923bd952f9e68b8ed6fdadc6b5ef310653833f09d384"],"state_sha256":"888242726258ef724b79f2a2e35503247a379f6341ab7003675c92fd3cb37bf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUxhKYYxA2YWa7brrknYNnvkZoB728xLRW1KB/99stmrvdilHw4zV/PCSdHAK2srgTWmvPmjiVJi2HSlWydpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T16:10:08.397524Z","bundle_sha256":"725141af30bbcaf57e0f23129e3a18a9563c737d8dad5ab121d874ce0e7a9025"}}