{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ROADVAY5JJW6T67K2ISYGOEWXA","short_pith_number":"pith:ROADVAY5","schema_version":"1.0","canonical_sha256":"8b803a831d4a6de9fbead225833896b82424b7c6773e09051a5366fba839d629","source":{"kind":"arxiv","id":"2606.29533","version":1},"attestation_state":"computed","paper":{"title":"Improved Multi-Dimensional Forecasting for Swap Regret","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Chido Onyeze, Erald Sinanaj, Eva Tardos, Joey Rivkin, Ramiro N. Deo-Campo Vuong, Robert Kleinberg","submitted_at":"2026-06-28T17:57:40Z","abstract_excerpt":"We study the problem of forecasting for an arbitrary number of downstream agents with unknown objectives, each of whom best responds to the forecaster's predictions. We seek a single forecaster that guarantees sublinear swap regret for all downstream agents simultaneously. For two-dimensional outcome spaces, we give a polynomial time algorithm that guarantees $\\tilde{O}(\\sqrt{kT})$ swap regret for any downstream agent with $k$ actions. This improves over the previously known bound of $\\tilde{O}(kT^{5/8})$ and avoids the exponential in $T$ runtime of prior algorithms in this setting. Our algori"},"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":"2606.29533","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-06-28T17:57:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"07d75bc7011506939a00d44833d7d13079a3f1f08fa738ca0407e22f4abf94d3","abstract_canon_sha256":"2f38dace55a62808f758615e9947c855358e58e6d3120d16287b28e9d7faddb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:18:10.691995Z","signature_b64":"GkMmTovbCDM5CZQwsT2XWmYYbirRUm4Wg0B0IOhkbPw0NlbLIl3eFi8LT47b9h7ibt6tvqxhGYsuWVrOCCIgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b803a831d4a6de9fbead225833896b82424b7c6773e09051a5366fba839d629","last_reissued_at":"2026-06-30T01:18:10.691479Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:18:10.691479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Multi-Dimensional Forecasting for Swap Regret","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Chido Onyeze, Erald Sinanaj, Eva Tardos, Joey Rivkin, Ramiro N. Deo-Campo Vuong, Robert Kleinberg","submitted_at":"2026-06-28T17:57:40Z","abstract_excerpt":"We study the problem of forecasting for an arbitrary number of downstream agents with unknown objectives, each of whom best responds to the forecaster's predictions. We seek a single forecaster that guarantees sublinear swap regret for all downstream agents simultaneously. For two-dimensional outcome spaces, we give a polynomial time algorithm that guarantees $\\tilde{O}(\\sqrt{kT})$ swap regret for any downstream agent with $k$ actions. This improves over the previously known bound of $\\tilde{O}(kT^{5/8})$ and avoids the exponential in $T$ runtime of prior algorithms in this setting. Our algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29533","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/2606.29533/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":"2606.29533","created_at":"2026-06-30T01:18:10.691552+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.29533v1","created_at":"2026-06-30T01:18:10.691552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29533","created_at":"2026-06-30T01:18:10.691552+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROADVAY5JJW6","created_at":"2026-06-30T01:18:10.691552+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROADVAY5JJW6T67K","created_at":"2026-06-30T01:18:10.691552+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROADVAY5","created_at":"2026-06-30T01:18:10.691552+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/ROADVAY5JJW6T67K2ISYGOEWXA","json":"https://pith.science/pith/ROADVAY5JJW6T67K2ISYGOEWXA.json","graph_json":"https://pith.science/api/pith-number/ROADVAY5JJW6T67K2ISYGOEWXA/graph.json","events_json":"https://pith.science/api/pith-number/ROADVAY5JJW6T67K2ISYGOEWXA/events.json","paper":"https://pith.science/paper/ROADVAY5"},"agent_actions":{"view_html":"https://pith.science/pith/ROADVAY5JJW6T67K2ISYGOEWXA","download_json":"https://pith.science/pith/ROADVAY5JJW6T67K2ISYGOEWXA.json","view_paper":"https://pith.science/paper/ROADVAY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.29533&json=true","fetch_graph":"https://pith.science/api/pith-number/ROADVAY5JJW6T67K2ISYGOEWXA/graph.json","fetch_events":"https://pith.science/api/pith-number/ROADVAY5JJW6T67K2ISYGOEWXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROADVAY5JJW6T67K2ISYGOEWXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROADVAY5JJW6T67K2ISYGOEWXA/action/storage_attestation","attest_author":"https://pith.science/pith/ROADVAY5JJW6T67K2ISYGOEWXA/action/author_attestation","sign_citation":"https://pith.science/pith/ROADVAY5JJW6T67K2ISYGOEWXA/action/citation_signature","submit_replication":"https://pith.science/pith/ROADVAY5JJW6T67K2ISYGOEWXA/action/replication_record"}},"created_at":"2026-06-30T01:18:10.691552+00:00","updated_at":"2026-06-30T01:18:10.691552+00:00"}