{"as_of":"2026-08-22T00:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a54c0b1fdd66e6c0fcde5458a2472c797f058a97249e445711865911808fd54d","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T23:49:09.478724Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2502.04052/citation-record","integrity":"/paper/2502.04052/integrity","json":"/paper/2502.04052/citation-record.json","paper":"/paper/2502.04052"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T23:49:09.391615Z","title":"Optuna: A next-generation hyperparameter optimization framework","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.391615Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:0de124a7bb5fb47fa5bc1bd020b9f364617d877354c5561df45a14e3c9c5dabf","observation_id":"e22b49fd-5b0f-4fcb-8932-816b520cb67b","resolution":{"observed_at":"2026-08-08T23:49:09.391615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.01780","last_updated":"2021-04-11T19:26:10Z","snapshot_observed_at":"2026-08-18T10:02:11.821839Z","submitted_at":"2019-02-05T16:40:34Z","title":"Learning Decision Trees Recurrently Through Communication","version":3},"cited_work":{"arxiv_id":"1902.01780","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.01780","snapshot_observed_at":"2026-08-08T23:49:09.544884Z","title":"Learning Decision Trees Recurrently Through Communication","venue":"cs.LG","work_id":"9bc29074-f013-4542-b913-c18fff6072de","year":2019},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.395061Z"},"links":{"cited_paper":"/paper/1902.01780","citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:8dcc634ddf861b375e71a805380fa6944f4e535782bf8fbb31a22c69bcdcefc9","observation_id":"ba7c3ade-2752-4e0d-ab0e-61e2be373de2","resolution":{"observed_at":"2026-08-08T23:49:09.548105Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.728226Z","title":"Linear model decision trees as surrogates in optimization of engineering applications","venue":null,"work_id":"7027ee76-b6a3-4445-8fdd-7bab96e3f72a","year":2023},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.398621Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:1bb4d6388ec044353d19e00c1ca588fa4cbbd2cafd1928a951df13f2650de17c","observation_id":"405e9ab2-e982-4ed5-b9bf-5aef99072cb1","resolution":{"observed_at":"2026-08-08T23:49:09.731426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04517","last_updated":"2024-12-06T15:42:07Z","snapshot_observed_at":"2026-08-16T13:54:34.627474Z","submitted_at":"2024-05-07T17:50:21Z","title":"xLSTM: Extended Long Short-Term Memory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.04517","snapshot_observed_at":"2026-08-08T23:49:09.401510Z","title":"o ppel, Markus Spanring, Andreas Auer, Oleksandra Prudnikova, Michael Kopp, G \\","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.401510Z"},"links":{"cited_paper":"/paper/2405.04517","citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:deca41943deb2e0d6976046b3137df68a378c48835b72f232096b08a5d1ead34","observation_id":"ce6181c0-dedd-4b89-aaf5-6b983f9224b1","resolution":{"observed_at":"2026-08-08T23:49:09.401510Z","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-08T23:49:09.719474Z","title":"Classification and regression trees","venue":null,"work_id":"75df20d6-4461-41fc-8bb7-27c5a4aa2672","year":2017},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.405224Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:f9c73290e88c348562fd918233f009fd16ae91e9aa5203a2e2f2275dc4db07fa","observation_id":"0a28c71c-c2eb-45d2-bd4d-b448f491345d","resolution":{"observed_at":"2026-08-08T23:49:09.722364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.711010Z","title":"Prediction of financial time series with recurrent lolimot (locally linear model tree)","venue":null,"work_id":"e7bed807-f220-41a7-9baf-4195d6974dc3","year":2010},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.408314Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:d1fe18de58de5f3e6562d8b51d44ce9e8b9ef78f280561aba7a1fbd92911adca","observation_id":"5a775fd2-e9b5-49d4-954f-ea44e8e814d2","resolution":{"observed_at":"2026-08-08T23:49:09.714051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.702274Z","title":"Learning online smooth predictors for realtime camera planning using recurrent decision trees","venue":null,"work_id":"8db720cd-0488-4991-9243-76277e936080","year":2016},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.411364Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:5f63397c10aaaad4ca40358128eeefdd51a71a598e122c4dd0c542177578dfcf","observation_id":"34ceda48-0bc8-4543-9ac8-33591e4d46ca","resolution":{"observed_at":"2026-08-08T23:49:09.705561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.693928Z","title":"Xgboost: A scalable tree boosting system","venue":null,"work_id":"d8237318-0447-451c-97f6-f5413bd440b7","year":2016},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.414164Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:a759e13908679a9cc8aeaf8a0c2c675d9b48d00ae34420e21546219d31effa1a","observation_id":"87841ee7-24d0-4924-88c2-301050b761b5","resolution":{"observed_at":"2026-08-08T23:49:09.696945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.685358Z","title":"The role of decision tree representation in regression problems--an evolutionary perspective","venue":null,"work_id":"8b051e45-6b36-472c-bf4b-e8c9c5886506","year":2016},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.417334Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:3153cccfecea4a561076eda99b31153aedd46bd4ea90c3a2ca2350e1713a28b3","observation_id":"8da97fe0-e829-4487-9d28-13d2af065aae","resolution":{"observed_at":"2026-08-08T23:49:09.688521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.420276Z","title":"Finding structure in time","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.420276Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:892d0480bf5186790f12d4b37d63fe25226ef914901ceb74ceec75ee32665e89","observation_id":"9fbfbe0a-fb00-4221-ab05-99ac74c2801c","resolution":{"observed_at":"2026-08-08T23:49:09.420276Z","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-08T23:49:09.671992Z","title":"The vanishing gradient problem during learning recurrent neural nets and problem solutions","venue":null,"work_id":"c72a6b97-3bbc-4620-a15d-30e0ed70911b","year":1998},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.422985Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:772924aba09e501fbe54662e24a51bebd46d491d30ef67882609e10f49f4bd9e","observation_id":"dee97635-c8c3-4238-90ca-79fb8ac5bc2a","resolution":{"observed_at":"2026-08-08T23:49:09.675023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.663268Z","title":"Soft decision trees","venue":null,"work_id":"c40fc72c-38bb-4663-b3e7-a12af4be4357","year":2012},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.426831Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:f43f6f81c68422716e8839f28cde19adea83f9337a78140b02cacfd87c88bf5b","observation_id":"e5d9090b-294c-40a6-8bf5-d624792a663a","resolution":{"observed_at":"2026-08-08T23:49:09.666662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.653938Z","title":"Sdtr: Soft decision tree regressor for tabular data","venue":null,"work_id":"d4cdb5d7-6529-4e22-99c7-a170f654967f","year":2021},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.429562Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:259a87d100183fde8a8172797b9a00097e6ff9a54d884d3b9f28c3b712cd11e7","observation_id":"0ae032af-d034-4849-8f61-75649e8904c1","resolution":{"observed_at":"2026-08-08T23:49:09.656988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.645628Z","title":"Gradtree: Learning axis-aligned decision trees with gradient descent","venue":null,"work_id":"8ec8c136-416a-4fc2-925c-666ab6dfe0fb","year":2024},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.432355Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:bd378c683ea945eb51648a248cb3840fa10af24205e76c769e5254514f0de2de","observation_id":"494df550-8a6c-45ca-bd79-62c41db5c912","resolution":{"observed_at":"2026-08-08T23:49:09.648705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.637254Z","title":"Grande: Gradient-based decision tree ensembles for tabular data","venue":null,"work_id":"3c34449a-6550-4dcb-bf93-5e4b410e36d6","year":2024},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.435061Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:968b2b4efdc35ceda6cff20e6e6ad1f442fea716370fecd8fe9a82749cee4e99","observation_id":"cb043894-2e5e-4fa3-9e30-370e95e0e755","resolution":{"observed_at":"2026-08-08T23:49:09.640393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.12386","last_updated":"2019-06-04T16:11:31Z","snapshot_observed_at":"2026-08-14T17:51:07.637605Z","submitted_at":"2018-11-29T18:53:11Z","title":"Tree-Structured Recurrent Switching Linear Dynamical Systems for Multi-Scale Modeling","version":6},"cited_work":{"arxiv_id":"1811.12386","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.12386","snapshot_observed_at":"2026-08-08T23:49:09.523690Z","title":"Tree-Structured Recurrent Switching Linear Dynamical Systems for Multi-Scale Modeling","venue":"stat.ML","work_id":"524d0e5f-3e68-4d43-8034-14968a4aabce","year":2018},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.437822Z"},"links":{"cited_paper":"/paper/1811.12386","citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:fe235043f79196f96173613e2ff777f96f49449fe4c80d6e4daf435192f3ee83","observation_id":"758c9775-7cc2-4294-bde1-3f8ff4e14022","resolution":{"observed_at":"2026-08-08T23:49:09.528758Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.629099Z","title":"Nonlinear dynamic system identification","venue":null,"work_id":"50d74393-c6fb-41e7-9a35-6ea8c7933d58","year":2020},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.440866Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:b2868c86f51441cb28b6e21fa2780ae746650945a7c8172fbf57b032a22dc513","observation_id":"3b3943ef-2fd9-4c3b-adb9-44848a45b74d","resolution":{"observed_at":"2026-08-08T23:49:09.631993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.620769Z","title":"Basis function networks for interpolation of local linear models","venue":null,"work_id":"06d407a0-1a0a-44a7-91f4-b0e18921c82a","year":1996},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.443573Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:643eb5aee6075dcdb7f35b1697ab0f3b5adda55eb857dfff022851f785a14959","observation_id":"a94d57ea-7fb1-487a-a7f7-ef5e0a28da5c","resolution":{"observed_at":"2026-08-08T23:49:09.623742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.06349","last_updated":"2023-03-11T08:53:11Z","snapshot_observed_at":"2026-08-16T15:49:03.576715Z","submitted_at":"2023-03-11T08:53:11Z","title":"Resurrecting Recurrent Neural Networks for Long Sequences","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.06349","snapshot_observed_at":"2026-08-08T23:49:09.446301Z","title":"Resurrecting recurrent neural networks for long sequences, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.446301Z"},"links":{"cited_paper":"/paper/2303.06349","citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:8cb3965f593aca98e2bd53a0d3f7bda5c7c348f939d7409faed83a21d909932e","observation_id":"ab224967-1657-4ec9-95cb-60effefa0f98","resolution":{"observed_at":"2026-08-08T23:49:09.446301Z","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-08T23:49:09.449444Z","title":"Catboost: unbiased boosting with categorical features","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.449444Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:ac50a333ea87a369dd22f49b32076630cb5115b119614c5652b959a83903a25e","observation_id":"36deb390-2806-4f73-979c-c725793980ca","resolution":{"observed_at":"2026-08-08T23:49:09.449444Z","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-08T23:49:09.452247Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.452247Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:49582381f33589b298db6d97ff916ec8970cb0e6903ad2968d273b59b2c71c72","observation_id":"b5d6da6e-4741-4c83-83af-35223e7bb906","resolution":{"observed_at":"2026-08-08T23:49:09.452247Z","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-08T23:49:09.602659Z","title":"Tree-rnn: Tree structural recurrent neural network for network traffic classification","venue":null,"work_id":"03add875-823b-41d1-b8a3-9a59f8ed39e9","year":2021},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.455072Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:c78e9ea52c2783bf44230e6edf0266df9c9139ed489a01ff5be910585dc0c4a5","observation_id":"3e3d9f61-82de-42b6-8148-a968d6c13e26","resolution":{"observed_at":"2026-08-08T23:49:09.605898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.594292Z","title":"Long short-term memory","venue":null,"work_id":"c47e6b2b-dfae-4976-bfaa-e7e90fd3421f","year":1997},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.457796Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:96baa4777db012ccac56d4dd5f4f30f272fb21c0d885f621830dec0073bc91da","observation_id":"439d4b81-2fd9-4fe3-8f6e-b4ce198df992","resolution":{"observed_at":"2026-08-08T23:49:09.597188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.585954Z","title":"Backpropagation through time: what it does and how to do it","venue":null,"work_id":"1a3eb097-0b0a-46a3-8ec8-90d7ef19f77d","year":1990},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.460516Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:e5c9c4d3b18118a3a076678ae7c9a9f414d8e346eb8cbc24d870435377dff0eb","observation_id":"198fd8a2-30f1-41b2-b502-cdac12e1072f","resolution":{"observed_at":"2026-08-08T23:49:09.588947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T23:49:09.577425Z","title":"Experimental analysis of the real-time recurrent learning algorithm","venue":null,"work_id":"df464bf3-ef15-426d-beb0-14221a28cc33","year":1989},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.463326Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:8cd7ada9f960dccd0d11994d3e3c637fe6541a6985ff1ad2acb1a61ea01a95e4","observation_id":"a04ea63f-cbca-41a5-93ee-b139e03179d3","resolution":{"observed_at":"2026-08-08T23:49:09.580454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.05662","last_updated":"2019-09-25T14:33:44Z","snapshot_observed_at":"2026-08-18T10:00:44.867682Z","submitted_at":"2019-03-13T18:23:43Z","title":"Understanding Straight-Through Estimator in Training Activation Quantized Neural Nets","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.05662","snapshot_observed_at":"2026-08-08T23:49:09.466090Z","title":"Understanding straight-through estimator in training activation quantized neural nets, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.466090Z"},"links":{"cited_paper":"/paper/1903.05662","citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:8630719707de4615c865c6bedb9bb133216c1819d374c3bf7768ad783d9f9b6d","observation_id":"6db4f704-d94d-4259-92b4-d1ec40cc0604","resolution":{"observed_at":"2026-08-08T23:49:09.466090Z","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-08T23:49:09.469211Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.469211Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:d870b7230415af316ac20dbe3af84dd8ed6c7fa388ba74da8eb96bd10fae4abb","observation_id":"02663937-cf80-482e-8098-c77dd5a66e96","resolution":{"observed_at":"2026-08-08T23:49:09.469211Z","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-08T23:49:09.472663Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.472663Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:28b40d56014a978767d597d00cfd21275210a372b9939a69000b0041efb2f2ff","observation_id":"f9f7fb22-1491-4eb2-bb3d-cddf5a0c1ec6","resolution":{"observed_at":"2026-08-08T23:49:09.472663Z","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-08T23:49:09.475827Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.475827Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:c553605f324392411ee3fbd2dfa75f99f78775488321ec225712e098f14fde26","observation_id":"88c2f5b2-7923-44ce-b417-ddcc68e45301","resolution":{"observed_at":"2026-08-08T23:49:09.475827Z","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-08T23:49:09.554987Z","title":"< 9˄ v !'_Xqz*0j#qͨܠ y z7-ygɊ k 6?<Ws˿? ?W;Ρ r oP ]|y4VR &e41 gu Qx&]k( 화FLO] 3G>qgb o ^? r ܵ=wq ._xftA[!W4v 5_o xO :L r|0 ,: x꾸U_s; mj;1=xŞ7 TX ;[;J ȞK y'< 2k|","venue":null,"work_id":"7e2f0bb5-d0df-42d1-aebd-215d640136fa","year":1971},"citing_paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T23:49:09.478724Z"},"links":{"citing_paper":"/paper/2502.04052"},"observation_digest":"sha256:5731de86af48161814e2d7fb051128f7eb06b38d76bfb716563a6c26b52502ce","observation_id":"d2c6861d-6fab-4c22-bfd8-5ff79efeee04","resolution":{"observed_at":"2026-08-08T23:49:09.557968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.04052","last_updated":"2025-02-06T13:11:50Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T10:01:34.709734Z","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":2,"verified_fuzzy":18},"total_outbound_references":30},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2502.04052."}