{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PUD3D5ZOPTCKTRASWIEUWT4NXE","short_pith_number":"pith:PUD3D5ZO","schema_version":"1.0","canonical_sha256":"7d07b1f72e7cc4a9c412b2094b4f8db907cbdfd20546ef34d8b186cc63afb1c0","source":{"kind":"arxiv","id":"1107.4080","version":1},"attestation_state":"computed","paper":{"title":"On the Universality of Online Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ambuj Tewari, Karthik Sridharan, Nathan Srebro","submitted_at":"2011-07-20T19:34:00Z","abstract_excerpt":"We show that for a general class of convex online learning problems, Mirror Descent can always achieve a (nearly) optimal regret guarantee."},"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":"1107.4080","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-20T19:34:00Z","cross_cats_sorted":[],"title_canon_sha256":"4dce4f599dcc18cc58ceeed3e73853e5c44d10b506ab5dd7f0ab3330eb1329ba","abstract_canon_sha256":"bbf1ab47d566678e991196842c833d6559981192058ff79d78024f2cf059807c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:14.044149Z","signature_b64":"31aAWZv6AyFeKFm63co5TnH2pp2v9lsYoobWDT7C4vfxUJKHn+mcObE/dzwxftQ/gOeMmZBKUPg3Cp3urDBpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d07b1f72e7cc4a9c412b2094b4f8db907cbdfd20546ef34d8b186cc63afb1c0","last_reissued_at":"2026-05-18T04:17:14.043624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:14.043624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Universality of Online Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ambuj Tewari, Karthik Sridharan, Nathan Srebro","submitted_at":"2011-07-20T19:34:00Z","abstract_excerpt":"We show that for a general class of convex online learning problems, Mirror Descent can always achieve a (nearly) optimal regret guarantee."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4080","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.4080","created_at":"2026-05-18T04:17:14.043704+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4080v1","created_at":"2026-05-18T04:17:14.043704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4080","created_at":"2026-05-18T04:17:14.043704+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUD3D5ZOPTCK","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUD3D5ZOPTCKTRAS","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUD3D5ZO","created_at":"2026-05-18T12:26:39.201973+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/PUD3D5ZOPTCKTRASWIEUWT4NXE","json":"https://pith.science/pith/PUD3D5ZOPTCKTRASWIEUWT4NXE.json","graph_json":"https://pith.science/api/pith-number/PUD3D5ZOPTCKTRASWIEUWT4NXE/graph.json","events_json":"https://pith.science/api/pith-number/PUD3D5ZOPTCKTRASWIEUWT4NXE/events.json","paper":"https://pith.science/paper/PUD3D5ZO"},"agent_actions":{"view_html":"https://pith.science/pith/PUD3D5ZOPTCKTRASWIEUWT4NXE","download_json":"https://pith.science/pith/PUD3D5ZOPTCKTRASWIEUWT4NXE.json","view_paper":"https://pith.science/paper/PUD3D5ZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4080&json=true","fetch_graph":"https://pith.science/api/pith-number/PUD3D5ZOPTCKTRASWIEUWT4NXE/graph.json","fetch_events":"https://pith.science/api/pith-number/PUD3D5ZOPTCKTRASWIEUWT4NXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUD3D5ZOPTCKTRASWIEUWT4NXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUD3D5ZOPTCKTRASWIEUWT4NXE/action/storage_attestation","attest_author":"https://pith.science/pith/PUD3D5ZOPTCKTRASWIEUWT4NXE/action/author_attestation","sign_citation":"https://pith.science/pith/PUD3D5ZOPTCKTRASWIEUWT4NXE/action/citation_signature","submit_replication":"https://pith.science/pith/PUD3D5ZOPTCKTRASWIEUWT4NXE/action/replication_record"}},"created_at":"2026-05-18T04:17:14.043704+00:00","updated_at":"2026-05-18T04:17:14.043704+00:00"}