{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LFNLIKHPNVRK3AKPXK4C6MBZKT","short_pith_number":"pith:LFNLIKHP","canonical_record":{"source":{"id":"1907.10494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-22T09:58:15Z","cross_cats_sorted":[],"title_canon_sha256":"a3d9bcaab1542f35a473be2a55d42d04d1a873d556859420d6fccdcafe7e3a01","abstract_canon_sha256":"cf5cf9ccc8bcc792c70126f4e4679b5dadff4c901807b6786edc62ee4228f1f3"},"schema_version":"1.0"},"canonical_sha256":"595ab428ef6d62ad814fbab82f303954e26b8658c4dd803d06ca7100a267d022","source":{"kind":"arxiv","id":"1907.10494","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10494","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10494v1","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10494","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"pith_short_12","alias_value":"LFNLIKHPNVRK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LFNLIKHPNVRK3AKP","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LFNLIKHP","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LFNLIKHPNVRK3AKPXK4C6MBZKT","target":"record","payload":{"canonical_record":{"source":{"id":"1907.10494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-22T09:58:15Z","cross_cats_sorted":[],"title_canon_sha256":"a3d9bcaab1542f35a473be2a55d42d04d1a873d556859420d6fccdcafe7e3a01","abstract_canon_sha256":"cf5cf9ccc8bcc792c70126f4e4679b5dadff4c901807b6786edc62ee4228f1f3"},"schema_version":"1.0"},"canonical_sha256":"595ab428ef6d62ad814fbab82f303954e26b8658c4dd803d06ca7100a267d022","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:37.748125Z","signature_b64":"GvXNWMyFOL/HGAuCPJSWz2DYJRhzRHErC+Ho2+9PgD5DDfRYjyGM1YAQad8fDDuen/tqxLUoLoX4YJrmdo+yBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"595ab428ef6d62ad814fbab82f303954e26b8658c4dd803d06ca7100a267d022","last_reissued_at":"2026-05-17T23:39:37.747658Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:37.747658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.10494","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-17T23:39:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"awkg8BuJIlKr4m83Pijz1o792o5hpVXS+vjLLIc+nRVsRdsYKc+HxgpAEkSWp1SxQboImnB74tNcj7C/JHgmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:11:12.633677Z"},"content_sha256":"3e89a2a1188e14d84b1ff2f6ef455a9f3d48e650393a27fb90cdb62ec8ffa68d","schema_version":"1.0","event_id":"sha256:3e89a2a1188e14d84b1ff2f6ef455a9f3d48e650393a27fb90cdb62ec8ffa68d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LFNLIKHPNVRK3AKPXK4C6MBZKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Gradient Method with Approximately Optimal Stepsize Based on Conic model for Unconstrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongwei Liu, Zexian Liu","submitted_at":"2019-07-22T09:58:15Z","abstract_excerpt":"A new type of stepsize, which was recently introduced by Liu and Liu (Optimization, 67(3), 427-440, 2018), is called approximately optimal stepsize and is quit efficient for gradient method. Interestingly, all gradient methods can be regarded as gradient methods with approximately optimal stepsizes. In this paper, based on the work (Numer. Algorithms 78(1), 21-39, 2018), we present an improved gradient method with approximately optimal stepsize based on conic model for unconstrained optimization. If the objective function $ f $ is not close to a quadratic on the line segment between the curren"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10494","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-17T23:39:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"csCPApxTPy4+jBLP9etehSFOMY/WTGYnQonGrBxJUEg6k5DdMtVP5Hf4rN7pejCx9Ujnc7dmkSbfHv2mYlTZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:11:12.634023Z"},"content_sha256":"015fa2d32344fe86a3b06cc7f9f352eceb53838aab1c60ec9ab890748e80b8e4","schema_version":"1.0","event_id":"sha256:015fa2d32344fe86a3b06cc7f9f352eceb53838aab1c60ec9ab890748e80b8e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFNLIKHPNVRK3AKPXK4C6MBZKT/bundle.json","state_url":"https://pith.science/pith/LFNLIKHPNVRK3AKPXK4C6MBZKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFNLIKHPNVRK3AKPXK4C6MBZKT/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-28T17:11:12Z","links":{"resolver":"https://pith.science/pith/LFNLIKHPNVRK3AKPXK4C6MBZKT","bundle":"https://pith.science/pith/LFNLIKHPNVRK3AKPXK4C6MBZKT/bundle.json","state":"https://pith.science/pith/LFNLIKHPNVRK3AKPXK4C6MBZKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFNLIKHPNVRK3AKPXK4C6MBZKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LFNLIKHPNVRK3AKPXK4C6MBZKT","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":"cf5cf9ccc8bcc792c70126f4e4679b5dadff4c901807b6786edc62ee4228f1f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-22T09:58:15Z","title_canon_sha256":"a3d9bcaab1542f35a473be2a55d42d04d1a873d556859420d6fccdcafe7e3a01"},"schema_version":"1.0","source":{"id":"1907.10494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10494","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10494v1","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10494","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"pith_short_12","alias_value":"LFNLIKHPNVRK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LFNLIKHPNVRK3AKP","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LFNLIKHP","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:015fa2d32344fe86a3b06cc7f9f352eceb53838aab1c60ec9ab890748e80b8e4","target":"graph","created_at":"2026-05-17T23:39:37Z","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 new type of stepsize, which was recently introduced by Liu and Liu (Optimization, 67(3), 427-440, 2018), is called approximately optimal stepsize and is quit efficient for gradient method. Interestingly, all gradient methods can be regarded as gradient methods with approximately optimal stepsizes. In this paper, based on the work (Numer. Algorithms 78(1), 21-39, 2018), we present an improved gradient method with approximately optimal stepsize based on conic model for unconstrained optimization. If the objective function $ f $ is not close to a quadratic on the line segment between the curren","authors_text":"Hongwei Liu, Zexian Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-22T09:58:15Z","title":"An Improved Gradient Method with Approximately Optimal Stepsize Based on Conic model for Unconstrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10494","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:3e89a2a1188e14d84b1ff2f6ef455a9f3d48e650393a27fb90cdb62ec8ffa68d","target":"record","created_at":"2026-05-17T23:39:37Z","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":"cf5cf9ccc8bcc792c70126f4e4679b5dadff4c901807b6786edc62ee4228f1f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-22T09:58:15Z","title_canon_sha256":"a3d9bcaab1542f35a473be2a55d42d04d1a873d556859420d6fccdcafe7e3a01"},"schema_version":"1.0","source":{"id":"1907.10494","kind":"arxiv","version":1}},"canonical_sha256":"595ab428ef6d62ad814fbab82f303954e26b8658c4dd803d06ca7100a267d022","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"595ab428ef6d62ad814fbab82f303954e26b8658c4dd803d06ca7100a267d022","first_computed_at":"2026-05-17T23:39:37.747658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:37.747658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GvXNWMyFOL/HGAuCPJSWz2DYJRhzRHErC+Ho2+9PgD5DDfRYjyGM1YAQad8fDDuen/tqxLUoLoX4YJrmdo+yBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:37.748125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.10494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e89a2a1188e14d84b1ff2f6ef455a9f3d48e650393a27fb90cdb62ec8ffa68d","sha256:015fa2d32344fe86a3b06cc7f9f352eceb53838aab1c60ec9ab890748e80b8e4"],"state_sha256":"869acc365a30c30a79d59fc685513777f3d8862fbfdf8e8650ddc82f9516964d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gDJIDV45x55Ie+j3DmU+HMzd3Iq/V2i6VFtoVvzC/bXdLbJ3wzjPEaSNT5jBBJY9fdkSsBLlertVshec0NBXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:11:12.635902Z","bundle_sha256":"a5b514503e9dc61f12898738002a94e07cbda728e2b25e1683b5e38a7248a638"}}