{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JOIDNAFSVHBD7BADVRWH75TZIV","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":"4b1fa55881a995e83a78a7369943902a1f06e2c5bc30f240d33b9c1a5fc768f9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-10T02:45:59Z","title_canon_sha256":"6978a7a0611978c68b9d78abd19c794f1e23e7d6b15b362a1b2392bf72371dcf"},"schema_version":"1.0","source":{"id":"2605.09273","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.09273","created_at":"2026-05-22T01:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"2605.09273v2","created_at":"2026-05-22T01:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.09273","created_at":"2026-05-22T01:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"JOIDNAFSVHBD","created_at":"2026-05-22T01:04:05Z"},{"alias_kind":"pith_short_16","alias_value":"JOIDNAFSVHBD7BAD","created_at":"2026-05-22T01:04:05Z"},{"alias_kind":"pith_short_8","alias_value":"JOIDNAFS","created_at":"2026-05-22T01:04:05Z"}],"graph_snapshots":[{"event_id":"sha256:4422f4d321af8879e4c0f0936f8be37a8813f11d4d2b836ac65938d8dda38312","target":"graph","created_at":"2026-05-22T01:04:05Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We give a single, efficient algorithm which dynamically interpolates between benign and worst-case sequences by adaptively refining a dyadic grid of prediction values. Its error is controlled by the number of leaves in the refinement tree. ... the rate depends on a threshold-complexity measure of the predictable mean process relative to the group family. We show that this dependence is tight up to logarithmic factors."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The analysis assumes that the threshold-complexity measure of the predictable mean process (relative to the given group family) is well-defined and that the algorithm can observe enough information to decide when to refine the dyadic grid without additional side information."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A single online multicalibration algorithm adaptively refines a dyadic grid and achieves instance-dependent rates: O(T^{2/3}) worst-case, O(sqrt T) for marginal stochastic data, and O(sqrt(JT)) for J-piecewise stationary means."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A single efficient algorithm achieves online multicalibration with error rates that automatically adapt to the complexity of the data sequence."}],"snapshot_sha256":"7e50624eeae355e9a114ab44314402bd943ed7a13d27665a83a4cce2e8c20e1d"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T08:02:08.914613Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T20:34:28.985734Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T13:31:17.808759Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T10:22:16.618251Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.09273/integrity.json","findings":[],"snapshot_sha256":"63a0e1f4c96243ebbcc85ade7f4d5204a5985f254a6c502c15069f71c6371b0d","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study online multicalibration beyond the worst-case. We give a single, efficient algorithm which dynamically interpolates between benign and worst-case sequences by adaptively refining a dyadic grid of prediction values. Its error is controlled by the number of leaves in the refinement tree. Our analysis recovers the known $\\widetilde O(T^{2/3})$ worst-case-optimal rate for online multicalibration, while simultaneously automatically adapting to easier instances: in the marginal stochastic setting it obtains a rate of $\\widetilde O(\\sqrt T)$, and for piecewise-stationary means with $J$ segme","authors_text":"Aaron Roth, Claire Jie Zhang, Jamie Morgenstern, Zhiming Huang","cross_cats":[],"headline":"A single efficient algorithm achieves online multicalibration with error rates that automatically adapt to the complexity of the data sequence.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-10T02:45:59Z","title":"Instance-Adaptive Online Multicalibration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.09273","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T04:39:51.056389Z","id":"0283a81d-f593-4251-8a3b-1706394b515e","model_set":{"reader":"grok-4.3"},"one_line_summary":"A single online multicalibration algorithm adaptively refines a dyadic grid and achieves instance-dependent rates: O(T^{2/3}) worst-case, O(sqrt T) for marginal stochastic data, and O(sqrt(JT)) for J-piecewise stationary means.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A single efficient algorithm achieves online multicalibration with error rates that automatically adapt to the complexity of the data sequence.","strongest_claim":"We give a single, efficient algorithm which dynamically interpolates between benign and worst-case sequences by adaptively refining a dyadic grid of prediction values. Its error is controlled by the number of leaves in the refinement tree. ... the rate depends on a threshold-complexity measure of the predictable mean process relative to the group family. We show that this dependence is tight up to logarithmic factors.","weakest_assumption":"The analysis assumes that the threshold-complexity measure of the predictable mean process (relative to the given group family) is well-defined and that the algorithm can observe enough information to decide when to refine the dyadic grid without additional side information."}},"verdict_id":"0283a81d-f593-4251-8a3b-1706394b515e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:62325ba88facad35cd26a9d722d98ccb9697166b2b59ca74b7573ad135c291e5","target":"record","created_at":"2026-05-22T01:04:05Z","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":"4b1fa55881a995e83a78a7369943902a1f06e2c5bc30f240d33b9c1a5fc768f9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-10T02:45:59Z","title_canon_sha256":"6978a7a0611978c68b9d78abd19c794f1e23e7d6b15b362a1b2392bf72371dcf"},"schema_version":"1.0","source":{"id":"2605.09273","kind":"arxiv","version":2}},"canonical_sha256":"4b903680b2a9c23f8403ac6c7ff6794559e924842a102d379196fcb4717b86c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b903680b2a9c23f8403ac6c7ff6794559e924842a102d379196fcb4717b86c8","first_computed_at":"2026-05-22T01:04:05.798767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:05.798767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vDFAHZMUSpWsFhOWYPWpn7KiW28xn2WYoJowY8fsp3gKeMM+TdX/GjgXz18I41zd9J/2qX6j06ByCM52kFWbDQ==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:05.799716Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.09273","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62325ba88facad35cd26a9d722d98ccb9697166b2b59ca74b7573ad135c291e5","sha256:4422f4d321af8879e4c0f0936f8be37a8813f11d4d2b836ac65938d8dda38312"],"state_sha256":"74c7f0fdb526f0aa7c000976305dfb98dfbc6cce221efac98283da9e380b12d5"}