{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YOT6F4ICXWUJR2PYYHQOGHVLUI","short_pith_number":"pith:YOT6F4IC","schema_version":"1.0","canonical_sha256":"c3a7e2f102bda898e9f8c1e0e31eaba21289bf83409fbde9d6a8b50529cc2959","source":{"kind":"arxiv","id":"2608.00196","version":1},"attestation_state":"computed","paper":{"title":"A Portable and Versatile Limited-Memory BFGS Implementation in PETSc/TAO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alp Dener, Hansol Suh, Hong Zhang, Richard Tran Mills, Tobin Isaac, Todd Munson","submitted_at":"2026-07-31T18:23:43Z","abstract_excerpt":"The limited-memory BFGS (L-BFGS) Hessian update scheme is the critical kernel in many quasi-Newton optimization algorithms. The most common approach to implementing L-BFGS uses $2m$ sequential rank-1 updates as part of solving a linear system when there are $m$ history steps. The performance of this approach suffers when the latency of synchronization is significant, and its poor temporal locality increases the memory traffic when vectors do not fit in cache. The compact dense representation of L-BFGS results in an approach that has minimal synchronization latency and better temporal locality,"},"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":"2608.00196","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-31T18:23:43Z","cross_cats_sorted":[],"title_canon_sha256":"29afa80d624a97be0237f299a504922d0892974f6f77774ab5b85b0fdcdf5396","abstract_canon_sha256":"2aeebbac7e77311f40b92ceef40a757038448fa97971fc1da5aa08df11889954"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T00:33:52.285746Z","signature_b64":"FDLl/Xu3fNAwO9eanySfNPTx0F16i4jeatePVi9KZ68hfI5iNh4jQ6D/EMXOzcNKoPnQv7xyzgmFtPQ8hmp9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3a7e2f102bda898e9f8c1e0e31eaba21289bf83409fbde9d6a8b50529cc2959","last_reissued_at":"2026-08-04T00:33:52.284360Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T00:33:52.284360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Portable and Versatile Limited-Memory BFGS Implementation in PETSc/TAO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alp Dener, Hansol Suh, Hong Zhang, Richard Tran Mills, Tobin Isaac, Todd Munson","submitted_at":"2026-07-31T18:23:43Z","abstract_excerpt":"The limited-memory BFGS (L-BFGS) Hessian update scheme is the critical kernel in many quasi-Newton optimization algorithms. The most common approach to implementing L-BFGS uses $2m$ sequential rank-1 updates as part of solving a linear system when there are $m$ history steps. The performance of this approach suffers when the latency of synchronization is significant, and its poor temporal locality increases the memory traffic when vectors do not fit in cache. The compact dense representation of L-BFGS results in an approach that has minimal synchronization latency and better temporal locality,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00196","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/2608.00196/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":"2608.00196","created_at":"2026-08-04T00:33:52.285415+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.00196v1","created_at":"2026-08-04T00:33:52.285415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00196","created_at":"2026-08-04T00:33:52.285415+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOT6F4ICXWUJ","created_at":"2026-08-04T00:33:52.285415+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOT6F4ICXWUJR2PY","created_at":"2026-08-04T00:33:52.285415+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOT6F4IC","created_at":"2026-08-04T00:33:52.285415+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/YOT6F4ICXWUJR2PYYHQOGHVLUI","json":"https://pith.science/pith/YOT6F4ICXWUJR2PYYHQOGHVLUI.json","graph_json":"https://pith.science/api/pith-number/YOT6F4ICXWUJR2PYYHQOGHVLUI/graph.json","events_json":"https://pith.science/api/pith-number/YOT6F4ICXWUJR2PYYHQOGHVLUI/events.json","paper":"https://pith.science/paper/YOT6F4IC"},"agent_actions":{"view_html":"https://pith.science/pith/YOT6F4ICXWUJR2PYYHQOGHVLUI","download_json":"https://pith.science/pith/YOT6F4ICXWUJR2PYYHQOGHVLUI.json","view_paper":"https://pith.science/paper/YOT6F4IC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.00196&json=true","fetch_graph":"https://pith.science/api/pith-number/YOT6F4ICXWUJR2PYYHQOGHVLUI/graph.json","fetch_events":"https://pith.science/api/pith-number/YOT6F4ICXWUJR2PYYHQOGHVLUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOT6F4ICXWUJR2PYYHQOGHVLUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOT6F4ICXWUJR2PYYHQOGHVLUI/action/storage_attestation","attest_author":"https://pith.science/pith/YOT6F4ICXWUJR2PYYHQOGHVLUI/action/author_attestation","sign_citation":"https://pith.science/pith/YOT6F4ICXWUJR2PYYHQOGHVLUI/action/citation_signature","submit_replication":"https://pith.science/pith/YOT6F4ICXWUJR2PYYHQOGHVLUI/action/replication_record"}},"created_at":"2026-08-04T00:33:52.285415+00:00","updated_at":"2026-08-04T00:33:52.285415+00:00"}