{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QHNOGWQ4X7XJIYRV53Q4F3JUGS","short_pith_number":"pith:QHNOGWQ4","schema_version":"1.0","canonical_sha256":"81dae35a1cbfee946235eee1c2ed34349c14a2543dd765c881cec1f39e6f63c1","source":{"kind":"arxiv","id":"2510.15714","version":3},"attestation_state":"computed","paper":{"title":"A Split-Client Approach to Second-Order Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"El Mahdi Chayti, Martin Jaggi","submitted_at":"2025-10-17T14:58:11Z","abstract_excerpt":"Second-order optimization methods offer superior convergence rates but are often bottlenecked by the wall-clock cost of Hessian computation and factorization. In the moderate-dimensional regime where the full Hessian fits in memory, factorization $\\mathcal{O}(d^3)$ typically dominates gradient evaluation $\\mathcal{O}(nd)$, creating a synchronization barrier that negates the per-iteration progress of classical second-order methods. We propose the \\emph{Split-Client} framework, which decouples optimization into parallel gradient and curvature processes. Unlike Lazy Hessian approaches, whose arit"},"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":"2510.15714","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-10-17T14:58:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"dc1909fcb2d170d3580aa5debae156f298445e44381b96a6fa7fc6f662ef9086","abstract_canon_sha256":"73e191b39082aa84ab0ec71bc72411c3cc552303ff663c37a481b88e669e5326"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:26.231338Z","signature_b64":"WwScLpaW/v54a/Ht2wDd+lAubv9E8CAHEJVU2m8788HUTzVy3H39zMndx8mXv4arFYyBggqPaQv/1mfiBXNBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81dae35a1cbfee946235eee1c2ed34349c14a2543dd765c881cec1f39e6f63c1","last_reissued_at":"2026-05-20T00:00:26.230439Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:26.230439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Split-Client Approach to Second-Order Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"El Mahdi Chayti, Martin Jaggi","submitted_at":"2025-10-17T14:58:11Z","abstract_excerpt":"Second-order optimization methods offer superior convergence rates but are often bottlenecked by the wall-clock cost of Hessian computation and factorization. In the moderate-dimensional regime where the full Hessian fits in memory, factorization $\\mathcal{O}(d^3)$ typically dominates gradient evaluation $\\mathcal{O}(nd)$, creating a synchronization barrier that negates the per-iteration progress of classical second-order methods. We propose the \\emph{Split-Client} framework, which decouples optimization into parallel gradient and curvature processes. Unlike Lazy Hessian approaches, whose arit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.15714","kind":"arxiv","version":3},"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/2510.15714/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":"2510.15714","created_at":"2026-05-20T00:00:26.230607+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.15714v3","created_at":"2026-05-20T00:00:26.230607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.15714","created_at":"2026-05-20T00:00:26.230607+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHNOGWQ4X7XJ","created_at":"2026-05-20T00:00:26.230607+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHNOGWQ4X7XJIYRV","created_at":"2026-05-20T00:00:26.230607+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHNOGWQ4","created_at":"2026-05-20T00:00:26.230607+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/QHNOGWQ4X7XJIYRV53Q4F3JUGS","json":"https://pith.science/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS.json","graph_json":"https://pith.science/api/pith-number/QHNOGWQ4X7XJIYRV53Q4F3JUGS/graph.json","events_json":"https://pith.science/api/pith-number/QHNOGWQ4X7XJIYRV53Q4F3JUGS/events.json","paper":"https://pith.science/paper/QHNOGWQ4"},"agent_actions":{"view_html":"https://pith.science/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS","download_json":"https://pith.science/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS.json","view_paper":"https://pith.science/paper/QHNOGWQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.15714&json=true","fetch_graph":"https://pith.science/api/pith-number/QHNOGWQ4X7XJIYRV53Q4F3JUGS/graph.json","fetch_events":"https://pith.science/api/pith-number/QHNOGWQ4X7XJIYRV53Q4F3JUGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS/action/storage_attestation","attest_author":"https://pith.science/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS/action/author_attestation","sign_citation":"https://pith.science/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS/action/citation_signature","submit_replication":"https://pith.science/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS/action/replication_record"}},"created_at":"2026-05-20T00:00:26.230607+00:00","updated_at":"2026-05-20T00:00:26.230607+00:00"}