{"as_of":"2026-08-07T12:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c743ab0c14735e0ca2f3de6749df95f4e60c4f01ac9d9d90c8465ef4b663ab3a","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-07T06:34:17.273281+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-07-31T21:55:17.309418Z","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-02T12:16:56.911098Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.03792","last_updated":"2025-06-03T12:14:42Z","snapshot_observed_at":"2026-07-06T21:19:53.873736Z","submitted_at":"2025-05-01T14:17:53Z","title":"Towards Efficient Online Tuning of VLM Agents via Counterfactual Soft Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2505.03792","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.03792","snapshot_observed_at":"2026-07-02T12:16:56.911098Z","title":"arXiv preprint arXiv:2505.03792 , year=","venue":null,"work_id":"a011737c-856f-48d9-ab1d-698e0fe83352","year":null},"citing_paper":{"arxiv_id":"2605.00347","last_updated":"2026-05-01T02:05:56Z","snapshot_observed_at":"2026-07-06T23:13:47.082550Z","submitted_at":"2026-05-01T02:05:56Z","title":"Odysseus: Scaling VLMs to 100+ Turn Decision-Making in Games via Reinforcement Learning","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-05-09T20:22:58.061772Z"},"links":{"cited_paper":"/paper/2505.03792","citing_paper":"/paper/2605.00347"},"observation_digest":"sha256:d21171721c8e597f31c5080e202457d22924cde54191229716c9ed4a36df84f0","observation_id":"5bd1a5f0-d1bd-45c8-99e5-55f276d9e0e9","resolution":{"observed_at":"2026-05-11T15:16:08.961965Z","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":"2505.03792","last_updated":"2025-06-03T12:14:42Z","snapshot_observed_at":"2026-07-06T21:19:53.873736Z","submitted_at":"2025-05-01T14:17:53Z","title":"Towards Efficient Online Tuning of VLM Agents via Counterfactual Soft Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2505.03792","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.03792","snapshot_observed_at":"2026-07-02T12:16:56.911098Z","title":"arXiv preprint arXiv:2505.03792 , year=","venue":null,"work_id":"a011737c-856f-48d9-ab1d-698e0fe83352","year":null},"citing_paper":{"arxiv_id":"2605.06642","last_updated":"2026-05-07T17:51:16Z","snapshot_observed_at":"2026-07-06T23:19:05.764765Z","submitted_at":"2026-05-07T17:51:16Z","title":"StraTA: Incentivizing Agentic Reinforcement Learning with Strategic Trajectory Abstraction","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-08T09:59:48.604813Z"},"links":{"cited_paper":"/paper/2505.03792","citing_paper":"/paper/2605.06642"},"observation_digest":"sha256:16aa98f4b683d122d3cbcd5903f88fc77bf3a53d94d5a6974cf6111b612cecf0","observation_id":"6b48a64f-f88f-4bbb-acb2-db4e987ba59b","resolution":{"observed_at":"2026-05-11T20:11:12.127979Z","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":"2505.03792","last_updated":"2025-06-03T12:14:42Z","snapshot_observed_at":"2026-07-06T21:19:53.873736Z","submitted_at":"2025-05-01T14:17:53Z","title":"Towards Efficient Online Tuning of VLM Agents via Counterfactual Soft Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2505.03792","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.03792","snapshot_observed_at":"2026-07-02T12:16:56.911098Z","title":"arXiv preprint arXiv:2505.03792 , year=","venue":null,"work_id":"a011737c-856f-48d9-ab1d-698e0fe83352","year":null},"citing_paper":{"arxiv_id":"2606.02355","last_updated":"2026-06-01T15:02:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-06-01T15:02:59Z","title":"SIRI: Self-Internalizing Reinforcement Learning with Intrinsic Skills for LLM Agent Training","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-28T14:33:00.408984Z"},"links":{"cited_paper":"/paper/2505.03792","citing_paper":"/paper/2606.02355"},"observation_digest":"sha256:abe7a43760e96f33c3bfbd53495377cb9b3e9f0841199d036345b36b1d32c957","observation_id":"e0c6c9f2-3dda-46d5-8b59-7eb88bd81ba9","resolution":{"observed_at":"2026-07-01T23:16:23.920593Z","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":"2505.03792","last_updated":"2025-06-03T12:14:42Z","snapshot_observed_at":"2026-07-06T21:19:53.873736Z","submitted_at":"2025-05-01T14:17:53Z","title":"Towards Efficient Online Tuning of VLM Agents via Counterfactual Soft Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2505.03792","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.03792","snapshot_observed_at":"2026-07-02T12:16:56.911098Z","title":"arXiv preprint arXiv:2505.03792 , year=","venue":null,"work_id":"a011737c-856f-48d9-ab1d-698e0fe83352","year":null},"citing_paper":{"arxiv_id":"2606.05885","last_updated":"2026-06-04T08:54:09Z","snapshot_observed_at":"2026-08-01T19:07:49.288895Z","submitted_at":"2026-06-04T08:54:09Z","title":"When Denser Credit Is Not Enough: Evidence-Calibrated Policy Optimization for Long-Horizon LLM Agent Training","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-28T02:17:32.324432Z"},"links":{"cited_paper":"/paper/2505.03792","citing_paper":"/paper/2606.05885"},"observation_digest":"sha256:c09ef2a1ff8de574d30cf0c7e2d46254ce3429389a220836329570b243ba8caa","observation_id":"3c679b43-a9f6-4690-8251-134ba644d44a","resolution":{"observed_at":"2026-07-02T12:16:56.912931Z","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":"2505.03792","last_updated":"2025-06-03T12:14:42Z","snapshot_observed_at":"2026-07-06T21:19:53.873736Z","submitted_at":"2025-05-01T14:17:53Z","title":"Towards Efficient Online Tuning of VLM Agents via Counterfactual Soft Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03792","snapshot_observed_at":"2026-07-31T21:55:17.309418Z","title":"arXiv preprint arXiv:2505.03792 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27967","last_updated":"2026-07-30T10:14:24Z","snapshot_observed_at":"2026-08-05T12:14:09.489312Z","submitted_at":"2026-07-30T10:14:24Z","title":"MARS-RA: Rank Aggregation for Credit Assignment via Multimodal Comparisons in Embodied Multi-Agent Cooperation","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-31T21:55:17.309418Z"},"links":{"cited_paper":"/paper/2505.03792","citing_paper":"/paper/2607.27967"},"observation_digest":"sha256:4d62467b352f89d2b412fe8055c87fcf291f25d14e8ea8a809f5a166560b4436","observation_id":"f948133b-c362-4c92-aa50-e1a8598e1a00","resolution":{"observed_at":"2026-07-31T21:55:17.309418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.03792/citation-record","integrity":"/paper/2505.03792/integrity","json":"/paper/2505.03792/citation-record.json","paper":"/paper/2505.03792"},"outbound":[],"paper":{"arxiv_id":"2505.03792","last_updated":"2025-06-03T12:14:42Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T21:19:53.873736Z","submitted_at":"2025-05-01T14:17:53Z","title":"Towards Efficient Online Tuning of VLM Agents via Counterfactual Soft 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-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 5 inbound Pith citation observations for arXiv:2505.03792."}