{"as_of":"2026-08-10T04:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:46c40e8661dd6f162c2ebbc03f1a19060b0cfb2d26ee471ca1ee4e7bf8b97f3d","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T01:09:04.344640Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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.11997/citation-record","integrity":"/paper/2506.11997/integrity","json":"/paper/2506.11997/citation-record.json","paper":"/paper/2506.11997"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:08.491063Z","title":null,"venue":null,"work_id":"191f8cea-19f3-45c7-9298-c87cc55a428c","year":2024},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:03.983287Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:0cf98b2eb155fc87101ee03b1f5d7b6abf5f7706b8da9cd7b2913fecf95fbaf0","observation_id":"3ca27037-a743-481e-ad9a-9d9b5652aa56","resolution":{"observed_at":"2026-08-07T01:09:08.615057Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:10.064486Z","title":null,"venue":null,"work_id":"e6773c18-c1a2-4d47-8dbe-7967232b7b20","year":2009},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:00.455216Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:737b0be43c420525e1964505b3e2377b354f49edf1e5537e401731543cd1101c","observation_id":"36103575-c9f7-4fbc-a483-25b95fd03494","resolution":{"observed_at":"2026-08-07T01:09:10.164397Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"stable/2371086","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:05.671917Z","title":null,"venue":null,"work_id":"f426b0ba-ad13-4533-8b34-adc263f5c8ac","year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:03.010795Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:484f66c3accbd6cd9d8990bb6662af5282cdba63149f11c3122033c0cf6eabbf","observation_id":"76b92aa9-eab2-4b5b-9b4e-8ce6492e25b1","resolution":{"observed_at":"2026-08-07T01:09:05.785970Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:09.860117Z","title":null,"venue":null,"work_id":"0083b107-612a-4c95-9c2f-a80c88bc53d9","year":1999},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:00.710874Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:f0430bad40e5136268d671bf89e65c886e96776a57ef0fc73167aed5c85ce1d6","observation_id":"a47738a5-e0af-4320-951f-9f2a66cc499d","resolution":{"observed_at":"2026-08-07T01:09:09.959381Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:08.753872Z","title":null,"venue":null,"work_id":"b198141b-ee07-400d-8e0a-8507b6bf9159","year":2024},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:03.813571Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:f9043c7ff93d4d7666e5fbb5b2eb8e854e06db7da4813bc08d23b39673ff7e4d","observation_id":"98ef6a1a-298c-4e6d-84a3-ad5eb9e7bb3d","resolution":{"observed_at":"2026-08-07T01:09:08.885818Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.00752","last_updated":"2024-05-31T17:55:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-01T18:01:34Z","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.00752","snapshot_observed_at":"2026-08-07T01:09:01.022054Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:01.022054Z"},"links":{"cited_paper":"/paper/2312.00752","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:2bd2e9afafdbf452f4b4fa17ec23306a6157af2a73625ccb9acdd6e54c0566a9","observation_id":"6b093688-fab2-46d2-b192-f38524e131d0","resolution":{"observed_at":"2026-08-07T01:09:01.022054Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:09.669209Z","title":null,"venue":null,"work_id":"6f8ab113-0b51-45d4-aa5d-8034decd061d","year":2024},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:01.445991Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:eee8dc5be3c19fbb25df4f1cf004943fb54b84f499364bba475637842c07a468","observation_id":"39a0afcd-26f6-469d-aa78-511d4bb31f08","resolution":{"observed_at":"2026-08-07T01:09:09.746682Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T01:09:01.308758Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:01.308758Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:d7d60d825edc1dfe3dfad0ffe4832a93ed4dbf64c38e8c2051830aae827ab0a2","observation_id":"0e752aa9-c5ca-46ad-af10-278628218e82","resolution":{"observed_at":"2026-08-07T01:09:01.308758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22391","last_updated":"2025-06-04T17:58:20Z","snapshot_observed_at":"2026-07-06T19:41:46.397542Z","submitted_at":"2024-10-29T17:55:47Z","title":"A Large Recurrent Action Model: xLSTM enables Fast Inference for Robotics Tasks","version":3},"cited_work":{"arxiv_id":"2410.22391","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.22391","snapshot_observed_at":"2026-08-07T01:09:06.021744Z","title":"A Large Recurrent Action Model: xLSTM enables Fast Inference for Robotics Tasks","venue":"cs.LG","work_id":"475d4753-a2b9-4975-bcfb-53321d7a35ae","year":2024},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:02.134692Z"},"links":{"cited_paper":"/paper/2410.22391","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:170e1a22a53def8454e9f3a7646e2ee52285ad802d6bd43f2f7c31d75e4ebe3e","observation_id":"91644508-e9dd-46f3-bd43-fbaf09fbb26f","resolution":{"observed_at":"2026-08-07T01:09:06.141853Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T01:09:02.230198Z","title":"Siems, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:02.230198Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:eef86781fcb984c156f98fcfa8735c5786349db8437435e6debba7775c44cec2","observation_id":"cc24ddea-1b12-49a2-891e-542bfd39d584","resolution":{"observed_at":"2026-08-07T01:09:02.230198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.04620","last_updated":"2025-08-31T18:32:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-05T16:23:20Z","title":"Learning to (Learn at Test Time): RNNs with Expressive Hidden States","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.04620","snapshot_observed_at":"2026-08-07T01:09:02.336296Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:02.336296Z"},"links":{"cited_paper":"/paper/2407.04620","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:b7cd07897522099f5f9e454ba5040ad5a002ab55ad65652653a6fef95ad02bf4","observation_id":"b92daa30-16cd-4adb-a2fc-1e9c8e42e538","resolution":{"observed_at":"2026-08-07T01:09:02.336296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1503.00075","last_updated":"2015-05-30T06:51:20Z","snapshot_observed_at":"2026-07-06T04:10:33.864180Z","submitted_at":"2015-02-28T06:31:50Z","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.00075","snapshot_observed_at":"2026-08-07T01:09:02.440496Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:02.440496Z"},"links":{"cited_paper":"/paper/1503.00075","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:5e8ba8108fae825b9d00cd953fb64a1deb4d87c4767370f9cf5253397638cf3d","observation_id":"0227506e-7df7-4a32-ac41-bfd29a4d1da9","resolution":{"observed_at":"2026-08-07T01:09:02.440496Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:09.471481Z","title":"Touvron, M","venue":null,"work_id":"6ee624a5-62e1-4e9d-9e8e-5c8924f469bf","year":2022},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:02.522553Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:34d6427405623d02b2f02cfde4cadcb192f3c12f433acdb3c0019a8e19df3b0c","observation_id":"d1483abd-3e9e-4f1d-a15d-e2805784c6a6","resolution":{"observed_at":"2026-08-07T01:09:09.559357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T01:09:02.659554Z","title":"ISBN 978-3-031-20052-6","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:02.659554Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:62f2b19aee6ec622e3c385a0efe4bf81df204ce0410f9b39afa8f15000bc81d3","observation_id":"a461acc1-f74a-402f-9bf8-5fd5b1aba004","resolution":{"observed_at":"2026-08-07T01:09:02.659554Z","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":"2412.00678","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:05.388887Z","title":null,"venue":null,"work_id":"5c43482f-91cd-4792-9cef-c5e2f6df3504","year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:03.413249Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:6961fa8eff30e94c7bf603092c0c70a2c16a7017673faa508d849a93d20fac8b","observation_id":"2354d368-8833-4d2f-8b76-3a9d678b96ff","resolution":{"observed_at":"2026-08-07T01:09:05.443908Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:09.259886Z","title":null,"venue":null,"work_id":"dd159259-d384-485e-ba52-51ad7d834270","year":2016},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:03.554091Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:35b2758f8c3fe96c31a1c9dc3e8db4ac83b6183ef91f263a7af8aa93812fa606","observation_id":"db95c671-3743-4936-89c3-4d2d3577b155","resolution":{"observed_at":"2026-08-07T01:09:09.379290Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:09.001249Z","title":"meta-paths","venue":null,"work_id":"358636e6-34b2-42e3-94e3-e982a6d3a546","year":2024},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:03.686800Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:05012511fef9adeeb46d6883b54b46e477b2d167f7dbeb630008c69103b57f14","observation_id":"8d3113e3-fb88-47a3-a39d-6e50b1e5f817","resolution":{"observed_at":"2026-08-07T01:09:09.116831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:08.232887Z","title":"3a\" → \"rand-m9-mstd0.5-inc1","venue":null,"work_id":"6c66f576-f199-45e8-b837-1518ce7ba40a","year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:04.117760Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:8c9ff50edb78adfb9264c43ec89db27b94f22977286a74f1e9f818e010e19801","observation_id":"3cc56f7f-a85c-4100-839a-dbb943e99cee","resolution":{"observed_at":"2026-08-07T01:09:08.332576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:08.007445Z","title":null,"venue":null,"work_id":"44ed16b3-f8af-45bc-87fb-2fd33ad43844","year":2021},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:04.228817Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:c9307c99553e5e834802be3f0da8009df2a0ebb4714abb156959ec61c0cf946d","observation_id":"c6e4e6cd-1706-444a-8455-277a258d9365","resolution":{"observed_at":"2026-08-07T01:09:08.109617Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:07.798678Z","title":"rand-m9-mstd0.5-inc1","venue":null,"work_id":"92f0fb29-9294-4eb9-955f-69ce39f783b3","year":2020},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:04.344640Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:26c35e0d43ff3c8fdcabf7b8ff75dce0ac48a1b66be431bbdb95c7943e2fe866","observation_id":"c4a8a141-56a0-4719-adbd-e09fcfa146da","resolution":{"observed_at":"2026-08-07T01:09:07.905020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/237108","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:04.476153Z","title":"doi: 10.2307/237108","venue":null,"work_id":"c5a88a7c-7572-422e-b77e-988b99395f91","year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":1932,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:02.915794Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:be2ffe3f45b71ffbe16e51ac1a43a20892828059ad7622adb871c4977384f1d6","observation_id":"973d82ab-81cc-4dc5-9fd6-22c4a6a10dc2","resolution":{"observed_at":"2026-08-07T01:09:04.608525Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T01:09:01.794677Z","title":null,"venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":1961,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:01.794677Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:fd5d9a3ff002fc2b6f75e4ec70013dd6e22e20eb2f76f36d0c79f7a76397a900","observation_id":"a39aa294-9db1-4ec7-8b96-b2530e4d45a4","resolution":{"observed_at":"2026-08-07T01:09:01.794677Z","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-07T01:09:01.382810Z","title":"doi: https://doi.org/10.1016/0095-8956 (78)90013-8","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":1978,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:01.382810Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:08b30ddf01c1e83600f47f71ccc74452d3313827a210a7ffd2c4df4b116118e0","observation_id":"27dbfe49-3ac6-45f4-bfc5-f28188f1f2ae","resolution":{"observed_at":"2026-08-07T01:09:01.382810Z","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-07T01:09:01.125205Z","title":"doi: 10.1073/p nas.79.8.2554","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":1982,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:01.125205Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:6399dc8d0259c73b61f5a87aef76644ddf962a3a38b2f80afe14e14ab8e14a5f","observation_id":"31816429-8c87-469e-a7f2-cb83cd5cf0ce","resolution":{"observed_at":"2026-08-07T01:09:01.125205Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/cbo97805118108","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:04.765312Z","title":"doi: 10.1017/CBO97805118108","venue":null,"work_id":"2fb09f1e-11e3-421f-bb65-4aff593b7eee","year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":1985,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:01.201736Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:756f3c091b7cf37e39aeca8ecf2720937fa36ce6b844413cf7a67991e4ce65ae","observation_id":"0abc4d4b-d0cd-48ca-936a-fed930453535","resolution":{"observed_at":"2026-08-07T01:09:04.901073Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00248","last_updated":"2017-07-02T07:41:10Z","snapshot_observed_at":"2026-07-06T05:49:23.884114Z","submitted_at":"2017-07-02T07:41:10Z","title":"DAG-based Long Short-Term Memory for Neural Word Segmentation","version":1},"cited_work":{"arxiv_id":"1707.00248","doi":null,"metadata_source":"pith","pith_arxiv_id":"1707.00248","snapshot_observed_at":"2026-08-07T01:09:07.149919Z","title":"DAG-based Long Short-Term Memory for Neural Word Segmentation","venue":"cs.CL","work_id":"1402a62a-62d2-4ea2-9be5-b992f62a415c","year":2017},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:00.207381Z"},"links":{"cited_paper":"/paper/1707.00248","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:c41d51650abfc6dd700ef0fe7d4aafeddd1c87c53afd5d1354257456558919e1","observation_id":"64f817fc-e20f-49c6-96eb-818aebd0d828","resolution":{"observed_at":"2026-08-07T01:09:07.266931Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1049/cp_19991218","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:05.042310Z","title":"ISBN 978-0-85296-721-8","venue":null,"work_id":"7cf1f6e0-5450-498a-afbf-431fde30dff8","year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:00.824258Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:e7699c5b1c81c86e8c6e9246b58157514e6ea7be114036e5e8b26b8b71b2bd07","observation_id":"8a6a19d5-8b1a-4084-bdf0-a2f90648e43c","resolution":{"observed_at":"2026-08-07T01:09:05.147584Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03234","last_updated":"2024-06-05T21:02:37Z","snapshot_observed_at":"2026-08-09T18:31:32.718620Z","submitted_at":"2024-03-05T01:42:51Z","title":"Caduceus: Bi-Directional Equivariant Long-Range DNA Sequence Modeling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03234","snapshot_observed_at":"2026-08-07T01:09:01.926594Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:01.926594Z"},"links":{"cited_paper":"/paper/2403.03234","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:70abe0940d49fd88b3577342d221f2be0f84cb050db73f2650737deba41086b8","observation_id":"c07dc63e-ba92-4b14-8894-3100dc4dfd34","resolution":{"observed_at":"2026-08-07T01:09:01.926594Z","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-07T01:09:00.909871Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:00.909871Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:b804f35a360f5c03bdce837f40b0c7d1c6c1cbba63f81e9ea13e3ddff1084700","observation_id":"6f052117-7255-4b61-afb9-b50b4246c9da","resolution":{"observed_at":"2026-08-07T01:09:00.909871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04165","last_updated":"2024-11-06T18:36:48Z","snapshot_observed_at":"2026-07-06T19:46:19.931894Z","submitted_at":"2024-11-06T18:36:48Z","title":"Bio-xLSTM: Generative modeling, representation and in-context learning of biological and chemical sequences","version":1},"cited_work":{"arxiv_id":"2411.04165","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.04165","snapshot_observed_at":"2026-08-07T01:09:06.301440Z","title":"Bio-xLSTM: Generative modeling, representation and in-context learning of biological and chemical sequences","venue":"q-bio.BM","work_id":"e1e50037-0ce3-42c2-8173-7ddfd06c1b5b","year":2024},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:02.063387Z"},"links":{"cited_paper":"/paper/2411.04165","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:8b4b878f0dd8e622eb14335574f40c641e63f53f508ccb88764103685687690a","observation_id":"752827ec-87b1-4d44-9663-c61a29e0cdc0","resolution":{"observed_at":"2026-08-07T01:09:06.429597Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.07063","last_updated":"2016-03-23T03:31:02Z","snapshot_observed_at":"2026-07-06T04:50:25.493544Z","submitted_at":"2016-03-23T03:31:02Z","title":"Semantic Object Parsing with Graph LSTM","version":1},"cited_work":{"arxiv_id":"1603.07063","doi":null,"metadata_source":"pith","pith_arxiv_id":"1603.07063","snapshot_observed_at":"2026-08-07T01:09:06.641577Z","title":"Semantic Object Parsing with Graph LSTM","venue":"cs.CV","work_id":"5a253b49-496e-4e25-b4c8-0abc289a0f5c","year":2016},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:01.633131Z"},"links":{"cited_paper":"/paper/1603.07063","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:b103f01f701cfa0268c7cabf508909829d27cb4cfa90c7db1545bc843a12f12c","observation_id":"ad4b93cd-fb2c-4f72-a616-e7ee311d2eef","resolution":{"observed_at":"2026-08-07T01:09:06.763212Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.21060","last_updated":"2024-05-31T17:50:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-05-31T17:50:01Z","title":"Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Duality","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.21060","snapshot_observed_at":"2026-08-07T01:09:00.341158Z","title":"Dao and A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:00.341158Z"},"links":{"cited_paper":"/paper/2405.21060","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:25c8f2407ed878d238738790cecf1201984429cc89f12691badd6758d8d0e014","observation_id":"bc83056d-4514-4cd4-8a80-5e0364be1fb0","resolution":{"observed_at":"2026-08-07T01:09:00.341158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10382","last_updated":"2024-10-14T11:11:06Z","snapshot_observed_at":"2026-07-06T19:33:00.110753Z","submitted_at":"2024-10-14T11:11:06Z","title":"V2M: Visual 2-Dimensional Mamba for Image Representation Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10382","snapshot_observed_at":"2026-08-07T01:09:02.756635Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:02.756635Z"},"links":{"cited_paper":"/paper/2410.10382","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:d761f6274d35b160f1fbacb579b983eec37d6433e037a233e75c178ede8a8d52","observation_id":"b66d9fc0-9621-4267-857c-8508298a030f","resolution":{"observed_at":"2026-08-07T01:09:02.756635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.06635","last_updated":"2024-08-27T01:27:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-11T18:51:59Z","title":"Gated Linear Attention Transformers with Hardware-Efficient Training","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.06635","snapshot_observed_at":"2026-08-07T01:09:03.158451Z","title":"Y ang, B","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:03.158451Z"},"links":{"cited_paper":"/paper/2312.06635","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:a6869eac600d7bc9124ceb273898e72993e11cc727418c1e1b21f62797f7b0ec","observation_id":"49fe7faf-9f69-4f0a-989e-d8003c68b99e","resolution":{"observed_at":"2026-08-07T01:09:03.158451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02308","last_updated":"2025-03-31T06:14:48Z","snapshot_observed_at":"2026-08-09T01:57:03.186839Z","submitted_at":"2024-03-04T18:46:20Z","title":"Vision-RWKV: Efficient and Scalable Visual Perception with RWKV-Like Architectures","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.02308","snapshot_observed_at":"2026-08-07T01:09:00.572111Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:00.572111Z"},"links":{"cited_paper":"/paper/2403.02308","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:97c9f8d0fda71b3156fa347e33ff1dcc5cbd00f2c85bdecb36edf44bf97df550","observation_id":"63aa752b-d592-406a-8130-f0bdde00a60a","resolution":{"observed_at":"2026-08-07T01:09:00.572111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.08819","last_updated":"2025-03-05T23:00:57Z","snapshot_observed_at":"2026-07-06T17:59:38.202928Z","submitted_at":"2024-04-12T21:30:06Z","title":"The Illusion of State in State-Space Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.08819","snapshot_observed_at":"2026-08-07T01:09:01.721259Z","title":"Merrill, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:01.721259Z"},"links":{"cited_paper":"/paper/2404.08819","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:e05f24e8c33d70dee3846c99230920f80ab07085c7aaa75c572f676f50643eb6","observation_id":"6c8a6c23-8d08-419b-87f2-4781650978b8","resolution":{"observed_at":"2026-08-07T01:09:01.721259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06484","last_updated":"2025-01-15T10:41:40Z","snapshot_observed_at":"2026-08-06T05:53:13.494942Z","submitted_at":"2024-06-10T17:24:42Z","title":"Parallelizing Linear Transformers with the Delta Rule over Sequence Length","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06484","snapshot_observed_at":"2026-08-07T01:09:03.309496Z","title":"Y ang, B","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:03.309496Z"},"links":{"cited_paper":"/paper/2406.06484","citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:2b128f0e4378fe8c720c182a438c7b04df591a5da5c3b7b03b2ab567407c311d","observation_id":"97f09e7b-fda8-42f7-ab1c-af5db940abdd","resolution":{"observed_at":"2026-08-07T01:09:03.309496Z","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":"2412.16146","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T01:09:07.457669Z","title":"arXiv:2412.16146 [cs]","venue":null,"work_id":"ddd4a6a6-2004-40eb-90c5-26f28379df1a","year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:00.084204Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:c14ae17b5cbf19910d102a45457619c8ea1c6876c2aadb75ca27027d3d4fccbd","observation_id":"ffd1462d-4d55-4c17-aa4f-d965f308560b","resolution":{"observed_at":"2026-08-07T01:09:07.557549Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T01:08:59.983112Z","title":"arXiv:2502.10818 [cs]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T01:08:59.983112Z"},"links":{"citing_paper":"/paper/2506.11997"},"observation_digest":"sha256:d7f51a5d94856257bf1dfde875d15996bbb36823fdf2a183fcc32c33eb3b41ac","observation_id":"05197e9c-a108-4634-962c-13c999a1e082","resolution":{"observed_at":"2026-08-07T01:08:59.983112Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.11997","last_updated":"2025-06-13T17:51:37Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T00:56:52.034236Z","submitted_at":"2025-06-13T17:51:37Z","title":"pLSTM: parallelizable Linear Source Transition Mark networks"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":10,"verified_fuzzy":4},"total_outbound_references":39},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2506.11997."}