{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4T62CWAPBPH5EDCM2OGPWDRW4C","short_pith_number":"pith:4T62CWAP","schema_version":"1.0","canonical_sha256":"e4fda1580f0bcfd20c4cd38cfb0e36e0805a74a16aac0506bbbe269e3f7fbf97","source":{"kind":"arxiv","id":"2607.20258","version":1},"attestation_state":"computed","paper":{"title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alberto Marchesi, Anna Lunghi, Matteo Castiglioni","submitted_at":"2026-07-22T15:15:28Z","abstract_excerpt":"We study regret minimization for learning CDF-related objectives of the form \\[ g(x)\\cdot\\mathbb{P}_{X\\sim\\mathcal{D}}(X\\le x), \\] over $[0,1]^2$, where $g$ is a known Lipschitz function and $\\mathcal{D}$ is an unknown distribution. At each round $t$, the learner selects a point $x_t$ and observes the binary feedback $\\mathbb{I}(X_t\\le x_t)$, where $X_t\\sim\\mathcal{D}$. We design an algorithm achieving regret $\\widetilde{\\mathcal{O}}(T^{7/10})$, improving over the previous best-known bound of $\\widetilde{\\mathcal{O}}(T^{3/4})$ and showing that the curse of dimensionality can be at least partia"},"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":"2607.20258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-22T15:15:28Z","cross_cats_sorted":[],"title_canon_sha256":"04db5272076785e462b45f6b123ba9d7aed7925a5a742a5cf53de8fb3982e6f1","abstract_canon_sha256":"add8854b7d0187a4293b0d0be7d0b69f885009fb4239e7d4ebce461cb02e389d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:25:10.484430Z","signature_b64":"IWSVPui870COFovRQ3owU2vTUWs3AKV6x4HEwmaTsT3MvgcRwTSyO5px40+qpTNHgwGtG7qs8OTDHCwhaNKKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4fda1580f0bcfd20c4cd38cfb0e36e0805a74a16aac0506bbbe269e3f7fbf97","last_reissued_at":"2026-07-23T01:25:10.483534Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:25:10.483534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking the $T^{3/4}$ Barrier for Regret Minimization With Bi-Dimensional CDFs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alberto Marchesi, Anna Lunghi, Matteo Castiglioni","submitted_at":"2026-07-22T15:15:28Z","abstract_excerpt":"We study regret minimization for learning CDF-related objectives of the form \\[ g(x)\\cdot\\mathbb{P}_{X\\sim\\mathcal{D}}(X\\le x), \\] over $[0,1]^2$, where $g$ is a known Lipschitz function and $\\mathcal{D}$ is an unknown distribution. At each round $t$, the learner selects a point $x_t$ and observes the binary feedback $\\mathbb{I}(X_t\\le x_t)$, where $X_t\\sim\\mathcal{D}$. We design an algorithm achieving regret $\\widetilde{\\mathcal{O}}(T^{7/10})$, improving over the previous best-known bound of $\\widetilde{\\mathcal{O}}(T^{3/4})$ and showing that the curse of dimensionality can be at least partia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.20258","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/2607.20258/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":"2607.20258","created_at":"2026-07-23T01:25:10.483970+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.20258v1","created_at":"2026-07-23T01:25:10.483970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.20258","created_at":"2026-07-23T01:25:10.483970+00:00"},{"alias_kind":"pith_short_12","alias_value":"4T62CWAPBPH5","created_at":"2026-07-23T01:25:10.483970+00:00"},{"alias_kind":"pith_short_16","alias_value":"4T62CWAPBPH5EDCM","created_at":"2026-07-23T01:25:10.483970+00:00"},{"alias_kind":"pith_short_8","alias_value":"4T62CWAP","created_at":"2026-07-23T01:25:10.483970+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/4T62CWAPBPH5EDCM2OGPWDRW4C","json":"https://pith.science/pith/4T62CWAPBPH5EDCM2OGPWDRW4C.json","graph_json":"https://pith.science/api/pith-number/4T62CWAPBPH5EDCM2OGPWDRW4C/graph.json","events_json":"https://pith.science/api/pith-number/4T62CWAPBPH5EDCM2OGPWDRW4C/events.json","paper":"https://pith.science/paper/4T62CWAP"},"agent_actions":{"view_html":"https://pith.science/pith/4T62CWAPBPH5EDCM2OGPWDRW4C","download_json":"https://pith.science/pith/4T62CWAPBPH5EDCM2OGPWDRW4C.json","view_paper":"https://pith.science/paper/4T62CWAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.20258&json=true","fetch_graph":"https://pith.science/api/pith-number/4T62CWAPBPH5EDCM2OGPWDRW4C/graph.json","fetch_events":"https://pith.science/api/pith-number/4T62CWAPBPH5EDCM2OGPWDRW4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4T62CWAPBPH5EDCM2OGPWDRW4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4T62CWAPBPH5EDCM2OGPWDRW4C/action/storage_attestation","attest_author":"https://pith.science/pith/4T62CWAPBPH5EDCM2OGPWDRW4C/action/author_attestation","sign_citation":"https://pith.science/pith/4T62CWAPBPH5EDCM2OGPWDRW4C/action/citation_signature","submit_replication":"https://pith.science/pith/4T62CWAPBPH5EDCM2OGPWDRW4C/action/replication_record"}},"created_at":"2026-07-23T01:25:10.483970+00:00","updated_at":"2026-07-23T01:25:10.483970+00:00"}