{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MVO6VOQEHZ6EWRWJNJLLEDX2UF","short_pith_number":"pith:MVO6VOQE","canonical_record":{"source":{"id":"1712.09498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-27T05:26:36Z","cross_cats_sorted":[],"title_canon_sha256":"b8507a7c49b08c0e1025028ffa5d02bd523e0965da528f9038f3b8ffb81178fa","abstract_canon_sha256":"152756ba790e2e6e9716fbf55b750ad5eb1f3488de5f0b2c0c78f62b1abbade2"},"schema_version":"1.0"},"canonical_sha256":"655deaba043e7c4b46c96a56b20efaa16321ccda3c5087c5408ff4bb04d7be69","source":{"kind":"arxiv","id":"1712.09498","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09498","created_at":"2026-05-17T23:56:38Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09498v2","created_at":"2026-05-17T23:56:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09498","created_at":"2026-05-17T23:56:38Z"},{"alias_kind":"pith_short_12","alias_value":"MVO6VOQEHZ6E","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MVO6VOQEHZ6EWRWJ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MVO6VOQE","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MVO6VOQEHZ6EWRWJNJLLEDX2UF","target":"record","payload":{"canonical_record":{"source":{"id":"1712.09498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-27T05:26:36Z","cross_cats_sorted":[],"title_canon_sha256":"b8507a7c49b08c0e1025028ffa5d02bd523e0965da528f9038f3b8ffb81178fa","abstract_canon_sha256":"152756ba790e2e6e9716fbf55b750ad5eb1f3488de5f0b2c0c78f62b1abbade2"},"schema_version":"1.0"},"canonical_sha256":"655deaba043e7c4b46c96a56b20efaa16321ccda3c5087c5408ff4bb04d7be69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:38.864866Z","signature_b64":"5rACg8hG5PlDsjuRxqwZxVbUlROgsbK34qEtZQqEeDVmIZkA1CvXwj7V6qRfiSXGOsZlmmo3IPtiuUkmzUTpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"655deaba043e7c4b46c96a56b20efaa16321ccda3c5087c5408ff4bb04d7be69","last_reissued_at":"2026-05-17T23:56:38.864195Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:38.864195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.09498","source_version":2,"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-17T23:56:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YLJKox7i6DzndtjMaueyd4O/fK0uBP6pYfZHz3en0x+OUvK9x5PqKMwoaj4Tl5IdQnUBS9O/urDrk2fZyAMnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:56:40.988579Z"},"content_sha256":"8c7aa64f35a126b644ee080f90f6d848bd862571d93540d3b4b5d37a0c8f894c","schema_version":"1.0","event_id":"sha256:8c7aa64f35a126b644ee080f90f6d848bd862571d93540d3b4b5d37a0c8f894c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MVO6VOQEHZ6EWRWJNJLLEDX2UF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A single potential governing convergence of conjugate gradient, accelerated gradient and geometric descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Sahar Karimi, Stephen Vavasis","submitted_at":"2017-12-27T05:26:36Z","abstract_excerpt":"Nesterov's accelerated gradient (AG) method for minimizing a smooth strongly convex function $f$ is known to reduce $f({\\bf x}_k)-f({\\bf x}^*)$ by a factor of $\\epsilon\\in(0,1)$ after $k=O(\\sqrt{L/\\ell}\\log(1/\\epsilon))$ iterations, where $\\ell,L$ are the two parameters of smooth strong convexity. Furthermore, it is known that this is the best possible complexity in the function-gradient oracle model of computation. Modulo a line search, the geometric descent (GD) method of Bubeck, Lee and Singh has the same bound for this class of functions. The method of linear conjugate gradients (CG) also "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09498","kind":"arxiv","version":2},"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-17T23:56:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9VKDibLvuE7b1S+lgvsGm7xtX5h35hHiDejfPgHDy9tf2av/ZqKjcWN4nl0LPbj3k7AEaC+Sp30NFLTlrMNWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:56:40.988911Z"},"content_sha256":"00d17206846dfb89defa3ff2b31805d6d94be54144910a216b027db811f15fdb","schema_version":"1.0","event_id":"sha256:00d17206846dfb89defa3ff2b31805d6d94be54144910a216b027db811f15fdb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVO6VOQEHZ6EWRWJNJLLEDX2UF/bundle.json","state_url":"https://pith.science/pith/MVO6VOQEHZ6EWRWJNJLLEDX2UF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVO6VOQEHZ6EWRWJNJLLEDX2UF/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-07T01:56:40Z","links":{"resolver":"https://pith.science/pith/MVO6VOQEHZ6EWRWJNJLLEDX2UF","bundle":"https://pith.science/pith/MVO6VOQEHZ6EWRWJNJLLEDX2UF/bundle.json","state":"https://pith.science/pith/MVO6VOQEHZ6EWRWJNJLLEDX2UF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVO6VOQEHZ6EWRWJNJLLEDX2UF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MVO6VOQEHZ6EWRWJNJLLEDX2UF","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":"152756ba790e2e6e9716fbf55b750ad5eb1f3488de5f0b2c0c78f62b1abbade2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-27T05:26:36Z","title_canon_sha256":"b8507a7c49b08c0e1025028ffa5d02bd523e0965da528f9038f3b8ffb81178fa"},"schema_version":"1.0","source":{"id":"1712.09498","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09498","created_at":"2026-05-17T23:56:38Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09498v2","created_at":"2026-05-17T23:56:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09498","created_at":"2026-05-17T23:56:38Z"},{"alias_kind":"pith_short_12","alias_value":"MVO6VOQEHZ6E","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MVO6VOQEHZ6EWRWJ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MVO6VOQE","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:00d17206846dfb89defa3ff2b31805d6d94be54144910a216b027db811f15fdb","target":"graph","created_at":"2026-05-17T23:56:38Z","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":"Nesterov's accelerated gradient (AG) method for minimizing a smooth strongly convex function $f$ is known to reduce $f({\\bf x}_k)-f({\\bf x}^*)$ by a factor of $\\epsilon\\in(0,1)$ after $k=O(\\sqrt{L/\\ell}\\log(1/\\epsilon))$ iterations, where $\\ell,L$ are the two parameters of smooth strong convexity. Furthermore, it is known that this is the best possible complexity in the function-gradient oracle model of computation. Modulo a line search, the geometric descent (GD) method of Bubeck, Lee and Singh has the same bound for this class of functions. The method of linear conjugate gradients (CG) also ","authors_text":"Sahar Karimi, Stephen Vavasis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-27T05:26:36Z","title":"A single potential governing convergence of conjugate gradient, accelerated gradient and geometric descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09498","kind":"arxiv","version":2},"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:8c7aa64f35a126b644ee080f90f6d848bd862571d93540d3b4b5d37a0c8f894c","target":"record","created_at":"2026-05-17T23:56:38Z","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":"152756ba790e2e6e9716fbf55b750ad5eb1f3488de5f0b2c0c78f62b1abbade2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-27T05:26:36Z","title_canon_sha256":"b8507a7c49b08c0e1025028ffa5d02bd523e0965da528f9038f3b8ffb81178fa"},"schema_version":"1.0","source":{"id":"1712.09498","kind":"arxiv","version":2}},"canonical_sha256":"655deaba043e7c4b46c96a56b20efaa16321ccda3c5087c5408ff4bb04d7be69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"655deaba043e7c4b46c96a56b20efaa16321ccda3c5087c5408ff4bb04d7be69","first_computed_at":"2026-05-17T23:56:38.864195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:38.864195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5rACg8hG5PlDsjuRxqwZxVbUlROgsbK34qEtZQqEeDVmIZkA1CvXwj7V6qRfiSXGOsZlmmo3IPtiuUkmzUTpCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:38.864866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09498","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c7aa64f35a126b644ee080f90f6d848bd862571d93540d3b4b5d37a0c8f894c","sha256:00d17206846dfb89defa3ff2b31805d6d94be54144910a216b027db811f15fdb"],"state_sha256":"435acaf13391f457e6cf39efbb9199a7e09238391c903d1439d1cc3b32d82e36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8SFLEzZXlAStqHTiANOYwGgvAjgR3uWDwo2xH7DYnmlGj6p5wn0unMk48hz9Ro/34roHKi3PgXcVIstspP1kCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T01:56:40.990710Z","bundle_sha256":"90c03455cf3af0bcbd0119507cdc7fca36105ad4b8ca7f438ae5868fcef40f3c"}}