{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:J6JTBWA3YWELZIJLSV4HDVPVLG","short_pith_number":"pith:J6JTBWA3","canonical_record":{"source":{"id":"1902.09803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-26T08:51:45Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"f0bf0d4193e1483cfb9eb4f394de079501255c6549ed4b6705f3671115ca6570","abstract_canon_sha256":"82f13f603745b2c969eed4b1ac852ca5711d8e142ea5452351fccf250219626d"},"schema_version":"1.0"},"canonical_sha256":"4f9330d81bc588bca12b957871d5f559bd6a78d5a4dab67e9e4828b48496d636","source":{"kind":"arxiv","id":"1902.09803","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09803","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09803v1","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09803","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"pith_short_12","alias_value":"J6JTBWA3YWEL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"J6JTBWA3YWELZIJL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"J6JTBWA3","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:J6JTBWA3YWELZIJLSV4HDVPVLG","target":"record","payload":{"canonical_record":{"source":{"id":"1902.09803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-26T08:51:45Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"f0bf0d4193e1483cfb9eb4f394de079501255c6549ed4b6705f3671115ca6570","abstract_canon_sha256":"82f13f603745b2c969eed4b1ac852ca5711d8e142ea5452351fccf250219626d"},"schema_version":"1.0"},"canonical_sha256":"4f9330d81bc588bca12b957871d5f559bd6a78d5a4dab67e9e4828b48496d636","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:35.322091Z","signature_b64":"1o9wMS9r5NFiWQ111WgBKQCT/2tmvSuG4Be8PXpKqMzkDrVTGVegmKO2DTqJiRCRH6rMn9LAcDV3knZCMb6iDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f9330d81bc588bca12b957871d5f559bd6a78d5a4dab67e9e4828b48496d636","last_reissued_at":"2026-05-17T23:52:35.321651Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:35.321651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.09803","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:52:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tTlim/4+xJwe9KptvU7VrMa/Y0pdl0tebeh3WOIxlHCjtjxLt67qYKD+4PeyQ2WOKZtfbQZtpaozg1UO4ZBrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:14:35.921105Z"},"content_sha256":"be7f708e1ab6dfed70931d028da1d1567f3c7b1b667c7ce8e3cc96f8c7fd242e","schema_version":"1.0","event_id":"sha256:be7f708e1ab6dfed70931d028da1d1567f3c7b1b667c7ce8e3cc96f8c7fd242e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:J6JTBWA3YWELZIJLSV4HDVPVLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Logarithmic Regret for parameter-free Online Logistic Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Joseph De Vilmarest (LPSM UMR 8001), Olivier Wintenberger (LPSM UMR 8001)","submitted_at":"2019-02-26T08:51:45Z","abstract_excerpt":"We consider online optimization procedures in the context of logistic regression, focusing on the Extended Kalman Filter (EKF). We introduce a second-order algorithm close to the EKF, named Semi-Online Step (SOS), for which we prove a O(log(n)) regret in the adversarial setting, paving the way to similar results for the EKF. This regret bound on SOS is the first for such parameter-free algorithm in the adversarial logistic regression. We prove for the EKF in constant dynamics a O(log(n)) regret in expectation and in the well-specified logistic regression model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09803","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:52:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ud+tDF2iYdeoxRbWqY7WrdxOHy6dLNXBpd0VU+4We7cAlxzOzcRJ8SqtSak1Q6GnFpAJX54JPyhsXsPGVBCzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:14:35.921571Z"},"content_sha256":"f5c6d09e33f094e8fda825b3c0f12b161b9f43287d216a4f743fc31b9bdac670","schema_version":"1.0","event_id":"sha256:f5c6d09e33f094e8fda825b3c0f12b161b9f43287d216a4f743fc31b9bdac670"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6JTBWA3YWELZIJLSV4HDVPVLG/bundle.json","state_url":"https://pith.science/pith/J6JTBWA3YWELZIJLSV4HDVPVLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6JTBWA3YWELZIJLSV4HDVPVLG/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-03T15:14:35Z","links":{"resolver":"https://pith.science/pith/J6JTBWA3YWELZIJLSV4HDVPVLG","bundle":"https://pith.science/pith/J6JTBWA3YWELZIJLSV4HDVPVLG/bundle.json","state":"https://pith.science/pith/J6JTBWA3YWELZIJLSV4HDVPVLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6JTBWA3YWELZIJLSV4HDVPVLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:J6JTBWA3YWELZIJLSV4HDVPVLG","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":"82f13f603745b2c969eed4b1ac852ca5711d8e142ea5452351fccf250219626d","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-26T08:51:45Z","title_canon_sha256":"f0bf0d4193e1483cfb9eb4f394de079501255c6549ed4b6705f3671115ca6570"},"schema_version":"1.0","source":{"id":"1902.09803","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09803","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09803v1","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09803","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"pith_short_12","alias_value":"J6JTBWA3YWEL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"J6JTBWA3YWELZIJL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"J6JTBWA3","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:f5c6d09e33f094e8fda825b3c0f12b161b9f43287d216a4f743fc31b9bdac670","target":"graph","created_at":"2026-05-17T23:52: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":"We consider online optimization procedures in the context of logistic regression, focusing on the Extended Kalman Filter (EKF). We introduce a second-order algorithm close to the EKF, named Semi-Online Step (SOS), for which we prove a O(log(n)) regret in the adversarial setting, paving the way to similar results for the EKF. This regret bound on SOS is the first for such parameter-free algorithm in the adversarial logistic regression. We prove for the EKF in constant dynamics a O(log(n)) regret in expectation and in the well-specified logistic regression model.","authors_text":"Joseph De Vilmarest (LPSM UMR 8001), Olivier Wintenberger (LPSM UMR 8001)","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-26T08:51:45Z","title":"Logarithmic Regret for parameter-free Online Logistic Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09803","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:be7f708e1ab6dfed70931d028da1d1567f3c7b1b667c7ce8e3cc96f8c7fd242e","target":"record","created_at":"2026-05-17T23:52: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":"82f13f603745b2c969eed4b1ac852ca5711d8e142ea5452351fccf250219626d","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-26T08:51:45Z","title_canon_sha256":"f0bf0d4193e1483cfb9eb4f394de079501255c6549ed4b6705f3671115ca6570"},"schema_version":"1.0","source":{"id":"1902.09803","kind":"arxiv","version":1}},"canonical_sha256":"4f9330d81bc588bca12b957871d5f559bd6a78d5a4dab67e9e4828b48496d636","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f9330d81bc588bca12b957871d5f559bd6a78d5a4dab67e9e4828b48496d636","first_computed_at":"2026-05-17T23:52:35.321651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:35.321651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1o9wMS9r5NFiWQ111WgBKQCT/2tmvSuG4Be8PXpKqMzkDrVTGVegmKO2DTqJiRCRH6rMn9LAcDV3knZCMb6iDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:35.322091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.09803","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be7f708e1ab6dfed70931d028da1d1567f3c7b1b667c7ce8e3cc96f8c7fd242e","sha256:f5c6d09e33f094e8fda825b3c0f12b161b9f43287d216a4f743fc31b9bdac670"],"state_sha256":"82bb8205aec514f4d1f550bd7b4306fa41381e6e39543e2f1e1a7bae6b98f8a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PqJ8Z4JPKaBrpHzTrPif3CWZiOOxbdQOifX7x1jYupf5PL1X/1bA2nVvVGwMPJikR4HjNcAKg+q82MhlMbUQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:14:35.923698Z","bundle_sha256":"d47d0509dea93aeae3076786248f2a42ab8067f281d90ea0b83c6159b8c1658d"}}