{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BBT4SYWMVENTMKNDVS5BTMSNXH","short_pith_number":"pith:BBT4SYWM","schema_version":"1.0","canonical_sha256":"0867c962cca91b3629a3acba19b24db9fb8abd7bcb4baf1643804019fd96725d","source":{"kind":"arxiv","id":"2302.05371","version":1},"attestation_state":"computed","paper":{"title":"A Second-Order Method for Stochastic Bandit Convex Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gy\\\"orgy, Tor Lattimore","submitted_at":"2023-02-10T16:49:58Z","abstract_excerpt":"We introduce a simple and efficient algorithm for unconstrained zeroth-order stochastic convex bandits and prove its regret is at most $(1 + r/d)[d^{1.5} \\sqrt{n} + d^3] polylog(n, d, r)$ where $n$ is the horizon, $d$ the dimension and $r$ is the radius of a known ball containing the minimiser of the loss."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2302.05371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-10T16:49:58Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"16adcff05e0ea36dec5eddfe6fd85fca4a5f2cd3a6ae68f34ebce4d43ec0d0a6","abstract_canon_sha256":"8c679db8e2c1c185575739f7efafee32bb6a7ff9bba2f6e7582f4f5f7248a087"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:40:38.646097Z","signature_b64":"87N3D+OzAwjs4iup8ojnviwdZ7tp+3sftwMihknMn7qTFsoEVYEJjeS8ie0EFfWHQEY2uDQ9ZXTSuGBgk3ujCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0867c962cca91b3629a3acba19b24db9fb8abd7bcb4baf1643804019fd96725d","last_reissued_at":"2026-07-05T05:40:38.645541Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:40:38.645541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Second-Order Method for Stochastic Bandit Convex Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gy\\\"orgy, Tor Lattimore","submitted_at":"2023-02-10T16:49:58Z","abstract_excerpt":"We introduce a simple and efficient algorithm for unconstrained zeroth-order stochastic convex bandits and prove its regret is at most $(1 + r/d)[d^{1.5} \\sqrt{n} + d^3] polylog(n, d, r)$ where $n$ is the horizon, $d$ the dimension and $r$ is the radius of a known ball containing the minimiser of the loss."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05371","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/2302.05371/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2302.05371","created_at":"2026-07-05T05:40:38.645609+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.05371v1","created_at":"2026-07-05T05:40:38.645609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05371","created_at":"2026-07-05T05:40:38.645609+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBT4SYWMVENT","created_at":"2026-07-05T05:40:38.645609+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBT4SYWMVENTMKND","created_at":"2026-07-05T05:40:38.645609+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBT4SYWM","created_at":"2026-07-05T05:40:38.645609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.11127","citing_title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BBT4SYWMVENTMKNDVS5BTMSNXH","json":"https://pith.science/pith/BBT4SYWMVENTMKNDVS5BTMSNXH.json","graph_json":"https://pith.science/api/pith-number/BBT4SYWMVENTMKNDVS5BTMSNXH/graph.json","events_json":"https://pith.science/api/pith-number/BBT4SYWMVENTMKNDVS5BTMSNXH/events.json","paper":"https://pith.science/paper/BBT4SYWM"},"agent_actions":{"view_html":"https://pith.science/pith/BBT4SYWMVENTMKNDVS5BTMSNXH","download_json":"https://pith.science/pith/BBT4SYWMVENTMKNDVS5BTMSNXH.json","view_paper":"https://pith.science/paper/BBT4SYWM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.05371&json=true","fetch_graph":"https://pith.science/api/pith-number/BBT4SYWMVENTMKNDVS5BTMSNXH/graph.json","fetch_events":"https://pith.science/api/pith-number/BBT4SYWMVENTMKNDVS5BTMSNXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBT4SYWMVENTMKNDVS5BTMSNXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBT4SYWMVENTMKNDVS5BTMSNXH/action/storage_attestation","attest_author":"https://pith.science/pith/BBT4SYWMVENTMKNDVS5BTMSNXH/action/author_attestation","sign_citation":"https://pith.science/pith/BBT4SYWMVENTMKNDVS5BTMSNXH/action/citation_signature","submit_replication":"https://pith.science/pith/BBT4SYWMVENTMKNDVS5BTMSNXH/action/replication_record"}},"created_at":"2026-07-05T05:40:38.645609+00:00","updated_at":"2026-07-05T05:40:38.645609+00:00"}