{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CZ23SYPMDOMUYAWR4234FWTMFC","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":"ee11e6cffedd5d02dbc3964f070caeb13a89a168ce698c1e41b5e003e2801560","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-05-18T13:46:47Z","title_canon_sha256":"71031a1f0ba907c423148fd9883543cbef45cbd6a1eff8f14862b8b834e5b696"},"schema_version":"1.0","source":{"id":"2605.18406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18406","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18406v1","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18406","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"pith_short_12","alias_value":"CZ23SYPMDOMU","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"pith_short_16","alias_value":"CZ23SYPMDOMUYAWR","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"pith_short_8","alias_value":"CZ23SYPM","created_at":"2026-05-20T00:05:59Z"}],"graph_snapshots":[{"event_id":"sha256:2e65d474fc85e33ff8312becf3cc6d1d229d06c50cd4d2ca003bf6f5d21c19da","target":"graph","created_at":"2026-05-20T00:05:59Z","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":"The paper provides a general approximative scheme with quadratic complexity O(J^2), an FFT-based acceleration with O(J log J) for convolution kernels on uniform grids, and an exact recursion with O(J R^2) for kernels admitting a state-space representation of dimension R, while retaining standard signature complexity in path dimension and truncation level N."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The decomposition of the Chen-type convolution relation into analytic and arithmetic parts (referenced from arXiv:2603.04525) can be performed without introducing errors that propagate into the final signature components for general matrix-valued kernels."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Algorithms for Volterra signature computation achieve O(J^2), O(J log J) via FFT, and O(J R^2) via recursion, plus a predictor-corrector scheme, all implemented in a public JAX package."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The Volterra signature with matrix-valued kernels admits efficient computation via quadratic approximation, FFT acceleration, and low-dimensional recursion."}],"snapshot_sha256":"68f5f25ca198a6ebe5c21eb02bf8d2f897ad8246845cbffb7c73918eca858b39"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"98a19a219b0b7c31d3c114dbedb1aea194e081c8971961297dc6bd8513a3a861"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.306986Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-20T00:01:17.322013Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T23:51:58.685644Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T23:49:59.963285Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:29.266121Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"external_links","ran_at":"2026-05-19T23:31:39.381344Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.711880Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.18406/integrity.json","findings":[],"snapshot_sha256":"f6b6c681b3719c97366993c606ecc2a4aab6f3a38f18e2f1b33a421cc6ca9506","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Volterra signature extends the classical path signature by incorporating general matrix-valued kernel into its iterated integral structure, yielding a flexible notion of memory for time series. Its components can be viewed as successive Picard iterates of linear controlled Volterra equations, making their exact computation of additional mathematical interest. However, the kernel introduces substantial algorithmic challenges. We provide a resolution by first decomposing the Chen-type convolution relation established in [arXiv:2603.04525] into analytic and arithmetic parts, and then introduc","authors_text":"Fabian N. Harang, Luca Pelizzari, Paul P. Hager, Samy Tindel","cross_cats":["cs.NA","stat.ML"],"headline":"The Volterra signature with matrix-valued kernels admits efficient computation via quadratic approximation, FFT acceleration, and low-dimensional recursion.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-05-18T13:46:47Z","title":"Computational aspects of the Volterra Signature"},"references":{"count":43,"internal_anchors":1,"resolved_work":43,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Dover Publications, Inc., USA, 1974","work_id":"901dddec-f282-4405-9576-e1cc06da31f1","year":1974},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Al-Mohy and Bahar Arslan","work_id":"1c18db85-6726-4134-a11c-e5ccf898ee96","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Springer Finance","work_id":"031ccdbf-bdff-4274-a3fe-020149e401dc","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"2 COMPUTATIONAL ASPECTS OF THE VOLTERRA SIGNATURE 58","work_id":"5c5bc3d0-b269-4433-bfa3-5f9ade89aebb","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Cohen, Terry Lyons, Joël Mouterde, and Benjamin Walker","work_id":"73173613-0fbe-4056-905b-7b6b01976061","year":2026}],"snapshot_sha256":"1e3e91d98bcec50a9e42d85123a1ee32c0f46bf7e6127c62527a1952d549fe2e"},"source":{"id":"2605.18406","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:55:26.531382Z","id":"6eb389f4-d4d8-455d-8921-063659732088","model_set":{"reader":"grok-4.3"},"one_line_summary":"Algorithms for Volterra signature computation achieve O(J^2), O(J log J) via FFT, and O(J R^2) via recursion, plus a predictor-corrector scheme, all implemented in a public JAX package.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The Volterra signature with matrix-valued kernels admits efficient computation via quadratic approximation, FFT acceleration, and low-dimensional recursion.","strongest_claim":"The paper provides a general approximative scheme with quadratic complexity O(J^2), an FFT-based acceleration with O(J log J) for convolution kernels on uniform grids, and an exact recursion with O(J R^2) for kernels admitting a state-space representation of dimension R, while retaining standard signature complexity in path dimension and truncation level N.","weakest_assumption":"The decomposition of the Chen-type convolution relation into analytic and arithmetic parts (referenced from arXiv:2603.04525) can be performed without introducing errors that propagate into the final signature components for general matrix-valued kernels."}},"verdict_id":"6eb389f4-d4d8-455d-8921-063659732088"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d803d8f20936a64460df0e616c1ce80c70fe03fafd3c9c5ce35039adf1e91eca","target":"record","created_at":"2026-05-20T00:05:59Z","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":"ee11e6cffedd5d02dbc3964f070caeb13a89a168ce698c1e41b5e003e2801560","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-05-18T13:46:47Z","title_canon_sha256":"71031a1f0ba907c423148fd9883543cbef45cbd6a1eff8f14862b8b834e5b696"},"schema_version":"1.0","source":{"id":"2605.18406","kind":"arxiv","version":1}},"canonical_sha256":"1675b961ec1b994c02d1e6b7c2da6c28b4145eaafb51a27db9aacff25615c7db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1675b961ec1b994c02d1e6b7c2da6c28b4145eaafb51a27db9aacff25615c7db","first_computed_at":"2026-05-20T00:05:59.133433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:59.133433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FkSo1X+pXTNUd3YAp1bDKSfdTj2ibqfKhzih9+LhwwSjJpkdEWVaf0OnQ4ZXtsQqJz2/8M/f4PZ6VrwLXWdyAQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:59.134157Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d803d8f20936a64460df0e616c1ce80c70fe03fafd3c9c5ce35039adf1e91eca","sha256:2e65d474fc85e33ff8312becf3cc6d1d229d06c50cd4d2ca003bf6f5d21c19da"],"state_sha256":"8eb4045ad90a1ece152ee202e98445d08cb12c9a5c01503f5f23547a4b32f183"}