{"as_of":"2026-08-18T05:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fa6239d8b4a42db25204b297ba64fc904c934f3e6a2a5b446db0f3f99fe3c09f","coverage":[{"denominator":298,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:09:21.861299Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.17634/citation-record","integrity":"/paper/2506.17634/integrity","json":"/paper/2506.17634/citation-record.json","paper":"/paper/2506.17634"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.380131Z","title":"https://pubchem.ncbi.nlm.nih.gov/","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.380131Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:7582997dce632d1bdf39fc164747518fca3d962ebf1a95fa5e428cc4200a22f3","observation_id":"d0943294-75ff-4b0b-a696-809043ff942c","resolution":{"observed_at":"2026-08-15T19:09:21.380131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.385327Z","title":"Bayesian model selection of lithium-ion battery models via Bayesian quadrature","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.385327Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:dec627cdc5f42f8da08c88ad3eb0f6d696d205630270bdcf0b2cec0789d03d01","observation_id":"cff1c523-93c5-4480-8976-c44587a887d0","resolution":{"observed_at":"2026-08-15T19:09:21.385327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.390697Z","title":"Adler and J.E","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.390697Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:11f8e8c65bf58a42af56e3b640e215ff8d40dc0377725e256a804fdfbb44e1bf","observation_id":"1103d82f-c01d-49d0-a7bb-dfc40b96f02f","resolution":{"observed_at":"2026-08-15T19:09:21.390697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.395680Z","title":"Predicting battery end of life from solar off-grid system field data using machine learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.395680Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:cf3fd357b1b0950a87f416f37f29ce6e502875e9b3d21d4d7d69cd75daa44956","observation_id":"0646d0bf-119d-4210-ac76-a55f9c06b060","resolution":{"observed_at":"2026-08-15T19:09:21.395680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.400684Z","title":"Learning scalable deep kernels with recurrent structure","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.400684Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:535bcbe1d58d3082bc86006eab16fc26060aff0a7edac1d3ff67d5b7f17d5734","observation_id":"402b2521-1014-416b-9455-c419ad8a3dae","resolution":{"observed_at":"2026-08-15T19:09:21.400684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.405475Z","title":"GluonTS: Probabilistic and neural time series mod- eling in Python","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.405475Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:c718f99cf290c5a72e9b224f6aa93c3c24c3493913c39e18ddd7e8104d57f17a","observation_id":"15280891-c21e-4d2a-bf7f-ef17b3ab0c0b","resolution":{"observed_at":"2026-08-15T19:09:21.405475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.410435Z","title":"On the bottleneck of graph neural networks and its practical implications","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.410435Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:2731244ccf25e1c02934a06ff2e40f0542ece5a108fff2e3ad7d0c5c75cd86c7","observation_id":"560bb3be-453a-42ec-898d-4170621723b8","resolution":{"observed_at":"2026-08-15T19:09:21.410435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.415258Z","title":"Signature-based valida- tion of real-world economic scenarios.ASTIN Bulletin: The Journal of the IAA, 54(2):410– 440, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.415258Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:6857f56e7f4bb914f2a344c752f48767974be717e43191199e9feae043d34908","observation_id":"e1876c96-b69f-410b-a166-1513aa2fe1fd","resolution":{"observed_at":"2026-08-15T19:09:21.415258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.419756Z","title":"UCI machine learning repository , 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.419756Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:9f84902ad0cd4c4c5b94f9ab15438952034d9054b238e8ffc27487a142605328","observation_id":"bff0fc37-1a3a-4a58-951a-222036809f32","resolution":{"observed_at":"2026-08-15T19:09:21.419756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.425422Z","title":"Random Fourier features for kernel ridge regression: Approximation 175 bounds and statistical guarantees","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.425422Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:1ad216e8612990eb25d9bdceb08433bb349006c381edb56b6c08cab90253b11f","observation_id":"f8546d3f-01a8-4d92-a09b-60f6a89e14ee","resolution":{"observed_at":"2026-08-15T19:09:21.425422Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.06450","last_updated":"2016-07-21T19:57:52Z","snapshot_observed_at":"2026-08-15T04:53:45.483331Z","submitted_at":"2016-07-21T19:57:52Z","title":"Layer Normalization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.06450","snapshot_observed_at":"2026-08-15T19:09:21.430067Z","title":"Layer normalization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.430067Z"},"links":{"cited_paper":"/paper/1607.06450","citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:2738af9a1957769e1f46ea5ec3add11255760530977741ab59c3a6fcbaa8439a","observation_id":"9d4af505-b3ad-4e77-94ec-fb71f7ebb68e","resolution":{"observed_at":"2026-08-15T19:09:21.430067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.435679Z","title":"Sharp analysis of low-rank kernel matrix approximations","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.435679Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:4a880d39baff652f3a1fde24ab8434787d3819261a50ae8dc9f74e0c72047e40","observation_id":"1edf9e9e-b82a-4d9a-b0b5-e58e7f39975c","resolution":{"observed_at":"2026-08-15T19:09:21.435679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.440307Z","title":"Neural machine translation by jointly learning to align and translate","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.440307Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:627c8d1e0eb30f9804bd427f3b2856b0c1ec3045aab07166eed418a93700c644","observation_id":"f6b76686-1223-4c9c-9635-6c9f2b48a339","resolution":{"observed_at":"2026-08-15T19:09:21.440307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.445274Z","title":"Ex- ploiting the past and the future in protein secondary structure prediction.Bioinformatics, 15(11):937–946, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.445274Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:b6071073bef4280a2eb2c4694e8c91febc253d2522957a70684cf1b74afe66c9","observation_id":"b91a8616-d4c3-4af8-b50b-25e68734afe5","resolution":{"observed_at":"2026-08-15T19:09:21.445274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.450252Z","title":"Interaction networks for learning about objects, relations and physics.Advances in neural information processing systems, 29, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.450252Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:1fdfecf61f09ce98f79b13696692851b9867ae5178e76b06fb62355dcae6d522","observation_id":"5e13b219-6509-40df-ab37-a14a133db065","resolution":{"observed_at":"2026-08-15T19:09:21.450252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.454860Z","title":"Understanding prob- abilistic sparse Gaussian process approximations","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.454860Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:374639466c7cd0f0d756b48dbf68c8230de20e06b45c787ad6c3aef416812202","observation_id":"b63f4a0d-f18a-4349-96bd-da3ec29980bb","resolution":{"observed_at":"2026-08-15T19:09:21.454860Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.459600Z","title":"Multivariate Time Series Classification Datasets","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.459600Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:ba7fead0da1a79a9872d6b5d6b13bbcab32386d5d69c8c6c1d240f66e184e720","observation_id":"7c0b7cc9-89aa-425b-9cd0-e484bb884ed2","resolution":{"observed_at":"2026-08-15T19:09:21.459600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.464645Z","title":"Learning a symbolic representation for multivariate time series classification","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.464645Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:550115df1d36bb7ca5702f27eb176b6a1fccf15235cc416b2d0748c9a8d19826","observation_id":"43993202-18b7-4fbb-b27e-5f89a707c22b","resolution":{"observed_at":"2026-08-15T19:09:21.464645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.469221Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.469221Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:578fc3e980258b2308e2496c0e9d4bf0ed3a347c2d22e0369b9423339f8eb55e","observation_id":"ba165b15-b062-4a60-9546-f701495aef5f","resolution":{"observed_at":"2026-08-15T19:09:21.469221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.474429Z","title":"A Bayesian wilcoxon signed-rank test based on the Dirichlet process","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.474429Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:e6af1d1b7fa70e33ad6aad5ccae4503a87b2f7af40b866dd014c0666c509fe99","observation_id":"a0ff2db3-da9e-4a3b-9827-909365ec7a4f","resolution":{"observed_at":"2026-08-15T19:09:21.474429Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.479475Z","title":"Reproducing kernel Hilbert spaces in proba- bility and statistics","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.479475Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:67c67cfbefad94c5c887f457f903ad79cfd3fb038f312bb7302ba5c25a072947","observation_id":"22413f77-2b7a-4ae3-8072-824ef4abee82","resolution":{"observed_at":"2026-08-15T19:09:21.479475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.484727Z","title":"Deep signature transforms","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.484727Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:fbf2da049f86683a6f643ece4e5a721b7cf60d36e2c30a320f2617dea5018c13","observation_id":"193a558a-d310-4fc2-bb04-506a78c3091b","resolution":{"observed_at":"2026-08-15T19:09:21.484727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.03854","last_updated":"2020-11-10T11:48:53Z","snapshot_observed_at":"2026-08-16T19:07:28.031403Z","submitted_at":"2020-11-07T21:44:53Z","title":"Graph Kernels: State-of-the-Art and Future Challenges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.03854","snapshot_observed_at":"2026-08-15T19:09:21.490379Z","title":"Graph kernels: State-of-the-art and future challenges","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.490379Z"},"links":{"cited_paper":"/paper/2011.03854","citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:9a776dce17712b4441c1df3cc464c9192027fe326c1e4d82b8b9313cc0b36026","observation_id":"8a21da43-0404-4c52-817f-a79fa6eeaf70","resolution":{"observed_at":"2026-08-15T19:09:21.490379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.495820Z","title":"Concentration Inequalities: A Nonasymptotic Theory of Independence","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.495820Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:7cb6127c8277d042a36f69345914e5429aa03f927c32b9460762e4368d23a33b","observation_id":"3fbfc40b-97c8-4181-baf3-679cd764671a","resolution":{"observed_at":"2026-08-15T19:09:21.495820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.13478","last_updated":"2021-05-02T16:16:03Z","snapshot_observed_at":"2026-08-12T23:06:05.148534Z","submitted_at":"2021-04-27T21:09:51Z","title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.13478","snapshot_observed_at":"2026-08-15T19:09:21.500464Z","title":"Geometric deep learning: Grids, groups, graphs, geodesics, and gauges.arXiv preprint arXiv:2104.13478, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.500464Z"},"links":{"cited_paper":"/paper/2104.13478","citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:9ce903de546bf0903504318b2952bf56c0b9b06324ab413b591b2004f95b6806","observation_id":"efec0c37-afe5-4519-9f48-66de15a95156","resolution":{"observed_at":"2026-08-15T19:09:21.500464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6203","last_updated":"2014-05-21T16:27:09Z","snapshot_observed_at":"2026-08-14T23:50:42.645895Z","submitted_at":"2013-12-21T04:25:53Z","title":"Spectral Networks and Locally Connected Networks on Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6203","snapshot_observed_at":"2026-08-15T19:09:21.505120Z","title":"Spectral networks and locally connected networks on graphs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.505120Z"},"links":{"cited_paper":"/paper/1312.6203","citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:724fc4ef7d7dbd9839f351331e2556067a0dd3956a40d641e9c52bff1449c0b1","observation_id":"dd4fe880-18f0-4978-9598-39b5c51d4995","resolution":{"observed_at":"2026-08-15T19:09:21.505120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.510052Z","title":"Generating financial markets with signatures","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.510052Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:c199473ef760391e2f8152a4850fa1be0af6497816317a399380411f554069ad","observation_id":"79f9316b-6ee2-446f-a1de-403cf5bd25d3","resolution":{"observed_at":"2026-08-15T19:09:21.510052Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.514429Z","title":"Time series forecasting for healthcare diagnosis and prognostics with the focus on cardiovascular diseases","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.514429Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:30fc9370393879982f81ba1eaf9fa25be58fcfcbbd1eb47208145bb5f566d93b","observation_id":"32342e08-b6e2-4d72-83bc-0af31b33b737","resolution":{"observed_at":"2026-08-15T19:09:21.514429Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.519039Z","title":"Bui, Josiah Yan, and Richard E","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.519039Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:83d4b42b46102b74e6534842ece3dfd63001e8b26889b911ce82f5d79f5de951","observation_id":"cb10b105-cdfc-4912-896d-f68c90b0ae22","resolution":{"observed_at":"2026-08-15T19:09:21.519039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.523468Z","title":"Learning with SGD and random features","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.523468Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:90042eccb82b00ac53892f324dcca81fb6138d531df38830acf56e26e3a31f11","observation_id":"f3274d26-018b-4522-89b2-d47afa8c9941","resolution":{"observed_at":"2026-08-15T19:09:21.523468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.528155Z","title":"Eckart-young","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.528155Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:c910fea6ad1a1f8ed4227ae1b05e3e6a974e16023bcffe4081b565b1613c22c6","observation_id":"bc89e2f9-8667-42ac-8d1e-ca6ec4922aaf","resolution":{"observed_at":"2026-08-15T19:09:21.528155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.533522Z","title":"Weighted signature kernels","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.533522Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:535fdde830d28d564327975ce8fd4ad5df8d743b084f484786a671641878a010","observation_id":"2c5219c6-21c1-4a09-bc54-50c3f53a1335","resolution":{"observed_at":"2026-08-15T19:09:21.533522Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.06583","last_updated":"2024-04-09T19:25:16Z","snapshot_observed_at":"2026-08-16T14:02:16.778133Z","submitted_at":"2024-04-09T19:25:16Z","title":"Lecture notes on rough paths and applications to machine learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.06583","snapshot_observed_at":"2026-08-15T19:09:21.538056Z","title":"Lecture notes on rough paths and applications to machine learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.538056Z"},"links":{"cited_paper":"/paper/2404.06583","citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:e3b367ee517311a799ceaf1447e28abd23fbe733c8942b1eb57226454976d890","observation_id":"29ccc17f-1a6e-45b0-839e-d1fab07ccafa","resolution":{"observed_at":"2026-08-15T19:09:21.538056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.542870Z","title":"Variational multinomial logit Gaussian process","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.542870Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:cfad7d1328df1ef150e8ccc0018e8c9e440b10fee8ee25909a42722b2bc21432","observation_id":"26ee9888-f1a9-4200-a5a6-03dcc84da831","resolution":{"observed_at":"2026-08-15T19:09:21.542870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.547189Z","title":"Orlicz random Fourier features","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.547189Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:00badb296af369329cf8bd45a1757f2f14792d1c6a47cd26d67442525c516480","observation_id":"9c2b2370-747d-4557-99c2-197065ba5d09","resolution":{"observed_at":"2026-08-15T19:09:21.547189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.09443","last_updated":"2021-10-18T16:23:38Z","snapshot_observed_at":"2026-08-16T17:48:24.396120Z","submitted_at":"2021-10-18T16:23:38Z","title":"Beltrami Flow and Neural Diffusion on Graphs","version":1},"cited_work":{"arxiv_id":"2110.09443","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.09443","snapshot_observed_at":"2026-08-15T19:09:23.486227Z","title":"Beltrami Flow and Neural Diffusion on Graphs","venue":"cs.LG","work_id":"d518d6fc-1f30-4e6a-91cf-cfc830210f90","year":2021},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.551489Z"},"links":{"cited_paper":"/paper/2110.09443","citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:888654e4b760a591ad0c58acfd2bc01e098902e3b51cef82306c3466a586deec","observation_id":"2b96ec21-23f6-4b95-b1a2-d052adf010d7","resolution":{"observed_at":"2026-08-15T19:09:23.491920Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.556189Z","title":"Rowbottom, Maria I","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.556189Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:68c7ad55222008dde1dcb6dff3057e74d7e97159f0bc6023d4cae9ab0c984af6","observation_id":"fec890a5-eed4-4683-a383-0b514732bb99","resolution":{"observed_at":"2026-08-15T19:09:21.556189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.560713Z","title":"Re- current neural networks for multivariate time series with missing values","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.560713Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:4cae372a77879318b90087562a7f8e508e6a7aab510df5d894c1d600d2e5bc3f","observation_id":"b6bcf150-f3c8-449d-9b44-005f336ac084","resolution":{"observed_at":"2026-08-15T19:09:21.560713Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.565735Z","title":"Convolutional kernel networks for graph-structured data","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.565735Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:4ce859cfef5d0fbfa039dc07abe0483fe59a2677d13a769f8ecbe3cc879cadf5","observation_id":"7c34cfc6-6e5c-4f78-bdbd-584f4a40609b","resolution":{"observed_at":"2026-08-15T19:09:21.565735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.570697Z","title":"Integration of paths—a faithful representation of paths by non- commutative formal power series","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.570697Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:07681223d2ef685dec603a38a3d61ed9e79c0ff4b576ebf0560853d988e30872","observation_id":"6c974f2f-e074-4941-86c4-82c8756fae08","resolution":{"observed_at":"2026-08-15T19:09:21.570697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.575260Z","title":"On the equivalence between graph isomorphism testing and function approximation with gnns","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.575260Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:e9f5339ab7699c13b1b8b7315d016dcca9d856bca2f5ef205944559bb2860f5c","observation_id":"4dd7cd92-14b5-4cf6-971d-063ee8a9bcd9","resolution":{"observed_at":"2026-08-15T19:09:21.575260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.579542Z","title":"A primer on the signature method in machine learning","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.579542Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:dde79a6375d4e7fc418a582d9fe3c6d11a758ec5019e0c8b1ff70ce94d1fc152","observation_id":"645d5640-166d-441c-92d3-fbd1cbfa9da2","resolution":{"observed_at":"2026-08-15T19:09:21.579542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.584057Z","title":"Persistence Paths and Signature Features in Topological Data Analysis","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.584057Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:f6b012d78adfeb10fcbe227f891a973f2e479ab5c0847decde8ff8d4ce66902f","observation_id":"4085299e-2999-4012-b7c8-021faf799771","resolution":{"observed_at":"2026-08-15T19:09:21.584057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.588264Z","title":"Signature moments to characterize laws of stochastic processes","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.588264Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:fcdedbba5475ae620d0dd52663a08be68fa7b4d32f4ccd80a8bc7d85a48db650","observation_id":"31863ecc-ae74-4bfc-b96a-ffc05f538139","resolution":{"observed_at":"2026-08-15T19:09:21.588264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.593176Z","title":"Learning phrase representations using rnn encoder-decoder for statistical machine translation","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.593176Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:90cf7ac7d6999004344463630e6b0ffde597f0bdbfa7ed5887509110afa1b07a","observation_id":"59767624-3b63-462a-86d7-b5e6119ea63f","resolution":{"observed_at":"2026-08-15T19:09:21.593176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.597555Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.597555Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:eb4065f1e8cd665abf076c2a0e5a54d4438f11bf35018b1d1a5a220413e1deff","observation_id":"c0b193fc-6de0-4697-8d07-d602f87d7b43","resolution":{"observed_at":"2026-08-15T19:09:21.597555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.602622Z","title":"The geometry of random features","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.602622Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:c1c131a691ceeef6d6816e9457a923d8cdafef41f5994c1d9d831a55e08a554b","observation_id":"06a0b66e-5733-4172-bd85-b418abcf4459","resolution":{"observed_at":"2026-08-15T19:09:21.602622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.607025Z","title":"The unreasonable effective- ness of structured random orthogonal embeddings","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.607025Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:09d0f8cf341314f1ea39d7e7271d6b7f30e7ee9fb5f541f19b4011cc4ac646a4","observation_id":"dc8c45c7-6cb7-400a-b766-829884d33069","resolution":{"observed_at":"2026-08-15T19:09:21.607025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.611339Z","title":"Recycling randomness with structure for sublinear time kernel expansions","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.611339Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:08dae1739873f728bed747ab01718091aad45a392c2baed355f3976d50f66032","observation_id":"be76e4f2-8514-409a-9e16-c4cd97c7129d","resolution":{"observed_at":"2026-08-15T19:09:21.611339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.615512Z","title":"Hybrid random features","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.615512Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:3264f4a4738952bb8a9c960748c8f1d3b9574eae79246bbf67ea16eca124d604","observation_id":"e4cbc2ad-6851-4825-b947-694198681500","resolution":{"observed_at":"2026-08-15T19:09:21.615512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.620448Z","title":"Tensor networks for dimensionality reduction and large-scale optimization: Part 1 low-rank tensor decompositions","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.620448Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:ea2f3e90162a7540562b26f0d71f541852cb971844b4b838c49cb35432c711b9","observation_id":"92e7fe55-3026-4d06-b78e-393630ebd9f4","resolution":{"observed_at":"2026-08-15T19:09:21.620448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.626008Z","title":"Sk-tree: a systematic malware detection algorithm on streaming trees via the signature kernel","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.626008Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:77fac67a92facd7bf385b0a7cf129fcff9298e3ee480293445b82bc6109ef9d1","observation_id":"61df9725-057f-4781-8234-0ddd69d74ec9","resolution":{"observed_at":"2026-08-15T19:09:21.626008Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.631485Z","title":"On the expressive power of deep learning: A tensor analysis","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.631485Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:c731ee061a85165b76a28762c2f39544cf0dedd66f9e4a0705bcb3b7f27934d2","observation_id":"170c1315-155e-4dde-add8-761b1226952f","resolution":{"observed_at":"2026-08-15T19:09:21.631485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.635895Z","title":"Inference suboptimality in variational autoencoders","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.635895Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:c942439a32f05df18f8280ce19dc02ab8b98141a71865e3add20ceffc0b264e0","observation_id":"a8b825b0-d95d-4dae-9fbf-d56ad6423f53","resolution":{"observed_at":"2026-08-15T19:09:21.635895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.641605Z","title":"Discrete-time signatures and randomness in reservoir computing","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.641605Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:19de869c8776716fc1d13413ea6183df9cb6a9ed55867a3524221ec443dd95b3","observation_id":"cf83ba55-986e-474b-a3b7-62638a55526b","resolution":{"observed_at":"2026-08-15T19:09:21.641605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.646161Z","title":"On the mathematical foundations of learning","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.646161Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:d8d97d2af238b93d910a254d265e01da251615c1cbb94caa440bcf84f3d25285","observation_id":"41483eab-fc80-4a97-aa93-9c8b6c9f687e","resolution":{"observed_at":"2026-08-15T19:09:21.646161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.650768Z","title":"Bonilla, Pietro Michiardi, and Maurizio Filippone","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.650768Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:23d1899ae0758e925153827bf658c9ba71d6286c0f3fdcbd91523f78f23d0375","observation_id":"3bdd840c-ec40-4122-8ada-0d6a3b65617d","resolution":{"observed_at":"2026-08-15T19:09:21.650768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.654973Z","title":"Fast global alignment kernels","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.654973Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:d827b39ed6b31a87a03b0a6ab75e35f12e72195400fdb398a2a63fdb7cd49f31","observation_id":"f816df5c-9253-4ea4-8e4a-3303b6335f98","resolution":{"observed_at":"2026-08-15T19:09:21.654973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1101.0673","last_updated":"2011-01-04T08:44:14Z","snapshot_observed_at":"2026-08-15T17:55:04.020040Z","submitted_at":"2011-01-04T08:44:14Z","title":"Autoregressive Kernels For Time Series","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1101.0673","snapshot_observed_at":"2026-08-15T19:09:21.663655Z","title":"Autoregressive kernels for time series","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.663655Z"},"links":{"cited_paper":"/paper/1101.0673","citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:f31098e9f69131449e9cee1ce75b916cbd658623fe14a07881f3e624172d41e1","observation_id":"1e9415c6-5103-4d01-b10c-eb24138b2e75","resolution":{"observed_at":"2026-08-15T19:09:21.663655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.668050Z","title":"Deep Gaussian processes","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.668050Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:bdcc13ff5e53c7aee2054e841d0d7819e948c81f8ca08a19b6495cf26864f7ee","observation_id":"26dd9857-4128-44c0-b2f7-f6a813063e2f","resolution":{"observed_at":"2026-08-15T19:09:21.668050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.673151Z","title":"Gaussian quadrature for kernel fea- tures","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.673151Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:0e023bd3d63650f571a9d45d06de70119e7962c2cc015d61b5b77170ceefc13b","observation_id":"1f655164-56fa-4e9c-a825-42172e3de466","resolution":{"observed_at":"2026-08-15T19:09:21.673151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.677819Z","title":"The UCR time series archive","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.677819Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:cc483821a839f14c4d3f926a2f9a1445dbc132459a236bb198d8fdee483df8fc","observation_id":"2daa7b1b-9493-4fec-8492-b6a7e30014dc","resolution":{"observed_at":"2026-08-15T19:09:21.677819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.682548Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.682548Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:ae9090e98fc73213b49a5d46421d109fff5945dc3dc33944f9f725b31cdc1f45","observation_id":"338981cf-7c46-4e8d-8025-7e79f8127fda","resolution":{"observed_at":"2026-08-15T19:09:21.682548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.687076Z","title":"Convolutional neural networks on graphs with fast localized spectral filtering","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.687076Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:81461e1f10c889b6bdfb5d5d897e878d9ae0458a18bc04ddabd50612a7aba3ec","observation_id":"7961da57-7b86-412b-b6f4-602aaed5ebd9","resolution":{"observed_at":"2026-08-15T19:09:21.687076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.691491Z","title":"Statistical comparisons of classifiers over multiple data sets","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.691491Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:1bfc707d56108ee2a200baa224e3c5c7e1b0fdcc3a79094eb2e97f293cfdbbc1","observation_id":"090f6f4f-017f-457c-9b59-65a59b0fab8a","resolution":{"observed_at":"2026-08-15T19:09:21.691491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.695992Z","title":"Group representations in probability and statistics","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.695992Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:3a69f33c936368eb119c9de0df094ab3b7a0f8cb7f5c134bcb91d46e821c8081","observation_id":"b0c95a98-6cee-419f-886a-c4d6d973723a","resolution":{"observed_at":"2026-08-15T19:09:21.695992Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.700426Z","title":"Time-warping invariants of multidimensional time series","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.700426Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:5dd23ac0e4993389d677b12e11c7e7b3089b8872fab0ebbfce356508170e7093","observation_id":"7b229f50-6eeb-427a-8d30-3a748e7ae55e","resolution":{"observed_at":"2026-08-15T19:09:21.700426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.704931Z","title":"Generalized iterated-sums sig- natures","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.704931Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:cccd1c21b9697572c43a8fb576d8123d2f24a4ffa6e955b63e7ffeba6eacad07","observation_id":"29d4996c-c56b-4f4f-8f06-9cda7714f01b","resolution":{"observed_at":"2026-08-15T19:09:21.704931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.709914Z","title":"Probabilistic recurrent state-space models","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.709914Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:a0e15ffc330d623d54b3f1c91d7e06857abf6c71a9e6915cf6382e28688126b7","observation_id":"11e2b59e-6704-4cf7-9a7c-4fc88cbdb0fe","resolution":{"observed_at":"2026-08-15T19:09:21.709914Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.715221Z","title":"Probabilistic recurrent state-space models","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.715221Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:6afc6c9cf24f88119d42aaa99c724b9acbcaec8c762f2f158154e77f52431fa5","observation_id":"4c14095e-bdef-4a20-8e20-8a64d07aa8d3","resolution":{"observed_at":"2026-08-15T19:09:21.715221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.719736Z","title":"Incorporating Nesterov Momentum into Adam","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.719736Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:bd23aba4b8be905c4a7070ceace350a9b24f5e21d4d0566ee5a72c021378220a","observation_id":"4c6442f0-db71-4b98-998b-7aaafba43249","resolution":{"observed_at":"2026-08-15T19:09:21.719736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.724598Z","title":"UCI machine learning repository , 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.724598Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:39284400f576dc13fb248c062a57b654af25331a04e6123158c0faf685b4715f","observation_id":"a664770e-b3ea-4a41-ab54-93d208d35b75","resolution":{"observed_at":"2026-08-15T19:09:21.724598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.729514Z","title":"The sizes of compact subsets of Hilbert space and continuity of Gaus- sian processes","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.729514Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:0d6c984bc0258a7994ba135c6315989e1b6aba35534a99a1146bcd428e5910e5","observation_id":"539a9dcb-4b20-4224-acc8-62041ce96e83","resolution":{"observed_at":"2026-08-15T19:09:21.729514Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.734182Z","title":"Cambridge University Press, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.734182Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:ced78142296cc645f80aa6c9136e39856c3102a638d6ce4c7ccf6d2e498c86b6","observation_id":"bbc218d5-1209-4321-a232-12d56ad007c5","resolution":{"observed_at":"2026-08-15T19:09:21.734182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.738564Z","title":"Approximate Bayesian computation with path signatures","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.738564Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:a1a00f2a63081df41af504e8754ec005bf393958f7e578ba164dba0a76849854","observation_id":"5ca48238-eb72-4bc5-b9af-7fe7bb955edf","resolution":{"observed_at":"2026-08-15T19:09:21.738564Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.743620Z","title":"Cannon, and Sebastian M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.743620Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:df024c62cc798138d4c4d97707271c6c2d2e49ce5bc2e000d0a4f95dd2da23c1","observation_id":"72f16d8e-c540-4383-91c8-caffc65bfde0","resolution":{"observed_at":"2026-08-15T19:09:21.743620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.749629Z","title":"Identifi- cation of Gaussian process state space models.Advances in Neural Information Processing Systems (NeurIPS), 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.749629Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:2be3c3d978ebc2ca8d271853c51155b706e1837132b89eb7ac90c9bcc272be7f","observation_id":"ff67efcf-0165-415e-bf84-eace74d857a9","resolution":{"observed_at":"2026-08-15T19:09:21.749629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.754616Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.754616Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:951ec83d54848d45500978392cf2043b964b74b8768085d927efa4be95ad2e98","observation_id":"a87a03aa-941b-4d6c-af03-024ee9523e64","resolution":{"observed_at":"2026-08-15T19:09:21.754616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.759069Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.759069Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:a8c6fc2e400e588baa2a8902e22ef91d91ed9e4ce9ac203ebbf85e36f680705e","observation_id":"b4ef4fd1-9bef-48dc-a3a7-64f81b4238d2","resolution":{"observed_at":"2026-08-15T19:09:21.759069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.763715Z","title":"Random feature mapping with signed circulant matrix projection","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.763715Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:b5e194919d8f0a1f5ea304d61182347173025e646fc897637cbe6e8ab92b05fe","observation_id":"4ede08ae-df71-4bdf-9ec6-33bc8208b203","resolution":{"observed_at":"2026-08-15T19:09:21.763715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.768298Z","title":"Framing RNN as a kernel method: A neural ODE approach","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.768298Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:6a8173c129c7439655b2d6709d0c1b4bee0026e6161ba4f3b6aa6ba0af629641","observation_id":"3d30e7b2-58a5-4826-9654-416edb48902b","resolution":{"observed_at":"2026-08-15T19:09:21.768298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.772661Z","title":"GP-VAE: Deep probabilistic time series imputation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.772661Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:7cd53900cf1b720e06f1b283af277c5ab9d625376caa986592adfceab98528d5","observation_id":"76b86dff-c0e1-4fa3-a943-8a8ca98b8b58","resolution":{"observed_at":"2026-08-15T19:09:21.772661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.777694Z","title":"Variational Gaussian process state-space models","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.777694Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:d277da769b3fb9b2cabf8daa36f95cd07fa0f5f835bdf1283c2629f5a2039178","observation_id":"85b832d8-0bc6-446a-b959-3d4f3b5a5c34","resolution":{"observed_at":"2026-08-15T19:09:21.777694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.782256Z","title":"Bayesian inference and learning in Gaussian process state-space models with particle MCMC","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.782256Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:bdd4f1f3b66d383b98eadbd35d7e46027e0003b9d3cd9bc52ffa9e7efd754008","observation_id":"4ffdfdac-4ec4-437e-8495-3eab0bbd17d3","resolution":{"observed_at":"2026-08-15T19:09:21.782256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.786861Z","title":"Bayesian inference and learning in Gaussian process state-space models with particle MCMC","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.786861Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:1260ed73d91671f38ba0f90c2c92155d948422eb4140be0c3e2034fa095296ab","observation_id":"7cafb804-5e78-4e75-872f-d925b2e3374c","resolution":{"observed_at":"2026-08-15T19:09:21.786861Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.792601Z","title":"A course on rough paths","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.792601Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:8677c6b09ca4d567945331981b1f527f431e5bc05a6cd2eae1a80612930fc725","observation_id":"0f74deab-2c26-444d-8ce0-2698d88a274e","resolution":{"observed_at":"2026-08-15T19:09:21.792601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.797254Z","title":"Sriperumbudur","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.797254Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:887f3affc12f9e9f3d6edbcf3180f4453a9e6cd5bed5783e82dbddf340969e2f","observation_id":"7d708d99-9a22-4e7a-9f3a-b01b9e31365a","resolution":{"observed_at":"2026-08-15T19:09:21.797254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.801900Z","title":"Improving the Gaussian process sparse spectrum approx- imation by representing uncertainty in frequency inputs","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.801900Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:eb8bdbb5eca0bf1e35d469221ace81e9738b7ca1fde44416d16fb48883f76e88","observation_id":"d41abff9-f302-4a5f-a998-f1ae810f5c07","resolution":{"observed_at":"2026-08-15T19:09:21.801900Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.20405","last_updated":"2024-07-29T20:17:01Z","snapshot_observed_at":"2026-08-16T14:59:26.238630Z","submitted_at":"2024-07-29T20:17:01Z","title":"Rank and symmetries of signature tensors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.20405","snapshot_observed_at":"2026-08-15T19:09:21.806660Z","title":"Rank and symmetries of signature tensors","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.806660Z"},"links":{"cited_paper":"/paper/2407.20405","citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:3ea7f658d202b88ce5c4761e49608bedacffce216ed5aa61655c5270a9f9edda","observation_id":"698e5606-9315-46bd-a260-9546291332ce","resolution":{"observed_at":"2026-08-15T19:09:21.806660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.811508Z","title":"GPytorch: Blackbox matrix-matrix Gaussian process inference with GPU acceleration","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.811508Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:08cd9716b1e93fee5e760967653410c1b44c3064413215e72e2f603b436376ce","observation_id":"4f4868f5-f264-481e-a206-45e52a94a286","resolution":{"observed_at":"2026-08-15T19:09:21.811508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.816435Z","title":"Probabilistic forecasting with spline quantile function rnns","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.816435Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:5cdce4a67d2d5739e90e54fb2fa14a421d6b220caab9eaa27deffe68f0c5dec4","observation_id":"f86a304d-97e7-48ee-869b-8858e43281f1","resolution":{"observed_at":"2026-08-15T19:09:21.816435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.821755Z","title":"Principe de moindre action, propagation de la chaleur et estimees sous elliptiques sur certains groupes nilpotents","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.821755Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:352d72f260d6d0f14496e1b0220b7c9b60a04dd1bd1ceccc525b7358c28a025a","observation_id":"7a8789f0-063d-437d-bc38-56684354048e","resolution":{"observed_at":"2026-08-15T19:09:21.821755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.826435Z","title":"Bayesian non-parametrics and the probabilistic approach to mod- elling","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.826435Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:fb39a3f1e1139ad1ffeffedd32dfea8c9db48b6ee11a0eeeff3e17480615882b","observation_id":"5968b481-dbf1-4c35-9c4e-0b4560d3c633","resolution":{"observed_at":"2026-08-15T19:09:21.826435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.831564Z","title":"Neural message passing for quantum chemistry","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.831564Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:be28696e7597c19c04a6922dcf4ab3eb820b2770734ed704800eb544544debe0","observation_id":"e597dd52-7242-4926-9d43-c55b0c0d7504","resolution":{"observed_at":"2026-08-15T19:09:21.831564Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.836199Z","title":"Signatures, lipschitz-free spaces, and paths of persistence diagrams","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.836199Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:3d8047e94735cec8fc6dc9906005f5209904bbb54a38718c27d340e4f0e9f59f","observation_id":"17b0bdd1-ca86-4e20-a39e-21d3a3d42456","resolution":{"observed_at":"2026-08-15T19:09:21.836199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.840678Z","title":"Strictly proper scoring rules, prediction, and estimation","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.840678Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:23a82e924a667fc828851094705179585ace9a459fac3c988dca693b3fc732a2","observation_id":"32821360-2984-446f-9de7-6992ecbd9d93","resolution":{"observed_at":"2026-08-15T19:09:21.840678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.845353Z","title":"Webb, Rob Hyndman, and Pablo Montero-Manso","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.845353Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:49b4dfeb9e6c2b13204676a6956f72ccfdeaa43ef6839f71ccfed20f8b222351","observation_id":"2d3f57c3-23aa-4ebd-86b0-84d8b7134b16","resolution":{"observed_at":"2026-08-15T19:09:21.845353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.850942Z","title":"Components of a new research resource for complex physiologic signals","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.850942Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:a12298bb86a9c4c2e4d57e918cb39aeeda19362c702c44139081242ea76b9f0b","observation_id":"432d6bc0-3e3b-4168-a9ec-0616b681fd8a","resolution":{"observed_at":"2026-08-15T19:09:21.850942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:09:21.856483Z","title":"Concentration inequalities for poly- nomials inα-sub-exponential random variables","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.856483Z"},"links":{"citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:f4aa14486fa7e9ab05229c433bcafe9e1bf7285e4545e2caf51069e73f7acdf7","observation_id":"cec2730f-ed3a-4ba7-a157-2e83f1cb0397","resolution":{"observed_at":"2026-08-15T19:09:21.856483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1308.0371","last_updated":"2013-12-01T17:17:06Z","snapshot_observed_at":"2026-08-15T00:08:05.779531Z","submitted_at":"2013-08-01T22:29:41Z","title":"Sparse arrays of signatures for online character recognition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1308.0371","snapshot_observed_at":"2026-08-15T19:09:21.861299Z","title":"Sparse arrays of signatures for online character recognition","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures","version":2},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-08-15T19:09:21.861299Z"},"links":{"cited_paper":"/paper/1308.0371","citing_paper":"/paper/2506.17634"},"observation_digest":"sha256:2885e7b7a769f0fade457cbe4e583636cb596f9604a1f3f8c8f22b73502c380b","observation_id":"84b25721-f88c-497f-8067-12529d003f30","resolution":{"observed_at":"2026-08-15T19:09:21.861299Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.17634","last_updated":"2025-06-24T20:58:09Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-17T16:57:27.348531Z","submitted_at":"2025-06-21T08:36:34Z","title":"Scalable Machine Learning Algorithms using Path Signatures"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":99,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":298},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 100 of 298 outbound references and 0 inbound Pith citation observations for arXiv:2506.17634."}