{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:M3LQB6W4NJY6ED34C7A6GNBYEK","short_pith_number":"pith:M3LQB6W4","canonical_record":{"source":{"id":"1610.03831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-12T19:19:49Z","cross_cats_sorted":[],"title_canon_sha256":"1d074f5af7fb1826029f0e39e9a66eb6cbbd595fab9d86eb073efabec44eff62","abstract_canon_sha256":"aca39f859ef1c3f61a9aa8f2eae329cd90c6c6f4659736a90a83240eb0732aea"},"schema_version":"1.0"},"canonical_sha256":"66d700fadc6a71e20f7c17c1e334382293da57de98c885c4be46abb640811e24","source":{"kind":"arxiv","id":"1610.03831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03831","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03831v1","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03831","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"M3LQB6W4NJY6","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M3LQB6W4NJY6ED34","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M3LQB6W4","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:M3LQB6W4NJY6ED34C7A6GNBYEK","target":"record","payload":{"canonical_record":{"source":{"id":"1610.03831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-12T19:19:49Z","cross_cats_sorted":[],"title_canon_sha256":"1d074f5af7fb1826029f0e39e9a66eb6cbbd595fab9d86eb073efabec44eff62","abstract_canon_sha256":"aca39f859ef1c3f61a9aa8f2eae329cd90c6c6f4659736a90a83240eb0732aea"},"schema_version":"1.0"},"canonical_sha256":"66d700fadc6a71e20f7c17c1e334382293da57de98c885c4be46abb640811e24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:29.130005Z","signature_b64":"QpjTCDUDpBZGkbtjsIf3DjW0+bPABVT4BhO6jqlu6XRaKu3TUCtLQBNlEjDBdTMuO7qqzChWe7+o8RWPd5+vDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66d700fadc6a71e20f7c17c1e334382293da57de98c885c4be46abb640811e24","last_reissued_at":"2026-05-18T01:02:29.129521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:29.129521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.03831","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:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFhAusCKX+/dRqRyf+tAHiNqdDOasavKUjtSB8LIPZq+dfBaerRW5MHqkdD809jmod00WcjgT/7q6CI6WzotBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:14:58.170351Z"},"content_sha256":"2f3c520562b41251c357207d9cb9209097054c0873c902d4247108f745169c5a","schema_version":"1.0","event_id":"sha256:2f3c520562b41251c357207d9cb9209097054c0873c902d4247108f745169c5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:M3LQB6W4NJY6ED34C7A6GNBYEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"R-Linear Convergence of Limited Memory Steepest Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Frank E. Curtis, Wei Guo","submitted_at":"2016-10-12T19:19:49Z","abstract_excerpt":"The limited memory steepest descent method (LMSD) proposed by Fletcher is an extension of the Barzilai-Borwein \"two-point step size\" strategy for steepest descent methods for solving unconstrained optimization problems. It is known that the Barzilai-Borwein strategy yields a method with an R-linear rate of convergence when it is employed to minimize a strongly convex quadratic. This paper extends this analysis for LMSD, also for strongly convex quadratics. In particular, it is shown that the method is R-linearly convergent for any choice of the history length parameter. The results of numerica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03831","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:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQS6m16koXPBMIQvoEtRnDr3G0SqKmvVZuK/Biib6lSnzvLbKzsrWzUP+QEqF8XamkBA+546juN9mExL8vlfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:14:58.171084Z"},"content_sha256":"c55a35ffcd81ca6a671f7b445f24004ee98bad127e8452f54e848c502c1904e1","schema_version":"1.0","event_id":"sha256:c55a35ffcd81ca6a671f7b445f24004ee98bad127e8452f54e848c502c1904e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3LQB6W4NJY6ED34C7A6GNBYEK/bundle.json","state_url":"https://pith.science/pith/M3LQB6W4NJY6ED34C7A6GNBYEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3LQB6W4NJY6ED34C7A6GNBYEK/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-31T21:14:58Z","links":{"resolver":"https://pith.science/pith/M3LQB6W4NJY6ED34C7A6GNBYEK","bundle":"https://pith.science/pith/M3LQB6W4NJY6ED34C7A6GNBYEK/bundle.json","state":"https://pith.science/pith/M3LQB6W4NJY6ED34C7A6GNBYEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3LQB6W4NJY6ED34C7A6GNBYEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:M3LQB6W4NJY6ED34C7A6GNBYEK","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":"aca39f859ef1c3f61a9aa8f2eae329cd90c6c6f4659736a90a83240eb0732aea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-12T19:19:49Z","title_canon_sha256":"1d074f5af7fb1826029f0e39e9a66eb6cbbd595fab9d86eb073efabec44eff62"},"schema_version":"1.0","source":{"id":"1610.03831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03831","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03831v1","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03831","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"M3LQB6W4NJY6","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M3LQB6W4NJY6ED34","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M3LQB6W4","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:c55a35ffcd81ca6a671f7b445f24004ee98bad127e8452f54e848c502c1904e1","target":"graph","created_at":"2026-05-18T01:02: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":"The limited memory steepest descent method (LMSD) proposed by Fletcher is an extension of the Barzilai-Borwein \"two-point step size\" strategy for steepest descent methods for solving unconstrained optimization problems. It is known that the Barzilai-Borwein strategy yields a method with an R-linear rate of convergence when it is employed to minimize a strongly convex quadratic. This paper extends this analysis for LMSD, also for strongly convex quadratics. In particular, it is shown that the method is R-linearly convergent for any choice of the history length parameter. The results of numerica","authors_text":"Frank E. Curtis, Wei Guo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-12T19:19:49Z","title":"R-Linear Convergence of Limited Memory Steepest Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03831","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:2f3c520562b41251c357207d9cb9209097054c0873c902d4247108f745169c5a","target":"record","created_at":"2026-05-18T01:02: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":"aca39f859ef1c3f61a9aa8f2eae329cd90c6c6f4659736a90a83240eb0732aea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-12T19:19:49Z","title_canon_sha256":"1d074f5af7fb1826029f0e39e9a66eb6cbbd595fab9d86eb073efabec44eff62"},"schema_version":"1.0","source":{"id":"1610.03831","kind":"arxiv","version":1}},"canonical_sha256":"66d700fadc6a71e20f7c17c1e334382293da57de98c885c4be46abb640811e24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66d700fadc6a71e20f7c17c1e334382293da57de98c885c4be46abb640811e24","first_computed_at":"2026-05-18T01:02:29.129521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:29.129521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QpjTCDUDpBZGkbtjsIf3DjW0+bPABVT4BhO6jqlu6XRaKu3TUCtLQBNlEjDBdTMuO7qqzChWe7+o8RWPd5+vDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:29.130005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f3c520562b41251c357207d9cb9209097054c0873c902d4247108f745169c5a","sha256:c55a35ffcd81ca6a671f7b445f24004ee98bad127e8452f54e848c502c1904e1"],"state_sha256":"8bfd70f87e27085ce153e3a63bd0dbd81cef895997147b89cad3edeeed0c485d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TS/QIB/Zddh8R1vMLT4/OEL39Spt6TXCSjKKrLcGURGGnQRvCEZ0ib249HysydM9VTOQ4y72Q/Frk0EKleu9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:14:58.175480Z","bundle_sha256":"eef06d4c70d60e0a4afb43ddcc150ed6ee35b22bfe0db7f5ecfb249609c19394"}}