{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:P4HWAUP3EWTLFMIF6RXK4RLZTT","short_pith_number":"pith:P4HWAUP3","canonical_record":{"source":{"id":"2503.19856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-25T17:20:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a01c5debbf8330a939218355d50bdb98315ab82c8b13ca75a1f7373b8ba40af9","abstract_canon_sha256":"c1dd7eba68fec3248cf950ebd6a723ef3c08596ef120bb3ba83df72cf7fd9ff2"},"schema_version":"1.0"},"canonical_sha256":"7f0f6051fb25a6b2b105f46eae45799cc9396bbc1f922ace758a39e1024bc72c","source":{"kind":"arxiv","id":"2503.19856","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.19856","created_at":"2026-07-05T11:27:28Z"},{"alias_kind":"arxiv_version","alias_value":"2503.19856v2","created_at":"2026-07-05T11:27:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.19856","created_at":"2026-07-05T11:27:28Z"},{"alias_kind":"pith_short_12","alias_value":"P4HWAUP3EWTL","created_at":"2026-07-05T11:27:28Z"},{"alias_kind":"pith_short_16","alias_value":"P4HWAUP3EWTLFMIF","created_at":"2026-07-05T11:27:28Z"},{"alias_kind":"pith_short_8","alias_value":"P4HWAUP3","created_at":"2026-07-05T11:27:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:P4HWAUP3EWTLFMIF6RXK4RLZTT","target":"record","payload":{"canonical_record":{"source":{"id":"2503.19856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-25T17:20:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a01c5debbf8330a939218355d50bdb98315ab82c8b13ca75a1f7373b8ba40af9","abstract_canon_sha256":"c1dd7eba68fec3248cf950ebd6a723ef3c08596ef120bb3ba83df72cf7fd9ff2"},"schema_version":"1.0"},"canonical_sha256":"7f0f6051fb25a6b2b105f46eae45799cc9396bbc1f922ace758a39e1024bc72c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:28.650437Z","signature_b64":"/M7yliL0kkB+0v6LktroyG58Tn9VFUqGxchO3UQHtesnIVt3ZhQ37dD5nvKHUTR9e1Nh4N1Zx5oMeckfwzwWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f0f6051fb25a6b2b105f46eae45799cc9396bbc1f922ace758a39e1024bc72c","last_reissued_at":"2026-07-05T11:27:28.649965Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:28.649965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.19856","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:27:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gJBH3/QK6HIPn7Yynex1o77546WbhPf2zq8ZlHom/r+SOwQwoyaQH0U2YF2WW6KyGnttOSQoYgPJ1X1mZuFSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:37:47.444790Z"},"content_sha256":"09d8350c4bd27d12eb7b650a28563cda009b4438b229373550849d13f4672899","schema_version":"1.0","event_id":"sha256:09d8350c4bd27d12eb7b650a28563cda009b4438b229373550849d13f4672899"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:P4HWAUP3EWTLFMIF6RXK4RLZTT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity-Constrained Online Learning with Delays: Scheduling Frameworks and Regret Trade-offs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Ryabchenko, Daniel M. Roy, Idan Attias","submitted_at":"2025-03-25T17:20:39Z","abstract_excerpt":"We study online learning with oblivious losses and delays under a novel ``capacity constraint'' that limits how many past rounds can be tracked simultaneously for delayed feedback. Under ``clairvoyance'' (i.e., delay durations are revealed upfront each round) and/or ``preemptibility'' (i.e., we can stop tracking previously chosen round feedback), we establish matching upper and lower bounds (up to logarithmic terms) on achievable regret, characterizing the ``optimal capacity'' needed to match the minimax rates of classical delayed online learning, which implicitly assume unlimited capacity. Ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.19856","kind":"arxiv","version":2},"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/2503.19856/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:27:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWCOzPxpv2+f45dBu78diemD/F3Aa65llXtDOE6qo6xdI8yhU7dAaoALJOK6Pme/6R68ufXmqiNJotKy6Z/NBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:37:47.445462Z"},"content_sha256":"43b5be31eba223804975dcf6eba170152b5489ae3bd23d5c6bc998a7bf2b3169","schema_version":"1.0","event_id":"sha256:43b5be31eba223804975dcf6eba170152b5489ae3bd23d5c6bc998a7bf2b3169"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4HWAUP3EWTLFMIF6RXK4RLZTT/bundle.json","state_url":"https://pith.science/pith/P4HWAUP3EWTLFMIF6RXK4RLZTT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4HWAUP3EWTLFMIF6RXK4RLZTT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T00:37:47Z","links":{"resolver":"https://pith.science/pith/P4HWAUP3EWTLFMIF6RXK4RLZTT","bundle":"https://pith.science/pith/P4HWAUP3EWTLFMIF6RXK4RLZTT/bundle.json","state":"https://pith.science/pith/P4HWAUP3EWTLFMIF6RXK4RLZTT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4HWAUP3EWTLFMIF6RXK4RLZTT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:P4HWAUP3EWTLFMIF6RXK4RLZTT","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":"c1dd7eba68fec3248cf950ebd6a723ef3c08596ef120bb3ba83df72cf7fd9ff2","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-25T17:20:39Z","title_canon_sha256":"a01c5debbf8330a939218355d50bdb98315ab82c8b13ca75a1f7373b8ba40af9"},"schema_version":"1.0","source":{"id":"2503.19856","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.19856","created_at":"2026-07-05T11:27:28Z"},{"alias_kind":"arxiv_version","alias_value":"2503.19856v2","created_at":"2026-07-05T11:27:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.19856","created_at":"2026-07-05T11:27:28Z"},{"alias_kind":"pith_short_12","alias_value":"P4HWAUP3EWTL","created_at":"2026-07-05T11:27:28Z"},{"alias_kind":"pith_short_16","alias_value":"P4HWAUP3EWTLFMIF","created_at":"2026-07-05T11:27:28Z"},{"alias_kind":"pith_short_8","alias_value":"P4HWAUP3","created_at":"2026-07-05T11:27:28Z"}],"graph_snapshots":[{"event_id":"sha256:43b5be31eba223804975dcf6eba170152b5489ae3bd23d5c6bc998a7bf2b3169","target":"graph","created_at":"2026-07-05T11:27:28Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.19856/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study online learning with oblivious losses and delays under a novel ``capacity constraint'' that limits how many past rounds can be tracked simultaneously for delayed feedback. Under ``clairvoyance'' (i.e., delay durations are revealed upfront each round) and/or ``preemptibility'' (i.e., we can stop tracking previously chosen round feedback), we establish matching upper and lower bounds (up to logarithmic terms) on achievable regret, characterizing the ``optimal capacity'' needed to match the minimax rates of classical delayed online learning, which implicitly assume unlimited capacity. Ou","authors_text":"Alexander Ryabchenko, Daniel M. Roy, Idan Attias","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-25T17:20:39Z","title":"Capacity-Constrained Online Learning with Delays: Scheduling Frameworks and Regret Trade-offs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.19856","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:09d8350c4bd27d12eb7b650a28563cda009b4438b229373550849d13f4672899","target":"record","created_at":"2026-07-05T11:27:28Z","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":"c1dd7eba68fec3248cf950ebd6a723ef3c08596ef120bb3ba83df72cf7fd9ff2","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-25T17:20:39Z","title_canon_sha256":"a01c5debbf8330a939218355d50bdb98315ab82c8b13ca75a1f7373b8ba40af9"},"schema_version":"1.0","source":{"id":"2503.19856","kind":"arxiv","version":2}},"canonical_sha256":"7f0f6051fb25a6b2b105f46eae45799cc9396bbc1f922ace758a39e1024bc72c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f0f6051fb25a6b2b105f46eae45799cc9396bbc1f922ace758a39e1024bc72c","first_computed_at":"2026-07-05T11:27:28.649965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:27:28.649965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/M7yliL0kkB+0v6LktroyG58Tn9VFUqGxchO3UQHtesnIVt3ZhQ37dD5nvKHUTR9e1Nh4N1Zx5oMeckfwzwWCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:27:28.650437Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.19856","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09d8350c4bd27d12eb7b650a28563cda009b4438b229373550849d13f4672899","sha256:43b5be31eba223804975dcf6eba170152b5489ae3bd23d5c6bc998a7bf2b3169"],"state_sha256":"ab9a1d9d9434b83d89372633bbb53c60403622e88f1411450e8cc6762492d70d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yj+zXPJpvFbh2H64GiDXwKpH+sbRhWTbl2xgtOSHsJcEVTpMBBj03jrHoJe+G31+IuB7tm9TxbDC4rYlC5UBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T00:37:47.449734Z","bundle_sha256":"6a5a1d6a74ae6566f75b63a01345866f315e0aefb2be582fb3b37f669b94d9ba"}}