{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5NQ4TEF72EPXPC3VERPQSFJM7W","short_pith_number":"pith:5NQ4TEF7","canonical_record":{"source":{"id":"1502.04874","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-02-17T12:49:01Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"af38d4602e66e2e908716309daa2401c8b6b1c96f13c79ec95d26285fb4c8f2d","abstract_canon_sha256":"24179271622bbc50688835096a03efffe9b2f0ccaaf74b2c1eba225ca24c0349"},"schema_version":"1.0"},"canonical_sha256":"eb61c990bfd11f778b75245f09152cfd95fb24f494e1fc5f75f7d69feebe8673","source":{"kind":"arxiv","id":"1502.04874","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04874","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04874v2","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04874","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"5NQ4TEF72EPX","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5NQ4TEF72EPXPC3V","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5NQ4TEF7","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5NQ4TEF72EPXPC3VERPQSFJM7W","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04874","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-02-17T12:49:01Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"af38d4602e66e2e908716309daa2401c8b6b1c96f13c79ec95d26285fb4c8f2d","abstract_canon_sha256":"24179271622bbc50688835096a03efffe9b2f0ccaaf74b2c1eba225ca24c0349"},"schema_version":"1.0"},"canonical_sha256":"eb61c990bfd11f778b75245f09152cfd95fb24f494e1fc5f75f7d69feebe8673","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:48.609616Z","signature_b64":"VZlA0WNph7eriykTSEkjQJiCG9ZopPGmV2w1zKPtYS9cWWrahbfh28DuQXrMaZNAz6Dr5vdfv5hDB1xNLc0qAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb61c990bfd11f778b75245f09152cfd95fb24f494e1fc5f75f7d69feebe8673","last_reissued_at":"2026-05-18T01:22:48.609101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:48.609101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04874","source_version":2,"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:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lT7G+lfgkQ3Z03b4UAjzgEbZlx2y2uCD8bkzq3WuwjgSWAqIgqiDSwxXvG2VxCJxsEbXJPuObsybUMvrxazFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:08:53.966166Z"},"content_sha256":"f928f60f74879c5cd7fb2e9982535ed77779d002bd5439960d011cbeb37069ed","schema_version":"1.0","event_id":"sha256:f928f60f74879c5cd7fb2e9982535ed77779d002bd5439960d011cbeb37069ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5NQ4TEF72EPXPC3VERPQSFJM7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regret bounds for Narendra-Shapiro bandit algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"math.PR","authors_text":"Fabien Panloup, S\\'ebastien Gadat, Sofiane Saadane","submitted_at":"2015-02-17T12:49:01Z","abstract_excerpt":"Narendra-Shapiro (NS) algorithms are bandit-type algorithms that have been introduced in the sixties (with a view to applications in Psychology or learning automata), whose convergence has been intensively studied in the stochastic algorithm literature. In this paper, we adress the following question: are the Narendra-Shapiro (NS) bandit algorithms competitive from a \\textit{regret} point of view? In our main result, we show that some competitive bounds can be obtained for such algorithms in their penalized version (introduced in \\cite{Lamberton_Pages}). More precisely, up to an over-penalizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04874","kind":"arxiv","version":2},"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:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IE/lqu7cKxXYeoKpiYnLicSa3y/cLowdVIdROxUWVl2B93Bge7P0r8a4KDPtQRMElQlIVxf+shiqxXruq/a1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:08:53.966548Z"},"content_sha256":"846c974612a55b5f404c7eb997795a7d41cd90a18a9492806c36e419a67d3a24","schema_version":"1.0","event_id":"sha256:846c974612a55b5f404c7eb997795a7d41cd90a18a9492806c36e419a67d3a24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W/bundle.json","state_url":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NQ4TEF72EPXPC3VERPQSFJM7W/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-05-31T06:08:53Z","links":{"resolver":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W","bundle":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W/bundle.json","state":"https://pith.science/pith/5NQ4TEF72EPXPC3VERPQSFJM7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NQ4TEF72EPXPC3VERPQSFJM7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5NQ4TEF72EPXPC3VERPQSFJM7W","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":"24179271622bbc50688835096a03efffe9b2f0ccaaf74b2c1eba225ca24c0349","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-02-17T12:49:01Z","title_canon_sha256":"af38d4602e66e2e908716309daa2401c8b6b1c96f13c79ec95d26285fb4c8f2d"},"schema_version":"1.0","source":{"id":"1502.04874","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04874","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04874v2","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04874","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"5NQ4TEF72EPX","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5NQ4TEF72EPXPC3V","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5NQ4TEF7","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:846c974612a55b5f404c7eb997795a7d41cd90a18a9492806c36e419a67d3a24","target":"graph","created_at":"2026-05-18T01:22:48Z","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":"Narendra-Shapiro (NS) algorithms are bandit-type algorithms that have been introduced in the sixties (with a view to applications in Psychology or learning automata), whose convergence has been intensively studied in the stochastic algorithm literature. In this paper, we adress the following question: are the Narendra-Shapiro (NS) bandit algorithms competitive from a \\textit{regret} point of view? In our main result, we show that some competitive bounds can be obtained for such algorithms in their penalized version (introduced in \\cite{Lamberton_Pages}). More precisely, up to an over-penalizat","authors_text":"Fabien Panloup, S\\'ebastien Gadat, Sofiane Saadane","cross_cats":["math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-02-17T12:49:01Z","title":"Regret bounds for Narendra-Shapiro bandit algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04874","kind":"arxiv","version":2},"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:f928f60f74879c5cd7fb2e9982535ed77779d002bd5439960d011cbeb37069ed","target":"record","created_at":"2026-05-18T01:22:48Z","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":"24179271622bbc50688835096a03efffe9b2f0ccaaf74b2c1eba225ca24c0349","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-02-17T12:49:01Z","title_canon_sha256":"af38d4602e66e2e908716309daa2401c8b6b1c96f13c79ec95d26285fb4c8f2d"},"schema_version":"1.0","source":{"id":"1502.04874","kind":"arxiv","version":2}},"canonical_sha256":"eb61c990bfd11f778b75245f09152cfd95fb24f494e1fc5f75f7d69feebe8673","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb61c990bfd11f778b75245f09152cfd95fb24f494e1fc5f75f7d69feebe8673","first_computed_at":"2026-05-18T01:22:48.609101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:48.609101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VZlA0WNph7eriykTSEkjQJiCG9ZopPGmV2w1zKPtYS9cWWrahbfh28DuQXrMaZNAz6Dr5vdfv5hDB1xNLc0qAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:48.609616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04874","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f928f60f74879c5cd7fb2e9982535ed77779d002bd5439960d011cbeb37069ed","sha256:846c974612a55b5f404c7eb997795a7d41cd90a18a9492806c36e419a67d3a24"],"state_sha256":"91c4d1d177b47164f1811d2d8970b6a7c1ca2b455f8bad36f40c8c68b78a4dd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A0z+RGaFZMXqNVsUIgzo8c5/e8DjcbMqCKY5IFsoPWq6fENrTGxHQZfOHISrKTSJyCaALSiQmaAOAjmgQ03JBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:08:53.968589Z","bundle_sha256":"6e9b9b6bedc4e98ec2f46d7b115b1f24941eef66a5df4b79817fffde5ebbfd5e"}}