{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WUHXH3QCPGQAPDTN7CSXCU3KUV","short_pith_number":"pith:WUHXH3QC","canonical_record":{"source":{"id":"1510.08974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-30T05:46:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1378ffbbf69a0c92cd0ea014cc74ee5b142abb799a32f330d8890b8bad631e0b","abstract_canon_sha256":"6fef74378311c2d14aece50ecdb56bff52c0ba35bda8a5a259aadedfb07d3db0"},"schema_version":"1.0"},"canonical_sha256":"b50f73ee0279a0078e6df8a571536aa55939630ef930f723d76d0bb7621be6b1","source":{"kind":"arxiv","id":"1510.08974","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08974","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08974v1","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08974","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"WUHXH3QCPGQA","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WUHXH3QCPGQAPDTN","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WUHXH3QC","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WUHXH3QCPGQAPDTN7CSXCU3KUV","target":"record","payload":{"canonical_record":{"source":{"id":"1510.08974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-30T05:46:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1378ffbbf69a0c92cd0ea014cc74ee5b142abb799a32f330d8890b8bad631e0b","abstract_canon_sha256":"6fef74378311c2d14aece50ecdb56bff52c0ba35bda8a5a259aadedfb07d3db0"},"schema_version":"1.0"},"canonical_sha256":"b50f73ee0279a0078e6df8a571536aa55939630ef930f723d76d0bb7621be6b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:05.804613Z","signature_b64":"4YEOb6EBTk4GjGIEelQSCorb3GPu93biYJ4jjobwMLylul2IF9+GmCC0T2gArdW+YeH14tIOdOBDrceifkYfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b50f73ee0279a0078e6df8a571536aa55939630ef930f723d76d0bb7621be6b1","last_reissued_at":"2026-05-18T01:22:05.804150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:05.804150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.08974","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:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fs2QxYCAcQh3sw/nmNa4edwvHJEKqnZNCwonSQVdrgbqE9x3cjddF61ErVEQ0H2XVu4db3aIjreCg/wn5iq2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:27:12.620489Z"},"content_sha256":"baccc7cdb59c4a2b386fd6cf37e557a9f30abc2da9e42b89dfff6ca289afe56d","schema_version":"1.0","event_id":"sha256:baccc7cdb59c4a2b386fd6cf37e557a9f30abc2da9e42b89dfff6ca289afe56d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WUHXH3QCPGQAPDTN7CSXCU3KUV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CONQUER: Confusion Queried Online Bandit Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Barsky, Koby Crammer","submitted_at":"2015-10-30T05:46:23Z","abstract_excerpt":"We present a new recommendation setting for picking out two items from a given set to be highlighted to a user, based on contextual input. These two items are presented to a user who chooses one of them, possibly stochastically, with a bias that favours the item with the higher value. We propose a second-order algorithm framework that members of it use uses relative upper-confidence bounds to trade off exploration and exploitation, and some explore via sampling. We analyze one algorithm in this framework in an adversarial setting with only mild assumption on the data, and prove a regret bound "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08974","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:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LI5Z82YLM7JxtxKBJpcE6zEJveIitEVNvc0FUb8cIlUjSc/bD52DRPucieiy4D2jwaxrev/HYTwPkEVi/GWFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:27:12.620838Z"},"content_sha256":"a97ce55fb49de608d37e2f4ca71e370e2dabc8d1af931072652fd0a18e79ec21","schema_version":"1.0","event_id":"sha256:a97ce55fb49de608d37e2f4ca71e370e2dabc8d1af931072652fd0a18e79ec21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUHXH3QCPGQAPDTN7CSXCU3KUV/bundle.json","state_url":"https://pith.science/pith/WUHXH3QCPGQAPDTN7CSXCU3KUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUHXH3QCPGQAPDTN7CSXCU3KUV/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-24T05:27:12Z","links":{"resolver":"https://pith.science/pith/WUHXH3QCPGQAPDTN7CSXCU3KUV","bundle":"https://pith.science/pith/WUHXH3QCPGQAPDTN7CSXCU3KUV/bundle.json","state":"https://pith.science/pith/WUHXH3QCPGQAPDTN7CSXCU3KUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUHXH3QCPGQAPDTN7CSXCU3KUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WUHXH3QCPGQAPDTN7CSXCU3KUV","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":"6fef74378311c2d14aece50ecdb56bff52c0ba35bda8a5a259aadedfb07d3db0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-30T05:46:23Z","title_canon_sha256":"1378ffbbf69a0c92cd0ea014cc74ee5b142abb799a32f330d8890b8bad631e0b"},"schema_version":"1.0","source":{"id":"1510.08974","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08974","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08974v1","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08974","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"WUHXH3QCPGQA","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WUHXH3QCPGQAPDTN","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WUHXH3QC","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:a97ce55fb49de608d37e2f4ca71e370e2dabc8d1af931072652fd0a18e79ec21","target":"graph","created_at":"2026-05-18T01:22:05Z","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":"We present a new recommendation setting for picking out two items from a given set to be highlighted to a user, based on contextual input. These two items are presented to a user who chooses one of them, possibly stochastically, with a bias that favours the item with the higher value. We propose a second-order algorithm framework that members of it use uses relative upper-confidence bounds to trade off exploration and exploitation, and some explore via sampling. We analyze one algorithm in this framework in an adversarial setting with only mild assumption on the data, and prove a regret bound ","authors_text":"Daniel Barsky, Koby Crammer","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-30T05:46:23Z","title":"CONQUER: Confusion Queried Online Bandit Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08974","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:baccc7cdb59c4a2b386fd6cf37e557a9f30abc2da9e42b89dfff6ca289afe56d","target":"record","created_at":"2026-05-18T01:22:05Z","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":"6fef74378311c2d14aece50ecdb56bff52c0ba35bda8a5a259aadedfb07d3db0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-30T05:46:23Z","title_canon_sha256":"1378ffbbf69a0c92cd0ea014cc74ee5b142abb799a32f330d8890b8bad631e0b"},"schema_version":"1.0","source":{"id":"1510.08974","kind":"arxiv","version":1}},"canonical_sha256":"b50f73ee0279a0078e6df8a571536aa55939630ef930f723d76d0bb7621be6b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b50f73ee0279a0078e6df8a571536aa55939630ef930f723d76d0bb7621be6b1","first_computed_at":"2026-05-18T01:22:05.804150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:05.804150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4YEOb6EBTk4GjGIEelQSCorb3GPu93biYJ4jjobwMLylul2IF9+GmCC0T2gArdW+YeH14tIOdOBDrceifkYfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:05.804613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08974","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:baccc7cdb59c4a2b386fd6cf37e557a9f30abc2da9e42b89dfff6ca289afe56d","sha256:a97ce55fb49de608d37e2f4ca71e370e2dabc8d1af931072652fd0a18e79ec21"],"state_sha256":"19e5bb5ec941d8e35ddb55b14e1e7cfa466d296a4930a26bcc19e12caaf2d8c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qtiubGK/T0UFLWjlPnxVwh/fzU/OSgzEXhnpYS4XW32bAUzM5LBJzMMzGoamZYDfcSm3xamUHLIpKYEV4Tk2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:27:12.623168Z","bundle_sha256":"726a410c62d1cb0c1a13a6c5d387e7e1a535f0c8f6c08feedfc9bdb29ea75d8c"}}