{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QUVYYIIVOMAXTD5BAE3UP3N44J","short_pith_number":"pith:QUVYYIIV","canonical_record":{"source":{"id":"1802.08183","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-22T17:13:36Z","cross_cats_sorted":["cs.AI","cs.DS","cs.LG"],"title_canon_sha256":"a0b7865a63fcc83b613cf0a11f0a60f85b158684cdec6d11ebb065d40be47bbc","abstract_canon_sha256":"4a7a87bbd3b6ae9442b9ba3c92e8410810cf7b5f14488c42c85e96515a4dae39"},"schema_version":"1.0"},"canonical_sha256":"852b8c21157301798fa1013747edbce255bd76c3dd38d761f7817ca83a7bf349","source":{"kind":"arxiv","id":"1802.08183","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08183","created_at":"2026-05-18T00:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08183v4","created_at":"2026-05-18T00:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08183","created_at":"2026-05-18T00:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"QUVYYIIVOMAX","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QUVYYIIVOMAXTD5B","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QUVYYIIV","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QUVYYIIVOMAXTD5BAE3UP3N44J","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08183","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-22T17:13:36Z","cross_cats_sorted":["cs.AI","cs.DS","cs.LG"],"title_canon_sha256":"a0b7865a63fcc83b613cf0a11f0a60f85b158684cdec6d11ebb065d40be47bbc","abstract_canon_sha256":"4a7a87bbd3b6ae9442b9ba3c92e8410810cf7b5f14488c42c85e96515a4dae39"},"schema_version":"1.0"},"canonical_sha256":"852b8c21157301798fa1013747edbce255bd76c3dd38d761f7817ca83a7bf349","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:17.303336Z","signature_b64":"9oCLsw0VVIV2R299dbpJTrwjHf0V2P3eu91id3hJjIhz5+m7nG1dxYecRGk60PPfljpV+c309ywmvIhj+vsrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"852b8c21157301798fa1013747edbce255bd76c3dd38d761f7817ca83a7bf349","last_reissued_at":"2026-05-18T00:13:17.302442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:17.302442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08183","source_version":4,"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-18T00:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cWJjcPEMJwMZXRauESjUOlTK0n3j2GBhFeRxPiO1yUXJvQK4PbNdiOyzGrXUkUnJQsdCLHxRI51dC9sN2tufBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:53:20.276757Z"},"content_sha256":"4527dd034fc32a33088b469cc4956f5d29bcb1b64405bafe5e00e5aa6d347c3a","schema_version":"1.0","event_id":"sha256:4527dd034fc32a33088b469cc4956f5d29bcb1b64405bafe5e00e5aa6d347c3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QUVYYIIVOMAXTD5BAE3UP3N44J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Amin Karbasi, Christopher Harshaw, Hamed Hassani, Lin Chen","submitted_at":"2018-02-22T17:13:36Z","abstract_excerpt":"Online optimization has been a successful framework for solving large-scale problems under computational constraints and partial information. Current methods for online convex optimization require either a projection or exact gradient computation at each step, both of which can be prohibitively expensive for large-scale applications. At the same time, there is a growing trend of non-convex optimization in machine learning community and a need for online methods. Continuous DR-submodular functions, which exhibit a natural diminishing returns condition, have recently been proposed as a broad cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08183","kind":"arxiv","version":4},"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-18T00:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KGsyKym/CJ9GGXIKwJ3FBFbjRPewQBy5QTK0nNHqGbFk2xoIJM+r01OSqg9c6xag+/857DyUCCyv/dEiGVraDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:53:20.277126Z"},"content_sha256":"b7255c32fa1014ad41f83fc8cfb2ae19fc82ee57f735bba17dd29b9a273fe542","schema_version":"1.0","event_id":"sha256:b7255c32fa1014ad41f83fc8cfb2ae19fc82ee57f735bba17dd29b9a273fe542"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J/bundle.json","state_url":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUVYYIIVOMAXTD5BAE3UP3N44J/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-05-31T12:53:20Z","links":{"resolver":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J","bundle":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J/bundle.json","state":"https://pith.science/pith/QUVYYIIVOMAXTD5BAE3UP3N44J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUVYYIIVOMAXTD5BAE3UP3N44J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QUVYYIIVOMAXTD5BAE3UP3N44J","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":"4a7a87bbd3b6ae9442b9ba3c92e8410810cf7b5f14488c42c85e96515a4dae39","cross_cats_sorted":["cs.AI","cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-22T17:13:36Z","title_canon_sha256":"a0b7865a63fcc83b613cf0a11f0a60f85b158684cdec6d11ebb065d40be47bbc"},"schema_version":"1.0","source":{"id":"1802.08183","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08183","created_at":"2026-05-18T00:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08183v4","created_at":"2026-05-18T00:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08183","created_at":"2026-05-18T00:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"QUVYYIIVOMAX","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QUVYYIIVOMAXTD5B","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QUVYYIIV","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:b7255c32fa1014ad41f83fc8cfb2ae19fc82ee57f735bba17dd29b9a273fe542","target":"graph","created_at":"2026-05-18T00:13:17Z","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":"Online optimization has been a successful framework for solving large-scale problems under computational constraints and partial information. Current methods for online convex optimization require either a projection or exact gradient computation at each step, both of which can be prohibitively expensive for large-scale applications. At the same time, there is a growing trend of non-convex optimization in machine learning community and a need for online methods. Continuous DR-submodular functions, which exhibit a natural diminishing returns condition, have recently been proposed as a broad cla","authors_text":"Amin Karbasi, Christopher Harshaw, Hamed Hassani, Lin Chen","cross_cats":["cs.AI","cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-22T17:13:36Z","title":"Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08183","kind":"arxiv","version":4},"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:4527dd034fc32a33088b469cc4956f5d29bcb1b64405bafe5e00e5aa6d347c3a","target":"record","created_at":"2026-05-18T00:13:17Z","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":"4a7a87bbd3b6ae9442b9ba3c92e8410810cf7b5f14488c42c85e96515a4dae39","cross_cats_sorted":["cs.AI","cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-22T17:13:36Z","title_canon_sha256":"a0b7865a63fcc83b613cf0a11f0a60f85b158684cdec6d11ebb065d40be47bbc"},"schema_version":"1.0","source":{"id":"1802.08183","kind":"arxiv","version":4}},"canonical_sha256":"852b8c21157301798fa1013747edbce255bd76c3dd38d761f7817ca83a7bf349","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"852b8c21157301798fa1013747edbce255bd76c3dd38d761f7817ca83a7bf349","first_computed_at":"2026-05-18T00:13:17.302442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:17.302442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9oCLsw0VVIV2R299dbpJTrwjHf0V2P3eu91id3hJjIhz5+m7nG1dxYecRGk60PPfljpV+c309ywmvIhj+vsrAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:17.303336Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08183","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4527dd034fc32a33088b469cc4956f5d29bcb1b64405bafe5e00e5aa6d347c3a","sha256:b7255c32fa1014ad41f83fc8cfb2ae19fc82ee57f735bba17dd29b9a273fe542"],"state_sha256":"dca5078574f9f9def425fcbcd5e5f08b4551b4487e7e8d64b17c1d527b5c1ea1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x3gW37uiEEKc7HLOjDObE//MwXEZXKiZXnnO4DAuuRGGfRXxg82tdF7saxhGyKOlvQrc0/P36VYjJav9W32xAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:53:20.279930Z","bundle_sha256":"5c2cf5f5421f88f35ab62cad57a70b44bb96e4e90d701067be89976d02b8b599"}}