{"as_of":"2026-08-08T03:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:767843ac54ad8094de42bfc66869cef9c1505863be9d7b8fa07d91760d053852","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:23:00.162942Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.01321/citation-record","integrity":"/paper/2608.01321/integrity","json":"/paper/2608.01321/citation-record.json","paper":"/paper/2608.01321"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.19470","last_updated":"2025-09-23T03:45:42Z","snapshot_observed_at":"2026-07-06T20:58:19.305457Z","submitted_at":"2025-03-25T09:00:58Z","title":"ReSearch: Learning to Reason with Search for LLMs via Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19470","snapshot_observed_at":"2026-08-06T00:23:00.109913Z","title":"Backtoba- sics:RevisitingREINFORCE-styleoptimizationforlearning from human feedback in LLMs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.109913Z"},"links":{"cited_paper":"/paper/2503.19470","citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:e7c7473ae64489048fd851eb79338eaa95770510d71a4eee44d64f9f940d30df","observation_id":"828498eb-f873-491f-815d-cd19cac53b4c","resolution":{"observed_at":"2026-08-06T00:23:00.109913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.03262","last_updated":"2025-11-10T15:11:13Z","snapshot_observed_at":"2026-08-02T05:27:47.490711Z","submitted_at":"2025-01-04T02:08:06Z","title":"REINFORCE++: Stabilizing Critic-Free Policy Optimization with Global Advantage Normalization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.03262","snapshot_observed_at":"2026-08-06T00:23:00.117039Z","title":"Jiang,Z.;Xu,F.F.;Gao,L.;Sun,Z.;Liu,Q.;Dwivedi-Yu,J.; Yang, Y.; Callan, J.; and Neubig, G","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.117039Z"},"links":{"cited_paper":"/paper/2501.03262","citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:4f8710bb4c7d9139da70504701a11e2a94e365647cf2501378d7b3b9cc7721f4","observation_id":"1fc66052-b943-45b5-ab6c-269720f14cb2","resolution":{"observed_at":"2026-08-06T00:23:00.117039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.09516","last_updated":"2025-08-05T19:08:38Z","snapshot_observed_at":"2026-07-06T20:51:28.022519Z","submitted_at":"2025-03-12T16:26:39Z","title":"Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.09516","snapshot_observed_at":"2026-08-06T00:23:00.123845Z","title":"Joshi, M.; Choi, E.; Weld, D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.123845Z"},"links":{"cited_paper":"/paper/2503.09516","citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:07605658b139d4d88759100bb37de6b5168f589df220568aaa8eebc987de0494","observation_id":"2324ed5f-44c1-41d5-8d9b-e0124c11a7a7","resolution":{"observed_at":"2026-08-06T00:23:00.123845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.20783","last_updated":"2025-10-06T09:30:03Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-26T17:59:14Z","title":"Understanding R1-Zero-Like Training: A Critical Perspective","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.20783","snapshot_observed_at":"2026-08-06T00:23:00.130178Z","title":"Mallen, A.; Asai, A.; Zhong, V.; Das, R.; Khashabi, D.; andHajishirzi,H.2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.130178Z"},"links":{"cited_paper":"/paper/2503.20783","citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:a77d64febb6679019c33cc18ee3086f870d708f8ef6828b26626120c30744402","observation_id":"4ed8254b-9de0-41ec-acd8-8dad457a9712","resolution":{"observed_at":"2026-08-06T00:23:00.130178Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-06T00:23:00.137252Z","title":"Sun, H.; Qiao, Z.; Guo, J.; Fan, X.; Hou, Y.; Jiang, Y.; Xie, P.; Zhang, Y.; Huang, F.; and Zhou, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.137252Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:7498b3a109c4120c79c8d8f170679675d7c56d539952d2066946193d46168d84","observation_id":"54838590-61cf-454f-8670-8d2ccc0da793","resolution":{"observed_at":"2026-08-06T00:23:00.137252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04588","last_updated":"2026-05-19T11:51:42Z","snapshot_observed_at":"2026-08-04T18:36:41.979541Z","submitted_at":"2025-05-07T17:30:22Z","title":"ZeroSearch: Incentivize the Search Capability of LLMs without Searching","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.04588","snapshot_observed_at":"2026-08-06T00:23:00.140200Z","title":"arXiv preprint arXiv:2505.04588","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.140200Z"},"links":{"cited_paper":"/paper/2505.04588","citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:b31ae3d33942d57fb49be079f9e1d720c74a8fb0206e293a906f0bafd7777b90","observation_id":"fac8333a-c316-4e68-9ba0-c7d119a48a70","resolution":{"observed_at":"2026-08-06T00:23:00.140200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:00.143198Z","title":"Wang, L.; Yang, N.; Huang, X.; Jiao, B.; Yang, L.; Jiang, D.; Majumder, R.; and Wei, F","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.143198Z"},"links":{"citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:fc3c192b641c20a1831e45ed2856b965c13fa22307e3a82edeb92f1602648b40","observation_id":"7eead41a-c95b-439f-a402-970b014088c5","resolution":{"observed_at":"2026-08-06T00:23:00.143198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15821","last_updated":"2024-05-23T14:01:44Z","snapshot_observed_at":"2026-07-06T18:19:33.945119Z","submitted_at":"2024-05-23T14:01:44Z","title":"Reinforcing Language Agents via Policy Optimization with Action Decomposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15821","snapshot_observed_at":"2026-08-06T00:23:00.148968Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.148968Z"},"links":{"cited_paper":"/paper/2405.15821","citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:be2df05695a0cf4041f3b4368e24ec714b612c075c042cca1af4b13301ef98d8","observation_id":"053a9567-4e62-4d7c-8e96-0d99d0544034","resolution":{"observed_at":"2026-08-06T00:23:00.148968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-06T00:23:00.151924Z","title":"Yang,Z.;Qi,P.;Zhang,S.;Bengio,Y.;Cohen,W.;Salakhut- dinov, R.; and Manning, C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.151924Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:b926abab975898402fe19c64c636cf58557b54b343c7bb8b2281a8c2d585fd90","observation_id":"1f78da99-5f49-44e7-9fec-3d8576722e6b","resolution":{"observed_at":"2026-08-06T00:23:00.151924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:00.396390Z","title":"InNeurIPS 2022 Foundation Models for Decision Making Workshop","venue":null,"work_id":"51afff6a-db3d-4e56-b483-5a677a7a1579","year":2022},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.157447Z"},"links":{"citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:6fbf1daf8b7ac4169243c5be712fb7cd5e0a4281c811eaf32c8551b7df9e8b97","observation_id":"fe2fda9b-e2ce-4d22-be87-1e3fc4ded146","resolution":{"observed_at":"2026-08-06T00:23:00.399638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:00.384692Z","title":"In ICML 2025 Workshop on Computer Use Agents","venue":null,"work_id":"b2d8bf04-962d-4d84-b856-5cb064424849","year":2025},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.160235Z"},"links":{"citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:7e1ac79bb16a426dcbb58bbec7ffd1ea1f313e23bb07ac815b65ffd5f3365d64","observation_id":"aabd6d07-53ca-4b02-af6b-a508bb1fd43a","resolution":{"observed_at":"2026-08-06T00:23:00.389492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:00.372777Z","title":"InProceedings of the 2025 Confer- ence on Empirical Methods in Natural Language Processing, 21816–21841","venue":null,"work_id":"cae008ae-f550-4962-a9f4-1c16879c9d83","year":2025},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.162942Z"},"links":{"citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:1c8de8ceb59178beec6a902b3b847404fb3767089c2ca17a7a928d3cb48e7628","observation_id":"ebf1ba2b-c5d1-4386-b796-807fafb4c366","resolution":{"observed_at":"2026-08-06T00:23:00.377564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-06T00:23:00.133989Z","title":"arXiv preprint arXiv:1707.06347","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.133989Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:6f557379d90ca3587f4525f21931120d4e3afb85235069bb5252468b7886d1f2","observation_id":"9c58b0a2-0fd5-4258-bb44-c937ea41054c","resolution":{"observed_at":"2026-08-06T00:23:00.133989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:00.407653Z","title":"In Proceedings of the 2018 conference on empirical methods in natural language processing, 2369–2380","venue":null,"work_id":"eca9b5d4-a2fe-4e74-b88b-bb96aba1d35a","year":2018},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.154757Z"},"links":{"citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:8b3662245597493e6fc560004b330ca99e11489845b33bf0cc0a9b58a760016d","observation_id":"58553e72-ee85-4c9b-9af2-bea56fb89c94","resolution":{"observed_at":"2026-08-06T00:23:00.411588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2212.03533","last_updated":"2024-02-22T06:21:51Z","snapshot_observed_at":"2026-07-06T14:27:46.217000Z","submitted_at":"2022-12-07T09:25:54Z","title":"Text Embeddings by Weakly-Supervised Contrastive Pre-training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.03533","snapshot_observed_at":"2026-08-06T00:23:00.146060Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.146060Z"},"links":{"cited_paper":"/paper/2212.03533","citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:559e82f4e509c70a5cddd461cd60dbb60fc9818bc82a8c212d4205a99e5e7b35","observation_id":"269a7463-30bc-4e64-b3c6-aad7d2240ab7","resolution":{"observed_at":"2026-08-06T00:23:00.146060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:00.430431Z","title":"InProceedings of the 2023 confer- ence on empirical methods in natural language processing, 7969–7992","venue":null,"work_id":"569fd9c4-89cf-42cc-850d-54131ad3cfa2","year":2023},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.120988Z"},"links":{"citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:6ba0a72b500bce35562659af8ebcafee2ea11e7ec83f93100e407b79ddcd2747","observation_id":"9bbefeee-8fc6-4413-8c83-a0055cadfee8","resolution":{"observed_at":"2026-08-06T00:23:00.434793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:23:00.418940Z","title":"InInternational Con- ference on Learning Representations, volume 2024, 39578– 39601","venue":null,"work_id":"aaa4e458-19ef-4225-8eb7-9f2224a3908b","year":2024},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.127289Z"},"links":{"citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:9ee6a53aabfcd12d05e3a111fb52fb971b8bde76d8085b88a21fd9620e6d8842","observation_id":"9ed19f1d-5a8c-4e86-8486-be834c8fd118","resolution":{"observed_at":"2026-08-06T00:23:00.422682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"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-06T00:23:00.113660Z","title":"Hao, Y.; Jin, Z.; Liao, H.; Liu, K.; and Zhao, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-06T00:23:00.113660Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2608.01321"},"observation_digest":"sha256:767f16a17223b3e61251c8ed1c6cc7ed53488fc91b845594ce605849223b8e37","observation_id":"d1ab04ea-6565-4e90-abc7-2dff849bfadb","resolution":{"observed_at":"2026-08-06T00:23:00.113660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.01321","last_updated":"2026-08-02T15:41:57Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T02:25:03.522128Z","submitted_at":"2026-08-02T15:41:57Z","title":"BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":6},"total_outbound_references":18},"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 8 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2608.01321."}