{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PRLAXTR4VHV5GTAG7SBBZXMHKP","short_pith_number":"pith:PRLAXTR4","canonical_record":{"source":{"id":"1608.00788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-08-02T12:29:36Z","cross_cats_sorted":[],"title_canon_sha256":"9f4d9eba099d2834b1762cbefc832b1bd1e517a4a4a4047cd3a671b0da80d7e2","abstract_canon_sha256":"8809b0321280026155dcb4273dcb0e654c29837df5f4fc490eee16ecb59138b5"},"schema_version":"1.0"},"canonical_sha256":"7c560bce3ca9ebd34c06fc821cdd8753fea3d5d74b458b0c07ba45644221905e","source":{"kind":"arxiv","id":"1608.00788","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00788","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00788v1","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00788","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"pith_short_12","alias_value":"PRLAXTR4VHV5","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PRLAXTR4VHV5GTAG","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PRLAXTR4","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PRLAXTR4VHV5GTAG7SBBZXMHKP","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-08-02T12:29:36Z","cross_cats_sorted":[],"title_canon_sha256":"9f4d9eba099d2834b1762cbefc832b1bd1e517a4a4a4047cd3a671b0da80d7e2","abstract_canon_sha256":"8809b0321280026155dcb4273dcb0e654c29837df5f4fc490eee16ecb59138b5"},"schema_version":"1.0"},"canonical_sha256":"7c560bce3ca9ebd34c06fc821cdd8753fea3d5d74b458b0c07ba45644221905e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:00.999130Z","signature_b64":"xijTzjd8PKqrhaOmryWxBLwY3+OEWOhNZjkJSb456xd0Evvlp9x3gO0io1CQOjMVqy98ECTW2ZHx8dowEMsvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c560bce3ca9ebd34c06fc821cdd8753fea3d5d74b458b0c07ba45644221905e","last_reissued_at":"2026-05-18T01:10:00.998550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:00.998550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00788","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:10:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0/hhNL2aq9w6LlHZBU3bUAG1rCB/EAXFsV3PGqzmY/s30VfvCi66z1FXCNOqb+Gwp93zktJ1S+DqYApPPp/bBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:28:00.186498Z"},"content_sha256":"90f228c63e9ac47dd3adf6c63b1e127dc08f187e908a08fb5a3fefa91617eba4","schema_version":"1.0","event_id":"sha256:90f228c63e9ac47dd3adf6c63b1e127dc08f187e908a08fb5a3fefa91617eba4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PRLAXTR4VHV5GTAG7SBBZXMHKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Multileaving Algorithm for Online Ranker Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Brian Brost, Christina Lioma, Ingemar J. Cox, Yevgeny Seldin","submitted_at":"2016-08-02T12:29:36Z","abstract_excerpt":"Online ranker evaluation is a key challenge in information retrieval. An important task in the online evaluation of rankers is using implicit user feedback for inferring preferences between rankers. Interleaving methods have been found to be efficient and sensitive, i.e. they can quickly detect even small differences in quality. It has recently been shown that multileaving methods exhibit similar sensitivity but can be more efficient than interleaving methods. This paper presents empirical results demonstrating that existing multileaving methods either do not scale well with the number of rank"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00788","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:10:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f9uiCMuh732B/smaur7k+bluYlX5iH46RKBIzOdBNglObRHVuzeHkTeR1mxGdfVyi3C+3P4pu6/JGBBslDzsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:28:00.186875Z"},"content_sha256":"93d837494addc8ca8788dbbf745b20e0087e8d2cd9bd9263505f6000bc78d2b9","schema_version":"1.0","event_id":"sha256:93d837494addc8ca8788dbbf745b20e0087e8d2cd9bd9263505f6000bc78d2b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PRLAXTR4VHV5GTAG7SBBZXMHKP/bundle.json","state_url":"https://pith.science/pith/PRLAXTR4VHV5GTAG7SBBZXMHKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PRLAXTR4VHV5GTAG7SBBZXMHKP/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-05-27T10:28:00Z","links":{"resolver":"https://pith.science/pith/PRLAXTR4VHV5GTAG7SBBZXMHKP","bundle":"https://pith.science/pith/PRLAXTR4VHV5GTAG7SBBZXMHKP/bundle.json","state":"https://pith.science/pith/PRLAXTR4VHV5GTAG7SBBZXMHKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PRLAXTR4VHV5GTAG7SBBZXMHKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PRLAXTR4VHV5GTAG7SBBZXMHKP","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":"8809b0321280026155dcb4273dcb0e654c29837df5f4fc490eee16ecb59138b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-08-02T12:29:36Z","title_canon_sha256":"9f4d9eba099d2834b1762cbefc832b1bd1e517a4a4a4047cd3a671b0da80d7e2"},"schema_version":"1.0","source":{"id":"1608.00788","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00788","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00788v1","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00788","created_at":"2026-05-18T01:10:00Z"},{"alias_kind":"pith_short_12","alias_value":"PRLAXTR4VHV5","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PRLAXTR4VHV5GTAG","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PRLAXTR4","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:93d837494addc8ca8788dbbf745b20e0087e8d2cd9bd9263505f6000bc78d2b9","target":"graph","created_at":"2026-05-18T01:10:00Z","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":"Online ranker evaluation is a key challenge in information retrieval. An important task in the online evaluation of rankers is using implicit user feedback for inferring preferences between rankers. Interleaving methods have been found to be efficient and sensitive, i.e. they can quickly detect even small differences in quality. It has recently been shown that multileaving methods exhibit similar sensitivity but can be more efficient than interleaving methods. This paper presents empirical results demonstrating that existing multileaving methods either do not scale well with the number of rank","authors_text":"Brian Brost, Christina Lioma, Ingemar J. Cox, Yevgeny Seldin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-08-02T12:29:36Z","title":"An Improved Multileaving Algorithm for Online Ranker Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00788","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:90f228c63e9ac47dd3adf6c63b1e127dc08f187e908a08fb5a3fefa91617eba4","target":"record","created_at":"2026-05-18T01:10:00Z","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":"8809b0321280026155dcb4273dcb0e654c29837df5f4fc490eee16ecb59138b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-08-02T12:29:36Z","title_canon_sha256":"9f4d9eba099d2834b1762cbefc832b1bd1e517a4a4a4047cd3a671b0da80d7e2"},"schema_version":"1.0","source":{"id":"1608.00788","kind":"arxiv","version":1}},"canonical_sha256":"7c560bce3ca9ebd34c06fc821cdd8753fea3d5d74b458b0c07ba45644221905e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c560bce3ca9ebd34c06fc821cdd8753fea3d5d74b458b0c07ba45644221905e","first_computed_at":"2026-05-18T01:10:00.998550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:00.998550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xijTzjd8PKqrhaOmryWxBLwY3+OEWOhNZjkJSb456xd0Evvlp9x3gO0io1CQOjMVqy98ECTW2ZHx8dowEMsvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:00.999130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00788","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90f228c63e9ac47dd3adf6c63b1e127dc08f187e908a08fb5a3fefa91617eba4","sha256:93d837494addc8ca8788dbbf745b20e0087e8d2cd9bd9263505f6000bc78d2b9"],"state_sha256":"9691f67ce4a745415f4f1719d39683bf7d523987b904847b6c3cb08f4753f959"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+TiewULg8XZqONNksUjTJh/Hx3eFGBmJejY3IJwsXmmLHImKxJzluWhRGgnbHSNvCygHucaW4gFHoMXdoaHVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:28:00.189035Z","bundle_sha256":"476d774961cf31e617d36ea05ceeaeff81ce3e67d6528a7fe2335cdf940f6423"}}