{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GERXDLFHISCNFLC4J5HXEOXHOE","short_pith_number":"pith:GERXDLFH","canonical_record":{"source":{"id":"1807.03558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-10T10:15:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fb97fcdd72b7a9282666300bcd0316f5b89e8f91cf6289cecbab4cecda5cc461","abstract_canon_sha256":"b1e9d2a3a6a0060f070c5e0895a70b65a69096cab9b60a71a5931bf32055fb8e"},"schema_version":"1.0"},"canonical_sha256":"312371aca74484d2ac5c4f4f723ae7712f9034a9f7ef497dcbe9501bf65ca369","source":{"kind":"arxiv","id":"1807.03558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03558","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03558v1","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03558","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"GERXDLFHISCN","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GERXDLFHISCNFLC4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GERXDLFH","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GERXDLFHISCNFLC4J5HXEOXHOE","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-10T10:15:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fb97fcdd72b7a9282666300bcd0316f5b89e8f91cf6289cecbab4cecda5cc461","abstract_canon_sha256":"b1e9d2a3a6a0060f070c5e0895a70b65a69096cab9b60a71a5931bf32055fb8e"},"schema_version":"1.0"},"canonical_sha256":"312371aca74484d2ac5c4f4f723ae7712f9034a9f7ef497dcbe9501bf65ca369","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:10.038528Z","signature_b64":"1glqaNtjUFStZe6YH7vjSBxtkN3aLQqN9QQLkUiDiJ27GFTgLzgT3Pf7xMBQcEPx1CMbI9ksTS79z0CAkHrGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"312371aca74484d2ac5c4f4f723ae7712f9034a9f7ef497dcbe9501bf65ca369","last_reissued_at":"2026-05-18T00:11:10.037788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:10.037788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03558","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-18T00:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAcepcxEr0jSDj/Q29oz8PpeD3FsvyuypAioqAwW27JasLVAkZe9bRDKn/uUef/cwU1CVg8xjPong0hS0K5dDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:49:34.437601Z"},"content_sha256":"5618e461dbe6b15c955561d27512221ce9ff0af5a8653744c7410e20646bb98a","schema_version":"1.0","event_id":"sha256:5618e461dbe6b15c955561d27512221ce9ff0af5a8653744c7410e20646bb98a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GERXDLFHISCNFLC4J5HXEOXHOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bandits with Side Observations: Bounded vs. Logarithmic Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Evrard Garcelon, R\\'emy Degenne, Vianney Perchet","submitted_at":"2018-07-10T10:15:30Z","abstract_excerpt":"We consider the classical stochastic multi-armed bandit but where, from time to time and roughly with frequency $\\epsilon$, an extra observation is gathered by the agent for free. We prove that, no matter how small $\\epsilon$ is the agent can ensure a regret uniformly bounded in time.\n  More precisely, we construct an algorithm with a regret smaller than $\\sum_i \\frac{\\log(1/\\epsilon)}{\\Delta_i}$, up to multiplicative constant and loglog terms. We also prove a matching lower-bound, stating that no reasonable algorithm can outperform this quantity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03558","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-18T00:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BcBzx21GLVbRNffcU2DJawfziyAluwGKWba8r/OHmhvrPqJGVudNc/HCYqV16IT0KNRoaEFk8/GfadH7oB/yCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:49:34.438244Z"},"content_sha256":"b810e9aed2d74ce2bf2d897c33d26e57e1345afbb6cd97c1c1c1bb7b8b943b42","schema_version":"1.0","event_id":"sha256:b810e9aed2d74ce2bf2d897c33d26e57e1345afbb6cd97c1c1c1bb7b8b943b42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GERXDLFHISCNFLC4J5HXEOXHOE/bundle.json","state_url":"https://pith.science/pith/GERXDLFHISCNFLC4J5HXEOXHOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GERXDLFHISCNFLC4J5HXEOXHOE/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-06T18:49:34Z","links":{"resolver":"https://pith.science/pith/GERXDLFHISCNFLC4J5HXEOXHOE","bundle":"https://pith.science/pith/GERXDLFHISCNFLC4J5HXEOXHOE/bundle.json","state":"https://pith.science/pith/GERXDLFHISCNFLC4J5HXEOXHOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GERXDLFHISCNFLC4J5HXEOXHOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GERXDLFHISCNFLC4J5HXEOXHOE","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":"b1e9d2a3a6a0060f070c5e0895a70b65a69096cab9b60a71a5931bf32055fb8e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-10T10:15:30Z","title_canon_sha256":"fb97fcdd72b7a9282666300bcd0316f5b89e8f91cf6289cecbab4cecda5cc461"},"schema_version":"1.0","source":{"id":"1807.03558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03558","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03558v1","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03558","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"GERXDLFHISCN","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GERXDLFHISCNFLC4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GERXDLFH","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:b810e9aed2d74ce2bf2d897c33d26e57e1345afbb6cd97c1c1c1bb7b8b943b42","target":"graph","created_at":"2026-05-18T00:11:10Z","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 the classical stochastic multi-armed bandit but where, from time to time and roughly with frequency $\\epsilon$, an extra observation is gathered by the agent for free. We prove that, no matter how small $\\epsilon$ is the agent can ensure a regret uniformly bounded in time.\n  More precisely, we construct an algorithm with a regret smaller than $\\sum_i \\frac{\\log(1/\\epsilon)}{\\Delta_i}$, up to multiplicative constant and loglog terms. We also prove a matching lower-bound, stating that no reasonable algorithm can outperform this quantity.","authors_text":"Evrard Garcelon, R\\'emy Degenne, Vianney Perchet","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-10T10:15:30Z","title":"Bandits with Side Observations: Bounded vs. Logarithmic Regret"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03558","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:5618e461dbe6b15c955561d27512221ce9ff0af5a8653744c7410e20646bb98a","target":"record","created_at":"2026-05-18T00:11:10Z","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":"b1e9d2a3a6a0060f070c5e0895a70b65a69096cab9b60a71a5931bf32055fb8e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-10T10:15:30Z","title_canon_sha256":"fb97fcdd72b7a9282666300bcd0316f5b89e8f91cf6289cecbab4cecda5cc461"},"schema_version":"1.0","source":{"id":"1807.03558","kind":"arxiv","version":1}},"canonical_sha256":"312371aca74484d2ac5c4f4f723ae7712f9034a9f7ef497dcbe9501bf65ca369","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"312371aca74484d2ac5c4f4f723ae7712f9034a9f7ef497dcbe9501bf65ca369","first_computed_at":"2026-05-18T00:11:10.037788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:10.037788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1glqaNtjUFStZe6YH7vjSBxtkN3aLQqN9QQLkUiDiJ27GFTgLzgT3Pf7xMBQcEPx1CMbI9ksTS79z0CAkHrGAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:10.038528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5618e461dbe6b15c955561d27512221ce9ff0af5a8653744c7410e20646bb98a","sha256:b810e9aed2d74ce2bf2d897c33d26e57e1345afbb6cd97c1c1c1bb7b8b943b42"],"state_sha256":"3d70005cf535ea85323995c26844f512a5abda9b38e91909cb55919b2268c4c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J4siBFRn2iPtDI1aqshBgnPzg1sGDTerSANpSha2qhlPRkWpDdFKUQAtrn8StTJ/BiE01+3mJkelQsm23jpqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:49:34.441946Z","bundle_sha256":"c046e1eb203bb7f5c8a6d6fea5cb3f6e984037d0f3b988ef0bcfedbd7708fddf"}}