{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3HGVGS4WJ2UCASOYI47JCNQGOK","short_pith_number":"pith:3HGVGS4W","canonical_record":{"source":{"id":"1610.02502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-08T08:59:03Z","cross_cats_sorted":[],"title_canon_sha256":"1e15e64ff75f1055e8cfa176b67cb75678a0505ef6aaa18ec51edef6a1549bc8","abstract_canon_sha256":"6d40b6fb0226fe9980d5d282277d3c51f739ac84a7133efedc3ce5828e364233"},"schema_version":"1.0"},"canonical_sha256":"d9cd534b964ea82049d8473e91360672a9c8e7df9e041bafec82897ec26e819c","source":{"kind":"arxiv","id":"1610.02502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02502","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02502v1","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02502","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"pith_short_12","alias_value":"3HGVGS4WJ2UC","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3HGVGS4WJ2UCASOY","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3HGVGS4W","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3HGVGS4WJ2UCASOYI47JCNQGOK","target":"record","payload":{"canonical_record":{"source":{"id":"1610.02502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-08T08:59:03Z","cross_cats_sorted":[],"title_canon_sha256":"1e15e64ff75f1055e8cfa176b67cb75678a0505ef6aaa18ec51edef6a1549bc8","abstract_canon_sha256":"6d40b6fb0226fe9980d5d282277d3c51f739ac84a7133efedc3ce5828e364233"},"schema_version":"1.0"},"canonical_sha256":"d9cd534b964ea82049d8473e91360672a9c8e7df9e041bafec82897ec26e819c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:51.352578Z","signature_b64":"aiRu6vonfCK1g10JjZCUqgnk10qul6ZtnCsvitzO86hbSPBhb8dr8LM+zO9o+wWTwFZVutEZCHY58GhBNiztDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9cd534b964ea82049d8473e91360672a9c8e7df9e041bafec82897ec26e819c","last_reissued_at":"2026-05-18T01:02:51.352030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:51.352030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.02502","source_version":1,"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-18T01:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OmV/I+gv/X5BFuKk+74IrXE3H7yRtl2vOhaqz8bHlpNwLc6vkhy+kYu75SRr1WF/ygCpBxKIrmF28z36Zj4JAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:17:21.677742Z"},"content_sha256":"f1d0abe69182377bbc3cc21ca16072fb232a473128424376c879e66b953b0e3c","schema_version":"1.0","event_id":"sha256:f1d0abe69182377bbc3cc21ca16072fb232a473128424376c879e66b953b0e3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3HGVGS4WJ2UCASOYI47JCNQGOK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Trade-Off Prediction 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, J. Shane Culpepper","submitted_at":"2016-10-08T08:59:03Z","abstract_excerpt":"Modern multi-stage retrieval systems are comprised of a candidate generation stage followed by one or more reranking stages. In such an architecture, the quality of the final ranked list may not be sensitive to the quality of initial candidate pool, especially in terms of early precision. This provides several opportunities to increase retrieval efficiency without significantly sacrificing effectiveness. In this paper, we explore a new approach to dynamically predicting two different parameters in the candidate generation stage which can directly affect the overall efficiency and effectiveness"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02502","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":""},"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-18T01:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2ukubJrZNz3VUz8VUcr2xJCRymFtfPhJj1Mh5ti3y6AmG4dZbKlJdsozgqI8o6tOH08K+NZnmtA214IZAipBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:17:21.678287Z"},"content_sha256":"9655d0102ea9a8e07e3b34d2bee7738488fee25691cd4fbb1336317aee36de9d","schema_version":"1.0","event_id":"sha256:9655d0102ea9a8e07e3b34d2bee7738488fee25691cd4fbb1336317aee36de9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HGVGS4WJ2UCASOYI47JCNQGOK/bundle.json","state_url":"https://pith.science/pith/3HGVGS4WJ2UCASOYI47JCNQGOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HGVGS4WJ2UCASOYI47JCNQGOK/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-03T21:17:21Z","links":{"resolver":"https://pith.science/pith/3HGVGS4WJ2UCASOYI47JCNQGOK","bundle":"https://pith.science/pith/3HGVGS4WJ2UCASOYI47JCNQGOK/bundle.json","state":"https://pith.science/pith/3HGVGS4WJ2UCASOYI47JCNQGOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HGVGS4WJ2UCASOYI47JCNQGOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3HGVGS4WJ2UCASOYI47JCNQGOK","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":"6d40b6fb0226fe9980d5d282277d3c51f739ac84a7133efedc3ce5828e364233","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-08T08:59:03Z","title_canon_sha256":"1e15e64ff75f1055e8cfa176b67cb75678a0505ef6aaa18ec51edef6a1549bc8"},"schema_version":"1.0","source":{"id":"1610.02502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02502","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02502v1","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02502","created_at":"2026-05-18T01:02:51Z"},{"alias_kind":"pith_short_12","alias_value":"3HGVGS4WJ2UC","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3HGVGS4WJ2UCASOY","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3HGVGS4W","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:9655d0102ea9a8e07e3b34d2bee7738488fee25691cd4fbb1336317aee36de9d","target":"graph","created_at":"2026-05-18T01:02:51Z","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":"Modern multi-stage retrieval systems are comprised of a candidate generation stage followed by one or more reranking stages. In such an architecture, the quality of the final ranked list may not be sensitive to the quality of initial candidate pool, especially in terms of early precision. This provides several opportunities to increase retrieval efficiency without significantly sacrificing effectiveness. In this paper, we explore a new approach to dynamically predicting two different parameters in the candidate generation stage which can directly affect the overall efficiency and effectiveness","authors_text":"Charles L. A. Clarke, Jimmy Lin, J. Shane Culpepper","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-08T08:59:03Z","title":"Dynamic Trade-Off Prediction in Multi-Stage Retrieval Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02502","kind":"arxiv","version":1},"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:f1d0abe69182377bbc3cc21ca16072fb232a473128424376c879e66b953b0e3c","target":"record","created_at":"2026-05-18T01:02:51Z","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":"6d40b6fb0226fe9980d5d282277d3c51f739ac84a7133efedc3ce5828e364233","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-08T08:59:03Z","title_canon_sha256":"1e15e64ff75f1055e8cfa176b67cb75678a0505ef6aaa18ec51edef6a1549bc8"},"schema_version":"1.0","source":{"id":"1610.02502","kind":"arxiv","version":1}},"canonical_sha256":"d9cd534b964ea82049d8473e91360672a9c8e7df9e041bafec82897ec26e819c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9cd534b964ea82049d8473e91360672a9c8e7df9e041bafec82897ec26e819c","first_computed_at":"2026-05-18T01:02:51.352030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:51.352030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aiRu6vonfCK1g10JjZCUqgnk10qul6ZtnCsvitzO86hbSPBhb8dr8LM+zO9o+wWTwFZVutEZCHY58GhBNiztDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:51.352578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1d0abe69182377bbc3cc21ca16072fb232a473128424376c879e66b953b0e3c","sha256:9655d0102ea9a8e07e3b34d2bee7738488fee25691cd4fbb1336317aee36de9d"],"state_sha256":"be4ba823423e7e534c9720e6963bcf2d68a598ad520223e05a97b339da6046aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nvfkuPl+HBPJusqaEsMnaGr+u9KRK8HzCM06jNH6/XORJ3+xDrHz1ZS5f2/kBycTxCYnyC2HNk/NOJS+xwy6AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:17:21.681024Z","bundle_sha256":"76fef5bfe90d6e99d6c17e10d4c7a60a08b9ffa3d88fd472d7b6495a346bbad6"}}