{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PG6OUHXARFIXRYVJB2LMPGA7JO","short_pith_number":"pith:PG6OUHXA","canonical_record":{"source":{"id":"1805.11386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-29T12:26:14Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"dea93bff124edfcadc0eec33b775b5dade00be6db8b1c3b473ab9838b6f89771","abstract_canon_sha256":"00117d8b8e4335492aade1bd1a268cb99e2658454cd83336b6a8ef15036c9750"},"schema_version":"1.0"},"canonical_sha256":"79bcea1ee0895178e2a90e96c7981f4b920a806ba8102a76e4965dcd9ec8754f","source":{"kind":"arxiv","id":"1805.11386","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11386","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11386v2","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11386","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"pith_short_12","alias_value":"PG6OUHXARFIX","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PG6OUHXARFIXRYVJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PG6OUHXA","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PG6OUHXARFIXRYVJB2LMPGA7JO","target":"record","payload":{"canonical_record":{"source":{"id":"1805.11386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-29T12:26:14Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"dea93bff124edfcadc0eec33b775b5dade00be6db8b1c3b473ab9838b6f89771","abstract_canon_sha256":"00117d8b8e4335492aade1bd1a268cb99e2658454cd83336b6a8ef15036c9750"},"schema_version":"1.0"},"canonical_sha256":"79bcea1ee0895178e2a90e96c7981f4b920a806ba8102a76e4965dcd9ec8754f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:52.993358Z","signature_b64":"n7E8JRkaCzGTA2otBIxYuZ4Gb/l6KeYP2S1k/O/uOozqwchdkMksQvftRUPMF6VQ2AyuffER9TqWSjtlEP5oCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79bcea1ee0895178e2a90e96c7981f4b920a806ba8102a76e4965dcd9ec8754f","last_reissued_at":"2026-05-17T23:52:52.992656Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:52.992656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.11386","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-05-17T23:52:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kzR1EpFTMGWQuejZDQw3r9DO2u31+BS90jsApWNV6idPKYSjLo9x1QonfF1PIQrNjnXpxYYsmdeCyMt7cRK0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:26:36.210521Z"},"content_sha256":"0c86a11afa8c2a842f18fa6dfeb6b83be7f471ba0b1d34ef006efc38320ef629","schema_version":"1.0","event_id":"sha256:0c86a11afa8c2a842f18fa6dfeb6b83be7f471ba0b1d34ef006efc38320ef629"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PG6OUHXARFIXRYVJB2LMPGA7JO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniform regret bounds over $R^d$ for the sequential linear regression problem with the square loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Gilles Stoltz (LMO), Malo Huard (LMO), Pierre Gaillard (SIERRA), S\\'ebastien Gerchinovitz (IMT)","submitted_at":"2018-05-29T12:26:14Z","abstract_excerpt":"We consider the setting of online linear regression for arbitrary deterministic sequences, with the square loss. We are interested in the aim set by Bartlett et al. (2015): obtain regret bounds that hold uniformly over all competitor vectors. When the feature sequence is known at the beginning of the game, they provided closed-form regret bounds of $2d B^2 \\ln T + \\mathcal{O}_T(1)$, where $T$ is the number of rounds and $B$ is a bound on the observations. Instead, we derive bounds with an optimal constant of $1$ in front of the $d B^2 \\ln T$ term. In the case of sequentially revealed features,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11386","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":""},"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-05-17T23:52:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7wtrsFEXqb9jCOFc4yMLedxmcSw6THpW59ST9/kKaD3nn6u6HjIYaoymEL6EFNTzAjiLnuAsyPh0aJrb0RCDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:26:36.210876Z"},"content_sha256":"a52f7ef7979a9f8676e5e6346df601151ea633f5986bec929f6601c4ad335618","schema_version":"1.0","event_id":"sha256:a52f7ef7979a9f8676e5e6346df601151ea633f5986bec929f6601c4ad335618"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PG6OUHXARFIXRYVJB2LMPGA7JO/bundle.json","state_url":"https://pith.science/pith/PG6OUHXARFIXRYVJB2LMPGA7JO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PG6OUHXARFIXRYVJB2LMPGA7JO/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-05-27T01:26:36Z","links":{"resolver":"https://pith.science/pith/PG6OUHXARFIXRYVJB2LMPGA7JO","bundle":"https://pith.science/pith/PG6OUHXARFIXRYVJB2LMPGA7JO/bundle.json","state":"https://pith.science/pith/PG6OUHXARFIXRYVJB2LMPGA7JO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PG6OUHXARFIXRYVJB2LMPGA7JO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PG6OUHXARFIXRYVJB2LMPGA7JO","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":"00117d8b8e4335492aade1bd1a268cb99e2658454cd83336b6a8ef15036c9750","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-29T12:26:14Z","title_canon_sha256":"dea93bff124edfcadc0eec33b775b5dade00be6db8b1c3b473ab9838b6f89771"},"schema_version":"1.0","source":{"id":"1805.11386","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11386","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11386v2","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11386","created_at":"2026-05-17T23:52:52Z"},{"alias_kind":"pith_short_12","alias_value":"PG6OUHXARFIX","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PG6OUHXARFIXRYVJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PG6OUHXA","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:a52f7ef7979a9f8676e5e6346df601151ea633f5986bec929f6601c4ad335618","target":"graph","created_at":"2026-05-17T23:52:52Z","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"},"paper":{"abstract_excerpt":"We consider the setting of online linear regression for arbitrary deterministic sequences, with the square loss. We are interested in the aim set by Bartlett et al. (2015): obtain regret bounds that hold uniformly over all competitor vectors. When the feature sequence is known at the beginning of the game, they provided closed-form regret bounds of $2d B^2 \\ln T + \\mathcal{O}_T(1)$, where $T$ is the number of rounds and $B$ is a bound on the observations. Instead, we derive bounds with an optimal constant of $1$ in front of the $d B^2 \\ln T$ term. In the case of sequentially revealed features,","authors_text":"Gilles Stoltz (LMO), Malo Huard (LMO), Pierre Gaillard (SIERRA), S\\'ebastien Gerchinovitz (IMT)","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-29T12:26:14Z","title":"Uniform regret bounds over $R^d$ for the sequential linear regression problem with the square loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11386","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:0c86a11afa8c2a842f18fa6dfeb6b83be7f471ba0b1d34ef006efc38320ef629","target":"record","created_at":"2026-05-17T23:52:52Z","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":"00117d8b8e4335492aade1bd1a268cb99e2658454cd83336b6a8ef15036c9750","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-29T12:26:14Z","title_canon_sha256":"dea93bff124edfcadc0eec33b775b5dade00be6db8b1c3b473ab9838b6f89771"},"schema_version":"1.0","source":{"id":"1805.11386","kind":"arxiv","version":2}},"canonical_sha256":"79bcea1ee0895178e2a90e96c7981f4b920a806ba8102a76e4965dcd9ec8754f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79bcea1ee0895178e2a90e96c7981f4b920a806ba8102a76e4965dcd9ec8754f","first_computed_at":"2026-05-17T23:52:52.992656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:52.992656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n7E8JRkaCzGTA2otBIxYuZ4Gb/l6KeYP2S1k/O/uOozqwchdkMksQvftRUPMF6VQ2AyuffER9TqWSjtlEP5oCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:52.993358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11386","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c86a11afa8c2a842f18fa6dfeb6b83be7f471ba0b1d34ef006efc38320ef629","sha256:a52f7ef7979a9f8676e5e6346df601151ea633f5986bec929f6601c4ad335618"],"state_sha256":"7e2ac35dbee2debb98f3e756b2030bcf36970b1010ae11ff2df1e79f21162387"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lD63Eui6Kb/aipave5CogVz+pbYWECq7OtOPRqbEvWGyXOZ0aPfnkxAcxriIFL+h+nXRcZROT9omLWpA1/oeAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:26:36.213085Z","bundle_sha256":"5bf0df00b7f4afa008e41b88cb034cf7f54057a73fb15da6ed0e932c21d5972a"}}