{"as_of":"2026-08-09T08:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e9a7cf69708f5a5fdd90672f1944dcd56928fb6a8d081bff7eaba43508cdeb0b","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T23:22:50.927678Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-20T22:13:46.752750Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.00633","last_updated":"2025-02-02T02:45:20Z","snapshot_observed_at":"2026-08-01T18:36:20.180935Z","submitted_at":"2025-02-02T02:45:20Z","title":"Lipschitz Lifelong Monte Carlo Tree Search for Mastering Non-Stationary Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.00633","snapshot_observed_at":"2026-08-05T23:22:50.927678Z","title":"Lipschitz lifelong monte carlo tree search for mastering non-stationary tasks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.05440","last_updated":"2025-08-07T14:29:43Z","snapshot_observed_at":"2026-08-06T04:40:10.759969Z","submitted_at":"2025-08-07T14:29:43Z","title":"3D DNA Origami-Enabled Molecularly Addressable Optical Nanocircuit","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T23:22:50.927678Z"},"links":{"cited_paper":"/paper/2502.00633","citing_paper":"/paper/2508.05440"},"observation_digest":"sha256:5069c7f261fa02540697601ba47c09792db3a656bf35295508f5f875f68843eb","observation_id":"91a38b12-e650-4864-b704-c54bf43fb3be","resolution":{"observed_at":"2026-08-05T23:22:50.927678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00633","last_updated":"2025-02-02T02:45:20Z","snapshot_observed_at":"2026-08-01T18:36:20.180935Z","submitted_at":"2025-02-02T02:45:20Z","title":"Lipschitz Lifelong Monte Carlo Tree Search for Mastering Non-Stationary Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.00633","snapshot_observed_at":"2026-08-05T23:22:29.231783Z","title":"Lipschitz lifelong monte carlo tree search for mastering non-stationary tasks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.05441","last_updated":"2025-08-07T14:31:22Z","snapshot_observed_at":"2026-08-09T07:07:06.006850Z","submitted_at":"2025-08-07T14:31:22Z","title":"Tail-Risk-Safe Monte Carlo Tree Search under PAC-Level Guarantees","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T23:22:29.231783Z"},"links":{"cited_paper":"/paper/2502.00633","citing_paper":"/paper/2508.05441"},"observation_digest":"sha256:c551a9e37f7b9daf52c5da16cd21f9f4468a967b3495fa2a1019bad5477741e8","observation_id":"eda2cdf4-cfb6-4734-9f14-2db650e75ce8","resolution":{"observed_at":"2026-08-05T23:22:29.231783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00633","last_updated":"2025-02-02T02:45:20Z","snapshot_observed_at":"2026-08-01T18:36:20.180935Z","submitted_at":"2025-02-02T02:45:20Z","title":"Lipschitz Lifelong Monte Carlo Tree Search for Mastering Non-Stationary Tasks","version":1},"cited_work":{"arxiv_id":"2502.00633","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00633","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lipschitz lifelong monte carlo tree search for mastering non-stationary tasks","venue":null,"work_id":"4296da23-5347-43d4-9601-eaed2499ddc7","year":2025},"citing_paper":{"arxiv_id":"2602.05048","last_updated":"2026-05-01T20:59:20Z","snapshot_observed_at":"2026-08-03T04:28:51.084715Z","submitted_at":"2026-02-04T20:58:53Z","title":"MINT: Minimal Information Neuro-Symbolic Tree for Objective-Driven Knowledge-Gap Reasoning and Active Elicitation","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-16T07:13:42.705619Z"},"links":{"cited_paper":"/paper/2502.00633","citing_paper":"/paper/2602.05048"},"observation_digest":"sha256:377ce0a8d44bb94a69ebac85774be16f0f3a4b5e1d8a7925c4ea162eaeb3ec7b","observation_id":"6f116d33-cd68-4989-85d5-71d89ab5d3a1","resolution":{"observed_at":"2026-05-16T07:17:30.666906Z","resolver_source":"arxiv_id","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":"2502.00633","last_updated":"2025-02-02T02:45:20Z","snapshot_observed_at":"2026-08-01T18:36:20.180935Z","submitted_at":"2025-02-02T02:45:20Z","title":"Lipschitz Lifelong Monte Carlo Tree Search for Mastering Non-Stationary Tasks","version":1},"cited_work":{"arxiv_id":"2502.00633","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00633","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lipschitz lifelong monte carlo tree search for mastering non-stationary tasks","venue":null,"work_id":"4296da23-5347-43d4-9601-eaed2499ddc7","year":2025},"citing_paper":{"arxiv_id":"2605.06500","last_updated":"2026-05-07T16:18:37Z","snapshot_observed_at":"2026-07-06T23:18:55.724335Z","submitted_at":"2026-05-07T16:18:37Z","title":"Operator-Guided Invariance Learning for Continuous Reinforcement Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-08T12:45:52.092349Z"},"links":{"cited_paper":"/paper/2502.00633","citing_paper":"/paper/2605.06500"},"observation_digest":"sha256:843fa995cf258950a61ef60ca9bee108bce838d9a8785c63bdaa3c2322ebb45e","observation_id":"57806f1d-b1e3-42ab-98bf-2c1f1b1ba908","resolution":{"observed_at":"2026-05-11T19:06:08.767806Z","resolver_source":"arxiv_id","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":"2502.00633","last_updated":"2025-02-02T02:45:20Z","snapshot_observed_at":"2026-08-01T18:36:20.180935Z","submitted_at":"2025-02-02T02:45:20Z","title":"Lipschitz Lifelong Monte Carlo Tree Search for Mastering Non-Stationary Tasks","version":1},"cited_work":{"arxiv_id":"2502.00633","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00633","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lipschitz lifelong monte carlo tree search for mastering non-stationary tasks","venue":null,"work_id":"4296da23-5347-43d4-9601-eaed2499ddc7","year":2025},"citing_paper":{"arxiv_id":"2605.18809","last_updated":"2026-05-12T01:02:01Z","snapshot_observed_at":"2026-08-07T15:41:16.849024Z","submitted_at":"2026-05-12T01:02:01Z","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-20T22:13:00.107205Z"},"links":{"cited_paper":"/paper/2502.00633","citing_paper":"/paper/2605.18809"},"observation_digest":"sha256:09e72cf5ca2c2a827e7d4a214b08e0052e67f656fe86392547df3179c79c7a39","observation_id":"cf33e756-3e32-44b9-aa43-1f5a4befbeda","resolution":{"observed_at":"2026-05-20T22:13:46.755847Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.00633/citation-record","integrity":"/paper/2502.00633/integrity","json":"/paper/2502.00633/citation-record.json","paper":"/paper/2502.00633"},"outbound":[],"paper":{"arxiv_id":"2502.00633","last_updated":"2025-02-02T02:45:20Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-01T18:36:20.180935Z","submitted_at":"2025-02-02T02:45:20Z","title":"Lipschitz Lifelong Monte Carlo Tree Search for Mastering Non-Stationary Tasks"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2502.00633."}