{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ME7G7FAHC6JR5ZGKIMNRAS27S4","short_pith_number":"pith:ME7G7FAH","canonical_record":{"source":{"id":"1903.09869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-23T19:15:41Z","cross_cats_sorted":[],"title_canon_sha256":"f8a7c9446d78bc6376c0bf32ddc3b18453fb5f90bd7d772f3d12ed88ba5a18f3","abstract_canon_sha256":"41f78eac622ba4f84824ad6f7161aafad100589ed0007efde7b3f83a5ab78a56"},"schema_version":"1.0"},"canonical_sha256":"613e6f940717931ee4ca431b104b5f97039220a33ac131894addf52a4b079144","source":{"kind":"arxiv","id":"1903.09869","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09869","created_at":"2026-05-17T23:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09869v1","created_at":"2026-05-17T23:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09869","created_at":"2026-05-17T23:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"ME7G7FAHC6JR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"ME7G7FAHC6JR5ZGK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"ME7G7FAH","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ME7G7FAHC6JR5ZGKIMNRAS27S4","target":"record","payload":{"canonical_record":{"source":{"id":"1903.09869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-23T19:15:41Z","cross_cats_sorted":[],"title_canon_sha256":"f8a7c9446d78bc6376c0bf32ddc3b18453fb5f90bd7d772f3d12ed88ba5a18f3","abstract_canon_sha256":"41f78eac622ba4f84824ad6f7161aafad100589ed0007efde7b3f83a5ab78a56"},"schema_version":"1.0"},"canonical_sha256":"613e6f940717931ee4ca431b104b5f97039220a33ac131894addf52a4b079144","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:35.222263Z","signature_b64":"qcOdUHwCmjc1+6leE0cN0jRP8BB4+BqwODJL6Vpv0X8GTLf30GxkMl//91nhSO8//chtV6xm5ciUlfsSBNxIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"613e6f940717931ee4ca431b104b5f97039220a33ac131894addf52a4b079144","last_reissued_at":"2026-05-17T23:50:35.221467Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:35.221467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.09869","source_version":1,"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:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YVEj4O7I0p7WCEBQLXaQ4/bqD+uQRnpBp3h7OWR4V403ia0brmqSDjlqEBmEWh6Murt3Cowm3tCZZf4uGw+CBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:30:43.471505Z"},"content_sha256":"e781cf5d953fa4c4d010c4f1e48f99c5bc29dc854cdfe7e0f2f3eccfb0cf2e41","schema_version":"1.0","event_id":"sha256:e781cf5d953fa4c4d010c4f1e48f99c5bc29dc854cdfe7e0f2f3eccfb0cf2e41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ME7G7FAHC6JR5ZGKIMNRAS27S4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Optimisation for Online Learning and Control -- From No-Regret to Generalised Error Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jan-P. Calliess","submitted_at":"2019-03-23T19:15:41Z","abstract_excerpt":"This paper presents early work aiming at the development of a new framework for the design and analysis of algorithms for online learning based prediction and control. Firstly, we consider the task of predicting values of a function or time series based on incrementally arriving sequences of inputs by utilising online programming. Introducing a generalisation of standard notions of convergence, we derive theoretical guarantees on the asymptotic behaviour of the prediction accuracies when prediction models are updated by a no-external-regret algorithm. We prove generalised learning guarantees f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09869","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":""},"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:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8is6Lq////ryU12yCDnqV2K4BboEJMsKRkFFZTrLH/6MePl5nfNPzmjezB/FIfz1HQi1VvSa/Yx17xOsKRPbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:30:43.471846Z"},"content_sha256":"6da17c1fc3b1f3faaf7480a97554cfb29e9474e7b10afbec47ae6c4d62e34f08","schema_version":"1.0","event_id":"sha256:6da17c1fc3b1f3faaf7480a97554cfb29e9474e7b10afbec47ae6c4d62e34f08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ME7G7FAHC6JR5ZGKIMNRAS27S4/bundle.json","state_url":"https://pith.science/pith/ME7G7FAHC6JR5ZGKIMNRAS27S4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ME7G7FAHC6JR5ZGKIMNRAS27S4/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-06-02T00:30:43Z","links":{"resolver":"https://pith.science/pith/ME7G7FAHC6JR5ZGKIMNRAS27S4","bundle":"https://pith.science/pith/ME7G7FAHC6JR5ZGKIMNRAS27S4/bundle.json","state":"https://pith.science/pith/ME7G7FAHC6JR5ZGKIMNRAS27S4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ME7G7FAHC6JR5ZGKIMNRAS27S4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ME7G7FAHC6JR5ZGKIMNRAS27S4","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":"41f78eac622ba4f84824ad6f7161aafad100589ed0007efde7b3f83a5ab78a56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-23T19:15:41Z","title_canon_sha256":"f8a7c9446d78bc6376c0bf32ddc3b18453fb5f90bd7d772f3d12ed88ba5a18f3"},"schema_version":"1.0","source":{"id":"1903.09869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09869","created_at":"2026-05-17T23:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09869v1","created_at":"2026-05-17T23:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09869","created_at":"2026-05-17T23:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"ME7G7FAHC6JR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"ME7G7FAHC6JR5ZGK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"ME7G7FAH","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:6da17c1fc3b1f3faaf7480a97554cfb29e9474e7b10afbec47ae6c4d62e34f08","target":"graph","created_at":"2026-05-17T23:50:35Z","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":"This paper presents early work aiming at the development of a new framework for the design and analysis of algorithms for online learning based prediction and control. Firstly, we consider the task of predicting values of a function or time series based on incrementally arriving sequences of inputs by utilising online programming. Introducing a generalisation of standard notions of convergence, we derive theoretical guarantees on the asymptotic behaviour of the prediction accuracies when prediction models are updated by a no-external-regret algorithm. We prove generalised learning guarantees f","authors_text":"Jan-P. Calliess","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-23T19:15:41Z","title":"Online Optimisation for Online Learning and Control -- From No-Regret to Generalised Error Convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09869","kind":"arxiv","version":1},"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:e781cf5d953fa4c4d010c4f1e48f99c5bc29dc854cdfe7e0f2f3eccfb0cf2e41","target":"record","created_at":"2026-05-17T23:50:35Z","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":"41f78eac622ba4f84824ad6f7161aafad100589ed0007efde7b3f83a5ab78a56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-23T19:15:41Z","title_canon_sha256":"f8a7c9446d78bc6376c0bf32ddc3b18453fb5f90bd7d772f3d12ed88ba5a18f3"},"schema_version":"1.0","source":{"id":"1903.09869","kind":"arxiv","version":1}},"canonical_sha256":"613e6f940717931ee4ca431b104b5f97039220a33ac131894addf52a4b079144","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"613e6f940717931ee4ca431b104b5f97039220a33ac131894addf52a4b079144","first_computed_at":"2026-05-17T23:50:35.221467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:35.221467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qcOdUHwCmjc1+6leE0cN0jRP8BB4+BqwODJL6Vpv0X8GTLf30GxkMl//91nhSO8//chtV6xm5ciUlfsSBNxIBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:35.222263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09869","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e781cf5d953fa4c4d010c4f1e48f99c5bc29dc854cdfe7e0f2f3eccfb0cf2e41","sha256:6da17c1fc3b1f3faaf7480a97554cfb29e9474e7b10afbec47ae6c4d62e34f08"],"state_sha256":"df649b57da7835f2b82cf0880a74814950422007b23fbf10fbbf5cd20ed5fdd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPDTX0SNJLQ3viRWndohsd0wdTOD6JcRZ9VMvOKWJGW9omss5UfexbfG0oa8CzR6YmXXrav9Dm4HpFk3oIuIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:30:43.473842Z","bundle_sha256":"68696585fb4cf9c7acb04cf3003b221d36cb406f1de694cb30eaeda8876dc9c1"}}