{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:75S5I7QL3HM7T47CGQNNL7A5TT","short_pith_number":"pith:75S5I7QL","canonical_record":{"source":{"id":"1406.0554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-06-03T00:00:38Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"1fac600fe8a5736ed5c67d6aa2b6fb2b6c626beae59396910b7289249e92a1a1","abstract_canon_sha256":"a5d42d6e401798ac6d64012c0db6ab9692d55bf1364b9343ecab64de5bce5e2c"},"schema_version":"1.0"},"canonical_sha256":"ff65d47e0bd9d9f9f3e2341ad5fc1d9cdbe7015e6ee2344da6287f868e134057","source":{"kind":"arxiv","id":"1406.0554","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0554","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0554v1","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0554","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"75S5I7QL3HM7","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"75S5I7QL3HM7T47C","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"75S5I7QL","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:75S5I7QL3HM7T47CGQNNL7A5TT","target":"record","payload":{"canonical_record":{"source":{"id":"1406.0554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-06-03T00:00:38Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"1fac600fe8a5736ed5c67d6aa2b6fb2b6c626beae59396910b7289249e92a1a1","abstract_canon_sha256":"a5d42d6e401798ac6d64012c0db6ab9692d55bf1364b9343ecab64de5bce5e2c"},"schema_version":"1.0"},"canonical_sha256":"ff65d47e0bd9d9f9f3e2341ad5fc1d9cdbe7015e6ee2344da6287f868e134057","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:33.311613Z","signature_b64":"PAhIgYzTeVKPuYGd+5CNEVm4WLM5P/GIRznSWJ7azgZ95fu6PsNqlV0Trx5r6jWm9Z17P3RjnX7SamIlIL1LBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff65d47e0bd9d9f9f3e2341ad5fc1d9cdbe7015e6ee2344da6287f868e134057","last_reissued_at":"2026-05-18T02:50:33.311104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:33.311104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.0554","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:50:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/2f4TdTO084Nw5tSUB61dbF97nVABcWdMQrfLmPkevZxjdzs63/iCBa6kp6g6YF+mk02OjQ2Cid8hPNC+Y0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:35:55.630827Z"},"content_sha256":"7a67d212a290f54f8384c1dcedd4f3bd38124cad4336aa77a1a65223899a0f7b","schema_version":"1.0","event_id":"sha256:7a67d212a290f54f8384c1dcedd4f3bd38124cad4336aa77a1a65223899a0f7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:75S5I7QL3HM7T47CGQNNL7A5TT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Convexification via Risk-Aversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.SY","authors_text":"Emanuel Todorov, Krishnamurthy Dvijotham, Maryam Fazel","submitted_at":"2014-06-03T00:00:38Z","abstract_excerpt":"We develop a framework for convexifying a fairly general class of optimization problems. Under additional assumptions, we analyze the suboptimality of the solution to the convexified problem relative to the original nonconvex problem and prove additive approximation guarantees. We then develop algorithms based on stochastic gradient methods to solve the resulting optimization problems and show bounds on convergence rates. %We show a simple application of this framework to supervised learning, where one can perform integration explicitly and can use standard (non-stochastic) optimization algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0554","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:50:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hR4h/txyTSC+pIWzBlKC558ULM+p7uamLozZqLfNeZhON/ARcq9EdbQggYOx4cve94E5wMDFU01QQPgWxwjXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:35:55.631195Z"},"content_sha256":"f7d4744719a5aa846068da30cdcf5ba42f6bab52f07d631d32b5e66aec7a53f5","schema_version":"1.0","event_id":"sha256:f7d4744719a5aa846068da30cdcf5ba42f6bab52f07d631d32b5e66aec7a53f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75S5I7QL3HM7T47CGQNNL7A5TT/bundle.json","state_url":"https://pith.science/pith/75S5I7QL3HM7T47CGQNNL7A5TT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75S5I7QL3HM7T47CGQNNL7A5TT/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-06T19:35:55Z","links":{"resolver":"https://pith.science/pith/75S5I7QL3HM7T47CGQNNL7A5TT","bundle":"https://pith.science/pith/75S5I7QL3HM7T47CGQNNL7A5TT/bundle.json","state":"https://pith.science/pith/75S5I7QL3HM7T47CGQNNL7A5TT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75S5I7QL3HM7T47CGQNNL7A5TT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:75S5I7QL3HM7T47CGQNNL7A5TT","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":"a5d42d6e401798ac6d64012c0db6ab9692d55bf1364b9343ecab64de5bce5e2c","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-06-03T00:00:38Z","title_canon_sha256":"1fac600fe8a5736ed5c67d6aa2b6fb2b6c626beae59396910b7289249e92a1a1"},"schema_version":"1.0","source":{"id":"1406.0554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0554","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0554v1","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0554","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"75S5I7QL3HM7","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"75S5I7QL3HM7T47C","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"75S5I7QL","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:f7d4744719a5aa846068da30cdcf5ba42f6bab52f07d631d32b5e66aec7a53f5","target":"graph","created_at":"2026-05-18T02:50:33Z","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 develop a framework for convexifying a fairly general class of optimization problems. Under additional assumptions, we analyze the suboptimality of the solution to the convexified problem relative to the original nonconvex problem and prove additive approximation guarantees. We then develop algorithms based on stochastic gradient methods to solve the resulting optimization problems and show bounds on convergence rates. %We show a simple application of this framework to supervised learning, where one can perform integration explicitly and can use standard (non-stochastic) optimization algori","authors_text":"Emanuel Todorov, Krishnamurthy Dvijotham, Maryam Fazel","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-06-03T00:00:38Z","title":"Universal Convexification via Risk-Aversion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0554","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:7a67d212a290f54f8384c1dcedd4f3bd38124cad4336aa77a1a65223899a0f7b","target":"record","created_at":"2026-05-18T02:50:33Z","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":"a5d42d6e401798ac6d64012c0db6ab9692d55bf1364b9343ecab64de5bce5e2c","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-06-03T00:00:38Z","title_canon_sha256":"1fac600fe8a5736ed5c67d6aa2b6fb2b6c626beae59396910b7289249e92a1a1"},"schema_version":"1.0","source":{"id":"1406.0554","kind":"arxiv","version":1}},"canonical_sha256":"ff65d47e0bd9d9f9f3e2341ad5fc1d9cdbe7015e6ee2344da6287f868e134057","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff65d47e0bd9d9f9f3e2341ad5fc1d9cdbe7015e6ee2344da6287f868e134057","first_computed_at":"2026-05-18T02:50:33.311104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:33.311104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PAhIgYzTeVKPuYGd+5CNEVm4WLM5P/GIRznSWJ7azgZ95fu6PsNqlV0Trx5r6jWm9Z17P3RjnX7SamIlIL1LBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:33.311613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.0554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a67d212a290f54f8384c1dcedd4f3bd38124cad4336aa77a1a65223899a0f7b","sha256:f7d4744719a5aa846068da30cdcf5ba42f6bab52f07d631d32b5e66aec7a53f5"],"state_sha256":"1fd0437c7ff9296155aecf8e8de952c31af73f4bb3c67877d1f4319e1461a67a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q6crbm0Ztw0VsHpLutt2cyG2vR5Hbfw2rbPXYTvBIDa32WMPRzlnX4UouhmlxC+PgqY2PUShbywKwvut6WzSCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:35:55.633779Z","bundle_sha256":"c35a700a01ed3f378bf1b29a65fc5fc4d014ecc1a2142bb51821e125c39c72fa"}}