{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:577QCK75WMG6V55NCRXGP64UDO","short_pith_number":"pith:577QCK75","canonical_record":{"source":{"id":"2101.01086","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-04T16:47:02Z","cross_cats_sorted":[],"title_canon_sha256":"883a18e66e27727ff20a70424a061b1c5106506e4b031367cc5c619c685c9c7d","abstract_canon_sha256":"e5b6efcb2951876b50ca117125cb47efefe71f49307300d9580715bdc4749c16"},"schema_version":"1.0"},"canonical_sha256":"efff012bfdb30deaf7ad146e67fb941bbba26baadadb2fcc25428f7bc5c65bbc","source":{"kind":"arxiv","id":"2101.01086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.01086","created_at":"2026-07-05T02:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"2101.01086v1","created_at":"2026-07-05T02:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.01086","created_at":"2026-07-05T02:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"577QCK75WMG6","created_at":"2026-07-05T02:04:24Z"},{"alias_kind":"pith_short_16","alias_value":"577QCK75WMG6V55N","created_at":"2026-07-05T02:04:24Z"},{"alias_kind":"pith_short_8","alias_value":"577QCK75","created_at":"2026-07-05T02:04:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:577QCK75WMG6V55NCRXGP64UDO","target":"record","payload":{"canonical_record":{"source":{"id":"2101.01086","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-04T16:47:02Z","cross_cats_sorted":[],"title_canon_sha256":"883a18e66e27727ff20a70424a061b1c5106506e4b031367cc5c619c685c9c7d","abstract_canon_sha256":"e5b6efcb2951876b50ca117125cb47efefe71f49307300d9580715bdc4749c16"},"schema_version":"1.0"},"canonical_sha256":"efff012bfdb30deaf7ad146e67fb941bbba26baadadb2fcc25428f7bc5c65bbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:24.611566Z","signature_b64":"MrY3lEyrC6Bbc674dJyejS+BXSHTtnAzgZedRoAIdp4C66BpT5YOYf7nE9nWhWc6DWgH0AqL/0usVigEVdmyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efff012bfdb30deaf7ad146e67fb941bbba26baadadb2fcc25428f7bc5c65bbc","last_reissued_at":"2026-07-05T02:04:24.611207Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:24.611207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.01086","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-07-05T02:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ru5PMqVoSe2R/UxtD//Gz9YZb5vhMNEL49Pd6V4A7Z4ZwQi5gPH4zCdpEexhx2/tt57I4jpSkpcRN40Dbr0dAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T20:43:47.639681Z"},"content_sha256":"ff4492b09fde4f01694c12d7077b2acffbd6487257a5fd90de189a31876e6805","schema_version":"1.0","event_id":"sha256:ff4492b09fde4f01694c12d7077b2acffbd6487257a5fd90de189a31876e6805"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:577QCK75WMG6V55NCRXGP64UDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Be Greedy in Multi-Armed Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jonathan Lou\\\"edec, Matthieu Jedor, Vianney Perchet","submitted_at":"2021-01-04T16:47:02Z","abstract_excerpt":"The Greedy algorithm is the simplest heuristic in sequential decision problem that carelessly takes the locally optimal choice at each round, disregarding any advantages of exploring and/or information gathering. Theoretically, it is known to sometimes have poor performances, for instance even a linear regret (with respect to the time horizon) in the standard multi-armed bandit problem. On the other hand, this heuristic performs reasonably well in practice and it even has sublinear, and even near-optimal, regret bounds in some very specific linear contextual and Bayesian bandit models. We buil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.01086","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.01086/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-05T02:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0G1toQqnCUkhKkPBf5bB29nxKcCoaOh3o4MoO4s7W15gsfaWW8QOzaswm7kjvfna7nsrZ7LVPziepAhgTKokDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T20:43:47.640205Z"},"content_sha256":"8c1bd92538d3de33f487171e2e6189fb70aebad0310f6cf3942249f854aa626c","schema_version":"1.0","event_id":"sha256:8c1bd92538d3de33f487171e2e6189fb70aebad0310f6cf3942249f854aa626c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/577QCK75WMG6V55NCRXGP64UDO/bundle.json","state_url":"https://pith.science/pith/577QCK75WMG6V55NCRXGP64UDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/577QCK75WMG6V55NCRXGP64UDO/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-20T20:43:47Z","links":{"resolver":"https://pith.science/pith/577QCK75WMG6V55NCRXGP64UDO","bundle":"https://pith.science/pith/577QCK75WMG6V55NCRXGP64UDO/bundle.json","state":"https://pith.science/pith/577QCK75WMG6V55NCRXGP64UDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/577QCK75WMG6V55NCRXGP64UDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:577QCK75WMG6V55NCRXGP64UDO","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":"e5b6efcb2951876b50ca117125cb47efefe71f49307300d9580715bdc4749c16","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-04T16:47:02Z","title_canon_sha256":"883a18e66e27727ff20a70424a061b1c5106506e4b031367cc5c619c685c9c7d"},"schema_version":"1.0","source":{"id":"2101.01086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.01086","created_at":"2026-07-05T02:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"2101.01086v1","created_at":"2026-07-05T02:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.01086","created_at":"2026-07-05T02:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"577QCK75WMG6","created_at":"2026-07-05T02:04:24Z"},{"alias_kind":"pith_short_16","alias_value":"577QCK75WMG6V55N","created_at":"2026-07-05T02:04:24Z"},{"alias_kind":"pith_short_8","alias_value":"577QCK75","created_at":"2026-07-05T02:04:24Z"}],"graph_snapshots":[{"event_id":"sha256:8c1bd92538d3de33f487171e2e6189fb70aebad0310f6cf3942249f854aa626c","target":"graph","created_at":"2026-07-05T02:04:24Z","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/2101.01086/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Greedy algorithm is the simplest heuristic in sequential decision problem that carelessly takes the locally optimal choice at each round, disregarding any advantages of exploring and/or information gathering. Theoretically, it is known to sometimes have poor performances, for instance even a linear regret (with respect to the time horizon) in the standard multi-armed bandit problem. On the other hand, this heuristic performs reasonably well in practice and it even has sublinear, and even near-optimal, regret bounds in some very specific linear contextual and Bayesian bandit models. We buil","authors_text":"Jonathan Lou\\\"edec, Matthieu Jedor, Vianney Perchet","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-04T16:47:02Z","title":"Be Greedy in Multi-Armed Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.01086","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:ff4492b09fde4f01694c12d7077b2acffbd6487257a5fd90de189a31876e6805","target":"record","created_at":"2026-07-05T02:04:24Z","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":"e5b6efcb2951876b50ca117125cb47efefe71f49307300d9580715bdc4749c16","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-04T16:47:02Z","title_canon_sha256":"883a18e66e27727ff20a70424a061b1c5106506e4b031367cc5c619c685c9c7d"},"schema_version":"1.0","source":{"id":"2101.01086","kind":"arxiv","version":1}},"canonical_sha256":"efff012bfdb30deaf7ad146e67fb941bbba26baadadb2fcc25428f7bc5c65bbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efff012bfdb30deaf7ad146e67fb941bbba26baadadb2fcc25428f7bc5c65bbc","first_computed_at":"2026-07-05T02:04:24.611207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:04:24.611207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MrY3lEyrC6Bbc674dJyejS+BXSHTtnAzgZedRoAIdp4C66BpT5YOYf7nE9nWhWc6DWgH0AqL/0usVigEVdmyCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:04:24.611566Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.01086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff4492b09fde4f01694c12d7077b2acffbd6487257a5fd90de189a31876e6805","sha256:8c1bd92538d3de33f487171e2e6189fb70aebad0310f6cf3942249f854aa626c"],"state_sha256":"1e6c69774ab806c325ecaa9b754d790d292198c13cfca72efeec83e49078678c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RhPatSCJL9ixfm2+mCsZ0qoAvfKTvbTDB7KW31Ybegxy3xds+P0VZ+7m+fX7eL++VbkkKCippu0q509rpw1BCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T20:43:47.644630Z","bundle_sha256":"753c05359e5920cbafe9f0bdfa5bb4d2c774d98f7701f63e2aeb804f84912436"}}