{"as_of":"2026-08-08T09:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e436da0c3ed15e1432d77896684cf53be74a7b3e2bfa86338cfe5ae944b5c0eb","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T15:13:53.234870Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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.02101/citation-record","integrity":"/paper/2608.02101/integrity","json":"/paper/2608.02101/citation-record.json","paper":"/paper/2608.02101"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T15:13:50.462612Z","title":"On-policy distillation of language models: Learning from self- generated mistakes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:50.462612Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:fe63e278e5826c96bd2f33f891c4d2fb37f255ca280b0de01a1417e560f0379c","observation_id":"02908189-4a32-4787-9085-a5f8bb32f85c","resolution":{"observed_at":"2026-08-04T15:13:50.462612Z","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-04T15:13:50.851244Z","title":"Mindsearch: Mimicking human minds elicits deep ai searcher","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:50.851244Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:f957ac08d8c4676cee38d8735d680f1f7e7284e990b50c40662ff7048d8d2a26","observation_id":"c87e8f22-371f-48d0-8172-cee965e4a028","resolution":{"observed_at":"2026-08-04T15:13:50.851244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.09101","last_updated":"2025-08-12T17:29:20Z","snapshot_observed_at":"2026-08-05T21:18:24.957038Z","submitted_at":"2025-08-12T17:29:20Z","title":"AutoCodeBench: Large Language Models are Automatic Code Benchmark Generators","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.09101","snapshot_observed_at":"2026-08-04T15:13:50.935010Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:50.935010Z"},"links":{"cited_paper":"/paper/2508.09101","citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:5b6666e9d00575a07cdff5e965c567c1ad4514a2075bf9cdf0e51fccdc32ec32","observation_id":"452afdc8-54b1-40b5-894c-937eddea0652","resolution":{"observed_at":"2026-08-04T15:13:50.935010Z","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-04T15:13:50.983267Z","title":"Yuxian Gu, Li Dong, Furu Wei, and Minlie Huang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:50.983267Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:1f8b32de7cd41dffc509817fd7113aaad2d85165d0ba09fdbc090c62b0bea313","observation_id":"8a20340c-b615-444b-9d64-3eb7eacf4fad","resolution":{"observed_at":"2026-08-04T15:13:50.983267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09938","last_updated":"2021-11-08T21:16:44Z","snapshot_observed_at":"2026-08-04T23:13:25.514661Z","submitted_at":"2021-05-20T17:58:42Z","title":"Measuring Coding Challenge Competence With APPS","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.09938","snapshot_observed_at":"2026-08-04T15:13:51.095256Z","title":"Measuring coding challenge competence with apps.arXiv preprint arXiv:2105.09938, 2021a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:51.095256Z"},"links":{"cited_paper":"/paper/2105.09938","citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:3402289442ab5e7bfd12d6b358b7f9d6712a84368774032b5a8045a98b234788","observation_id":"1e193772-2c95-46ac-8343-ce8b53ef6c31","resolution":{"observed_at":"2026-08-04T15:13:51.095256Z","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-04T15:13:51.256374Z","title":"Zhouyu Jiang, Mengshu Sun, Lei Liang, and Zhiqiang Zhang","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:51.256374Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:5fd520d80cf8b0cd5dcbc44892123cf779205377eded2d794ecc7921e942a8ca","observation_id":"a97d47ab-73d5-49ca-a408-49a9873b574a","resolution":{"observed_at":"2026-08-04T15:13:51.256374Z","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-04T15:13:51.407216Z","title":"Search-r1: Training llms to reason and leverage search engines with reinforcement learning.arXiv preprint arXiv:2503.09516,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:51.407216Z"},"links":{"cited_paper":"/paper/2503.09516","citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:a9cb4e555d36203bfda1df9726f309fbebdad8b8215753d9dc6b59da941d085b","observation_id":"f2040a4f-3658-4e4b-89e3-0830481571a9","resolution":{"observed_at":"2026-08-04T15:13:51.407216Z","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-04T15:13:51.556857Z","title":"ISBN 979-8-89176-251-0","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:51.556857Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:25837cbd78a248096877c80103e37556d48a7a908b5612f6804c0bba75cdcafa","observation_id":"bcdf37a0-599b-4eb6-bc4d-fce75f3d1187","resolution":{"observed_at":"2026-08-04T15:13:51.556857Z","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-04T15:13:51.775769Z","title":"Towards robust mathematical reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:51.775769Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:0467d3430ec75b52986bb1c724bee3141a36beece14576584f437cbeb97800e0","observation_id":"e6adafe5-7c7f-4c22-8c86-f916f09797ad","resolution":{"observed_at":"2026-08-04T15:13:51.775769Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.05592","last_updated":"2025-03-18T08:32:24Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-07T17:14:44Z","title":"R1-Searcher: Incentivizing the Search Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.05592","snapshot_observed_at":"2026-08-04T15:13:52.085559Z","title":"R1-searcher: Incentivizing the search capability in llms via reinforcement learning.arXiv preprint arXiv:2503.05592,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:52.085559Z"},"links":{"cited_paper":"/paper/2503.05592","citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:1fcbc44d1ed724bcfcd3e8e48c66f240a86bf2f034ea30cfd0f6d9b015f47458","observation_id":"c8390b12-43e1-4cba-8f09-13f7c97b1bea","resolution":{"observed_at":"2026-08-04T15:13:52.085559Z","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-04T15:13:52.172134Z","title":"Challenging big-bench tasks and whether chain-of-thought can solve them","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:52.172134Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:744408caccc723c507ff44806679bf602320f12718d9a5438ed0f17892ce8377","observation_id":"9a5ffa78-91a8-4254-834e-a1156b1ecc35","resolution":{"observed_at":"2026-08-04T15:13:52.172134Z","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-04T15:13:52.307519Z","title":"Miles Wang, Robi Lin, Kat Hu, Joy Jiao, Neil Chowdhury, Ethan Chang, and Tejal Patwardhan","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:52.307519Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:344f078387ad9757f20d0b23d44059acc7de1056207937953f09729d4c0cce3f","observation_id":"f13bd8ab-5166-4abe-ab20-9728d642dbb8","resolution":{"observed_at":"2026-08-04T15:13:52.307519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.10635","last_updated":"2024-06-28T08:24:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-07-20T07:01:57Z","title":"SciBench: Evaluating College-Level Scientific Problem-Solving Abilities of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.10635","snapshot_observed_at":"2026-08-04T15:13:52.438172Z","title":"Scibench: Evaluating college-level scientific problem-solving abilities of large language models.arXiv preprint arXiv:2307.10635, 2023a","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:52.438172Z"},"links":{"cited_paper":"/paper/2307.10635","citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:accb14d435fafab50a190e79e90d348b4933e0da654e902d72c25edeb378ba7c","observation_id":"128bc9aa-b2d6-4172-ac31-4f5a35860c74","resolution":{"observed_at":"2026-08-04T15:13:52.438172Z","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-04T15:13:52.535957Z","title":"Deepseek-v4: Towards highly efficient million- token context intelligence.arXiv preprint arXiv:2606.19348,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:52.535957Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:851554ccab5488e34aa88d4e4d149bb6cf1142c1286725d76437d84b134f0be1","observation_id":"eb5af1e7-3dc8-4aa8-b1f9-46c964055c66","resolution":{"observed_at":"2026-08-04T15:13:52.535957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04408","last_updated":"2023-10-06T17:55:36Z","snapshot_observed_at":"2026-08-05T10:28:11.033488Z","submitted_at":"2023-10-06T17:55:36Z","title":"RECOMP: Improving Retrieval-Augmented LMs with Compression and Selective Augmentation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04408","snapshot_observed_at":"2026-08-04T15:13:52.637480Z","title":"Recomp: Improving retrieval-augmented lms with compression and selective augmentation.arXiv preprint arXiv:2310.04408,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:52.637480Z"},"links":{"cited_paper":"/paper/2310.04408","citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:c835e53a2f5396af03a3c849c8fd83bb5feaf50fcf32138493411e767d74e43a","observation_id":"e3cd67c2-e71f-4b66-8d0d-382bf455ff92","resolution":{"observed_at":"2026-08-04T15:13:52.637480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.15763","last_updated":"2026-02-24T10:44:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-02-17T17:50:56Z","title":"GLM-5: from Vibe Coding to Agentic Engineering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.15763","snapshot_observed_at":"2026-08-04T15:13:52.896609Z","title":"Glm-5: from vibe coding to agentic engineering.arXiv preprint arXiv:2602.15763,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:52.896609Z"},"links":{"cited_paper":"/paper/2602.15763","citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:e183c271f7734c7769b28cf54036d9c19af4be48c9f59931c34057ea98345ac1","observation_id":"de2565fc-2442-4c69-abbb-17dba17ef4b6","resolution":{"observed_at":"2026-08-04T15:13:52.896609Z","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-04T15:13:53.035346Z","title":"Superchem: A multimodal reasoning benchmark in chemistry.arXiv preprint arXiv:2512.01274,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:53.035346Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:25692857feff1ba8227cac9bba6b9104d36a8d11182e583dab7ec7fa7315bd98","observation_id":"90404642-63fc-442e-9c1f-78e7b13a8c45","resolution":{"observed_at":"2026-08-04T15:13:53.035346Z","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-04T15:13:53.234870Z","title":"Deepresearcher: Scaling deep research via reinforcement learning in real-world environ- ments","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:53.234870Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:d1459c4470e6be6e615d40b3f0865c4e92358db8271b0af4f969d743aa924e45","observation_id":"2e581f86-d5d4-4ad0-9cb8-3a6d542be107","resolution":{"observed_at":"2026-08-04T15:13:53.234870Z","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-04T15:13:51.650885Z","title":"doi: 10.18653/v1/P17-1015","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:51.650885Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:c663a1f9042a9e0a1269d6ff42335b05a842523806d71292f5f987849efe86a5","observation_id":"6162f356-6500-4a48-846e-7bc29ee71d1b","resolution":{"observed_at":"2026-08-04T15:13:51.650885Z","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-04T15:13:51.925877Z","title":"Deepseekmath: Pushing the limits of mathematical reasoning in open language models.arXiv preprint arXiv:2402.03300,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:51.925877Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:05d590238034f055fd976127f929c9f3d6ca15fe881d23349d6c9b13932730d7","observation_id":"221c1cb6-bfef-4585-a1de-374bda32b108","resolution":{"observed_at":"2026-08-04T15:13:51.925877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-04T15:13:52.756213Z","title":"Qwen3 technical report.arXiv preprint arXiv:2505.09388,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:52.756213Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:d1a8469e638731ff5523236429a652e68b01810dccaa57297f143531d8c3874f","observation_id":"6086373d-7659-4ab7-b607-201d143f7725","resolution":{"observed_at":"2026-08-04T15:13:52.756213Z","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-04T15:13:50.517902Z","title":"2025 aime i","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:50.517902Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:5f8a5c14dafda0feca935556ebe115682686030addd9c341e640a365c8b82ed7","observation_id":"031c31ca-b3eb-4e70-b69a-13a4ffedf854","resolution":{"observed_at":"2026-08-04T15:13:50.517902Z","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-04T15:13:50.640484Z","title":"Accessed:","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:50.640484Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:fa3acec2ceb96dd365c076e56a8de1fbfa0b7b114ab6f40cc7db592b0f5a5637","observation_id":"89b1942a-71ad-4709-a005-40982f7e2ef5","resolution":{"observed_at":"2026-08-04T15:13:50.640484Z","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-04T15:13:50.704606Z","title":"ISBN 979-8-89176-390-6","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-04T15:13:50.704606Z"},"links":{"citing_paper":"/paper/2608.02101"},"observation_digest":"sha256:69f6a0598e469cf11a85499aa823759d255c88be797494d34f2ebadd3f89fc69","observation_id":"fd4671cf-808a-4b55-a0b1-e209083aab57","resolution":{"observed_at":"2026-08-04T15:13:50.704606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.02101","last_updated":"2026-08-03T12:01:18Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T22:10:34.249752Z","submitted_at":"2026-08-03T12:01:18Z","title":"Cross-Domain Hybrid OPD for Generalizable Search Agents"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":24},"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 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2608.02101."}