{"as_of":"2026-08-07T06:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c58625bcb3db259f5bcc263114f8cbf49968962538cc0fe42caf43ab45cd2347","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":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T15:45:50.027870Z","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-04T13:59:52.270237Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17838","snapshot_observed_at":"2026-08-04T15:45:50.027870Z","title":"Carl: Learning scalable planning policies with simple rewards,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.18608","last_updated":"2025-11-03T20:29:38Z","snapshot_observed_at":"2026-08-04T15:45:49.359240Z","submitted_at":"2025-09-23T03:56:10Z","title":"End-to-End Crop Row Navigation via LiDAR-Based Deep Reinforcement Learning","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T15:45:50.027870Z"},"links":{"cited_paper":"/paper/2504.17838","citing_paper":"/paper/2509.18608"},"observation_digest":"sha256:d713035d120c1bb974864b25c1e2a79edf2a155155d54675c444666c34864aaa","observation_id":"3d9169d7-3c53-4a64-88db-feb5ee5545d1","resolution":{"observed_at":"2026-08-04T15:45:50.027870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17838","snapshot_observed_at":"2026-08-04T07:54:31.437962Z","title":"Carl: Learning scalable planning policies with simple rewards.arXiv preprint arXiv:2504.17838,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24108","last_updated":"2026-07-08T06:19:04Z","snapshot_observed_at":"2026-08-07T05:50:37.378935Z","submitted_at":"2025-10-28T06:26:36Z","title":"Zero-Human Demonstration End-to-end Autonomous Driving with Trajectory Scorer","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-04T07:54:31.437962Z"},"links":{"cited_paper":"/paper/2504.17838","citing_paper":"/paper/2510.24108"},"observation_digest":"sha256:0789da6dfe4ca89698c9acf1d4be20eb0723434501f576d41492b81fa439cb36","observation_id":"a6d06704-b62d-4783-bba3-83f3ecb3e0eb","resolution":{"observed_at":"2026-08-04T07:54:31.437962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","version":3},"cited_work":{"arxiv_id":"2504.17838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17838","snapshot_observed_at":"2026-07-04T13:59:52.270237Z","title":"Carl: Learning scalable planning policies with simple rewards","venue":null,"work_id":"acecd357-7fb2-44ad-bf5b-7be64dce857a","year":2025},"citing_paper":{"arxiv_id":"2603.24155","last_updated":"2026-04-07T08:33:33Z","snapshot_observed_at":"2026-07-06T22:50:28.640006Z","submitted_at":"2026-03-25T10:24:16Z","title":"Goal-Oriented Reactive Simulation for Closed-Loop Trajectory Prediction","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-15T00:55:01.446865Z"},"links":{"cited_paper":"/paper/2504.17838","citing_paper":"/paper/2603.24155"},"observation_digest":"sha256:721f669fbde4c50aed09a91195891de0d660b4089c9779c1253927dbd2b51816","observation_id":"7f28dc87-b3fd-4a13-b102-b31572796698","resolution":{"observed_at":"2026-05-15T00:58:26.219951Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","version":3},"cited_work":{"arxiv_id":"2504.17838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17838","snapshot_observed_at":"2026-07-04T13:59:52.270237Z","title":"Carl: Learning scalable planning policies with simple rewards","venue":null,"work_id":"acecd357-7fb2-44ad-bf5b-7be64dce857a","year":2025},"citing_paper":{"arxiv_id":"2604.04138","last_updated":"2026-06-30T14:47:48Z","snapshot_observed_at":"2026-07-13T11:16:49.191589Z","submitted_at":"2026-04-05T14:53:43Z","title":"Learning Dexterous Grasping from Sparse Taxonomy Guidance","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-13T17:05:06.300013Z"},"links":{"cited_paper":"/paper/2504.17838","citing_paper":"/paper/2604.04138"},"observation_digest":"sha256:b9d47f1169c4df90666239e583e67bcca7255cc90be16e8577499339ad54fad9","observation_id":"ec35f504-c895-4d74-a3db-f860c52472a3","resolution":{"observed_at":"2026-05-13T17:08:00.975998Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17838","snapshot_observed_at":"2026-07-13T11:14:37.619203Z","title":"Carl: Learning scalable planning policies with simple rewards,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.04141","last_updated":"2026-06-17T17:55:46Z","snapshot_observed_at":"2026-07-13T11:14:32.847324Z","submitted_at":"2026-04-05T14:59:47Z","title":"On Data Thinning for Model Validation in Small Area Estimation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-13T11:14:37.619203Z"},"links":{"cited_paper":"/paper/2504.17838","citing_paper":"/paper/2604.04141"},"observation_digest":"sha256:69f5b10354d9495a8ca6426d340967c4e42927dcd0323f6a1564f35e9d918b09","observation_id":"13fe5e58-3f3d-4f22-b7b3-69418b13313e","resolution":{"observed_at":"2026-07-13T11:14:37.619203Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","version":3},"cited_work":{"arxiv_id":"2504.17838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17838","snapshot_observed_at":"2026-07-04T13:59:52.270237Z","title":"Carl: Learning scalable planning policies with simple rewards","venue":null,"work_id":"acecd357-7fb2-44ad-bf5b-7be64dce857a","year":2025},"citing_paper":{"arxiv_id":"2604.08535","last_updated":"2026-04-09T17:59:18Z","snapshot_observed_at":"2026-07-06T22:57:35.435713Z","submitted_at":"2026-04-09T17:59:18Z","title":"Fail2Drive: Benchmarking Closed-Loop Driving Generalization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T17:19:01.704384Z"},"links":{"cited_paper":"/paper/2504.17838","citing_paper":"/paper/2604.08535"},"observation_digest":"sha256:b08202879ba59aaaeb81e24a2645f1fd013283ff9d360f71b77bec3ba30deeea","observation_id":"9b6d7338-4464-4b64-8677-b4786c7c01b3","resolution":{"observed_at":"2026-05-11T07:06:00.592800Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","version":3},"cited_work":{"arxiv_id":"2504.17838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17838","snapshot_observed_at":"2026-07-04T13:59:52.270237Z","title":"Carl: Learning scalable planning policies with simple rewards","venue":null,"work_id":"acecd357-7fb2-44ad-bf5b-7be64dce857a","year":2025},"citing_paper":{"arxiv_id":"2605.10034","last_updated":"2026-05-11T05:59:49Z","snapshot_observed_at":"2026-08-02T08:50:18.136920Z","submitted_at":"2026-05-11T05:59:49Z","title":"Beyond Self-Play and Scale: A Behavior Benchmark for Generalization in Autonomous Driving","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-12T03:31:25.453515Z"},"links":{"cited_paper":"/paper/2504.17838","citing_paper":"/paper/2605.10034"},"observation_digest":"sha256:c60e1e37af4aff86455382cceff18d980ee96e3dc54910c03cc170763cb44114","observation_id":"9d25453d-cff1-442c-88d1-99b20e707ad9","resolution":{"observed_at":"2026-05-12T07:16:30.361471Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","version":3},"cited_work":{"arxiv_id":"2504.17838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17838","snapshot_observed_at":"2026-07-04T13:59:52.270237Z","title":"Carl: Learning scalable planning policies with simple rewards","venue":null,"work_id":"acecd357-7fb2-44ad-bf5b-7be64dce857a","year":2025},"citing_paper":{"arxiv_id":"2605.14201","last_updated":"2026-05-19T23:20:07Z","snapshot_observed_at":"2026-07-06T23:25:39.415637Z","submitted_at":"2026-05-13T23:35:14Z","title":"MAPLE: Latent Multi-Agent Play for End-to-End Autonomous Driving","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-15T04:41:07.402168Z"},"links":{"cited_paper":"/paper/2504.17838","citing_paper":"/paper/2605.14201"},"observation_digest":"sha256:7fdcdb6233d2284c5da755f91ead7d6b2e3a25aa3522a13a89d97435c78509f2","observation_id":"813d3636-a4bb-4489-ae9d-6ceeb22c4fbb","resolution":{"observed_at":"2026-05-15T04:45:01.098432Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","version":3},"cited_work":{"arxiv_id":"2504.17838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17838","snapshot_observed_at":"2026-07-04T13:59:52.270237Z","title":"Carl: Learning scalable planning policies with simple rewards","venue":null,"work_id":"acecd357-7fb2-44ad-bf5b-7be64dce857a","year":2025},"citing_paper":{"arxiv_id":"2605.14201","last_updated":"2026-05-19T23:20:07Z","snapshot_observed_at":"2026-07-06T23:25:39.415637Z","submitted_at":"2026-05-13T23:35:14Z","title":"MAPLE: Latent Multi-Agent Play for End-to-End Autonomous Driving","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-21T07:48:52.168457Z"},"links":{"cited_paper":"/paper/2504.17838","citing_paper":"/paper/2605.14201"},"observation_digest":"sha256:a8d1efa5529efe0cd063b6ab2a57dac79e83a42849f858d80356ebd96667bfdf","observation_id":"e01fa9b1-c60b-4ba6-b6f7-05985bb9b51d","resolution":{"observed_at":"2026-05-21T07:49:49.990219Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","version":3},"cited_work":{"arxiv_id":"2504.17838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17838","snapshot_observed_at":"2026-07-04T13:59:52.270237Z","title":"Carl: Learning scalable planning policies with simple rewards","venue":null,"work_id":"acecd357-7fb2-44ad-bf5b-7be64dce857a","year":2025},"citing_paper":{"arxiv_id":"2605.16737","last_updated":"2026-05-16T01:21:30Z","snapshot_observed_at":"2026-08-03T19:45:20.069309Z","submitted_at":"2026-05-16T01:21:30Z","title":"DriveSafer: End-to-End Autonomous Driving with Safety Guidance","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-19T21:43:25.406524Z"},"links":{"cited_paper":"/paper/2504.17838","citing_paper":"/paper/2605.16737"},"observation_digest":"sha256:b3fd640b18bd652a5dfdfb01660491eccd6d6965d39cf41085e34d10acff102d","observation_id":"f7174094-d128-4f74-a8bf-b9a81d72064f","resolution":{"observed_at":"2026-05-19T21:47:48.699813Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","version":3},"cited_work":{"arxiv_id":"2504.17838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17838","snapshot_observed_at":"2026-07-04T13:59:52.270237Z","title":"Carl: Learning scalable planning policies with simple rewards","venue":null,"work_id":"acecd357-7fb2-44ad-bf5b-7be64dce857a","year":2025},"citing_paper":{"arxiv_id":"2606.19641","last_updated":"2026-06-19T17:53:33Z","snapshot_observed_at":"2026-08-02T19:40:05.899913Z","submitted_at":"2026-06-17T22:39:11Z","title":"Scaling Self-Play for End-to-End Driving","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-26T20:22:03.938518Z"},"links":{"cited_paper":"/paper/2504.17838","citing_paper":"/paper/2606.19641"},"observation_digest":"sha256:a64b729850ed3ef8bd3de97c53b76336bad8ae77be70eaaddb404f8e24702860","observation_id":"29775f65-6292-45d0-95d9-c0df84ef79d6","resolution":{"observed_at":"2026-07-04T01:29:22.337007Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","version":3},"cited_work":{"arxiv_id":"2504.17838","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17838","snapshot_observed_at":"2026-07-04T13:59:52.270237Z","title":"Carl: Learning scalable planning policies with simple rewards","venue":null,"work_id":"acecd357-7fb2-44ad-bf5b-7be64dce857a","year":2025},"citing_paper":{"arxiv_id":"2606.26858","last_updated":"2026-06-25T10:42:15Z","snapshot_observed_at":"2026-07-07T00:01:10.711037Z","submitted_at":"2026-06-25T10:42:15Z","title":"PlanRL: A Trajectory Planning Architecture for Reinforcement Learning-based Driving Experts","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T04:44:08.377384Z"},"links":{"cited_paper":"/paper/2504.17838","citing_paper":"/paper/2606.26858"},"observation_digest":"sha256:55ed27cec9e793a80835688207cd7a87c4ce7e027744a9a0202b57cba404922b","observation_id":"efe9097f-183a-45b2-9ca0-f806f1d146e0","resolution":{"observed_at":"2026-07-04T13:59:52.271864Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17838","snapshot_observed_at":"2026-07-12T06:40:47.686215Z","title":"Jaeger, D","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02841","last_updated":"2026-07-03T00:34:50Z","snapshot_observed_at":"2026-07-12T06:40:47.425874Z","submitted_at":"2026-07-03T00:34:50Z","title":"CLEAR: Closed-Loop Reinforcement Learning at Scale for End-to-End Autonomous Driving","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-12T06:40:47.686215Z"},"links":{"cited_paper":"/paper/2504.17838","citing_paper":"/paper/2607.02841"},"observation_digest":"sha256:509b77a0762257b72b4ec47d9d49a01e2bf0b613b08dcc951a7a3d53c78145ac","observation_id":"e2ac9611-57a9-4f69-8dca-5daa9c4378b3","resolution":{"observed_at":"2026-07-12T06:40:47.686215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.17838/citation-record","integrity":"/paper/2504.17838/integrity","json":"/paper/2504.17838/citation-record.json","paper":"/paper/2504.17838"},"outbound":[],"paper":{"arxiv_id":"2504.17838","last_updated":"2025-08-20T19:00:45Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T21:14:24.007428Z","submitted_at":"2025-04-24T17:56:01Z","title":"CaRL: Learning Scalable Planning Policies with Simple Rewards"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2504.17838."}