{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HEQJ5V2DCDGBTUQQPUSNBAKV73","short_pith_number":"pith:HEQJ5V2D","schema_version":"1.0","canonical_sha256":"39209ed74310cc19d2107d24d08155fef02b3228185555aaf7f028ebe9e49bf7","source":{"kind":"arxiv","id":"1410.7596","version":1},"attestation_state":"computed","paper":{"title":"Fast Algorithms for Online Stochastic Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.LG","authors_text":"Nikhil R. Devanur, Shipra Agrawal","submitted_at":"2014-10-28T11:57:54Z","abstract_excerpt":"We introduce the online stochastic Convex Programming (CP) problem, a very general version of stochastic online problems which allows arbitrary concave objectives and convex feasibility constraints. Many well-studied problems like online stochastic packing and covering, online stochastic matching with concave returns, etc. form a special case of online stochastic CP. We present fast algorithms for these problems, which achieve near-optimal regret guarantees for both the i.i.d. and the random permutation models of stochastic inputs. When applied to the special case online packing, our ideas yie"},"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":"1410.7596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-28T11:57:54Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"f33544cfdfcb974ae316072ce54ec56603d5b79f39844edcf671e7f78c39ea99","abstract_canon_sha256":"7719615b9dc4ebcb97672edca425ddef5575b28229bd0cd1c1dd33505596f4ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:09.923563Z","signature_b64":"mJqqD5u01CF/4CHT3MFVqRxNhSDG7CHwkJNrrK5wCjH2y5EQq3+8v10auMSJzgjnk/nwcphJBCrzpyfLKeBjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39209ed74310cc19d2107d24d08155fef02b3228185555aaf7f028ebe9e49bf7","last_reissued_at":"2026-05-18T02:39:09.922912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:09.922912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Algorithms for Online Stochastic Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.LG","authors_text":"Nikhil R. Devanur, Shipra Agrawal","submitted_at":"2014-10-28T11:57:54Z","abstract_excerpt":"We introduce the online stochastic Convex Programming (CP) problem, a very general version of stochastic online problems which allows arbitrary concave objectives and convex feasibility constraints. Many well-studied problems like online stochastic packing and covering, online stochastic matching with concave returns, etc. form a special case of online stochastic CP. We present fast algorithms for these problems, which achieve near-optimal regret guarantees for both the i.i.d. and the random permutation models of stochastic inputs. When applied to the special case online packing, our ideas yie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7596","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":"1410.7596","created_at":"2026-05-18T02:39:09.922994+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7596v1","created_at":"2026-05-18T02:39:09.922994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7596","created_at":"2026-05-18T02:39:09.922994+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEQJ5V2DCDGB","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEQJ5V2DCDGBTUQQ","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEQJ5V2D","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10519","citing_title":"Online Resource Allocation With General Constraints","ref_index":61,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73","json":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73.json","graph_json":"https://pith.science/api/pith-number/HEQJ5V2DCDGBTUQQPUSNBAKV73/graph.json","events_json":"https://pith.science/api/pith-number/HEQJ5V2DCDGBTUQQPUSNBAKV73/events.json","paper":"https://pith.science/paper/HEQJ5V2D"},"agent_actions":{"view_html":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73","download_json":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73.json","view_paper":"https://pith.science/paper/HEQJ5V2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7596&json=true","fetch_graph":"https://pith.science/api/pith-number/HEQJ5V2DCDGBTUQQPUSNBAKV73/graph.json","fetch_events":"https://pith.science/api/pith-number/HEQJ5V2DCDGBTUQQPUSNBAKV73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73/action/storage_attestation","attest_author":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73/action/author_attestation","sign_citation":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73/action/citation_signature","submit_replication":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73/action/replication_record"}},"created_at":"2026-05-18T02:39:09.922994+00:00","updated_at":"2026-05-18T02:39:09.922994+00:00"}