{"as_of":"2026-08-08T07:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b8d79311511f8a4b5a7cfc946d7fb871e53a7c3abc1b42e781e25f5694dbf1b","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:04:55.685878Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T12:17:04.321971Z","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-03T04:17:36.934090Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"cited_work":{"arxiv_id":"2505.22866","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.22866","snapshot_observed_at":"2026-07-03T04:17:36.934090Z","title":"Scaling offline rl via efficient and expressive shortcut models","venue":null,"work_id":"b3e2db6e-179b-437f-ac0d-37122e76bb78","year":2025},"citing_paper":{"arxiv_id":"2603.04333","last_updated":"2026-05-08T20:08:31Z","snapshot_observed_at":"2026-07-31T16:31:42.095039Z","submitted_at":"2026-03-04T17:51:30Z","title":"What Does Flow Matching Bring To TD Learning?","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-15T16:32:29.432272Z"},"links":{"cited_paper":"/paper/2505.22866","citing_paper":"/paper/2603.04333"},"observation_digest":"sha256:31912aa2fd7aa6ec29eddce03d2cc205392b68b0d17258827b67f349d7901f32","observation_id":"67a8b9cf-f114-4a01-a816-1b8e8c6fe278","resolution":{"observed_at":"2026-05-15T16:36:17.986049Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"cited_work":{"arxiv_id":"2505.22866","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.22866","snapshot_observed_at":"2026-07-03T04:17:36.934090Z","title":"Scaling offline rl via efficient and expressive shortcut models","venue":null,"work_id":"b3e2db6e-179b-437f-ac0d-37122e76bb78","year":2025},"citing_paper":{"arxiv_id":"2604.22229","last_updated":"2026-04-24T05:07:09Z","snapshot_observed_at":"2026-07-06T23:08:42.301487Z","submitted_at":"2026-04-24T05:07:09Z","title":"Preserve Support, Not Correspondence: Dynamic Routing for Offline Reinforcement Learning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-08T12:24:01.571564Z"},"links":{"cited_paper":"/paper/2505.22866","citing_paper":"/paper/2604.22229"},"observation_digest":"sha256:4b8aafcb42bbdb5baf2efbd0d807c9ec1205e6f5e628ef087332d14d738b9f0b","observation_id":"6b2e358b-b27b-4197-8b2c-a6eb659a33a3","resolution":{"observed_at":"2026-05-11T19:16:09.425693Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"cited_work":{"arxiv_id":"2505.22866","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.22866","snapshot_observed_at":"2026-07-03T04:17:36.934090Z","title":"Scaling offline rl via efficient and expressive shortcut models","venue":null,"work_id":"b3e2db6e-179b-437f-ac0d-37122e76bb78","year":2025},"citing_paper":{"arxiv_id":"2605.01356","last_updated":"2026-05-02T09:59:24Z","snapshot_observed_at":"2026-07-06T23:14:38.379875Z","submitted_at":"2026-05-02T09:59:24Z","title":"Model-Based Proactive Cost Generation for Learning Safe Policies Offline with Limited Violation Data","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-09T14:24:58.919333Z"},"links":{"cited_paper":"/paper/2505.22866","citing_paper":"/paper/2605.01356"},"observation_digest":"sha256:30a2b474af466f3cead59d6d18b858e6ab86a53f9d08aa793b09ced4743b3cbb","observation_id":"5fd8890f-441e-4d41-b52f-05ad8b1e8aeb","resolution":{"observed_at":"2026-05-11T16:56:07.788332Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"cited_work":{"arxiv_id":"2505.22866","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.22866","snapshot_observed_at":"2026-07-03T04:17:36.934090Z","title":"Scaling offline rl via efficient and expressive shortcut models","venue":null,"work_id":"b3e2db6e-179b-437f-ac0d-37122e76bb78","year":2025},"citing_paper":{"arxiv_id":"2605.01663","last_updated":"2026-05-28T02:21:27Z","snapshot_observed_at":"2026-07-06T23:14:52.417213Z","submitted_at":"2026-05-03T01:32:11Z","title":"Towards Efficient and Expressive Offline RL via Flow-Anchored Noise-conditioned Q-Learning","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-05-10T16:25:25.739019Z"},"links":{"cited_paper":"/paper/2505.22866","citing_paper":"/paper/2605.01663"},"observation_digest":"sha256:9339d80af833f06ae7a98f85aa2371f092037d75a93807df5f149296e8d379a3","observation_id":"b62d35ee-eaa3-4a8f-a7ea-27eb0c906cf7","resolution":{"observed_at":"2026-05-11T08:56:00.551299Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"cited_work":{"arxiv_id":"2505.22866","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.22866","snapshot_observed_at":"2026-07-03T04:17:36.934090Z","title":"Scaling offline rl via efficient and expressive shortcut models","venue":null,"work_id":"b3e2db6e-179b-437f-ac0d-37122e76bb78","year":2025},"citing_paper":{"arxiv_id":"2605.07727","last_updated":"2026-05-08T13:34:27Z","snapshot_observed_at":"2026-07-06T23:20:06.574823Z","submitted_at":"2026-05-08T13:34:27Z","title":"Drifting Field Policy: A One-Step Generative Policy via Wasserstein Gradient Flow","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-11T02:16:36.302353Z"},"links":{"cited_paper":"/paper/2505.22866","citing_paper":"/paper/2605.07727"},"observation_digest":"sha256:f4ebd1bca0f34c8073c5ee494ab668c5f5ce8f37a4b1b822ac46d7854fed03ec","observation_id":"60aa35dd-c787-4058-b7aa-5408e5df6036","resolution":{"observed_at":"2026-05-11T03:50:53.985389Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"cited_work":{"arxiv_id":"2505.22866","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.22866","snapshot_observed_at":"2026-07-03T04:17:36.934090Z","title":"Scaling offline rl via efficient and expressive shortcut models","venue":null,"work_id":"b3e2db6e-179b-437f-ac0d-37122e76bb78","year":2025},"citing_paper":{"arxiv_id":"2606.11087","last_updated":"2026-06-09T16:45:57Z","snapshot_observed_at":"2026-08-02T20:45:09.177143Z","submitted_at":"2026-06-09T16:45:57Z","title":"Test-Time Gradient Guidance of Flow Policies in Reinforcement Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T14:05:01.073951Z"},"links":{"cited_paper":"/paper/2505.22866","citing_paper":"/paper/2606.11087"},"observation_digest":"sha256:5fca143a47dc1be557dbdde750aad574f60d3d46e1d3a7cebb2aca2867c87058","observation_id":"808728ea-225b-4e6d-abcd-6725603d6591","resolution":{"observed_at":"2026-07-03T04:17:36.936386Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22866","snapshot_observed_at":"2026-07-14T12:17:04.321971Z","title":"Espinosa-Dice, Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10369","last_updated":"2026-07-11T15:45:12Z","snapshot_observed_at":"2026-08-06T15:16:44.357534Z","submitted_at":"2026-07-11T15:45:12Z","title":"VINE: Taming Generative Control Policies for Reinforcement Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-14T12:17:04.321971Z"},"links":{"cited_paper":"/paper/2505.22866","citing_paper":"/paper/2607.10369"},"observation_digest":"sha256:cc2fb0f85eabe389b70c7bb7033692693f92f20e3b1d5a99484bdef6381ba696","observation_id":"d005ac5f-b984-4097-bbba-cd9df75f9fdc","resolution":{"observed_at":"2026-07-14T12:17:04.321971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.22866/citation-record","integrity":"/paper/2505.22866/integrity","json":"/paper/2505.22866/citation-record.json","paper":"/paper/2505.22866"},"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-07T13:04:59.693997Z","title":null,"venue":null,"work_id":"93032a42-1a09-41b8-bd26-4c3a7eba02b4","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:54.008617Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:0020d632d52b8bc7b8647ba77339e9168e3f55b0a19a8bb2bd2c3db604e66106","observation_id":"2bcffc4b-efa7-4150-abc0-88d8d6f4e393","resolution":{"observed_at":"2026-08-07T13:04:59.771175Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:59.407187Z","title":null,"venue":null,"work_id":"3ed0c0ee-218b-4851-98ca-d709312f9078","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:54.085101Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:3d74c9af3203ce5e3a7682ae80b12b0de346ca13dd437605b5022ad772c5024f","observation_id":"9d8e54ce-495f-4093-bda3-e90ad6df4e99","resolution":{"observed_at":"2026-08-07T13:04:59.538726Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:59.174489Z","title":null,"venue":null,"work_id":"bbf2adaa-1fd5-4b8a-8fe7-7a94b123b1e6","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:54.162523Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:5c08c735c915e27b9db8d609f88b5f3058a98505045c15845e4c734684a97af7","observation_id":"023d076a-117e-464f-85a4-31c0588db425","resolution":{"observed_at":"2026-08-07T13:04:59.288744Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:56.612475Z","title":null,"venue":null,"work_id":"7b05b98f-3179-4d07-89ef-737ec2c16ff0","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:55.393502Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:d3a83c0be5e117477fd5ff4803b978344170bc50cedc1c8385caea53164f1774","observation_id":"e522440f-3cbf-4a19-bd80-6c0ed38bd1ce","resolution":{"observed_at":"2026-08-07T13:04:56.720944Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:56.393948Z","title":null,"venue":null,"work_id":"cbff4e7c-7c1f-4f13-a333-f539f47da554","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:55.457050Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:7a54a24ced50db4ba697309df740a6babd39c3a7a9a4523972daebb2227c4072","observation_id":"742d3c69-6cc1-4563-896e-5119bde0bce6","resolution":{"observed_at":"2026-08-07T13:04:56.454551Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:56.223256Z","title":null,"venue":null,"work_id":"9cc49a80-5e4c-448c-ad4c-781761ad3a57","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:55.528442Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:3d57cb1befc8f10588e8efe274df64d0e24e7699353ff960baff73fe201cd034","observation_id":"8c501f48-b4ff-4d9e-a01a-95c6c8d76bcf","resolution":{"observed_at":"2026-08-07T13:04:56.303288Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:58.913794Z","title":null,"venue":null,"work_id":"c50127aa-c452-4382-8f5f-2628a18e3d0f","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:54.257695Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:01883f43d553d1678e3df0074e362c93d583d9995cf1c8e182e07a69d90f02c6","observation_id":"cd549d77-3d2f-4196-ac15-81e7e4699223","resolution":{"observed_at":"2026-08-07T13:04:59.011606Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:58.688193Z","title":null,"venue":null,"work_id":"37876dc0-9d62-411b-a9cf-104c024f1b5d","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:54.322888Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:c6b3e9f6f5040245489a137ba66e9ae2c501f85206c2e280e8fe4031faa81b55","observation_id":"46b437c3-9c40-4759-9e6c-3224a8c10247","resolution":{"observed_at":"2026-08-07T13:04:58.790235Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:58.515879Z","title":null,"venue":null,"work_id":"3ed0a679-b64a-4673-801a-d7d7c44ca612","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:54.397763Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:6b1f3242e8b56804944ed7257519666a26d4dc415b6335dc48ca415471c0c590","observation_id":"43ea13c5-bbde-4e1e-92b8-421b05e5eef8","resolution":{"observed_at":"2026-08-07T13:04:58.564812Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:58.294946Z","title":null,"venue":null,"work_id":"8945bd5a-9811-4cd3-a987-c8df57fd5c9d","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:54.492746Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:a0772aee507a1374978b71bf292b30cc05bd76b16fb5dc0cec72cdacdad499ab","observation_id":"344ae560-15cf-41ab-aab6-ad415d3db68a","resolution":{"observed_at":"2026-08-07T13:04:58.397043Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:58.096987Z","title":null,"venue":null,"work_id":"ce80553e-8078-419a-823d-b158b52c9b1a","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:54.627151Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:799291ce2c64239c2e2920f38a55137135248cebacddea03c0d551864a52b2be","observation_id":"f02d5dd9-24ea-455d-b05b-67b372066dce","resolution":{"observed_at":"2026-08-07T13:04:58.162275Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:57.884576Z","title":null,"venue":null,"work_id":"80add7cc-af5b-4360-b83d-ee088a15d0a8","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:54.746284Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:2a6e9ac249c36cc2e0ea40fe47beb4c263fad8a10d13f422ed0ae278219ca5e7","observation_id":"4c8d3d30-0299-4e78-836a-449a18cc03e2","resolution":{"observed_at":"2026-08-07T13:04:57.959145Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:57.714429Z","title":null,"venue":null,"work_id":"705c5ee0-12ea-4d42-a6ba-4e857c183d1d","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:54.921891Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:534a06b62221def465c67b1d9662b69b872566bb0360f61c21d6188a324dbf8a","observation_id":"c480bb7d-01a5-41e5-a7aa-e17c49dcdfd4","resolution":{"observed_at":"2026-08-07T13:04:57.778581Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:57.539050Z","title":null,"venue":null,"work_id":"57d11119-6283-4ff1-a930-84bb5dc49ec6","year":2025},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:55.088097Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:1624e34b9c2e14243864e3ed8aec3dffc7d66c592eba1d8d1e0f11d149e3fb7b","observation_id":"6d11bef5-6379-4747-bd7c-6796201614cb","resolution":{"observed_at":"2026-08-07T13:04:57.594815Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:57.343258Z","title":null,"venue":null,"work_id":"e5a7f88a-0b03-4920-86fa-10720bd350f9","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:55.204157Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:7a13910f470c27293dd22f249aff89a1215d9f8abe405602f6e75fae9a74eed7","observation_id":"a73641d5-cd0d-4aec-b81f-a56727d0e908","resolution":{"observed_at":"2026-08-07T13:04:57.399964Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:57.124041Z","title":null,"venue":null,"work_id":"226c8c58-1cd8-44c3-ae94-4fbba8934aab","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:55.266381Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:74a626264ca135a8ae561a9a3c9c83ef522c066c5837bf28341d6b2ee0bf8d4b","observation_id":"1066c606-33be-4495-81a8-2a50473a75c6","resolution":{"observed_at":"2026-08-07T13:04:57.217615Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:56.874769Z","title":null,"venue":null,"work_id":"f2b7f7d6-f4a6-4863-8ca0-f5644e47b524","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:55.345226Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:6da6129d7c0577c474d14d4d4e9528358cdffa0ccd9df719c72379d2bee7047c","observation_id":"8d40e389-845e-4ab3-8063-122077a5909b","resolution":{"observed_at":"2026-08-07T13:04:56.984828Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:56.075558Z","title":null,"venue":null,"work_id":"ea2dab3e-75bd-4076-be81-f348e437a663","year":null},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:55.612420Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:cc79067f2ca9b764616d0bc6395e6983cf77c7687db64dc9ea0ed498293de67e","observation_id":"54681eb2-e625-458b-ad6f-3524279ac117","resolution":{"observed_at":"2026-08-07T13:04:56.119568Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:04:55.930880Z","title":"The antmaze and humanoidmaze tasks involve navigating quadrupedal (8 degrees of freedom (DOF)) and humanoid (21 DOF) agents through complex mazes","venue":null,"work_id":"0fe7613c-5975-4c5a-b86e-751dc8322089","year":2025},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:55.685878Z"},"links":{"citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:d3957bcf704d2b57c16808468fe9d43f36fac60caebaecce5302b45b234a1c3c","observation_id":"14f3c143-9c00-4e7d-ba12-96538013a91b","resolution":{"observed_at":"2026-08-07T13:04:55.986187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11171","last_updated":"2023-03-07T17:57:37Z","snapshot_observed_at":"2026-07-06T12:50:22.773056Z","submitted_at":"2022-03-21T17:48:52Z","title":"Self-Consistency Improves Chain of Thought Reasoning in Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.11171","snapshot_observed_at":"2026-08-07T13:04:53.941254Z","title":"Zhendong Wang, Jonathan J Hunt, and Mingyuan Zhou","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:53.941254Z"},"links":{"cited_paper":"/paper/2203.11171","citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:016aa948cecda17c629e2ea3b54fcf641798792091eaac15a2f2e5dceead706f","observation_id":"295d784e-be32-4f4c-a1a2-428bbc6c9508","resolution":{"observed_at":"2026-08-07T13:04:53.941254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21787","last_updated":"2024-12-30T19:03:24Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:57:25Z","title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21787","snapshot_observed_at":"2026-08-07T13:04:53.782606Z","title":"Qingwen Bu, Jisong Cai, Li Chen, Xiuqi Cui, Yan Ding, Siyuan Feng, Shenyuan Gao, Xindong He, Xu Huang, Shu Jiang, et al","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:53.782606Z"},"links":{"cited_paper":"/paper/2407.21787","citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:829926077142526460ce7f57850c002fc0a0dbcb4c648de0c4ac4a98ef7aac9d","observation_id":"1bfc959f-2918-4db2-8eb7-157f4e7d59e8","resolution":{"observed_at":"2026-08-07T13:04:53.782606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-07T13:04:53.861977Z","title":"Zihan Ding and Chi Jin","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T13:04:53.861977Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2505.22866"},"observation_digest":"sha256:602a0c9e6cf021cf590d8f0e57aa3fe1e80944b3e41f70e7e7b0e9db750ea614","observation_id":"d8620597-0053-4b65-aa6f-eca74fbc09c2","resolution":{"observed_at":"2026-08-07T13:04:53.861977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.22866","last_updated":"2025-05-28T20:59:22Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T12:56:17.301228Z","submitted_at":"2025-05-28T20:59:22Z","title":"Scaling Offline RL via Efficient and Expressive Shortcut Models"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":22},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 7 inbound Pith citation observations for arXiv:2505.22866."}