{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HEQJ5V2DCDGBTUQQPUSNBAKV73","short_pith_number":"pith:HEQJ5V2D","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"},"canonical_sha256":"39209ed74310cc19d2107d24d08155fef02b3228185555aaf7f028ebe9e49bf7","source":{"kind":"arxiv","id":"1410.7596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7596","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7596v1","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7596","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"HEQJ5V2DCDGB","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HEQJ5V2DCDGBTUQQ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HEQJ5V2D","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HEQJ5V2DCDGBTUQQPUSNBAKV73","target":"record","payload":{"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"},"canonical_sha256":"39209ed74310cc19d2107d24d08155fef02b3228185555aaf7f028ebe9e49bf7","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"},"source_kind":"arxiv","source_id":"1410.7596","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-18T02:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VWOgSFUJgHc8NRG7BdJnjOLdZIXY7PArnz1KAxIAiq+Uk0140s6u5AqqM2W/rzPQj6A5iRCiXmdJ/D10R8lJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:53:33.494647Z"},"content_sha256":"c42b81e243d132f30e7010b113d56b953b048c2383c6c8b8a6b502307bf17d84","schema_version":"1.0","event_id":"sha256:c42b81e243d132f30e7010b113d56b953b048c2383c6c8b8a6b502307bf17d84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HEQJ5V2DCDGBTUQQPUSNBAKV73","target":"graph","payload":{"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"},"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-18T02:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iBWAS9yRgFXezBL5aaz8zQYY4bIWEQC2D0BNczl6lMAeLUdF4EfAAoeL8lqI6lS7j/zcmB0TEXy0N1zsHI2KCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:53:33.495008Z"},"content_sha256":"2e49b4ec7d9b8deb0b8782df42ee95fb35921f022ce30cecb6afa5312d193f44","schema_version":"1.0","event_id":"sha256:2e49b4ec7d9b8deb0b8782df42ee95fb35921f022ce30cecb6afa5312d193f44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73/bundle.json","state_url":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73/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-05T14:53:33Z","links":{"resolver":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73","bundle":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73/bundle.json","state":"https://pith.science/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEQJ5V2DCDGBTUQQPUSNBAKV73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HEQJ5V2DCDGBTUQQPUSNBAKV73","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":"7719615b9dc4ebcb97672edca425ddef5575b28229bd0cd1c1dd33505596f4ee","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-28T11:57:54Z","title_canon_sha256":"f33544cfdfcb974ae316072ce54ec56603d5b79f39844edcf671e7f78c39ea99"},"schema_version":"1.0","source":{"id":"1410.7596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7596","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7596v1","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7596","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"HEQJ5V2DCDGB","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HEQJ5V2DCDGBTUQQ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HEQJ5V2D","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:2e49b4ec7d9b8deb0b8782df42ee95fb35921f022ce30cecb6afa5312d193f44","target":"graph","created_at":"2026-05-18T02:39:09Z","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 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","authors_text":"Nikhil R. Devanur, Shipra Agrawal","cross_cats":["cs.DS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-28T11:57:54Z","title":"Fast Algorithms for Online Stochastic Convex Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7596","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:c42b81e243d132f30e7010b113d56b953b048c2383c6c8b8a6b502307bf17d84","target":"record","created_at":"2026-05-18T02:39:09Z","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":"7719615b9dc4ebcb97672edca425ddef5575b28229bd0cd1c1dd33505596f4ee","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-28T11:57:54Z","title_canon_sha256":"f33544cfdfcb974ae316072ce54ec56603d5b79f39844edcf671e7f78c39ea99"},"schema_version":"1.0","source":{"id":"1410.7596","kind":"arxiv","version":1}},"canonical_sha256":"39209ed74310cc19d2107d24d08155fef02b3228185555aaf7f028ebe9e49bf7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39209ed74310cc19d2107d24d08155fef02b3228185555aaf7f028ebe9e49bf7","first_computed_at":"2026-05-18T02:39:09.922912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:09.922912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mJqqD5u01CF/4CHT3MFVqRxNhSDG7CHwkJNrrK5wCjH2y5EQq3+8v10auMSJzgjnk/nwcphJBCrzpyfLKeBjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:09.923563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c42b81e243d132f30e7010b113d56b953b048c2383c6c8b8a6b502307bf17d84","sha256:2e49b4ec7d9b8deb0b8782df42ee95fb35921f022ce30cecb6afa5312d193f44"],"state_sha256":"248ee3cf49a6348d3a176132e35c6854de9803f66e36a10dcc213446b3f870ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2g1OUgjNIAx8UgEqhJPmE8JWFWtdAdSaXIzjssTcsrtWBs62FG3x31PTYH4gFiz1D8hUm5aL4jNK44xXqBYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:53:33.496897Z","bundle_sha256":"fe0018d5cf5c9ed1d2adb6b37355a02fca5e619658b8f92caaf507c82ddf1b28"}}