{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MTV2REHBQCXBXFOAV5WD52WAMC","short_pith_number":"pith:MTV2REHB","canonical_record":{"source":{"id":"2605.13378","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CE","submitted_at":"2026-05-13T11:34:32Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"708eb2ce55b461502af8ba7190e9fdffa4398860a895dbe0334c4038d4e7dcde","abstract_canon_sha256":"a93c34770cedaecb9472883ae67572009cbfa07af587427f27afef18ebf37f0a"},"schema_version":"1.0"},"canonical_sha256":"64eba890e180ae1b95c0af6c3eeac060b2c692adf076a2af7267d51c48ee6fd8","source":{"kind":"arxiv","id":"2605.13378","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13378","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13378v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13378","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"MTV2REHBQCXB","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MTV2REHBQCXBXFOA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MTV2REHB","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MTV2REHBQCXBXFOAV5WD52WAMC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13378","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CE","submitted_at":"2026-05-13T11:34:32Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"708eb2ce55b461502af8ba7190e9fdffa4398860a895dbe0334c4038d4e7dcde","abstract_canon_sha256":"a93c34770cedaecb9472883ae67572009cbfa07af587427f27afef18ebf37f0a"},"schema_version":"1.0"},"canonical_sha256":"64eba890e180ae1b95c0af6c3eeac060b2c692adf076a2af7267d51c48ee6fd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:47.874253Z","signature_b64":"0ipRyw1t0YcgnbbrZxUL/sfDfiUD86kIfXK3BtqJG1DUo8QIiW0rXMujHULhfNYtzDm3fRKdytUTkp2Vf60DBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64eba890e180ae1b95c0af6c3eeac060b2c692adf076a2af7267d51c48ee6fd8","last_reissued_at":"2026-05-18T02:44:47.873733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:47.873733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13378","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-18T02:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mlun95gctfbWpWkUatCEUG6HORRxH+xXPuCbBgmdkbpKPCeffbWWEICNjH2ZfTJ2G5Z/aj9NTScB2xeaMG9hCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T09:58:12.788657Z"},"content_sha256":"f550cecc73cb4570d21c35bcd79118b2d5ca204cff4ee1ab958aa0b2fd96ba80","schema_version":"1.0","event_id":"sha256:f550cecc73cb4570d21c35bcd79118b2d5ca204cff4ee1ab958aa0b2fd96ba80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MTV2REHBQCXBXFOAV5WD52WAMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Matrix-Free Newton-Krylov Solvers via Automatic Differentiation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Automatic differentiation for Jacobian-vector products makes matrix-free Newton-Krylov solvers orders of magnitude faster and far more robust than finite differences.","cross_cats":["physics.comp-ph"],"primary_cat":"cs.CE","authors_text":"Marco Pasquale, Stefano Markidis","submitted_at":"2026-05-13T11:34:32Z","abstract_excerpt":"Jacobian-Free Newton-Krylov (JFNK) methods avoid forming the full Jacobian, but still require Jacobian-vector products, i.e., Gateaux derivatives of the nonlinear residual along Krylov directions. In standard Finite Differences (FD) formulations, these products are obtained by perturbing the Newton state and differencing residuals, making the linearization sensitive to round-off error and floating-point precision. This work evaluates the global impact of forward-mode Automatic Differentiation (AD) as a replacement for FD Jacobian-vector product in finite-precision JFNK solvers. The comparison "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"By preventing degradation of the Krylov operator, AD accelerates computation by 2-3 orders of magnitude across both CPU and GPU architectures. More importantly, it drastically improves global solver robustness, achieving a minimum completion rate of 95%, compared to just 42% for FD.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the observed gains are caused solely by the accuracy of the Gateaux derivatives and will persist when the automatic-differentiation implementation, problem size, or floating-point precision changes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Forward-mode automatic differentiation replaces finite-difference approximations for Jacobian-vector products in JFNK solvers, delivering 2-3 orders of magnitude speedup and lifting minimum solver completion from 42% to 95% across Burgers, radiation diffusion, reaction-diffusion, and nonlinear time-","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Automatic differentiation for Jacobian-vector products makes matrix-free Newton-Krylov solvers orders of magnitude faster and far more robust than finite differences.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"98da9c81a3478bc72be14c42e5543a0675e7ac4c384575e24fab7f4657d00f07"},"source":{"id":"2605.13378","kind":"arxiv","version":1},"verdict":{"id":"84ca345b-833d-418c-acce-13e3866dd439","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:53:47.699379Z","strongest_claim":"By preventing degradation of the Krylov operator, AD accelerates computation by 2-3 orders of magnitude across both CPU and GPU architectures. More importantly, it drastically improves global solver robustness, achieving a minimum completion rate of 95%, compared to just 42% for FD.","one_line_summary":"Forward-mode automatic differentiation replaces finite-difference approximations for Jacobian-vector products in JFNK solvers, delivering 2-3 orders of magnitude speedup and lifting minimum solver completion from 42% to 95% across Burgers, radiation diffusion, reaction-diffusion, and nonlinear time-","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the observed gains are caused solely by the accuracy of the Gateaux derivatives and will persist when the automatic-differentiation implementation, problem size, or floating-point precision changes.","pith_extraction_headline":"Automatic differentiation for Jacobian-vector products makes matrix-free Newton-Krylov solvers orders of magnitude faster and far more robust than finite differences."},"references":{"count":31,"sample":[{"doi":"10.1016/j.jcp.2003.08.010","year":2004,"title":"D. Knoll, D. Keyes, Jacobian-free Newton–Krylov methods: a survey of approaches and applications, Journal of Computational Physics 193 (2) 26 (2004) 357–397.doi:10.1016/j.jcp.2003.08.010. URLhttps://l","work_id":"0af1b009-f84f-4a2c-a4e6-bc1cfd9f18d9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1137/1.9781611970944","year":1995,"title":"C. T. Kelley, Iterative Methods for Linear and Nonlinear Equations, Frontiers in Applied Mathematics, Society for Industrial and Applied Mathematics, 1995.doi:10.1137/1.9781611970944. URLhttps://epubs","work_id":"9fc8315a-16e1-43fe-a09f-dd166e2f7178","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1137/0907058","year":1986,"title":"GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems","work_id":"f6da0283-d7be-49a1-9588-ef5e70259b34","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1952,"title":"M. R. Hestenes, E. Stiefel, Methods of Conjugate Gradients for Solving LinearSystems, JournalofResearchoftheNationalBureauofStandards 49 (6) (1952) 409–436","work_id":"657d203e-cd14-4080-8004-d235c4806e38","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1137/0913035","year":1992,"title":"H. A. Van Der Vorst, Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems, SIAM Journal on Scientific and Statistical Computing 13 (2) (1992) 631–","work_id":"77df7389-dd91-4e7f-b294-eb5f25f03be0","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":31,"snapshot_sha256":"3c3ab9e0dc756420ff341358b00bbe2e135fcb6a18bd800ececd7cfc07a25d6f","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"2e693b03efbeb288ee1e1d14ce2123f1d1a1f0374f563cb582f9aca697380c30"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"84ca345b-833d-418c-acce-13e3866dd439"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"in9s0otHhfPwGuOXd3LZ9dRwnLhmHC+IGZ1heolRjask8Uyy9NbrvQ+Y7sQ7YroOHKUvKvluqwoeAKOnnGM/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T09:58:12.789949Z"},"content_sha256":"9d64534d2baf6c563ec66c5e9056f99e6a9b2e51750eb5c84672f87f378c2f4b","schema_version":"1.0","event_id":"sha256:9d64534d2baf6c563ec66c5e9056f99e6a9b2e51750eb5c84672f87f378c2f4b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:MTV2REHBQCXBXFOAV5WD52WAMC","target":"integrity","payload":{"note":"Identifier '10.5555/3571885.3571964' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"W. S. Moses, S. H. K. Narayanan, L. Paehler, V. Churavy, M. Schanen, J. Hückelheim, J. Doerfert, P. Hovland, Scalable automatic differentia- tion of multiple parallel paradigms through compiler augmentation, in: Proceedings of the Internati","arxiv_id":"2605.13378","detector":"doi_compliance","evidence":{"doi":"10.5555/3571885.3571964","arxiv_id":null,"ref_index":20,"raw_excerpt":"W. S. Moses, S. H. K. Narayanan, L. Paehler, V. Churavy, M. Schanen, J. Hückelheim, J. Doerfert, P. Hovland, Scalable automatic differentia- tion of multiple parallel paradigms through compiler augmentation, in: Proceedings of the International Conference on High Performance Com- puting, Networking, Storage and Analysis, SC ’22, IEEE Press, Dallas, 29 Texas, 2022, pp. 1–18. URLhttps://dl.acm.org/d","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":20,"audited_at":"2026-05-19T06:37:30.402510Z","event_type":"pith.integrity.v1","detected_doi":"10.5555/3571885.3571964","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"9d15ff776b328acb10e448dc5ffd363f790443b5f57a27ea6b167b560eeafaa7","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":184,"payload_sha256":"fe319a183efdd517cd7a2931d6194a16960bfa9472ffc62e8559fb0c5a74475d","signature_b64":"o8hFYcKt8v7XwtgFzBcKA12WI0ID4VdG53R+mbgkMTBrDYAhN0UQVZSnhUNRCa+iz7yFdvYr7k/QLsyCgy0vDw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T06:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qPu01Z0LD+sxOdQmZuIE6eb+plgnIYee5Ecd2RaokHZktKKW0zsPIZbGiRcrC121+8Q3Mq80ccl9m3yipZQoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T09:58:12.791505Z"},"content_sha256":"78e6dae54b8bb6f341a13cb6ddc1fa42833c5526beabaf389fdd87a548710472","schema_version":"1.0","event_id":"sha256:78e6dae54b8bb6f341a13cb6ddc1fa42833c5526beabaf389fdd87a548710472"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:MTV2REHBQCXBXFOAV5WD52WAMC","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.48550/arXiv.2406.09699.URLhttp://arxiv.org/abs/2406.09699) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"F. Sapienza, J. Bolibar, F. Schäfer, B. Groenke, A. Pal, V. Bous- sange, P. Heimbach, G. Hooker, F. Pérez, P.-O. Persson, C. Rack- auckas, Differentiable Programming for Differential Equations: A Re- view, arXiv:2406.09699 [math] (Oct. 2025","arxiv_id":"2605.13378","detector":"doi_compliance","evidence":{"ref_index":14,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"F. Sapienza, J. Bolibar, F. Schäfer, B. Groenke, A. Pal, V. Bous- sange, P. Heimbach, G. Hooker, F. Pérez, P.-O. Persson, C. Rack- auckas, Differentiable Programming for Differential Equations: A Re- view, arXiv:2406.09699 [math] (Oct. 2025","reconstructed_doi":"10.48550/arXiv.2406.09699.URLhttp://arxiv.org/abs/2406.09699"},"severity":"advisory","ref_index":14,"audited_at":"2026-05-19T06:37:30.402510Z","event_type":"pith.integrity.v1","detected_doi":"10.48550/arXiv.2406.09699.URLhttp://arxiv.org/abs/2406.09699","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"c1398245b2087a2c05be81e4f5282a39b44daa919760eb56072b351cb590af53","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":183,"payload_sha256":"852b80ae6c4c10806971ce8b8a0e849f91036a158f9a81c061c252c33262064d","signature_b64":"lxjcHbKGqnqSvlU4sLwnuL6DbaeOIr1M2Ew7nDUBF1RyOW3EBM9Kwa8h+V9+ETU0OfNiqtV7sypSnM1f0BdQAg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T06:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vd/qXRiUA09ltbtVcOsFKA+8jFRDS5XH8pmENE0NYTEjzl+/Z9Gb6oD0G9B+HZRS/pxB3LFusX/KoBRwDvz9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T09:58:12.792062Z"},"content_sha256":"ff7ae82fac0ae61850aa49a7bf35359961bed729afc4d81a53634e1590aedb94","schema_version":"1.0","event_id":"sha256:ff7ae82fac0ae61850aa49a7bf35359961bed729afc4d81a53634e1590aedb94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTV2REHBQCXBXFOAV5WD52WAMC/bundle.json","state_url":"https://pith.science/pith/MTV2REHBQCXBXFOAV5WD52WAMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTV2REHBQCXBXFOAV5WD52WAMC/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-21T09:58:12Z","links":{"resolver":"https://pith.science/pith/MTV2REHBQCXBXFOAV5WD52WAMC","bundle":"https://pith.science/pith/MTV2REHBQCXBXFOAV5WD52WAMC/bundle.json","state":"https://pith.science/pith/MTV2REHBQCXBXFOAV5WD52WAMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTV2REHBQCXBXFOAV5WD52WAMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MTV2REHBQCXBXFOAV5WD52WAMC","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a93c34770cedaecb9472883ae67572009cbfa07af587427f27afef18ebf37f0a","cross_cats_sorted":["physics.comp-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CE","submitted_at":"2026-05-13T11:34:32Z","title_canon_sha256":"708eb2ce55b461502af8ba7190e9fdffa4398860a895dbe0334c4038d4e7dcde"},"schema_version":"1.0","source":{"id":"2605.13378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13378","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13378v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13378","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"MTV2REHBQCXB","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MTV2REHBQCXBXFOA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MTV2REHB","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:9d64534d2baf6c563ec66c5e9056f99e6a9b2e51750eb5c84672f87f378c2f4b","target":"graph","created_at":"2026-05-18T02:44:47Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"By preventing degradation of the Krylov operator, AD accelerates computation by 2-3 orders of magnitude across both CPU and GPU architectures. More importantly, it drastically improves global solver robustness, achieving a minimum completion rate of 95%, compared to just 42% for FD."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the observed gains are caused solely by the accuracy of the Gateaux derivatives and will persist when the automatic-differentiation implementation, problem size, or floating-point precision changes."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Forward-mode automatic differentiation replaces finite-difference approximations for Jacobian-vector products in JFNK solvers, delivering 2-3 orders of magnitude speedup and lifting minimum solver completion from 42% to 95% across Burgers, radiation diffusion, reaction-diffusion, and nonlinear time-"},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Automatic differentiation for Jacobian-vector products makes matrix-free Newton-Krylov solvers orders of magnitude faster and far more robust than finite differences."}],"snapshot_sha256":"98da9c81a3478bc72be14c42e5543a0675e7ac4c384575e24fab7f4657d00f07"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"2e693b03efbeb288ee1e1d14ce2123f1d1a1f0374f563cb582f9aca697380c30"},"paper":{"abstract_excerpt":"Jacobian-Free Newton-Krylov (JFNK) methods avoid forming the full Jacobian, but still require Jacobian-vector products, i.e., Gateaux derivatives of the nonlinear residual along Krylov directions. In standard Finite Differences (FD) formulations, these products are obtained by perturbing the Newton state and differencing residuals, making the linearization sensitive to round-off error and floating-point precision. This work evaluates the global impact of forward-mode Automatic Differentiation (AD) as a replacement for FD Jacobian-vector product in finite-precision JFNK solvers. The comparison ","authors_text":"Marco Pasquale, Stefano Markidis","cross_cats":["physics.comp-ph"],"headline":"Automatic differentiation for Jacobian-vector products makes matrix-free Newton-Krylov solvers orders of magnitude faster and far more robust than finite differences.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CE","submitted_at":"2026-05-13T11:34:32Z","title":"Robust Matrix-Free Newton-Krylov Solvers via Automatic Differentiation"},"references":{"count":31,"internal_anchors":1,"resolved_work":31,"sample":[{"cited_arxiv_id":"","doi":"10.1016/j.jcp.2003.08.010","is_internal_anchor":false,"ref_index":1,"title":"D. Knoll, D. Keyes, Jacobian-free Newton–Krylov methods: a survey of approaches and applications, Journal of Computational Physics 193 (2) 26 (2004) 357–397.doi:10.1016/j.jcp.2003.08.010. URLhttps://l","work_id":"0af1b009-f84f-4a2c-a4e6-bc1cfd9f18d9","year":2004},{"cited_arxiv_id":"","doi":"10.1137/1.9781611970944","is_internal_anchor":false,"ref_index":2,"title":"C. T. Kelley, Iterative Methods for Linear and Nonlinear Equations, Frontiers in Applied Mathematics, Society for Industrial and Applied Mathematics, 1995.doi:10.1137/1.9781611970944. URLhttps://epubs","work_id":"9fc8315a-16e1-43fe-a09f-dd166e2f7178","year":1995},{"cited_arxiv_id":"","doi":"10.1137/0907058","is_internal_anchor":false,"ref_index":3,"title":"GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems","work_id":"f6da0283-d7be-49a1-9588-ef5e70259b34","year":1986},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"M. R. Hestenes, E. Stiefel, Methods of Conjugate Gradients for Solving LinearSystems, JournalofResearchoftheNationalBureauofStandards 49 (6) (1952) 409–436","work_id":"657d203e-cd14-4080-8004-d235c4806e38","year":1952},{"cited_arxiv_id":"","doi":"10.1137/0913035","is_internal_anchor":false,"ref_index":5,"title":"H. A. Van Der Vorst, Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems, SIAM Journal on Scientific and Statistical Computing 13 (2) (1992) 631–","work_id":"77df7389-dd91-4e7f-b294-eb5f25f03be0","year":1992}],"snapshot_sha256":"3c3ab9e0dc756420ff341358b00bbe2e135fcb6a18bd800ececd7cfc07a25d6f"},"source":{"id":"2605.13378","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:53:47.699379Z","id":"84ca345b-833d-418c-acce-13e3866dd439","model_set":{"reader":"grok-4.3"},"one_line_summary":"Forward-mode automatic differentiation replaces finite-difference approximations for Jacobian-vector products in JFNK solvers, delivering 2-3 orders of magnitude speedup and lifting minimum solver completion from 42% to 95% across Burgers, radiation diffusion, reaction-diffusion, and nonlinear time-","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Automatic differentiation for Jacobian-vector products makes matrix-free Newton-Krylov solvers orders of magnitude faster and far more robust than finite differences.","strongest_claim":"By preventing degradation of the Krylov operator, AD accelerates computation by 2-3 orders of magnitude across both CPU and GPU architectures. More importantly, it drastically improves global solver robustness, achieving a minimum completion rate of 95%, compared to just 42% for FD.","weakest_assumption":"That the observed gains are caused solely by the accuracy of the Gateaux derivatives and will persist when the automatic-differentiation implementation, problem size, or floating-point precision changes."}},"verdict_id":"84ca345b-833d-418c-acce-13e3866dd439"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f550cecc73cb4570d21c35bcd79118b2d5ca204cff4ee1ab958aa0b2fd96ba80","target":"record","created_at":"2026-05-18T02:44:47Z","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":"a93c34770cedaecb9472883ae67572009cbfa07af587427f27afef18ebf37f0a","cross_cats_sorted":["physics.comp-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CE","submitted_at":"2026-05-13T11:34:32Z","title_canon_sha256":"708eb2ce55b461502af8ba7190e9fdffa4398860a895dbe0334c4038d4e7dcde"},"schema_version":"1.0","source":{"id":"2605.13378","kind":"arxiv","version":1}},"canonical_sha256":"64eba890e180ae1b95c0af6c3eeac060b2c692adf076a2af7267d51c48ee6fd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64eba890e180ae1b95c0af6c3eeac060b2c692adf076a2af7267d51c48ee6fd8","first_computed_at":"2026-05-18T02:44:47.873733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:47.873733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ipRyw1t0YcgnbbrZxUL/sfDfiUD86kIfXK3BtqJG1DUo8QIiW0rXMujHULhfNYtzDm3fRKdytUTkp2Vf60DBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:47.874253Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13378","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:78e6dae54b8bb6f341a13cb6ddc1fa42833c5526beabaf389fdd87a548710472","sha256:ff7ae82fac0ae61850aa49a7bf35359961bed729afc4d81a53634e1590aedb94"]}],"invalid_events":[],"applied_event_ids":["sha256:f550cecc73cb4570d21c35bcd79118b2d5ca204cff4ee1ab958aa0b2fd96ba80","sha256:9d64534d2baf6c563ec66c5e9056f99e6a9b2e51750eb5c84672f87f378c2f4b"],"state_sha256":"85980de23be1ffa714b4cdcaee12ef8806058eb46d82b643141b8b2300a7f0fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dQVfuuyZeSfO/Kg9Zijzcbro5jSLuzlgoStwkz1mSgX94Xbn2OxEm/1eEp7GG8CviMgssBO0GSHEF+HO6ccBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T09:58:12.796484Z","bundle_sha256":"b0ce44de60faf4882d779e5e5746df388d3826478e35fed0d360062ac730c8a2"}}