{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MTEDTLAORWUOO7I3PK6C54TYNS","short_pith_number":"pith:MTEDTLAO","schema_version":"1.0","canonical_sha256":"64c839ac0e8da8e77d1b7abc2ef2786cabb9c4f68f606f3a5a83e319cbb5f20e","source":{"kind":"arxiv","id":"2206.14674","version":7},"attestation_state":"computed","paper":{"title":"Signature Methods in Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.CA","math.NA","math.ST","stat.ME","stat.TH"],"primary_cat":"stat.ML","authors_text":"Andrew D. McLeod, Terry Lyons","submitted_at":"2022-06-29T14:23:28Z","abstract_excerpt":"Signature-based techniques give mathematical insight into the interactions between complex streams of evolving data. These insights can be quite naturally translated into numerical approaches to understanding streamed data, and perhaps because of their mathematical precision, have proved useful in analysing streamed data in situations where the data is irregular, and not stationary, and the dimension of the data and the sample sizes are both moderate. Understanding streamed multi-modal data is exponential: a word in $n$ letters from an alphabet of size $d$ can be any one of $d^n$ messages. Sig"},"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":"2206.14674","kind":"arxiv","version":7},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2022-06-29T14:23:28Z","cross_cats_sorted":["cs.LG","cs.NA","math.CA","math.NA","math.ST","stat.ME","stat.TH"],"title_canon_sha256":"30e256dbdd93c5c1c9911bea2bdc34829bdbdd083047bc161067383a3ead4584","abstract_canon_sha256":"261b7c1ed3a794f7c280bb91a2921c75f13b7183b6e4ad8d17d532f6177c1d15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:17:03.983469Z","signature_b64":"P6SHPr5T+E7wkanapyVPqOhpbVo6q5bdTewNPpcEdweuQ6sWyqaIkd8jal2wXEQUjXVzWVwhbS967Y/YSBVkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64c839ac0e8da8e77d1b7abc2ef2786cabb9c4f68f606f3a5a83e319cbb5f20e","last_reissued_at":"2026-07-05T10:17:03.983029Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:17:03.983029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Signature Methods in Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.CA","math.NA","math.ST","stat.ME","stat.TH"],"primary_cat":"stat.ML","authors_text":"Andrew D. McLeod, Terry Lyons","submitted_at":"2022-06-29T14:23:28Z","abstract_excerpt":"Signature-based techniques give mathematical insight into the interactions between complex streams of evolving data. These insights can be quite naturally translated into numerical approaches to understanding streamed data, and perhaps because of their mathematical precision, have proved useful in analysing streamed data in situations where the data is irregular, and not stationary, and the dimension of the data and the sample sizes are both moderate. Understanding streamed multi-modal data is exponential: a word in $n$ letters from an alphabet of size $d$ can be any one of $d^n$ messages. Sig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.14674","kind":"arxiv","version":7},"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/2206.14674/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":"2206.14674","created_at":"2026-07-05T10:17:03.983089+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.14674v7","created_at":"2026-07-05T10:17:03.983089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.14674","created_at":"2026-07-05T10:17:03.983089+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTEDTLAORWUO","created_at":"2026-07-05T10:17:03.983089+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTEDTLAORWUOO7I3","created_at":"2026-07-05T10:17:03.983089+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTEDTLAO","created_at":"2026-07-05T10:17:03.983089+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18544","citing_title":"Chess Signatures of Play","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08928","citing_title":"The Singular Values of L\\'evy's Area Matrix","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2507.03700","citing_title":"Exponentially Fading Memory Signature","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06087","citing_title":"Safety Certification is Classification","ref_index":83,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05008","citing_title":"Generative Path-Law Jump-Diffusion: Sequential MMD-Gradient Flows and Generalisation Bounds in Marcus-Signature RKHS","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04662","citing_title":"Anticipatory Reinforcement Learning: From Generative Path-Laws to Distributional Value Functions","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MTEDTLAORWUOO7I3PK6C54TYNS","json":"https://pith.science/pith/MTEDTLAORWUOO7I3PK6C54TYNS.json","graph_json":"https://pith.science/api/pith-number/MTEDTLAORWUOO7I3PK6C54TYNS/graph.json","events_json":"https://pith.science/api/pith-number/MTEDTLAORWUOO7I3PK6C54TYNS/events.json","paper":"https://pith.science/paper/MTEDTLAO"},"agent_actions":{"view_html":"https://pith.science/pith/MTEDTLAORWUOO7I3PK6C54TYNS","download_json":"https://pith.science/pith/MTEDTLAORWUOO7I3PK6C54TYNS.json","view_paper":"https://pith.science/paper/MTEDTLAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.14674&json=true","fetch_graph":"https://pith.science/api/pith-number/MTEDTLAORWUOO7I3PK6C54TYNS/graph.json","fetch_events":"https://pith.science/api/pith-number/MTEDTLAORWUOO7I3PK6C54TYNS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTEDTLAORWUOO7I3PK6C54TYNS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTEDTLAORWUOO7I3PK6C54TYNS/action/storage_attestation","attest_author":"https://pith.science/pith/MTEDTLAORWUOO7I3PK6C54TYNS/action/author_attestation","sign_citation":"https://pith.science/pith/MTEDTLAORWUOO7I3PK6C54TYNS/action/citation_signature","submit_replication":"https://pith.science/pith/MTEDTLAORWUOO7I3PK6C54TYNS/action/replication_record"}},"created_at":"2026-07-05T10:17:03.983089+00:00","updated_at":"2026-07-05T10:17:03.983089+00:00"}