{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VYH3PXJIYE3F2FKSKK4D46VBDA","short_pith_number":"pith:VYH3PXJI","schema_version":"1.0","canonical_sha256":"ae0fb7dd28c1365d155252b83e7aa11804bea07a316f12ef48fe9192a49dd880","source":{"kind":"arxiv","id":"2508.06002","version":1},"attestation_state":"computed","paper":{"title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Chungen Shen, Lei-Hong Zhang, Linuo Xue, Yifeng Meng","submitted_at":"2025-08-08T04:09:48Z","abstract_excerpt":"The Barzilai and Borwein (BB) gradient method is one of the most widely-used line-search gradient methods. It computes the step-size for the current iterate by using the information carried in the previous iteration. Recently, William Kahan [Kahan, Automatic Step-Size Control for Minimization Iterations, Technical report, University of California, Berkeley CA, USA, 2019] proposed new Gradient Descent (KGD) step-size strategies which iterate the step-size itself by effectively utilizing the information in the previous iteration. In the quadratic model, such a new step-size is shown to be mathem"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2508.06002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-08T04:09:48Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"b8ee92add2fa7f7e439736a354c50b981f7f0e6d617efaeac0651ea17d0085a6","abstract_canon_sha256":"d0b6e799e4cf724d1a7a1074b18d077ccc82a4f1951054db26ca17dec904e8f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:47.181793Z","signature_b64":"nI3KS6sf1LJFaO8Or1EAtt1w0wcNEH3oEvbTWzI4rAfDr7VK62CDAyhSEdu/9iOP3tCGPIUKulA3wGLdBIm6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae0fb7dd28c1365d155252b83e7aa11804bea07a316f12ef48fe9192a49dd880","last_reissued_at":"2026-07-05T11:50:47.180925Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:47.180925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kahan's Automatic Step-Size Control for Unconstrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Chungen Shen, Lei-Hong Zhang, Linuo Xue, Yifeng Meng","submitted_at":"2025-08-08T04:09:48Z","abstract_excerpt":"The Barzilai and Borwein (BB) gradient method is one of the most widely-used line-search gradient methods. It computes the step-size for the current iterate by using the information carried in the previous iteration. Recently, William Kahan [Kahan, Automatic Step-Size Control for Minimization Iterations, Technical report, University of California, Berkeley CA, USA, 2019] proposed new Gradient Descent (KGD) step-size strategies which iterate the step-size itself by effectively utilizing the information in the previous iteration. In the quadratic model, such a new step-size is shown to be mathem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.06002","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.06002/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2508.06002","created_at":"2026-07-05T11:50:47.181040+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.06002v1","created_at":"2026-07-05T11:50:47.181040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.06002","created_at":"2026-07-05T11:50:47.181040+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYH3PXJIYE3F","created_at":"2026-07-05T11:50:47.181040+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYH3PXJIYE3F2FKS","created_at":"2026-07-05T11:50:47.181040+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYH3PXJI","created_at":"2026-07-05T11:50:47.181040+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VYH3PXJIYE3F2FKSKK4D46VBDA","json":"https://pith.science/pith/VYH3PXJIYE3F2FKSKK4D46VBDA.json","graph_json":"https://pith.science/api/pith-number/VYH3PXJIYE3F2FKSKK4D46VBDA/graph.json","events_json":"https://pith.science/api/pith-number/VYH3PXJIYE3F2FKSKK4D46VBDA/events.json","paper":"https://pith.science/paper/VYH3PXJI"},"agent_actions":{"view_html":"https://pith.science/pith/VYH3PXJIYE3F2FKSKK4D46VBDA","download_json":"https://pith.science/pith/VYH3PXJIYE3F2FKSKK4D46VBDA.json","view_paper":"https://pith.science/paper/VYH3PXJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.06002&json=true","fetch_graph":"https://pith.science/api/pith-number/VYH3PXJIYE3F2FKSKK4D46VBDA/graph.json","fetch_events":"https://pith.science/api/pith-number/VYH3PXJIYE3F2FKSKK4D46VBDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYH3PXJIYE3F2FKSKK4D46VBDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYH3PXJIYE3F2FKSKK4D46VBDA/action/storage_attestation","attest_author":"https://pith.science/pith/VYH3PXJIYE3F2FKSKK4D46VBDA/action/author_attestation","sign_citation":"https://pith.science/pith/VYH3PXJIYE3F2FKSKK4D46VBDA/action/citation_signature","submit_replication":"https://pith.science/pith/VYH3PXJIYE3F2FKSKK4D46VBDA/action/replication_record"}},"created_at":"2026-07-05T11:50:47.181040+00:00","updated_at":"2026-07-05T11:50:47.181040+00:00"}