{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7F7FQIEINK2WNBJVGNUPYXYNPH","short_pith_number":"pith:7F7FQIEI","canonical_record":{"source":{"id":"1207.3024","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-12T17:15:06Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"1b3f60490dcee5cf2fea2ae079191033dfd8354eb5cfba7d0c1b3b1b8807191f","abstract_canon_sha256":"20f19c460b7bc6cac11a3d8f4942e6f9c6bdf1271f984513d533b1cf9e85360b"},"schema_version":"1.0"},"canonical_sha256":"f97e5820886ab56685353368fc5f0d79d198a4d4d3a3ef59a5281e32b39a1185","source":{"kind":"arxiv","id":"1207.3024","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3024","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3024v4","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3024","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"7F7FQIEINK2W","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7F7FQIEINK2WNBJV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7F7FQIEI","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7F7FQIEINK2WNBJVGNUPYXYNPH","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3024","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-12T17:15:06Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"1b3f60490dcee5cf2fea2ae079191033dfd8354eb5cfba7d0c1b3b1b8807191f","abstract_canon_sha256":"20f19c460b7bc6cac11a3d8f4942e6f9c6bdf1271f984513d533b1cf9e85360b"},"schema_version":"1.0"},"canonical_sha256":"f97e5820886ab56685353368fc5f0d79d198a4d4d3a3ef59a5281e32b39a1185","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:17.985151Z","signature_b64":"A7nkf6/4XrQk5umwWScX4bXji2QTLGD9JVF8MPD4hujMmIt0Cn15s+eReRRvEetSg7fuMi4yWTzw7OTdt1z8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f97e5820886ab56685353368fc5f0d79d198a4d4d3a3ef59a5281e32b39a1185","last_reissued_at":"2026-05-18T02:48:17.984741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:17.984741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3024","source_version":4,"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-18T02:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o85O3mraliHm7s3nVaZnIoJ/lQ6NH/oenWLS124XneogcJt+MfZCv8twb6DYkHQD9aKgL5/N2zBOkOmGAk5oBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:08:09.999058Z"},"content_sha256":"564791d47970d64f4c16314f30357b41c0e6c03028bcdbd8b2e6da394ec9064a","schema_version":"1.0","event_id":"sha256:564791d47970d64f4c16314f30357b41c0e6c03028bcdbd8b2e6da394ec9064a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7F7FQIEINK2WNBJVGNUPYXYNPH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Time and Space Efficient Algorithm for Contextual Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Jinyun Yan, Jos\\'e Bento, S. Muthukrishnan, Stratis Ioannidis","submitted_at":"2012-07-12T17:15:06Z","abstract_excerpt":"We consider a multi-armed bandit problem where payoffs are a linear function of an observed stochastic contextual variable. In the scenario where there exists a gap between optimal and suboptimal rewards, several algorithms have been proposed that achieve $O(\\log T)$ regret after $T$ time steps. However, proposed methods either have a computation complexity per iteration that scales linearly with $T$ or achieve regrets that grow linearly with the number of contexts $|\\myset{X}|$. We propose an $\\epsilon$-greedy type of algorithm that solves both limitations. In particular, when contexts are va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3024","kind":"arxiv","version":4},"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-18T02:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5bN31c0wRCetS9vgjzRJAvYReUjHY/SiufLr5sotKpibmr3zAZNCEe3IhFIAPcVomN4heYWs8GZ7mQYRMvnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:08:09.999409Z"},"content_sha256":"2940d78047ebf65f1f3d13c4c8f0ba29d031e15c48328a51b558081fa99da080","schema_version":"1.0","event_id":"sha256:2940d78047ebf65f1f3d13c4c8f0ba29d031e15c48328a51b558081fa99da080"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7F7FQIEINK2WNBJVGNUPYXYNPH/bundle.json","state_url":"https://pith.science/pith/7F7FQIEINK2WNBJVGNUPYXYNPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7F7FQIEINK2WNBJVGNUPYXYNPH/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-04T05:08:10Z","links":{"resolver":"https://pith.science/pith/7F7FQIEINK2WNBJVGNUPYXYNPH","bundle":"https://pith.science/pith/7F7FQIEINK2WNBJVGNUPYXYNPH/bundle.json","state":"https://pith.science/pith/7F7FQIEINK2WNBJVGNUPYXYNPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7F7FQIEINK2WNBJVGNUPYXYNPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7F7FQIEINK2WNBJVGNUPYXYNPH","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":"20f19c460b7bc6cac11a3d8f4942e6f9c6bdf1271f984513d533b1cf9e85360b","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-12T17:15:06Z","title_canon_sha256":"1b3f60490dcee5cf2fea2ae079191033dfd8354eb5cfba7d0c1b3b1b8807191f"},"schema_version":"1.0","source":{"id":"1207.3024","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3024","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3024v4","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3024","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"7F7FQIEINK2W","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7F7FQIEINK2WNBJV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7F7FQIEI","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:2940d78047ebf65f1f3d13c4c8f0ba29d031e15c48328a51b558081fa99da080","target":"graph","created_at":"2026-05-18T02:48:17Z","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 consider a multi-armed bandit problem where payoffs are a linear function of an observed stochastic contextual variable. In the scenario where there exists a gap between optimal and suboptimal rewards, several algorithms have been proposed that achieve $O(\\log T)$ regret after $T$ time steps. However, proposed methods either have a computation complexity per iteration that scales linearly with $T$ or achieve regrets that grow linearly with the number of contexts $|\\myset{X}|$. We propose an $\\epsilon$-greedy type of algorithm that solves both limitations. In particular, when contexts are va","authors_text":"Jinyun Yan, Jos\\'e Bento, S. Muthukrishnan, Stratis Ioannidis","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-12T17:15:06Z","title":"A Time and Space Efficient Algorithm for Contextual Linear Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3024","kind":"arxiv","version":4},"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:564791d47970d64f4c16314f30357b41c0e6c03028bcdbd8b2e6da394ec9064a","target":"record","created_at":"2026-05-18T02:48:17Z","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":"20f19c460b7bc6cac11a3d8f4942e6f9c6bdf1271f984513d533b1cf9e85360b","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-12T17:15:06Z","title_canon_sha256":"1b3f60490dcee5cf2fea2ae079191033dfd8354eb5cfba7d0c1b3b1b8807191f"},"schema_version":"1.0","source":{"id":"1207.3024","kind":"arxiv","version":4}},"canonical_sha256":"f97e5820886ab56685353368fc5f0d79d198a4d4d3a3ef59a5281e32b39a1185","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f97e5820886ab56685353368fc5f0d79d198a4d4d3a3ef59a5281e32b39a1185","first_computed_at":"2026-05-18T02:48:17.984741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:17.984741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A7nkf6/4XrQk5umwWScX4bXji2QTLGD9JVF8MPD4hujMmIt0Cn15s+eReRRvEetSg7fuMi4yWTzw7OTdt1z8CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:17.985151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3024","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:564791d47970d64f4c16314f30357b41c0e6c03028bcdbd8b2e6da394ec9064a","sha256:2940d78047ebf65f1f3d13c4c8f0ba29d031e15c48328a51b558081fa99da080"],"state_sha256":"ea9380264e5c00d5294f819f2641e0d300d10a21cf93ac03ef543c6837beff4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bg2K9nbsyjO93k93Sa7kbDiqdAjqnHZnqy0TxbVHwxENBUpiuH8a7eSmxQOas9Q4bDCk9OFDmUJyLdK5MzWoBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:08:10.001592Z","bundle_sha256":"8824076c779e01ee16a85ea30b5eaa5691aec45dc9d9f724d2c179f6e4d714bc"}}