{"as_of":"2026-08-07T15:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f2a21726369678afe8a8165b699ee9b4de497c8d2385d7566f6150cc32ce13c4","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T20:51:34.297682Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"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/2605.31377/citation-record","integrity":"/paper/2605.31377/integrity","json":"/paper/2605.31377/citation-record.json","paper":"/paper/2605.31377"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T20:51:34.297682Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:0477eb56cc5e5b79595e6c35b91ae9a5a0d481a6afee029d71758c5c39fbfc52","observation_id":"3c2ce7f0-307c-41d3-a045-91e51fd326a4","resolution":{"observed_at":"2026-06-28T20:51:34.297682Z","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-06-28T20:51:34.297682Z","title":"InInternational Conference on Learning Representations, Vol","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:8ccc7593f98f7c722727d9677d1dd35c080b50a80e23b66422a441bce474dbeb","observation_id":"c345ac42-0ca2-41eb-859d-025702f3d46b","resolution":{"observed_at":"2026-06-28T20:51:34.297682Z","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-06-28T20:51:34.297682Z","title":"Aslam, Matthew Ekstrand-Abueg, Virgil Pavlu, Fernando Diaz, Richard McCreadie, and Tetsuya Sakai","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:699815b5c4147b1ad82212b48b355f40355fd3c64274aab6b4eac91b0c661261","observation_id":"21a79e72-bfc2-4b5c-8394-da2f7b35f311","resolution":{"observed_at":"2026-06-28T20:51:34.297682Z","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":"10.1016/j.ipm.2019.05.009","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2019 , issue_date =","venue":"Information Processing & Management","work_id":"cd61faa2-34b6-4950-a3ad-fdde65cae948","year":2019},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:1031132e489bda99ec89aa35c09cdafc653a4402a9ea20770a0dcbd46fccc494","observation_id":"bafe57e9-acbc-49cd-b9de-35a5a0eaecdc","resolution":{"observed_at":"2026-06-28T20:52:36.866973Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T20:51:34.297682Z","title":"Andy Brock, Michela Paganini, Geoffrey Irving, Oriol Vinyals, Simon Osindero, Karen Simonyan, Jack Rae, Erich Elsen, and Laurent Sifre","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:63e7bef6800899f93bf09a2819c881d0d3e7a545f1d57ca82b29facd3e4cb464","observation_id":"aed41616-b485-41b7-ba18-6762d8d33f36","resolution":{"observed_at":"2026-06-28T20:51:34.297682Z","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":"1389.207139","doi":"10.1145/2071389.2071390","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ACM Computing Surveys","work_id":"1e7385c3-76ee-45b4-9cbe-221aa8059144","year":2012},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:bac0c653f3180f9e117bc750bb7475da878148decdb0ee3b5ea3726784f306b2","observation_id":"25f56c6f-281c-44ad-b489-bb95533902bf","resolution":{"observed_at":"2026-06-28T20:52:36.851305Z","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":"2507.06261","last_updated":"2025-12-19T14:25:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-07T17:36:04Z","title":"Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities","version":6},"cited_work":{"arxiv_id":"2507.06261","doi":"10.48550/arxiv.2503.19","metadata_source":"pith","pith_arxiv_id":"2507.06261","snapshot_observed_at":"2026-07-11T03:17:51.364436Z","title":"Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities","venue":"cs.CL","work_id":"008df105-2fdd-45d8-857a-8e35868aecb6","year":2025},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"cited_paper":"/paper/2507.06261","citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:6ab287ae8e058bc0a4e4a6ad96cef7f84b7e562f187ae0e7bd6c572404ec4f6d","observation_id":"2cfcdd51-5195-474c-98cd-052b20fc1a73","resolution":{"observed_at":"2026-06-28T20:52:37.193239Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":"8487.171849","doi":"10.1145/1718487.1718490","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the Third","venue":null,"work_id":"776ab819-bd85-4761-a0fe-ea1e33db0edd","year":2010},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:3fae45b779f96f5358ded0d93691e1ab04a14961be20d33cd028ecf3df9073cc","observation_id":"e593f957-71d8-4b15-ae75-c93939a2d343","resolution":{"observed_at":"2026-06-28T20:52:36.879482Z","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":null,"cited_work":{"arxiv_id":"2690.177272","doi":"10.1145/1772690.1772725","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"7e40f3c7-d75e-428d-8b06-36358f3c6dfb","year":2010},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:f174455d630f7e954355270eb958e9b9013b7fe0a60a7eff1f3cea87fa2c8369","observation_id":"51a32af9-46c4-4147-9065-4b247fe69524","resolution":{"observed_at":"2026-06-28T20:52:36.867173Z","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":"2404.16130","last_updated":"2025-02-19T10:49:41Z","snapshot_observed_at":"2026-07-06T18:05:11.700127Z","submitted_at":"2024-04-24T18:38:11Z","title":"From Local to Global: A Graph RAG Approach to Query-Focused Summarization","version":2},"cited_work":{"arxiv_id":"2404.16130","doi":"10.48550/arxiv.2404.16130","metadata_source":"pith","pith_arxiv_id":"2404.16130","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"From Local to Global: A Graph RAG Approach to Query-Focused Summarization","venue":"cs.CL","work_id":"588618d7-fd41-4053-b34d-a981f8793039","year":2024},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"cited_paper":"/paper/2404.16130","citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:a410a1ddbd122cf19107ef955d419a54e3f99852de61238ab2a8f04a37e58c6d","observation_id":"5b4e323d-55fc-473c-825e-8f73967c1cc3","resolution":{"observed_at":"2026-06-28T20:52:37.186764Z","resolver_source":"local_arxiv","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-07-11T05:49:57.694079+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T05:49:57.694079+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8487.171848","doi":"10.1145/1718487.1718489","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Elsas and Susan T","venue":null,"work_id":"7d038c7b-1a91-403b-9477-519b2c1df242","year":2010},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:02c40614986c3b7898f25bdff8274fe4355c22d8f819e563756e63cb36f862b3","observation_id":"c86d9f2c-6df7-4c88-97d2-7294e70e4372","resolution":{"observed_at":"2026-06-28T20:52:36.876089Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T20:51:34.297682Z","title":"Frank, Steven J","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:af4050ba99cc848f165ad5d11a538e053bb28f480451132875f15ac0d69dd05c","observation_id":"db140f54-1509-406e-b6a2-200bae0d04a4","resolution":{"observed_at":"2026-06-28T20:51:34.297682Z","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-06-28T20:51:34.297682Z","title":"http://trec.nist.gov/pubs/trec22/papers/KBA.OVERVIEW.pdf","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:4c0364da98e7ef10637bec6717aa9a10f68a1400946c938632fc0f40e73c2b38","observation_id":"50c284cb-cb8c-4054-85e5-aeee2d26d67f","resolution":{"observed_at":"2026-06-28T20:51:34.297682Z","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":"10.18653/v1/2023.acl-long.99","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Precise zero-shot dense retrieval without relevance labels","venue":null,"work_id":"dda6cfdf-a913-473f-a9a4-43d0c26d506a","year":2023},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:348de9db9dd5124e3ac3af0d574d49ffef80e513df187e9d2d5d069cb4a4ad0c","observation_id":"94ab0cfc-6855-4593-917e-7ef30e77f0c1","resolution":{"observed_at":"2026-06-28T20:52:36.860687Z","resolver_source":"doi","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-01T13:38:13.43132+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T13:38:13.43132+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10997","last_updated":"2024-03-27T09:16:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-18T07:47:33Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","version":5},"cited_work":{"arxiv_id":"2312.10997","doi":"10.1186/1476-072x-8-72","metadata_source":"pith","pith_arxiv_id":"2312.10997","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","venue":"cs.CL","work_id":"b80d2790-6cd9-4c87-b3c4-de404f99a80e","year":2023},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"cited_paper":"/paper/2312.10997","citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:14fa47652d595b532b9b6fa1ac9d86b6a0d3966c850bb2dce6e67a278b6b6b9e","observation_id":"2b7d6afd-ebfa-4f46-aa29-5a55aab57a22","resolution":{"observed_at":"2026-06-28T20:52:37.183878Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2021.eacl-main.74","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Leveraging Passage Retrieval with Generative Models for Open Domain Question Answering","venue":null,"work_id":"b7f86aa5-b9b1-42ad-b0cc-8d6f7ab85b04","year":2021},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:2570f7a2da473fc71600a9c5c60667bc90f7cb03417799939775c8a66fd37516","observation_id":"311a8b1b-44b0-4549-beb2-830d080aaaf7","resolution":{"observed_at":"2026-06-28T20:52:36.855006Z","resolver_source":"doi","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-05-30T14:55:32.844017+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-30T14:55:32.844017+00:00","source":"openalex_status_cache"},{"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":"10.1145/2911451","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"061d7410-a988-4dda-a63b-73e7c1df147b","year":2016},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:b3e8e8129ed403b886b75b6bfb1c35450c95dc4e2d0eed02b9c8a7e653515535","observation_id":"853e7433-83e7-4328-a9ac-2160b64ca6e0","resolution":{"observed_at":"2026-06-28T20:52:36.882269Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":"3952.38397","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T20:52:37.188861Z","title":"Bruce Croft","venue":null,"work_id":"34eeb484-4197-4906-9843-f8dc52617b25","year":2001},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:a51762fbb1292744667f4b3e6c33892eca7048d3cbe2ee422f2a5a7659494602","observation_id":"ef43a225-a12d-4070-8b65-5303fbfb5544","resolution":{"observed_at":"2026-06-28T20:52:37.190826Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T20:51:34.297682Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:34ae755b1a0eb26873069fb7f1d8e84a5385b0ace8cf79481603b8a7ffd99110","observation_id":"fd4e2bd5-ba64-41e1-a671-1a4c38447fe3","resolution":{"observed_at":"2026-06-28T20:51:34.297682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.07794","last_updated":"2026-05-07T13:52:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-09T14:31:11Z","title":"Query Expansion in the Age of Pre-trained and Large Language Models: A Comprehensive Survey","version":3},"cited_work":{"arxiv_id":"2509.07794","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.07794","snapshot_observed_at":"2026-06-28T20:52:37.194703Z","title":"Query Expansion in the Age of Pre-trained and Large Language Models: A Comprehensive Survey","venue":"cs.IR","work_id":"7fec2f0a-fd73-4dc5-926d-8a40ab095c87","year":2025},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"cited_paper":"/paper/2509.07794","citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:1b40f237c35bd14aa8a47a316bb5b1252c4c43ebf6ec511d80e9227c5574f78e","observation_id":"82631b70-550b-490b-a42e-0377d85bea31","resolution":{"observed_at":"2026-06-28T20:52:37.195914Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":"6863.956951","doi":"10.1145/956863.956951","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bruce Croft","venue":null,"work_id":"e520a790-85c3-4909-9fb3-349ff305054c","year":2003},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:a867d036819e73b89c942c231838ecf6cf4e856a0ed8350ad6170dec145e7ab2","observation_id":"8e7311cd-32a3-4afd-9240-a4598280cf71","resolution":{"observed_at":"2026-06-28T20:52:36.864152Z","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":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2023.emnlp-main.322","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Query Rewriting in Retrieval-Augmented Large Language Models","venue":null,"work_id":"0406c992-5232-4e22-8650-4021b3e6b9a6","year":2023},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:edae1fb3e6448e576e73d2c20854c04763f8e7e85517de402489c64832f09844","observation_id":"679d73f3-c024-4af7-bf77-05e266f91b59","resolution":{"observed_at":"2026-06-28T20:52:36.871205Z","resolver_source":"doi","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.20243","last_updated":"2026-04-23T12:44:13Z","snapshot_observed_at":"2026-08-04T01:52:17.091849Z","submitted_at":"2025-05-26T17:21:26Z","title":"It's High Time: A Survey of Temporal Question Answering","version":4},"cited_work":{"arxiv_id":"2505.20243","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.20243","snapshot_observed_at":"2026-07-03T14:48:32.588260Z","title":"It's High Time: A Survey of Temporal Question Answering","venue":"cs.CL","work_id":"ba574677-7e5f-45e6-80ba-c9103e5b7cf5","year":2025},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"cited_paper":"/paper/2505.20243","citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:ac05e0430a845528f5fe1c49c1ee8808996e68a78fd3973d91391c33c1742c04","observation_id":"beaa57f2-9fc0-4214-89c5-7f348c7ff746","resolution":{"observed_at":"2026-06-28T20:52:37.200717Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T20:51:34.297682Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:f13484b34ae1333019ac940c68d53f02c152cd7e9f6b65e12065834f29b64288","observation_id":"18d4eaae-d242-49d7-b668-4b1de88b20ae","resolution":{"observed_at":"2026-06-28T20:51:34.297682Z","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-06-28T20:51:34.297682Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:383964092557ea463cd481d76cd4ee1eda7a4ed8d50e7c72dc44aa600f668c14","observation_id":"a904c620-9102-4195-a027-79a2ddc36e3c","resolution":{"observed_at":"2026-06-28T20:51:34.297682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.09136","last_updated":"2026-04-01T15:51:06Z","snapshot_observed_at":"2026-08-07T12:36:27.102579Z","submitted_at":"2025-01-15T20:40:25Z","title":"Agentic Retrieval-Augmented Generation: A Survey on Agentic RAG","version":4},"cited_work":{"arxiv_id":"2501.09136","doi":"10.48550/arxiv.2501.09136","metadata_source":"pith","pith_arxiv_id":"2501.09136","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Agentic Retrieval-Augmented Generation: A Survey on Agentic RAG","venue":"cs.AI","work_id":"6edcfe5a-e498-4a2e-aa57-dcaa5ef20f86","year":2025},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"cited_paper":"/paper/2501.09136","citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:7eace2a7ad1473a75989c5b203d5905657e69e1eef7b27552772581dad3cc75b","observation_id":"3b2d15f2-3a72-4ea5-bb7e-3be1ccc59a1b","resolution":{"observed_at":"2026-06-28T20:52:37.178639Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":"files/1228896","doi":"10.18653/v1/2025.emnlp-main","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Stolfo, A., Balachandran, V ., Yousefi, S., Horvitz, E., and Nushi, B","venue":null,"work_id":"e8f5282f-30a2-4e6a-96fd-5aa884a0e8a0","year":2025},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:f4c1fe9cf6e1e5be00bac0f7842d4d9f57b0e68e2fc314f24bd4dbbb9d2de50c","observation_id":"4f9777d0-cfc5-4811-9553-0293d2e6db8d","resolution":{"observed_at":"2026-06-28T20:52:36.863387Z","resolver_source":"doi","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-07-11T08:50:07.505227+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T08:50:07.505227+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08663","last_updated":"2021-10-21T01:18:28Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-04-17T23:29:55Z","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","version":4},"cited_work":{"arxiv_id":"2104.08663","doi":"10.48550/arxiv.2104.08663","metadata_source":"pith","pith_arxiv_id":"2104.08663","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","venue":"cs.IR","work_id":"c5f7f027-ac36-4b07-b824-0eca2f310641","year":2021},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"cited_paper":"/paper/2104.08663","citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:aa733102e8ad5e16a34f9bd4e0a95a17e4f278dd93cf59ae269a858d086fb48b","observation_id":"ac9f1a4b-639e-4d92-841c-51dc765e3bb7","resolution":{"observed_at":"2026-06-28T20:52:37.173580Z","resolver_source":"local_arxiv","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-06-02T00:57:45.853409+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:57:45.853409+00:00","source":"openalex_status_cache"},{"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":"10.18653/v1/2024.findings-acl.813","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"F resh LLM s: Refreshing large language models with search engine augmentation","venue":null,"work_id":"43edb0ca-c614-4c49-aaf1-f134866824be","year":2024},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:b1b1feaed1985b576310bad8944cbf342b75433bfdcf2714046dd8be2ccd41a5","observation_id":"235653ef-bdac-4ead-be96-caf691b5892b","resolution":{"observed_at":"2026-06-28T20:52:36.871013Z","resolver_source":"doi","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-05-30T09:56:21.252483+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-30T09:56:21.252483+00:00","source":"openalex_status_cache"},{"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":"10.1007/s11704-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T06:16:42.849900Z","title":"Fron- tiers of Computer Science 11(5), 746–761 (2017)","venue":null,"work_id":"0615ec93-1785-423c-b6ef-8f039fa8dbff","year":2024},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:6377ea363c043d96c7db46e9e37c11d18abdf133674e258d2f4e12732c0d8832","observation_id":"4cbb07a9-e9d0-4ea0-a057-6b2de5edeba7","resolution":{"observed_at":"2026-06-28T20:52:36.869157Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T20:51:34.297682Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:e431fca1e05094cf0305564b1f309a2c831512acf6351b9442af943c9e717ed7","observation_id":"94646502-015a-40dd-a831-12bad45db0c5","resolution":{"observed_at":"2026-06-28T20:51:34.297682Z","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":"2502.00510","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T20:52:37.174685Z","title":"Who’s the mvp? a game-theoretic evaluation benchmark for modular attribution in llm agents","venue":null,"work_id":"069ba7a9-9479-4363-b439-8d22d88f06e0","year":2025},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:b5aa8ef5125838e9e067845aa41df5abe206356f8749b44ced97483b67ee14aa","observation_id":"37c748a9-68e2-44a4-9ea6-a9fc9d354a9c","resolution":{"observed_at":"2026-06-28T20:52:37.176123Z","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":"2210.03629","last_updated":"2023-03-10T01:00:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-10-06T01:00:32Z","title":"ReAct: Synergizing Reasoning and Acting in Language Models","version":3},"cited_work":{"arxiv_id":"2210.03629","doi":"10.48550/arxiv.2210.03629","metadata_source":"pith","pith_arxiv_id":"2210.03629","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ReAct: Synergizing Reasoning and Acting in Language Models","venue":"cs.CL","work_id":"407a2351-25f1-497d-b611-f77d0292a8e6","year":2022},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"cited_paper":"/paper/2210.03629","citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:6e52b6111279640036904f3a4f38a318a236c944a8b5a7a83ccfe266d43e9607","observation_id":"8acf6850-7dc5-4bf4-b4cc-d460c3e8c903","resolution":{"observed_at":"2026-06-28T20:52:37.181142Z","resolver_source":"local_arxiv","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-07-12T03:19:36.897515+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T03:19:36.897515+00:00","source":"openalex_status_cache"},{"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":"10.18653/v1/2025.acl-long.1312","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ISBN 979-8-89176-251-0","venue":null,"work_id":"2333d88e-5ef8-40e3-9284-23060bcd002c","year":2025},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:155687be1a37c3fc81ed822087f6bab5f3fd16abd1a0c6ccc7461b9da143e185","observation_id":"1899c61f-b24f-4f01-9a36-34dd7556f694","resolution":{"observed_at":"2026-06-28T20:52:36.844247Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T20:51:34.297682Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:c89bf9f6ac3ba45930fc8b90265fadc712edbfcc062e1cbe3cf73a87cb11b70c","observation_id":"7b509d88-89db-4718-8715-5a8b79062cbb","resolution":{"observed_at":"2026-06-28T20:51:34.297682Z","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":"10.18653/v1/2025.naacl-long.449","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Knowledge graph-guided retrieval augmented generation","venue":null,"work_id":"1ad59dde-ed87-4251-ae99-375fbc96075c","year":2025},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:ef696dd515f3d9ce2dbe52e91e00c122011d1089c195fb94290a4cf8282673d9","observation_id":"02304d7c-5fcb-40bd-b6cf-9927ae632078","resolution":{"observed_at":"2026-06-28T20:52:36.873172Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3748304","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ACM Trans","venue":"ACM Transactions on Information Systems","work_id":"f0f4fb78-2112-48a4-a94d-aecf31d3ba65","year":2025},"citing_paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-28T20:51:34.297682Z"},"links":{"citing_paper":"/paper/2605.31377"},"observation_digest":"sha256:bb22460d254b6dab997a2756c2e565dd0b1c3f227c01261019aa7377c29ecc90","observation_id":"bdeb2e95-5c6e-4b67-8479-a854cedde7b0","resolution":{"observed_at":"2026-06-28T20:52:36.865044Z","resolver_source":"doi","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"}}],"paper":{"arxiv_id":"2605.31377","last_updated":"2026-05-29T14:45:58Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-06T23:40:32.387598Z","submitted_at":"2026-05-29T14:45:58Z","title":"DynaTree: Dynamic Agentic Retrieval Tree for Time-Sensitive News Retrieval"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":24,"verified_fuzzy":0},"total_outbound_references":37},"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 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2605.31377."}