{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HV4I6P5L3V764IHHK4NN2WBX7J","short_pith_number":"pith:HV4I6P5L","schema_version":"1.0","canonical_sha256":"3d788f3fabdd7fee20e7571add5837fa72e44795ade53ee01fe5395ad7f8043f","source":{"kind":"arxiv","id":"1112.6060","version":2},"attestation_state":"computed","paper":{"title":"Limited-memory BFGS Systems with Diagonal Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Jennifer B. Erway, Roummel F. Marcia","submitted_at":"2011-12-28T04:29:17Z","abstract_excerpt":"In this paper, we investigate a formula to solve systems of the form (B + {\\sigma}I)x = y, where B is a limited-memory BFGS quasi-Newton matrix and {\\sigma} is a positive constant. These types of systems arise naturally in large-scale optimization such as trust-region methods as well as doubly-augmented Lagrangian methods. We show that provided a simple condition holds on B_0 and \\sigma, the system (B + \\sigma I)x = y can be solved via a recursion formula that requies only vector inner products. This formula has complexity M^2n, where M is the number of L-BFGS updates and n >> M is the dimensi"},"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":"1112.6060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-12-28T04:29:17Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"36e2502e390df92f333eccb8e6fc149ef48355b31b8966d5c1c53745c5b6c247","abstract_canon_sha256":"7896c0cb2d4ecc33428a6330762e9ddf03623d4264f08480eb6680a0daca25e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:20.839285Z","signature_b64":"H42IQOyGQ8TCPIaV85jbsxLz0jKa367p3xpqEbZamqueQ3Q6i9KMeksJOvvY/ZVIa9aKktueQH6YUJi0VGNGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d788f3fabdd7fee20e7571add5837fa72e44795ade53ee01fe5395ad7f8043f","last_reissued_at":"2026-05-18T04:03:20.838731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:20.838731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limited-memory BFGS Systems with Diagonal Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Jennifer B. Erway, Roummel F. Marcia","submitted_at":"2011-12-28T04:29:17Z","abstract_excerpt":"In this paper, we investigate a formula to solve systems of the form (B + {\\sigma}I)x = y, where B is a limited-memory BFGS quasi-Newton matrix and {\\sigma} is a positive constant. These types of systems arise naturally in large-scale optimization such as trust-region methods as well as doubly-augmented Lagrangian methods. We show that provided a simple condition holds on B_0 and \\sigma, the system (B + \\sigma I)x = y can be solved via a recursion formula that requies only vector inner products. This formula has complexity M^2n, where M is the number of L-BFGS updates and n >> M is the dimensi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6060","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.6060","created_at":"2026-05-18T04:03:20.838803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.6060v2","created_at":"2026-05-18T04:03:20.838803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6060","created_at":"2026-05-18T04:03:20.838803+00:00"},{"alias_kind":"pith_short_12","alias_value":"HV4I6P5L3V76","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HV4I6P5L3V764IHH","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HV4I6P5L","created_at":"2026-05-18T12:26:30.835961+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/HV4I6P5L3V764IHHK4NN2WBX7J","json":"https://pith.science/pith/HV4I6P5L3V764IHHK4NN2WBX7J.json","graph_json":"https://pith.science/api/pith-number/HV4I6P5L3V764IHHK4NN2WBX7J/graph.json","events_json":"https://pith.science/api/pith-number/HV4I6P5L3V764IHHK4NN2WBX7J/events.json","paper":"https://pith.science/paper/HV4I6P5L"},"agent_actions":{"view_html":"https://pith.science/pith/HV4I6P5L3V764IHHK4NN2WBX7J","download_json":"https://pith.science/pith/HV4I6P5L3V764IHHK4NN2WBX7J.json","view_paper":"https://pith.science/paper/HV4I6P5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.6060&json=true","fetch_graph":"https://pith.science/api/pith-number/HV4I6P5L3V764IHHK4NN2WBX7J/graph.json","fetch_events":"https://pith.science/api/pith-number/HV4I6P5L3V764IHHK4NN2WBX7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HV4I6P5L3V764IHHK4NN2WBX7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HV4I6P5L3V764IHHK4NN2WBX7J/action/storage_attestation","attest_author":"https://pith.science/pith/HV4I6P5L3V764IHHK4NN2WBX7J/action/author_attestation","sign_citation":"https://pith.science/pith/HV4I6P5L3V764IHHK4NN2WBX7J/action/citation_signature","submit_replication":"https://pith.science/pith/HV4I6P5L3V764IHHK4NN2WBX7J/action/replication_record"}},"created_at":"2026-05-18T04:03:20.838803+00:00","updated_at":"2026-05-18T04:03:20.838803+00:00"}