{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X6T3JKKHQRTB6QNWKFMFEGICJH","short_pith_number":"pith:X6T3JKKH","schema_version":"1.0","canonical_sha256":"bfa7b4a94784661f41b6515852190249d05051f094b3f71461b7eb535d778775","source":{"kind":"arxiv","id":"1909.05207","version":3},"attestation_state":"computed","paper":{"title":"Introduction to Online Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Elad Hazan","submitted_at":"2019-09-07T19:06:23Z","abstract_excerpt":"This manuscript portrays optimization as a process. In many practical applications the environment is so complex that it is infeasible to lay out a comprehensive theoretical model and use classical algorithmic theory and mathematical optimization. It is necessary as well as beneficial to take a robust approach, by applying an optimization method that learns as one goes along, learning from experience as more aspects of the problem are observed. This view of optimization as a process has become prominent in varied fields and has led to some spectacular success in modeling and systems that are n"},"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":"1909.05207","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-07T19:06:23Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"afca6ef9cfb1922aeb2ce8cddcf6c103bf3f0c556e6d1569e9898fe794b55fba","abstract_canon_sha256":"77bd85f0aea79ea277fe4ab99bc18d15d3543fe40e30b4d5eca78ead361035b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:37:45.633871Z","signature_b64":"fITl87gD+B83jBAdB2VNiN3tu9Z8nGkXA+40MKZUO+WiowgIV4VRHNGMQzvnW1ZTVbKU8AYBuIRigikEnDo+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfa7b4a94784661f41b6515852190249d05051f094b3f71461b7eb535d778775","last_reissued_at":"2026-07-05T06:37:45.633363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:37:45.633363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Introduction to Online Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Elad Hazan","submitted_at":"2019-09-07T19:06:23Z","abstract_excerpt":"This manuscript portrays optimization as a process. In many practical applications the environment is so complex that it is infeasible to lay out a comprehensive theoretical model and use classical algorithmic theory and mathematical optimization. It is necessary as well as beneficial to take a robust approach, by applying an optimization method that learns as one goes along, learning from experience as more aspects of the problem are observed. This view of optimization as a process has become prominent in varied fields and has led to some spectacular success in modeling and systems that are n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.05207","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.05207/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.05207","created_at":"2026-07-05T06:37:45.633405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.05207v3","created_at":"2026-07-05T06:37:45.633405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.05207","created_at":"2026-07-05T06:37:45.633405+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6T3JKKHQRTB","created_at":"2026-07-05T06:37:45.633405+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6T3JKKHQRTB6QNW","created_at":"2026-07-05T06:37:45.633405+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6T3JKKH","created_at":"2026-07-05T06:37:45.633405+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":12,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18778","citing_title":"Online Distributional Prediction via Latent Cluster Geometry Under Drift and Corruption","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06085","citing_title":"Revenue Guarantees of No-Swap-Regret Dynamics in First Price Auctions","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27718","citing_title":"Robust Moment-Based Estimation via Spectral Gradient Reweighting","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27831","citing_title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23887","citing_title":"CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2603.22596","citing_title":"ParlayMarket: Automated Market Making for Parlay-style Joint Contracts","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21107","citing_title":"A Geometric Approach to Constrained Online Learning","ref_index":163,"is_internal_anchor":false},{"citing_arxiv_id":"2601.17942","citing_title":"LLM-Based SQL Generation: Prompting, Self-Refinement, and Adaptive Weighted Majority Voting","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08290","citing_title":"Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10519","citing_title":"Online Resource Allocation With General Constraints","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06190","citing_title":"Constrained Contextual Bandits with Adversarial Contexts","ref_index":152,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15416","citing_title":"StoSignSGD: Unbiased Structural Stochasticity Fixes SignSGD for Training Large Language Models","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X6T3JKKHQRTB6QNWKFMFEGICJH","json":"https://pith.science/pith/X6T3JKKHQRTB6QNWKFMFEGICJH.json","graph_json":"https://pith.science/api/pith-number/X6T3JKKHQRTB6QNWKFMFEGICJH/graph.json","events_json":"https://pith.science/api/pith-number/X6T3JKKHQRTB6QNWKFMFEGICJH/events.json","paper":"https://pith.science/paper/X6T3JKKH"},"agent_actions":{"view_html":"https://pith.science/pith/X6T3JKKHQRTB6QNWKFMFEGICJH","download_json":"https://pith.science/pith/X6T3JKKHQRTB6QNWKFMFEGICJH.json","view_paper":"https://pith.science/paper/X6T3JKKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.05207&json=true","fetch_graph":"https://pith.science/api/pith-number/X6T3JKKHQRTB6QNWKFMFEGICJH/graph.json","fetch_events":"https://pith.science/api/pith-number/X6T3JKKHQRTB6QNWKFMFEGICJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6T3JKKHQRTB6QNWKFMFEGICJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6T3JKKHQRTB6QNWKFMFEGICJH/action/storage_attestation","attest_author":"https://pith.science/pith/X6T3JKKHQRTB6QNWKFMFEGICJH/action/author_attestation","sign_citation":"https://pith.science/pith/X6T3JKKHQRTB6QNWKFMFEGICJH/action/citation_signature","submit_replication":"https://pith.science/pith/X6T3JKKHQRTB6QNWKFMFEGICJH/action/replication_record"}},"created_at":"2026-07-05T06:37:45.633405+00:00","updated_at":"2026-07-05T06:37:45.633405+00:00"}