{"as_of":"2026-08-17T07:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a99de4823410c62b0e5df29c6f12368031c4f978a5920155d091119b79a3f75d","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-17T07:23:14.939247Z","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:8f6c15cd59d07c4da5591aec5f29d022cc70024a69d4d3ecfe66f1b344c4269c","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-17T07:23:14.939247Z","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:1d03e59661337a99afde86c232561432a942c6854de66b96bb728e9b12fd8f64","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-17T07:23:14.939247Z","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:4c12b942397136e8525612a17ffccbfcb68fb29ccc0b7d5797ef99cf0a424ea2","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-17T07:23:14.939247Z","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:113b91a9fdd5f1accc113eba86362a0d788fcac1ca1d7b8c076cf8d3511246c6","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-17T07:23:14.939247Z","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:752c2c18da5bb470d37ea330e156f76d04a8d87d2caaed367a824180bbea8ec3","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-17T07:23:14.939247Z","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:2e89741ef6532f46086f55e973698c48d9191ddc384c1e5f68411e63fd16392e","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-17T07:23:14.939247Z","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:28f095bc6aed13baaa17ffd36681f7f8e3bbf58604b0f74aa9d679656be5682d","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-17T07:23:14.939247Z","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:44f2295fe2be32b1a1696fccde5ca8a6e6bcfaf9453270a7982953115116d2b7","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-17T07:23:14.939247Z","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:71c0c03ee3f76cef9c26edd016fa51dfcecd86575bb2be739033d636bb774c1c","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-17T07:23:14.939247Z","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:4da8a62b59a9861df5c846f41a57eb6db0ac3762ff2f31c50fd6889efa92b990","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-17T07:23:14.939247Z","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:cda54887271be0b06e017e63c1a73edcebdde11870b042dda15d8e3c460b66b3","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-17T07:23:14.939247Z","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:5f5bc74e7126b72318a3de0075ca7e108a35def7c515d9b86eccd390567d518e","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-17T07:23:14.939247Z","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:07cb613b0cf10d2186706c8f7e2b1e054edd0e3d2eadea14762de31c7827f44b","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-17T07:23:14.939247Z","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:f503d188a044c85c6007118cc7d4ba795e2231ae1d40c78236b29e180688c622","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-17T07:23:14.939247Z","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:abd25f7e85236c7bc72565791c8f3afa41aa104d5964b5d35b30363fe203576d","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-17T07:23:14.939247Z","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:49e60346ef9f6b50c8979b4379107e0ebdb60fe02bf92fae90419a0357a403f7","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-17T07:23:14.939247Z","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:b0a992ec03bf115be191cb9b36d36ada52bfbb5ee65b532185b297d4dcfc96fd","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-17T07:23:14.939247Z","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:c2f9b523656e612fa74e5fac4357e7b3931a3225be0027a718ec8a808b065bbb","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-17T07:23:14.939247Z","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:00e140638ba2934872b508c541ee4700e6b9a0e73f3161f6bff056852bdf98c8","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-17T07:23:14.939247Z","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:454190dbedba3158aa80ede19dc6ea11631268c5287ababc03337d53a9d2d755","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-17T07:23:14.939247Z","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:bee912edbaa52a06f68fffe05c898ae4460cf03f92dd9692bd215ddab79ba84d","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-17T07:23:14.939247Z","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:1bd6230a6ee24e2ddff931573990c6f0e1bfca2f903b66cc5e12bb5d028e90dd","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-17T07:23:14.939247Z","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:e670fd5ebcdb0ba10e940328f8760479ef71ae3cd16d5d5af3de7dba46b44fff","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-17T07:23:14.939247Z","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:f185ad59d0976a0970467b2abf176e1b111fa786123c19d267298f333e3dc3a5","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-17T07:23:14.939247Z","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:bb36069d89a753b8e607e938b260d80825ce3104ba1152fad6b32bbce9aed9f3","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-17T07:23:14.939247Z","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:5bd28b7340079b2160b461ac71ddd0c49e97b48090d931fd1e2f991cf44a56c1","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-17T07:23:14.939247Z","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:849fe174eda9f89a686f093d0d804b1c0b77e8a206a53b68fcb954b7c0a2605e","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-17T07:23:14.939247Z","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:ab837e56efdf4d2ad2a8e1143ddc2fc0553f841a8dc067e9d9ad28c5dcd8791c","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-17T07:23:14.939247Z","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:a7709638c360d84df34aa65f7399fbad6bd2acb7d7807ccda04dd2d9abfd1bee","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-17T07:23:14.939247Z","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:b65d13e3f6ffae8e631c1359b6879fdb71e2e1660bc48bcc62b3fd04932d1bac","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-17T07:23:14.939247Z","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:75b10ca8b8235eace90f0a8954dbc7aaa58672c385220bec722d0b518810093c","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-17T07:23:14.939247Z","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:b587b937f01927ba18d5ac7fd05778abd95dccf50ef36c3ad50ac490bb83442c","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-17T07:23:14.939247Z","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:61d94cfe9f7c4e83b86e4cee91cc9055d8e9e11ad77b4fe0d1be3dd0a6852128","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-17T07:23:14.939247Z","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:e368678ade402176beb641e796f4d04a300d8e30e5bf2ecb652816fac2a5119a","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-17T07:23:14.939247Z","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:6ad72f158633e683077f6152dfcb9ffdd69d15f3b4b0ff63c781ad145e624698","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-17T07:23:14.939247Z","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:98512eec954efea2ee6f84e9218478513294ee8fe0b265147da3d44df4b1d535","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-17T07:23:14.939247Z","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:0bfbc9bd71418fd059dd95616caa415f7e8c33921d82df0e7221beeff4717cea","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-17T07:23:14.939247Z","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:b63db4b3007ae6a1ad36ab4bcb363cc622fc2b64389b7a54db4eddf462bc6616","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-17T07:23:14.939247Z","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:67c291f9b3f36d865504c73922fc6a98d17c45e614a90d7663acb7d7616b3b6d","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-17T07:23:14.939247Z","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:c65b90fc95a56f5e73ce8e4d898d06e16bc454409ef8292543fb1f164498d47b","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-17T07:23:14.939247Z","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:0245d4900c4fe5d74b293d6490cbc9f88e4896a4393262f29afbabfb6b755302","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-17T07:23:14.939247Z","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:04dce4378cbe0803335d423f897db4002a973b6e4d0c2d58c4893f89e95a7481","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-17T07:23:14.939247Z","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:079d0e1e4e4015ec4d6f7807a904d58f3ec8e1de517417dadd4cfa091ef7d729","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-17T07:23:14.939247Z","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:ee58feb672d71f64c4c2746250da57b5181f89507fd9754654437f8c6a765685","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-17T07:23:14.939247Z","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:5d4fd7a1f213dc487785536a0942176728ff81d7c6c836a8d0f85fd56aabc8aa","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-17T07:23:14.939247Z","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:cd203495858ff5c1940307d0e93dc0d193b93714bd763211b63f4c0dc7ae0153","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-17T07:23:14.939247Z","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:c0e7382b77e99c28d41d1a343ef14165db05190f2d034fc26e35e9f4365056dd","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-17T07:23:14.939247Z","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:1906ddb94f104340c61c35432eb868f093aa3879fff1c4557137c89ea1fdcfa9","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-17T07:23:14.939247Z","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:853d931f568e6cd424a46bcdf6b2050eccbd24a726361dddddac501795670a00","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-17T07:23:14.939247Z","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:14810bf588757b3c30ec760b6b90f0fb379080d3fd76406b0c2541d61661efdb","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-17T07:23:14.939247Z","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:9fe3d5496c14f5a5b910ea47838df4bfec5794d18882c5ddaf4cacb68c5c5f9c","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-17T07:23:14.939247Z","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:abb45b787d90e7422e18956b21e892bb82791d11430f00a41ac0e3d82d9c2068","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-17T07:23:14.939247Z","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:1d4d25c7f66695bb97181f81821919949f84d624f715a5bc621dabed3b7beeaf","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-17T07:23:14.939247Z","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:01f574bc267cd807f6bfc87c367e0763c44fb86fd9e4a768ca5b7f242843cbc1","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-17T07:23:14.939247Z","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:5c6d21743cecda93f7d51d8a8cae1534cb24008904f2d2b85e47bced12799107","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-17T07:23:14.939247Z","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:9f5f48fd97d718abee057a7e042ca2d683978ca3f7bf7f1b3485526f702ad9af","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-17T07:23:14.939247Z","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:5d43db552c101d01b884fbd419f075af57218d9e7ea44506cef1d8fdd763cffc","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-17T07:23:14.939247Z","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:3c0ceaeccd11e10975eac3966320c521f2024887e4481dec9f900510cd4b664d","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-17T07:23:14.939247Z","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:1e825f63087ea3e6e26ca3111e5294b4d650519277ec7d0fcc62c939e0ef2939","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-17T07:23:14.939247Z","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:e5c0bd72b0a79d492ef78dd1316fd6aa460c4b99e64e4fe149581760a0871a3e","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-17T07:23:14.939247Z","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:c21a63618f375eeadb34e828e8e72895f60cc3e27e4d79daa15aa6e5f3dfdadb","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-17T07:23:14.939247Z","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:63d76cafad58c6682ade63fcf227d37a83a6be04f246769250fd60deb5244b58","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-17T07:23:14.939247Z","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:c49f7e5c9229188e47c7cbb25f6c3431b0ef4ca9009766d50c13714dfcb6a3bd","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-17T07:23:14.939247Z","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:705de10257ba9b9595fdfffbfe6a3b4fed8a7c80e7a50d370e18c788570128b1","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-17T07:23:14.939247Z","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:afadc6e4fdf2420983631c1b47c341afbdb61a033308494fc10a2d7dbbdea0f3","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-17T07:23:14.939247Z","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:625a9d342ba5dc9d5e56de8567460960397c567b375aaaa4cd1ddf5a18ce8fd3","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-17T07:23:14.939247Z","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:41cfa8e49325d28027d81658f108cdcf723ebc0607edbbc5ba08230632c4dba5","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-17T07:23:14.939247Z","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:4a6afd944e88897df26922fdd504df5f0d50c59f7a4b18d134654a3ab3c1df70","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-17T07:23:14.939247Z","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:26453a45e237241b34c66ecca7c52c5e0a71666306fce09b85710f03a07c453b","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-17T07:23:14.939247Z","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:eacd4b8f1145d0a1bef74f989cb8297f6024afe46c1caa4014a0dc1ab15e106d","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-17T07:23:14.939247Z","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:34932b1f47290ae5cf898ea111028f77bcebfe9a8fd5f71103691d4711cea67d","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-17T07:23:14.939247Z","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:539f30391d30773ade04ced8c913e8798f5f7bbb0820f8be8d47c029d29c7652","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-17T07:23:14.939247Z","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:ee46bd6f3153ee3249ca4c91c4a7454b5f62a14753a4e3a31b37c6522f40e0ca","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-17T07:23:14.939247Z","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:3b01e6dfb7221e484421c8e8df4a2ff87efff3480a49f9f9d744a7ee08cb9e6c","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-17T07:23:14.939247Z","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:bcc6f7b425ed49480f04c6fdfdbe7e3e7f3d1b48b1a210b2802ddf65121408b6","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-17T07:23:14.939247Z","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:85037f52c8337305684a2f126883b1137fe67579b83840324d6e0227c36045bd","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-17T07:23:14.939247Z","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:6a925152ff99058440defc12fc63e2c7ffccad7dbaf7269262ce5b799cb2ec94","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-17T07:23:14.939247Z","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:29e50cd0ee62a308cb239de4287015befa4f74ef54e822ee07dd74ad4f96c138","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-17T07:23:14.939247Z","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:b96e1bf6b29d0c29bed35368706ae818090b945df4ee129387ffcd551ea4da93","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-17T07:23:14.939247Z","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:d42586d544728d61d3fc77fc92aaabb32b72fca2ce0b727e56a1d29f60869568","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-17T07:23:14.939247Z","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:9fac3f5c8909b19672fec2ecca44d847b191f101d57469571be9c9ca03a331f6","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-17T07:23:14.939247Z","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:d7bf490e38a899022fa03948976dfe7f9426f8b2593e04ef0690883c2d5c79fa","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-17T07:23:14.939247Z","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:81cc8adf1405b3bfa590274aa565d13c04bb9a57e8925b1cb550e9f333dad12e","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-17T07:23:14.939247Z","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:13ad4c671044430eb5dbc7fb1f3622bdab2e1dc22cb5652d8fe4714445911be1","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-17T07:23:14.939247Z","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:9f0bbd6da9ebea4a03deddae89745bfff3bf45c24a59fa83ce8ffb51d4fd95c3","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-17T07:23:14.939247Z","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:536d5c6cf4e78468795c07f4b766753168fd49bb7af9717950b2db73d458ec5a","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-17T07:23:14.939247Z","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:d70b343e9140edf09026779178bdf65506b169acf7a998ef16624cbd8a644d4a","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-17T07:23:14.939247Z","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:3690e7f49db20df21b0200fd60c2bd0b00ce0f5a7069221c2f9a197deb3d8972","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-17T07:23:14.939247Z","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:dc27b41be4467c94c2c64fc4e3649b65644aaee328bbc011e9fb19c68d8d57d1","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-17T07:23:14.939247Z","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:c7fe02e18259f46cf375e565f20aa0b8707f439014215681d91890c54c49bcf3","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-17T07:23:14.939247Z","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:c29219c878ad195a190ccf6c11161e255695e59d151345624e48d4ba838d8cff","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-17T07:23:14.939247Z","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:30c9832eb186c3bd6a4381add9480b779fa5e6e042c1211af15737469bd37679","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-17T07:23:14.939247Z","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:5c87e9a9a112df51b3b3dccfaa9c5f12d103d31bdeca572ec91a86372f124ffe","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-17T07:23:14.939247Z","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:8ffb5159092619788418bf40b72e4ffb2007fb896d48d86c7bea9f8733073884","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-17T07:23:14.939247Z","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:21f0234313108e17c2a8ad6fc00a0741df745cfe18aa412c14aafca4561ca656","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-17T07:23:14.939247Z","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:9eb46e497e5519e6191e83e0e4b558cde9683b2a35142664134a8fdc8727a5c2","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-17T07:23:14.939247Z","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:4e484640296ca6322facb2a1a449974905ee717b3a5661340d837ef8c9be80f1","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-17T07:23:14.939247Z","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:1cef216e61e2798f82aab070ce167c710895361247da4f515da13f3f1e9b5184","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-17T07:23:14.939247Z","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:897474122cac0bc2ef75a32b7e8468a4698f255304b0814d1db312338ce29bcc","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-17T07:23:14.939247Z","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:737680ff0d0822396bbe66fbb1c8ccdab260a38c2c285f2553b39d6a20d8bccc","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-17T07:23:14.939247Z","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 17 August 2026, this Paper Citation Record lists 100 of 298 outbound references and 0 inbound Pith citation observations for arXiv:2506.17634."}