{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SSHT6JI6Z44ZULMYXFIO3XJUYZ","short_pith_number":"pith:SSHT6JI6","canonical_record":{"source":{"id":"1605.08712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-27T16:50:36Z","cross_cats_sorted":[],"title_canon_sha256":"cfa605a635203a4d60ae1244804e63b253a98fd30e7c6a9b929a786654386f69","abstract_canon_sha256":"a8ebbf10817a2ac75f4ee8687c7f091c017970bd5255563561167f3d7b49d296"},"schema_version":"1.0"},"canonical_sha256":"948f3f251ecf399a2d98b950eddd34c6461fa6a98e6593d872533a5a105cd74d","source":{"kind":"arxiv","id":"1605.08712","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08712","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08712v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08712","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"SSHT6JI6Z44Z","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SSHT6JI6Z44ZULMY","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SSHT6JI6","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SSHT6JI6Z44ZULMYXFIO3XJUYZ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-27T16:50:36Z","cross_cats_sorted":[],"title_canon_sha256":"cfa605a635203a4d60ae1244804e63b253a98fd30e7c6a9b929a786654386f69","abstract_canon_sha256":"a8ebbf10817a2ac75f4ee8687c7f091c017970bd5255563561167f3d7b49d296"},"schema_version":"1.0"},"canonical_sha256":"948f3f251ecf399a2d98b950eddd34c6461fa6a98e6593d872533a5a105cd74d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.250812Z","signature_b64":"tBt/XzChF4wVDbOsP5V/aW8KRNyNCwsRtEjgCKsMmjJ0a1VTynDESMcapXb2rx4hEsiupI0DHCaLVuAlciCnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"948f3f251ecf399a2d98b950eddd34c6461fa6a98e6593d872533a5a105cd74d","last_reissued_at":"2026-05-18T01:13:29.250289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.250289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08712","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-18T01:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8Bi3zbGYhQE+do1e3Id/RKk8Pzo5sNqjbUM7t0n4PF3zA9HxUU3615O2Yeo+G35j6Lbo4S389Xxi2dwr1CoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:30:00.084491Z"},"content_sha256":"f2341fb5d22b9102fdbe2ec4f49ac319d24b8175c34bd7d2353fe38f76afcb6d","schema_version":"1.0","event_id":"sha256:f2341fb5d22b9102fdbe2ec4f49ac319d24b8175c34bd7d2353fe38f76afcb6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SSHT6JI6Z44ZULMYXFIO3XJUYZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"\"Efficient\" Subgradient Methods for General Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"James Renegar","submitted_at":"2016-05-27T16:50:36Z","abstract_excerpt":"A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified error of optimality. Feasibility is maintained with a line-search at each iteration, avoiding the need for orthogonal projections onto the feasible region (the operation that limits practicality of traditional subgradient methods). Lipschitz continuity is not required, yet the algorithm is shown to possess a convergence rate analogous to rates for traditional"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08712","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-18T01:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2chrd4rHwV5r4J2Qc3uKpc7+5gj+AJPqTzsjIhMXPiB1vrFthYggfLnB48H8jaRweoX5bnyFabQCpjr4fKp/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:30:00.084837Z"},"content_sha256":"733759d1b6467c24e209365888adb2ed370d614d3c97228e808ba4a078cd22cd","schema_version":"1.0","event_id":"sha256:733759d1b6467c24e209365888adb2ed370d614d3c97228e808ba4a078cd22cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSHT6JI6Z44ZULMYXFIO3XJUYZ/bundle.json","state_url":"https://pith.science/pith/SSHT6JI6Z44ZULMYXFIO3XJUYZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSHT6JI6Z44ZULMYXFIO3XJUYZ/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-07-03T06:30:00Z","links":{"resolver":"https://pith.science/pith/SSHT6JI6Z44ZULMYXFIO3XJUYZ","bundle":"https://pith.science/pith/SSHT6JI6Z44ZULMYXFIO3XJUYZ/bundle.json","state":"https://pith.science/pith/SSHT6JI6Z44ZULMYXFIO3XJUYZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSHT6JI6Z44ZULMYXFIO3XJUYZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SSHT6JI6Z44ZULMYXFIO3XJUYZ","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":"a8ebbf10817a2ac75f4ee8687c7f091c017970bd5255563561167f3d7b49d296","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-27T16:50:36Z","title_canon_sha256":"cfa605a635203a4d60ae1244804e63b253a98fd30e7c6a9b929a786654386f69"},"schema_version":"1.0","source":{"id":"1605.08712","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08712","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08712v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08712","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"SSHT6JI6Z44Z","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SSHT6JI6Z44ZULMY","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SSHT6JI6","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:733759d1b6467c24e209365888adb2ed370d614d3c97228e808ba4a078cd22cd","target":"graph","created_at":"2026-05-18T01:13:29Z","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":"A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified error of optimality. Feasibility is maintained with a line-search at each iteration, avoiding the need for orthogonal projections onto the feasible region (the operation that limits practicality of traditional subgradient methods). Lipschitz continuity is not required, yet the algorithm is shown to possess a convergence rate analogous to rates for traditional","authors_text":"James Renegar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-27T16:50:36Z","title":"\"Efficient\" Subgradient Methods for General Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08712","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:f2341fb5d22b9102fdbe2ec4f49ac319d24b8175c34bd7d2353fe38f76afcb6d","target":"record","created_at":"2026-05-18T01:13:29Z","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":"a8ebbf10817a2ac75f4ee8687c7f091c017970bd5255563561167f3d7b49d296","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-27T16:50:36Z","title_canon_sha256":"cfa605a635203a4d60ae1244804e63b253a98fd30e7c6a9b929a786654386f69"},"schema_version":"1.0","source":{"id":"1605.08712","kind":"arxiv","version":1}},"canonical_sha256":"948f3f251ecf399a2d98b950eddd34c6461fa6a98e6593d872533a5a105cd74d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"948f3f251ecf399a2d98b950eddd34c6461fa6a98e6593d872533a5a105cd74d","first_computed_at":"2026-05-18T01:13:29.250289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:29.250289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tBt/XzChF4wVDbOsP5V/aW8KRNyNCwsRtEjgCKsMmjJ0a1VTynDESMcapXb2rx4hEsiupI0DHCaLVuAlciCnDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:29.250812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08712","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2341fb5d22b9102fdbe2ec4f49ac319d24b8175c34bd7d2353fe38f76afcb6d","sha256:733759d1b6467c24e209365888adb2ed370d614d3c97228e808ba4a078cd22cd"],"state_sha256":"fe9135aa509b004f386011e9360bee3f6aeb07a014d6ceafbcc4e18ef0d9d7e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/lRxEol04cfFFs7ZEzWOelIWzxfX6kDaMDawOl19BvYedjv+WB4T6RwT/6RyWxLjL14r6fUbnb6DYygzQ5KDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T06:30:00.086752Z","bundle_sha256":"4258a416f513ea3569929e1c91b4d7eaced20322c4fa76f62e3c8ff41e2a8211"}}