{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5LIAURM4ZYX23V557T3ESQW6JM","short_pith_number":"pith:5LIAURM4","canonical_record":{"source":{"id":"1610.05708","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-18T17:05:03Z","cross_cats_sorted":[],"title_canon_sha256":"6a1ea54862b9ef0813039b984051493e3498596297bbe70ef39b25801a8a0563","abstract_canon_sha256":"07164466cab4a8d2663a7fe7d742d85c3af32efe008f07c6241161c182835819"},"schema_version":"1.0"},"canonical_sha256":"ead00a459cce2fadd7bdfcf64942de4b2809b771b80ce83750d2be1b14d3d36a","source":{"kind":"arxiv","id":"1610.05708","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05708","created_at":"2026-05-18T00:33:22Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05708v3","created_at":"2026-05-18T00:33:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05708","created_at":"2026-05-18T00:33:22Z"},{"alias_kind":"pith_short_12","alias_value":"5LIAURM4ZYX2","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5LIAURM4ZYX23V55","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5LIAURM4","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5LIAURM4ZYX23V557T3ESQW6JM","target":"record","payload":{"canonical_record":{"source":{"id":"1610.05708","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-18T17:05:03Z","cross_cats_sorted":[],"title_canon_sha256":"6a1ea54862b9ef0813039b984051493e3498596297bbe70ef39b25801a8a0563","abstract_canon_sha256":"07164466cab4a8d2663a7fe7d742d85c3af32efe008f07c6241161c182835819"},"schema_version":"1.0"},"canonical_sha256":"ead00a459cce2fadd7bdfcf64942de4b2809b771b80ce83750d2be1b14d3d36a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:22.522513Z","signature_b64":"zhmXCef2OOwRu7goS2hZ9+pLx6mdvY7FvylNvC1aXs3agwD1IGQpdR2JLxRSBHmauciaCSD/8O8OT//GVVgjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ead00a459cce2fadd7bdfcf64942de4b2809b771b80ce83750d2be1b14d3d36a","last_reissued_at":"2026-05-18T00:33:22.521772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:22.521772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.05708","source_version":3,"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:33:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spNGxJwbT3aLQoMqE9U8Ae43OAxJwglICIKC4B2iJzpBIJ9szlyVC7mV2VKIP/ZBlB0FaOeZ5vV7VsfhLW8mBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:27:22.188155Z"},"content_sha256":"b10e9ff649e14ef12eef6987c138f91fdb6ef8539f04ea3082f2b5768dd4cf19","schema_version":"1.0","event_id":"sha256:b10e9ff649e14ef12eef6987c138f91fdb6ef8539f04ea3082f2b5768dd4cf19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5LIAURM4ZYX23V557T3ESQW6JM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relatively-Smooth Convex Optimization by First-Order Methods, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haihao Lu, Robert M. Freund, Yurii Nesterov","submitted_at":"2016-10-18T17:05:03Z","abstract_excerpt":"The usual approach to developing and analyzing first-order methods for smooth convex optimization assumes that the gradient of the objective function is uniformly smooth with some Lipschitz constant $L$. However, in many settings the differentiable convex function $f(\\cdot)$ is not uniformly smooth -- for example in $D$-optimal design where $f(x):=-\\ln \\det(HXH^T)$, or even the univariate setting with $f(x) := -\\ln(x) + x^2$. Herein we develop a notion of \"relative smoothness\" and relative strong convexity that is determined relative to a user-specified \"reference function\" $h(\\cdot)$ (that sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05708","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":""},"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:33:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZN9hOt6dyhCXvy+RP3vDjMZEZBfQOtpbzHpcrOoh9ZNXXp0dXTtIhUUmDyWf9zv/A6KBRwD0QX/fivco6znTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:27:22.188824Z"},"content_sha256":"4589c9f6958587a086bc1fb6aea7e0a9fee0a9af52a0b9f0fe73dfae22b58c2d","schema_version":"1.0","event_id":"sha256:4589c9f6958587a086bc1fb6aea7e0a9fee0a9af52a0b9f0fe73dfae22b58c2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LIAURM4ZYX23V557T3ESQW6JM/bundle.json","state_url":"https://pith.science/pith/5LIAURM4ZYX23V557T3ESQW6JM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LIAURM4ZYX23V557T3ESQW6JM/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-27T10:27:22Z","links":{"resolver":"https://pith.science/pith/5LIAURM4ZYX23V557T3ESQW6JM","bundle":"https://pith.science/pith/5LIAURM4ZYX23V557T3ESQW6JM/bundle.json","state":"https://pith.science/pith/5LIAURM4ZYX23V557T3ESQW6JM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LIAURM4ZYX23V557T3ESQW6JM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5LIAURM4ZYX23V557T3ESQW6JM","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":"07164466cab4a8d2663a7fe7d742d85c3af32efe008f07c6241161c182835819","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-18T17:05:03Z","title_canon_sha256":"6a1ea54862b9ef0813039b984051493e3498596297bbe70ef39b25801a8a0563"},"schema_version":"1.0","source":{"id":"1610.05708","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05708","created_at":"2026-05-18T00:33:22Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05708v3","created_at":"2026-05-18T00:33:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05708","created_at":"2026-05-18T00:33:22Z"},{"alias_kind":"pith_short_12","alias_value":"5LIAURM4ZYX2","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5LIAURM4ZYX23V55","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5LIAURM4","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:4589c9f6958587a086bc1fb6aea7e0a9fee0a9af52a0b9f0fe73dfae22b58c2d","target":"graph","created_at":"2026-05-18T00:33:22Z","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":"The usual approach to developing and analyzing first-order methods for smooth convex optimization assumes that the gradient of the objective function is uniformly smooth with some Lipschitz constant $L$. However, in many settings the differentiable convex function $f(\\cdot)$ is not uniformly smooth -- for example in $D$-optimal design where $f(x):=-\\ln \\det(HXH^T)$, or even the univariate setting with $f(x) := -\\ln(x) + x^2$. Herein we develop a notion of \"relative smoothness\" and relative strong convexity that is determined relative to a user-specified \"reference function\" $h(\\cdot)$ (that sh","authors_text":"Haihao Lu, Robert M. Freund, Yurii Nesterov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-18T17:05:03Z","title":"Relatively-Smooth Convex Optimization by First-Order Methods, and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05708","kind":"arxiv","version":3},"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:b10e9ff649e14ef12eef6987c138f91fdb6ef8539f04ea3082f2b5768dd4cf19","target":"record","created_at":"2026-05-18T00:33:22Z","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":"07164466cab4a8d2663a7fe7d742d85c3af32efe008f07c6241161c182835819","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-18T17:05:03Z","title_canon_sha256":"6a1ea54862b9ef0813039b984051493e3498596297bbe70ef39b25801a8a0563"},"schema_version":"1.0","source":{"id":"1610.05708","kind":"arxiv","version":3}},"canonical_sha256":"ead00a459cce2fadd7bdfcf64942de4b2809b771b80ce83750d2be1b14d3d36a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ead00a459cce2fadd7bdfcf64942de4b2809b771b80ce83750d2be1b14d3d36a","first_computed_at":"2026-05-18T00:33:22.521772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:22.521772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zhmXCef2OOwRu7goS2hZ9+pLx6mdvY7FvylNvC1aXs3agwD1IGQpdR2JLxRSBHmauciaCSD/8O8OT//GVVgjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:22.522513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05708","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b10e9ff649e14ef12eef6987c138f91fdb6ef8539f04ea3082f2b5768dd4cf19","sha256:4589c9f6958587a086bc1fb6aea7e0a9fee0a9af52a0b9f0fe73dfae22b58c2d"],"state_sha256":"64c844e98dce9883f5dfbf7baf6a2f97371e010b351584146ddbc69bc3b62bad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJWHNR6IbmEmjxrHwNTWSACFgBAp5bGKm7aOdBll31o5I+T4CIojWsuQ/m2GYQs1LPDDQkGG3CmarP77tLQvBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:27:22.191833Z","bundle_sha256":"1701079546a876aceece1833328c1b260e940984efe76e960dfcdc1743df87f1"}}