{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:IFOWN32NAODG2FDBGYKBWLMLHE","short_pith_number":"pith:IFOWN32N","canonical_record":{"source":{"id":"2110.08057","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-15T12:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"c3b634236a9fe983369ee5f5589296f22885dc613912107c8dca9d6eab15a4a8","abstract_canon_sha256":"dc0d9d1f32bd8ddc2e7df14bdeb59b2fcf26883edcab79f52cb33b71a29bf601"},"schema_version":"1.0"},"canonical_sha256":"415d66ef4d03866d146136141b2d8b39184c7ba4c786aed78a4643f4133cb30b","source":{"kind":"arxiv","id":"2110.08057","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.08057","created_at":"2026-07-05T05:06:52Z"},{"alias_kind":"arxiv_version","alias_value":"2110.08057v3","created_at":"2026-07-05T05:06:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.08057","created_at":"2026-07-05T05:06:52Z"},{"alias_kind":"pith_short_12","alias_value":"IFOWN32NAODG","created_at":"2026-07-05T05:06:52Z"},{"alias_kind":"pith_short_16","alias_value":"IFOWN32NAODG2FDB","created_at":"2026-07-05T05:06:52Z"},{"alias_kind":"pith_short_8","alias_value":"IFOWN32N","created_at":"2026-07-05T05:06:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:IFOWN32NAODG2FDBGYKBWLMLHE","target":"record","payload":{"canonical_record":{"source":{"id":"2110.08057","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-15T12:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"c3b634236a9fe983369ee5f5589296f22885dc613912107c8dca9d6eab15a4a8","abstract_canon_sha256":"dc0d9d1f32bd8ddc2e7df14bdeb59b2fcf26883edcab79f52cb33b71a29bf601"},"schema_version":"1.0"},"canonical_sha256":"415d66ef4d03866d146136141b2d8b39184c7ba4c786aed78a4643f4133cb30b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:52.621247Z","signature_b64":"kdcQknhQB6+6bCfDuI3wcsRtt84hyKy8Vh8lljYVFl6rz20ux6r/zs1NU+E8x4ZKOJxhdSLM4rRf+1kitXpIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"415d66ef4d03866d146136141b2d8b39184c7ba4c786aed78a4643f4133cb30b","last_reissued_at":"2026-07-05T05:06:52.620806Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:52.620806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.08057","source_version":3,"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-07-05T05:06:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4WeoHqWC4QWe/JhMSTtK5OSYQDVsEIsTktMuTqeNuoOWbo0NagHTv+59lQHw7no4WVzZU7GIOimeaZN8+UgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:11:46.586989Z"},"content_sha256":"eac85be19b1ce1c6d1275898c42d37d4dae219caaa6b067e22d7bd6d8cc9ade5","schema_version":"1.0","event_id":"sha256:eac85be19b1ce1c6d1275898c42d37d4dae219caaa6b067e22d7bd6d8cc9ade5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:IFOWN32NAODG2FDBGYKBWLMLHE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost Optimal Batch-Regret Tradeoff for Batch Linear Contextual Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Xiangyang Ji, Yuan Zhou, Zihan Zhang","submitted_at":"2021-10-15T12:32:33Z","abstract_excerpt":"We study the optimal batch-regret tradeoff for batch linear contextual bandits. For any batch number $M$, number of actions $K$, time horizon $T$, and dimension $d$, we provide an algorithm and prove its regret guarantee, which, due to technical reasons, features a two-phase expression as the time horizon $T$ grows. We also prove a lower bound theorem that surprisingly shows the optimality of our two-phase regret upper bound (up to logarithmic factors) in the \\emph{full range} of the problem parameters, therefore establishing the exact batch-regret tradeoff.\n  Compared to the recent work \\cite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.08057","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.08057/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:06:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WzstlLwoZkfezvHvRxZMTxyJiHr73EXAwK6pG9G8iyQFsUIOUoalnbtVXgpTpwR8+9yow3MUITiG0FLoORrtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:11:46.587529Z"},"content_sha256":"0eb6d21bef7ec7ffeed715680242e6caa5224d0261fb9d20dc4acda9e305e711","schema_version":"1.0","event_id":"sha256:0eb6d21bef7ec7ffeed715680242e6caa5224d0261fb9d20dc4acda9e305e711"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFOWN32NAODG2FDBGYKBWLMLHE/bundle.json","state_url":"https://pith.science/pith/IFOWN32NAODG2FDBGYKBWLMLHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFOWN32NAODG2FDBGYKBWLMLHE/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-08-10T19:11:46Z","links":{"resolver":"https://pith.science/pith/IFOWN32NAODG2FDBGYKBWLMLHE","bundle":"https://pith.science/pith/IFOWN32NAODG2FDBGYKBWLMLHE/bundle.json","state":"https://pith.science/pith/IFOWN32NAODG2FDBGYKBWLMLHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFOWN32NAODG2FDBGYKBWLMLHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:IFOWN32NAODG2FDBGYKBWLMLHE","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":"dc0d9d1f32bd8ddc2e7df14bdeb59b2fcf26883edcab79f52cb33b71a29bf601","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-15T12:32:33Z","title_canon_sha256":"c3b634236a9fe983369ee5f5589296f22885dc613912107c8dca9d6eab15a4a8"},"schema_version":"1.0","source":{"id":"2110.08057","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.08057","created_at":"2026-07-05T05:06:52Z"},{"alias_kind":"arxiv_version","alias_value":"2110.08057v3","created_at":"2026-07-05T05:06:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.08057","created_at":"2026-07-05T05:06:52Z"},{"alias_kind":"pith_short_12","alias_value":"IFOWN32NAODG","created_at":"2026-07-05T05:06:52Z"},{"alias_kind":"pith_short_16","alias_value":"IFOWN32NAODG2FDB","created_at":"2026-07-05T05:06:52Z"},{"alias_kind":"pith_short_8","alias_value":"IFOWN32N","created_at":"2026-07-05T05:06:52Z"}],"graph_snapshots":[{"event_id":"sha256:0eb6d21bef7ec7ffeed715680242e6caa5224d0261fb9d20dc4acda9e305e711","target":"graph","created_at":"2026-07-05T05:06:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.08057/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the optimal batch-regret tradeoff for batch linear contextual bandits. For any batch number $M$, number of actions $K$, time horizon $T$, and dimension $d$, we provide an algorithm and prove its regret guarantee, which, due to technical reasons, features a two-phase expression as the time horizon $T$ grows. We also prove a lower bound theorem that surprisingly shows the optimality of our two-phase regret upper bound (up to logarithmic factors) in the \\emph{full range} of the problem parameters, therefore establishing the exact batch-regret tradeoff.\n  Compared to the recent work \\cite","authors_text":"Xiangyang Ji, Yuan Zhou, Zihan Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-15T12:32:33Z","title":"Almost Optimal Batch-Regret Tradeoff for Batch Linear Contextual Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.08057","kind":"arxiv","version":3},"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:eac85be19b1ce1c6d1275898c42d37d4dae219caaa6b067e22d7bd6d8cc9ade5","target":"record","created_at":"2026-07-05T05:06:52Z","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":"dc0d9d1f32bd8ddc2e7df14bdeb59b2fcf26883edcab79f52cb33b71a29bf601","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-15T12:32:33Z","title_canon_sha256":"c3b634236a9fe983369ee5f5589296f22885dc613912107c8dca9d6eab15a4a8"},"schema_version":"1.0","source":{"id":"2110.08057","kind":"arxiv","version":3}},"canonical_sha256":"415d66ef4d03866d146136141b2d8b39184c7ba4c786aed78a4643f4133cb30b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"415d66ef4d03866d146136141b2d8b39184c7ba4c786aed78a4643f4133cb30b","first_computed_at":"2026-07-05T05:06:52.620806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:06:52.620806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kdcQknhQB6+6bCfDuI3wcsRtt84hyKy8Vh8lljYVFl6rz20ux6r/zs1NU+E8x4ZKOJxhdSLM4rRf+1kitXpIAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:06:52.621247Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.08057","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eac85be19b1ce1c6d1275898c42d37d4dae219caaa6b067e22d7bd6d8cc9ade5","sha256:0eb6d21bef7ec7ffeed715680242e6caa5224d0261fb9d20dc4acda9e305e711"],"state_sha256":"3ab858e6f056f0e0bc6ecf3f03c4d21e4d6dc635c15b3ba8084a46929624277e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RfYGfE1B5YFbCHEqTFJcws34Gv5smQS3Yv9+Qf1KCjD6zW0UlcMz4wM/4fMRppW/D6xMpAg3w1/I60bH9OG0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T19:11:46.591725Z","bundle_sha256":"98113ecdcda981a590cff60f5702d6bea626cfd4b176c48767a7d1b960442fde"}}