{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:W7P7DJQXWXJ4FCQFUGDP22M6CM","short_pith_number":"pith:W7P7DJQX","schema_version":"1.0","canonical_sha256":"b7dff1a617b5d3c28a05a186fd699e131f084a9630656c4d5f41506590ca12f2","source":{"kind":"arxiv","id":"1304.2994","version":3},"attestation_state":"computed","paper":{"title":"A Generalized Online Mirror Descent with Applications to Classification and Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Francesco Orabona, Koby Crammer, Nicol\\`o Cesa-Bianchi","submitted_at":"2013-04-10T15:26:13Z","abstract_excerpt":"Online learning algorithms are fast, memory-efficient, easy to implement, and applicable to many prediction problems, including classification, regression, and ranking. Several online algorithms were proposed in the past few decades, some based on additive updates, like the Perceptron, and some on multiplicative updates, like Winnow. A unifying perspective on the design and the analysis of online algorithms is provided by online mirror descent, a general prediction strategy from which most first-order algorithms can be obtained as special cases. We generalize online mirror descent to time-vary"},"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":"1304.2994","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-10T15:26:13Z","cross_cats_sorted":[],"title_canon_sha256":"3b865932651637cf831bd87d6f0c4452987e98aadfc490aeb3feeb06a02d1b63","abstract_canon_sha256":"772575247808351c3631b51a99c39ad34eff8b81275076b3b5df1b0024041ff4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:28.995747Z","signature_b64":"HHjR39sZlpvzXeGH+JHPq3yNHgGmPpLCSwk4D/OCbRA9NIsgbFP9Pt57V3DUdNHq9GlLEBnVQwVJktMpXYPUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7dff1a617b5d3c28a05a186fd699e131f084a9630656c4d5f41506590ca12f2","last_reissued_at":"2026-05-18T01:37:28.995016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:28.995016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalized Online Mirror Descent with Applications to Classification and Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Francesco Orabona, Koby Crammer, Nicol\\`o Cesa-Bianchi","submitted_at":"2013-04-10T15:26:13Z","abstract_excerpt":"Online learning algorithms are fast, memory-efficient, easy to implement, and applicable to many prediction problems, including classification, regression, and ranking. Several online algorithms were proposed in the past few decades, some based on additive updates, like the Perceptron, and some on multiplicative updates, like Winnow. A unifying perspective on the design and the analysis of online algorithms is provided by online mirror descent, a general prediction strategy from which most first-order algorithms can be obtained as special cases. We generalize online mirror descent to time-vary"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2994","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.2994","created_at":"2026-05-18T01:37:28.995134+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2994v3","created_at":"2026-05-18T01:37:28.995134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2994","created_at":"2026-05-18T01:37:28.995134+00:00"},{"alias_kind":"pith_short_12","alias_value":"W7P7DJQXWXJ4","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"W7P7DJQXWXJ4FCQF","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"W7P7DJQX","created_at":"2026-05-18T12:28:04.890932+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/W7P7DJQXWXJ4FCQFUGDP22M6CM","json":"https://pith.science/pith/W7P7DJQXWXJ4FCQFUGDP22M6CM.json","graph_json":"https://pith.science/api/pith-number/W7P7DJQXWXJ4FCQFUGDP22M6CM/graph.json","events_json":"https://pith.science/api/pith-number/W7P7DJQXWXJ4FCQFUGDP22M6CM/events.json","paper":"https://pith.science/paper/W7P7DJQX"},"agent_actions":{"view_html":"https://pith.science/pith/W7P7DJQXWXJ4FCQFUGDP22M6CM","download_json":"https://pith.science/pith/W7P7DJQXWXJ4FCQFUGDP22M6CM.json","view_paper":"https://pith.science/paper/W7P7DJQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2994&json=true","fetch_graph":"https://pith.science/api/pith-number/W7P7DJQXWXJ4FCQFUGDP22M6CM/graph.json","fetch_events":"https://pith.science/api/pith-number/W7P7DJQXWXJ4FCQFUGDP22M6CM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W7P7DJQXWXJ4FCQFUGDP22M6CM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W7P7DJQXWXJ4FCQFUGDP22M6CM/action/storage_attestation","attest_author":"https://pith.science/pith/W7P7DJQXWXJ4FCQFUGDP22M6CM/action/author_attestation","sign_citation":"https://pith.science/pith/W7P7DJQXWXJ4FCQFUGDP22M6CM/action/citation_signature","submit_replication":"https://pith.science/pith/W7P7DJQXWXJ4FCQFUGDP22M6CM/action/replication_record"}},"created_at":"2026-05-18T01:37:28.995134+00:00","updated_at":"2026-05-18T01:37:28.995134+00:00"}