{"as_of":"2026-08-04T11:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f70fc1d645145fead68f7bdfbaf2773d02c1a196d9020a4293feaf98fdfe577f","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T06:49:02.060472Z","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-07-03T14:58:33.275948Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2208.09515","last_updated":"2023-03-07T16:26:05Z","snapshot_observed_at":"2026-07-06T13:43:35.936418Z","submitted_at":"2022-08-19T19:01:30Z","title":"Spectral Decomposition Representation for Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2208.09515","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2208.09515","snapshot_observed_at":"2026-07-03T14:58:33.275948Z","title":"arXiv preprint arXiv:2208.09515 , year=","venue":null,"work_id":"df5be900-cf8f-468f-9033-0bfee4450877","year":2022},"citing_paper":{"arxiv_id":"2605.01242","last_updated":"2026-05-02T04:46:54Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T04:46:54Z","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-05-09T15:12:54.575483Z"},"links":{"cited_paper":"/paper/2208.09515","citing_paper":"/paper/2605.01242"},"observation_digest":"sha256:d8cbbf0e4e5188ad396e24e7c71812789c83e0abdc2d010e2eed2416133b9812","observation_id":"8d1af092-0814-4b17-bc1a-aaf7e199f944","resolution":{"observed_at":"2026-05-11T16:46:05.411562Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.09515","last_updated":"2023-03-07T16:26:05Z","snapshot_observed_at":"2026-07-06T13:43:35.936418Z","submitted_at":"2022-08-19T19:01:30Z","title":"Spectral Decomposition Representation for Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2208.09515","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2208.09515","snapshot_observed_at":"2026-07-03T14:58:33.275948Z","title":"arXiv preprint arXiv:2208.09515 , year=","venue":null,"work_id":"df5be900-cf8f-468f-9033-0bfee4450877","year":2022},"citing_paper":{"arxiv_id":"2605.20408","last_updated":"2026-05-19T19:04:47Z","snapshot_observed_at":"2026-07-06T23:30:58.549353Z","submitted_at":"2026-05-19T19:04:47Z","title":"Spectral Souping: A Unified Framework for Online Preference Alignment","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-21T07:54:56.356555Z"},"links":{"cited_paper":"/paper/2208.09515","citing_paper":"/paper/2605.20408"},"observation_digest":"sha256:304ade65afea5db3851f7f967c3313c7d74679e96b3a76bc637b8c65ff8a6d03","observation_id":"be83e757-bba4-4f27-a4d2-98ed9739e529","resolution":{"observed_at":"2026-05-21T07:59:50.995866Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.09515","last_updated":"2023-03-07T16:26:05Z","snapshot_observed_at":"2026-07-06T13:43:35.936418Z","submitted_at":"2022-08-19T19:01:30Z","title":"Spectral Decomposition Representation for Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2208.09515","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2208.09515","snapshot_observed_at":"2026-07-03T14:58:33.275948Z","title":"arXiv preprint arXiv:2208.09515 , year=","venue":null,"work_id":"df5be900-cf8f-468f-9033-0bfee4450877","year":2022},"citing_paper":{"arxiv_id":"2606.12890","last_updated":"2026-06-11T04:33:03Z","snapshot_observed_at":"2026-07-31T15:41:37.692914Z","submitted_at":"2026-06-11T04:33:03Z","title":"Learning to Adapt: Representation-Based Reinforcement Learning for Multi-Task Skill Transfer","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T06:49:02.060472Z"},"links":{"cited_paper":"/paper/2208.09515","citing_paper":"/paper/2606.12890"},"observation_digest":"sha256:dd180570063d4911dbe3eecfba3e9803d0508c181a11c44555e48b734f0e8b6a","observation_id":"a35147d8-0deb-4d17-8907-081682761fad","resolution":{"observed_at":"2026-07-03T14:58:33.277368Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2208.09515/citation-record","integrity":"/paper/2208.09515/integrity","json":"/paper/2208.09515/citation-record.json","paper":"/paper/2208.09515"},"outbound":[],"paper":{"arxiv_id":"2208.09515","last_updated":"2023-03-07T16:26:05Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:43:35.936418Z","submitted_at":"2022-08-19T19:01:30Z","title":"Spectral Decomposition Representation for Reinforcement Learning"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2208.09515."}