{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UB5G4WSF5FY6VPXDA2BM2QBYPF","short_pith_number":"pith:UB5G4WSF","canonical_record":{"source":{"id":"1702.08000","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-26T08:24:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a7f713129101b03345cc4f2f6286ad8afdb37b80392d5b540c432d3a7367bd4e","abstract_canon_sha256":"8af2afaf544fe271d6bb86c1c2e34b4e6fd1c5010724a68242e0b60edbc9d9ae"},"schema_version":"1.0"},"canonical_sha256":"a07a6e5a45e971eabee30682cd403879560deadf1e6b6703f9dc98d97ae15808","source":{"kind":"arxiv","id":"1702.08000","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08000","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08000v2","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08000","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"UB5G4WSF5FY6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UB5G4WSF5FY6VPXD","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UB5G4WSF","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UB5G4WSF5FY6VPXDA2BM2QBYPF","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08000","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-26T08:24:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a7f713129101b03345cc4f2f6286ad8afdb37b80392d5b540c432d3a7367bd4e","abstract_canon_sha256":"8af2afaf544fe271d6bb86c1c2e34b4e6fd1c5010724a68242e0b60edbc9d9ae"},"schema_version":"1.0"},"canonical_sha256":"a07a6e5a45e971eabee30682cd403879560deadf1e6b6703f9dc98d97ae15808","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:06.221729Z","signature_b64":"AtxhNHuOr28cFSoxZdmwt2vke+dlwqLOJvKitVOwRRwPuEaeXWXPaCpbYD9V3oT2JichF6GinsTaCG/jYStMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a07a6e5a45e971eabee30682cd403879560deadf1e6b6703f9dc98d97ae15808","last_reissued_at":"2026-05-18T00:49:06.221174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:06.221174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08000","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-18T00:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e2+YuM3dm7ZMzWC/pyoATMB3QUFj4vxuBA14SfQxZFf27SfQ2i2HhEGi9cB7AsDfieWWlt84dC8g71GWEyMEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:00:55.082507Z"},"content_sha256":"bdec2e208bd733676fc43aca20d2f1050db1399b96bebbb77ebccc2e5347a790","schema_version":"1.0","event_id":"sha256:bdec2e208bd733676fc43aca20d2f1050db1399b96bebbb77ebccc2e5347a790"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UB5G4WSF5FY6VPXDA2BM2QBYPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kiefer Wolfowitz Algorithm is Asymptotically Optimal for a Class of Non-Stationary Bandit Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Rahul Singh, Taposh Banerjee","submitted_at":"2017-02-26T08:24:11Z","abstract_excerpt":"We consider the problem of designing an allocation rule or an \"online learning algorithm\" for a class of bandit problems in which the set of control actions available at each time $s$ is a convex, compact subset of $\\mathbb{R}^d$. Upon choosing an action $x$ at time $s$, the algorithm obtains a noisy value of the unknown and time-varying function $f_s$ evaluated at $x$. The \"regret\" of an algorithm is the gap between its expected reward, and the reward earned by a strategy which has the knowledge of the function $f_s$ at each time $s$ and hence chooses the action $x_s$ that maximizes $f_s$.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08000","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-18T00:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJiPJj3M2qWTLEo+rfL71RP27xpiidez6BweDPRiKur0PSrXkDj8nWoF21ef3FlUdZWkuac8yBFqWw6FVaczBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:00:55.082856Z"},"content_sha256":"e6ff663055f5b3a5164f8c2bafd419137d49504f02c8f269582699cacb09a0fd","schema_version":"1.0","event_id":"sha256:e6ff663055f5b3a5164f8c2bafd419137d49504f02c8f269582699cacb09a0fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UB5G4WSF5FY6VPXDA2BM2QBYPF/bundle.json","state_url":"https://pith.science/pith/UB5G4WSF5FY6VPXDA2BM2QBYPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UB5G4WSF5FY6VPXDA2BM2QBYPF/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-19T19:00:55Z","links":{"resolver":"https://pith.science/pith/UB5G4WSF5FY6VPXDA2BM2QBYPF","bundle":"https://pith.science/pith/UB5G4WSF5FY6VPXDA2BM2QBYPF/bundle.json","state":"https://pith.science/pith/UB5G4WSF5FY6VPXDA2BM2QBYPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UB5G4WSF5FY6VPXDA2BM2QBYPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UB5G4WSF5FY6VPXDA2BM2QBYPF","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":"8af2afaf544fe271d6bb86c1c2e34b4e6fd1c5010724a68242e0b60edbc9d9ae","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-26T08:24:11Z","title_canon_sha256":"a7f713129101b03345cc4f2f6286ad8afdb37b80392d5b540c432d3a7367bd4e"},"schema_version":"1.0","source":{"id":"1702.08000","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08000","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08000v2","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08000","created_at":"2026-05-18T00:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"UB5G4WSF5FY6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UB5G4WSF5FY6VPXD","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UB5G4WSF","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:e6ff663055f5b3a5164f8c2bafd419137d49504f02c8f269582699cacb09a0fd","target":"graph","created_at":"2026-05-18T00:49:06Z","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 problem of designing an allocation rule or an \"online learning algorithm\" for a class of bandit problems in which the set of control actions available at each time $s$ is a convex, compact subset of $\\mathbb{R}^d$. Upon choosing an action $x$ at time $s$, the algorithm obtains a noisy value of the unknown and time-varying function $f_s$ evaluated at $x$. The \"regret\" of an algorithm is the gap between its expected reward, and the reward earned by a strategy which has the knowledge of the function $f_s$ at each time $s$ and hence chooses the action $x_s$ that maximizes $f_s$.\n  ","authors_text":"Rahul Singh, Taposh Banerjee","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-26T08:24:11Z","title":"Kiefer Wolfowitz Algorithm is Asymptotically Optimal for a Class of Non-Stationary Bandit Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08000","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:bdec2e208bd733676fc43aca20d2f1050db1399b96bebbb77ebccc2e5347a790","target":"record","created_at":"2026-05-18T00:49:06Z","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":"8af2afaf544fe271d6bb86c1c2e34b4e6fd1c5010724a68242e0b60edbc9d9ae","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-26T08:24:11Z","title_canon_sha256":"a7f713129101b03345cc4f2f6286ad8afdb37b80392d5b540c432d3a7367bd4e"},"schema_version":"1.0","source":{"id":"1702.08000","kind":"arxiv","version":2}},"canonical_sha256":"a07a6e5a45e971eabee30682cd403879560deadf1e6b6703f9dc98d97ae15808","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a07a6e5a45e971eabee30682cd403879560deadf1e6b6703f9dc98d97ae15808","first_computed_at":"2026-05-18T00:49:06.221174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:06.221174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AtxhNHuOr28cFSoxZdmwt2vke+dlwqLOJvKitVOwRRwPuEaeXWXPaCpbYD9V3oT2JichF6GinsTaCG/jYStMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:06.221729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08000","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdec2e208bd733676fc43aca20d2f1050db1399b96bebbb77ebccc2e5347a790","sha256:e6ff663055f5b3a5164f8c2bafd419137d49504f02c8f269582699cacb09a0fd"],"state_sha256":"b86b8198dc8c91e3673719961a3681784e95db80cbec21041c0075903b6139dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ZvmwmSeAz7uLaIJBpfZJra/yWSCxIUiHxjgTFQViF3sr7WT1GSbLv0bI2FHVqxuEH4Bp8k19PJrVeYrNe6cBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T19:00:55.084859Z","bundle_sha256":"8adf0467f4e681121a66f0464253da3280da7b81b7e372359b7e5355ca3934a9"}}