{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZP3P5BNF36CLPJ3J552HBZNOW4","short_pith_number":"pith:ZP3P5BNF","schema_version":"1.0","canonical_sha256":"cbf6fe85a5df84b7a769ef7470e5aeb71240a4f144a12523fc154c7e2e5932bb","source":{"kind":"arxiv","id":"2605.29148","version":1},"attestation_state":"computed","paper":{"title":"Optimal Gap-Dependent Regret for Private Stochastic Decision-Theoretic Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Roberto Colomboni, Tommaso Cesari","submitted_at":"2026-05-27T22:17:00Z","abstract_excerpt":"We study stochastic decision-theoretic online learning with full information and event-level pure differential privacy. A COLT open problem of Hu and Mehta asks to determine the optimal gap-dependent regret rate for stochastic decision-theoretic online learning under pure event-level differential privacy. For $K$ actions, losses in $[0,1]$, and a unique best action separated from the second-best action by gap $\\Delta_{\\min}$, the known lower bound is of order $\n  \\frac{\\log K}{\\min\\{\\Delta_{\\min},\\varepsilon\\}}, $\nor equivalently, up to universal constants, of order \\[\n  \\frac{\\log K}{\\Delta_{"},"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":"2605.29148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-27T22:17:00Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1c1950857806623e3dea6b47c255d0e36f09851e765d8b48d8767550f676a061","abstract_canon_sha256":"93ec350a9758b69f64f7977b630bd20780b40df05be1751b0b7f5f736a012b87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:20.820068Z","signature_b64":"WhnqqsCdh6JGjtkl0vtU3Ow5lxvH0HiQJGKncE4kuTKXNF/oPg2jy+8quXanMdxXZNsjl8t6IGvaHSFQP+D/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbf6fe85a5df84b7a769ef7470e5aeb71240a4f144a12523fc154c7e2e5932bb","last_reissued_at":"2026-05-29T01:05:20.819336Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:20.819336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Gap-Dependent Regret for Private Stochastic Decision-Theoretic Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Roberto Colomboni, Tommaso Cesari","submitted_at":"2026-05-27T22:17:00Z","abstract_excerpt":"We study stochastic decision-theoretic online learning with full information and event-level pure differential privacy. A COLT open problem of Hu and Mehta asks to determine the optimal gap-dependent regret rate for stochastic decision-theoretic online learning under pure event-level differential privacy. For $K$ actions, losses in $[0,1]$, and a unique best action separated from the second-best action by gap $\\Delta_{\\min}$, the known lower bound is of order $\n  \\frac{\\log K}{\\min\\{\\Delta_{\\min},\\varepsilon\\}}, $\nor equivalently, up to universal constants, of order \\[\n  \\frac{\\log K}{\\Delta_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29148","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/2605.29148/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":"2605.29148","created_at":"2026-05-29T01:05:20.819451+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.29148v1","created_at":"2026-05-29T01:05:20.819451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29148","created_at":"2026-05-29T01:05:20.819451+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZP3P5BNF36CL","created_at":"2026-05-29T01:05:20.819451+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZP3P5BNF36CLPJ3J","created_at":"2026-05-29T01:05:20.819451+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZP3P5BNF","created_at":"2026-05-29T01:05:20.819451+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZP3P5BNF36CLPJ3J552HBZNOW4","json":"https://pith.science/pith/ZP3P5BNF36CLPJ3J552HBZNOW4.json","graph_json":"https://pith.science/api/pith-number/ZP3P5BNF36CLPJ3J552HBZNOW4/graph.json","events_json":"https://pith.science/api/pith-number/ZP3P5BNF36CLPJ3J552HBZNOW4/events.json","paper":"https://pith.science/paper/ZP3P5BNF"},"agent_actions":{"view_html":"https://pith.science/pith/ZP3P5BNF36CLPJ3J552HBZNOW4","download_json":"https://pith.science/pith/ZP3P5BNF36CLPJ3J552HBZNOW4.json","view_paper":"https://pith.science/paper/ZP3P5BNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.29148&json=true","fetch_graph":"https://pith.science/api/pith-number/ZP3P5BNF36CLPJ3J552HBZNOW4/graph.json","fetch_events":"https://pith.science/api/pith-number/ZP3P5BNF36CLPJ3J552HBZNOW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZP3P5BNF36CLPJ3J552HBZNOW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZP3P5BNF36CLPJ3J552HBZNOW4/action/storage_attestation","attest_author":"https://pith.science/pith/ZP3P5BNF36CLPJ3J552HBZNOW4/action/author_attestation","sign_citation":"https://pith.science/pith/ZP3P5BNF36CLPJ3J552HBZNOW4/action/citation_signature","submit_replication":"https://pith.science/pith/ZP3P5BNF36CLPJ3J552HBZNOW4/action/replication_record"}},"created_at":"2026-05-29T01:05:20.819451+00:00","updated_at":"2026-05-29T01:05:20.819451+00:00"}