{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QHNOGWQ4X7XJIYRV53Q4F3JUGS","short_pith_number":"pith:QHNOGWQ4","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"},"canonical_sha256":"81dae35a1cbfee946235eee1c2ed34349c14a2543dd765c881cec1f39e6f63c1","source":{"kind":"arxiv","id":"2510.15714","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.15714","created_at":"2026-05-20T00:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"2510.15714v3","created_at":"2026-05-20T00:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.15714","created_at":"2026-05-20T00:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"QHNOGWQ4X7XJ","created_at":"2026-05-20T00:00:26Z"},{"alias_kind":"pith_short_16","alias_value":"QHNOGWQ4X7XJIYRV","created_at":"2026-05-20T00:00:26Z"},{"alias_kind":"pith_short_8","alias_value":"QHNOGWQ4","created_at":"2026-05-20T00:00:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QHNOGWQ4X7XJIYRV53Q4F3JUGS","target":"record","payload":{"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"},"canonical_sha256":"81dae35a1cbfee946235eee1c2ed34349c14a2543dd765c881cec1f39e6f63c1","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"},"source_kind":"arxiv","source_id":"2510.15714","source_version":3,"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-20T00:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljZVG3gwFpVzszuOFgpbbnJnxHL5X2B30ta3HVahQtax5ihMUJ+Z79i6sI6ZykP4W+vd7bcPrZcA9Vg7mFfTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:35:47.158546Z"},"content_sha256":"7bb894bffc240e84193c9d7d459b38ba0d95de0b07581860dfd7f89b68e9bef6","schema_version":"1.0","event_id":"sha256:7bb894bffc240e84193c9d7d459b38ba0d95de0b07581860dfd7f89b68e9bef6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QHNOGWQ4X7XJIYRV53Q4F3JUGS","target":"graph","payload":{"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"},"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-20T00:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DWTlc0yRT0Ai8ENLg7DPozEytFZsc8fGjHR09V2rcihQQg2tpEUjOq4vvz0EyKvIjFJtrzhiWAdl10BBuoRsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:35:47.158924Z"},"content_sha256":"7c8176cd00c7533669592207873d11fc9a4ce9f72c0b427dcd401fe96095ea26","schema_version":"1.0","event_id":"sha256:7c8176cd00c7533669592207873d11fc9a4ce9f72c0b427dcd401fe96095ea26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS/bundle.json","state_url":"https://pith.science/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS/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-06-02T10:35:47Z","links":{"resolver":"https://pith.science/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS","bundle":"https://pith.science/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS/bundle.json","state":"https://pith.science/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHNOGWQ4X7XJIYRV53Q4F3JUGS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QHNOGWQ4X7XJIYRV53Q4F3JUGS","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":"73e191b39082aa84ab0ec71bc72411c3cc552303ff663c37a481b88e669e5326","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-10-17T14:58:11Z","title_canon_sha256":"dc1909fcb2d170d3580aa5debae156f298445e44381b96a6fa7fc6f662ef9086"},"schema_version":"1.0","source":{"id":"2510.15714","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.15714","created_at":"2026-05-20T00:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"2510.15714v3","created_at":"2026-05-20T00:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.15714","created_at":"2026-05-20T00:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"QHNOGWQ4X7XJ","created_at":"2026-05-20T00:00:26Z"},{"alias_kind":"pith_short_16","alias_value":"QHNOGWQ4X7XJIYRV","created_at":"2026-05-20T00:00:26Z"},{"alias_kind":"pith_short_8","alias_value":"QHNOGWQ4","created_at":"2026-05-20T00:00:26Z"}],"graph_snapshots":[{"event_id":"sha256:7c8176cd00c7533669592207873d11fc9a4ce9f72c0b427dcd401fe96095ea26","target":"graph","created_at":"2026-05-20T00:00:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.15714/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"El Mahdi Chayti, Martin Jaggi","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-10-17T14:58:11Z","title":"A Split-Client Approach to Second-Order Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.15714","kind":"arxiv","version":3},"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:7bb894bffc240e84193c9d7d459b38ba0d95de0b07581860dfd7f89b68e9bef6","target":"record","created_at":"2026-05-20T00:00:26Z","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":"73e191b39082aa84ab0ec71bc72411c3cc552303ff663c37a481b88e669e5326","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-10-17T14:58:11Z","title_canon_sha256":"dc1909fcb2d170d3580aa5debae156f298445e44381b96a6fa7fc6f662ef9086"},"schema_version":"1.0","source":{"id":"2510.15714","kind":"arxiv","version":3}},"canonical_sha256":"81dae35a1cbfee946235eee1c2ed34349c14a2543dd765c881cec1f39e6f63c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81dae35a1cbfee946235eee1c2ed34349c14a2543dd765c881cec1f39e6f63c1","first_computed_at":"2026-05-20T00:00:26.230439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:26.230439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WwScLpaW/v54a/Ht2wDd+lAubv9E8CAHEJVU2m8788HUTzVy3H39zMndx8mXv4arFYyBggqPaQv/1mfiBXNBBg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:26.231338Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.15714","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bb894bffc240e84193c9d7d459b38ba0d95de0b07581860dfd7f89b68e9bef6","sha256:7c8176cd00c7533669592207873d11fc9a4ce9f72c0b427dcd401fe96095ea26"],"state_sha256":"6aefda323c66809c28a253f407e901c618dfb8f5fd359ec9f4961a0ee4b1f892"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/rE7P4BjK+4b3aMAA2vraJJ1yecMKBvjDxbkN8OFuujk1tHXDXJDC+I+BYW32bW+WB2FUsuHeXOUJBfy057CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:35:47.161090Z","bundle_sha256":"82f9e708405f60fbde475aae14163bcd5735f80a2a38befc88619ad7c600a9c1"}}