{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4QGMF36OMMFBUFKPHZB7RCEYKF","short_pith_number":"pith:4QGMF36O","schema_version":"1.0","canonical_sha256":"e40cc2efce630a1a154f3e43f88898515286f5dba3abdffd4a849875c38acc33","source":{"kind":"arxiv","id":"2311.12214","version":2},"attestation_state":"computed","paper":{"title":"Random Fourier Signature Features","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Csaba Toth, Harald Oberhauser, Zoltan Szabo","submitted_at":"2023-11-20T22:08:17Z","abstract_excerpt":"Tensor algebras give rise to one of the most powerful measures of similarity for sequences of arbitrary length called the signature kernel accompanied with attractive theoretical guarantees from stochastic analysis. Previous algorithms to compute the signature kernel scale quadratically in terms of the length and the number of the sequences. To mitigate this severe computational bottleneck, we develop a random Fourier feature-based acceleration of the signature kernel acting on the inherently non-Euclidean domain of sequences. We show uniform approximation guarantees for the proposed unbiased "},"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":"2311.12214","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-11-20T22:08:17Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"3ad417d4e0420f706f0a69bd5afe021251254fbf9654c7c5f4d54557ba9d47f6","abstract_canon_sha256":"ae4945133a32a235ded3a3e146d751135d8de70fbe86b400ebe55f46fe5d0288"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:04.762014Z","signature_b64":"cdhStMDu4APLHGdVPE6eu/y3L9OQ5YwQB8u8uhD4iDnlAAtyh3IXkhzvya2xz+PveoheXSzdycs3+MUicbGKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e40cc2efce630a1a154f3e43f88898515286f5dba3abdffd4a849875c38acc33","last_reissued_at":"2026-07-05T09:39:04.761557Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:04.761557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Fourier Signature Features","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Csaba Toth, Harald Oberhauser, Zoltan Szabo","submitted_at":"2023-11-20T22:08:17Z","abstract_excerpt":"Tensor algebras give rise to one of the most powerful measures of similarity for sequences of arbitrary length called the signature kernel accompanied with attractive theoretical guarantees from stochastic analysis. Previous algorithms to compute the signature kernel scale quadratically in terms of the length and the number of the sequences. To mitigate this severe computational bottleneck, we develop a random Fourier feature-based acceleration of the signature kernel acting on the inherently non-Euclidean domain of sequences. We show uniform approximation guarantees for the proposed unbiased "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.12214","kind":"arxiv","version":2},"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/2311.12214/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":"2311.12214","created_at":"2026-07-05T09:39:04.761619+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.12214v2","created_at":"2026-07-05T09:39:04.761619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.12214","created_at":"2026-07-05T09:39:04.761619+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QGMF36OMMFB","created_at":"2026-07-05T09:39:04.761619+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QGMF36OMMFBUFKP","created_at":"2026-07-05T09:39:04.761619+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QGMF36O","created_at":"2026-07-05T09:39:04.761619+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.07145","citing_title":"A User's Guide to $\\texttt{KSig}$: GPU-Accelerated Computation of the Signature Kernel","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4QGMF36OMMFBUFKPHZB7RCEYKF","json":"https://pith.science/pith/4QGMF36OMMFBUFKPHZB7RCEYKF.json","graph_json":"https://pith.science/api/pith-number/4QGMF36OMMFBUFKPHZB7RCEYKF/graph.json","events_json":"https://pith.science/api/pith-number/4QGMF36OMMFBUFKPHZB7RCEYKF/events.json","paper":"https://pith.science/paper/4QGMF36O"},"agent_actions":{"view_html":"https://pith.science/pith/4QGMF36OMMFBUFKPHZB7RCEYKF","download_json":"https://pith.science/pith/4QGMF36OMMFBUFKPHZB7RCEYKF.json","view_paper":"https://pith.science/paper/4QGMF36O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.12214&json=true","fetch_graph":"https://pith.science/api/pith-number/4QGMF36OMMFBUFKPHZB7RCEYKF/graph.json","fetch_events":"https://pith.science/api/pith-number/4QGMF36OMMFBUFKPHZB7RCEYKF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QGMF36OMMFBUFKPHZB7RCEYKF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QGMF36OMMFBUFKPHZB7RCEYKF/action/storage_attestation","attest_author":"https://pith.science/pith/4QGMF36OMMFBUFKPHZB7RCEYKF/action/author_attestation","sign_citation":"https://pith.science/pith/4QGMF36OMMFBUFKPHZB7RCEYKF/action/citation_signature","submit_replication":"https://pith.science/pith/4QGMF36OMMFBUFKPHZB7RCEYKF/action/replication_record"}},"created_at":"2026-07-05T09:39:04.761619+00:00","updated_at":"2026-07-05T09:39:04.761619+00:00"}