{"as_of":"2026-08-18T16:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:135d0ff9960c94b4d20011f28687371de76be60d439a4d212eb70abc9d976475","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T10:13:10.932250Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2606.11662/citation-record","integrity":"/paper/2606.11662/integrity","json":"/paper/2606.11662/citation-record.json","paper":"/paper/2606.11662"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.13651","last_updated":"2025-06-16T16:16:14Z","snapshot_observed_at":"2026-08-13T10:30:44.297570Z","submitted_at":"2025-06-16T16:16:14Z","title":"xbench: Tracking Agents Productivity Scaling with Profession-Aligned Real-World Evaluations","version":1},"cited_work":{"arxiv_id":"2506.13651","doi":"10.48550/arxiv.2506.13651","metadata_source":"pith","pith_arxiv_id":"2506.13651","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"xbench: Tracking agents productivity scaling with profession-aligned real-world evaluations","venue":"cs.LG","work_id":"b7f0bdf6-3821-4735-b55e-be58f6ef326d","year":2025},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"cited_paper":"/paper/2506.13651","citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:e774ad611908f16b5febbb5f414dd6b65dd3054c13fb0061009a3e45e0d45e20","observation_id":"74a88603-cf3d-4d7c-bff8-4f8cae43a650","resolution":{"observed_at":"2026-07-03T10:17:57.270124Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.24699","doi":"10.48550/arxiv.2510.24699","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Agentfold: Long-horizon web agents with proactive context management","venue":"arXiv (Cornell University)","work_id":"c066e479-5bdf-45aa-9a32-63dae2dff088","year":2025},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:a94b5e69a7ffe8dfcc3d8955d4beeb3afdf83ff4b7dea0f479076289b170d91b","observation_id":"3a34315d-ee49-4cab-8c98-d1488db8b1ed","resolution":{"observed_at":"2026-07-03T10:17:57.272621Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:e65501e3d4cd504a804f03964723e1f855d81366442954b83aaf3ef10883b18e","observation_id":"a831cb40-a1b5-4f33-b0eb-623e435d28b0","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:fd9fec2ff04f5f80f586e1f984ea7936d8d9ba91bdfada119bf6aaddd3f5132f","observation_id":"97129c51-933c-478b-a17a-225b991b1958","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":"Goals with no dependencies can execute in parallel","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:375398eb53b70c17631efefe2b054a5aca261b9bc4a331352739b9d40deded3e","observation_id":"6c173de1-9c38-41ce-a804-747fb96feaca","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:ae8ce9b66b6ea65319756d8ba207ef3af90362c44780162bca0d866e363bcc45","observation_id":"75839786-e5e8-42bf-8540-5d2eb2c286fe","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":"Goal 2 (Search Y's population) depends on Goal 1 (Search X's population)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:63587321ca4b1c5c2c7025fc778faf41bb9cf422fa48e91ca070c02a54758bcf","observation_id":"793456dc-af59-4258-8533-e652689610a3","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:848240c4d169818bca167ab1c74aa39d66d930b10b35cebd769fa0d3e2a91784","observation_id":"44ac9ce1-d17a-490b-a6df-96d9635c69b4","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":",→ ,→ ,→","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:6d4b1254eafee8be3da5be24adbafa1bd8d351207d57d4aa61b2923926a0e330","observation_id":"af3c701d-406d-4392-b1ea-c165442ec4f6","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":"If a path has been selected 8+ times without escaping the loop, you may **consider** backtracking; if 12+ times, you **MUST** backtrack","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:c69fe2221285ed430357e407481ea813e1779b0f77894369b4befe79c0b9cca6","observation_id":"794dc470-e384-4059-b822-9b42e04c0bcd","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":"can the original task be answered NOW with the evidence already collected across ALL goals?","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:3c5fd83b799576d70bdd5c4052f96e9b0492fee02b07e72fc66e87ef03c9e181","observation_id":"3ffab34c-c4b0-4042-8757-7b3540ed4804","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:bf30c0a5fed8bcc1758d24acb19d95a5782cfa55f9325355b9f953cbd9b3b477","observation_id":"d363e751-1a25-4aaf-a2e2-b723536d38c5","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":"Goal X: resolved, result is [result summary]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:cee8e602e9792966e3e429e1095f9120a8a65897de6ac34fd4aa4f85cf6e16ae","observation_id":"8c7b1833-1464-4f42-858e-2bcef77c03c3","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:2a520b5e3917e3a3420ec547637386a5e1d5a4f14dc52f4cb52d65f61e29eef5","observation_id":"7b25cfc6-2030-408c-aa02-5874dae1bd1c","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:d6b301e884fe2a406ea3ecd71ffc2c32319e99c7a04402102e6aa9db3f7ca7a1","observation_id":"1faf17a3-1f6b-41a4-9437-59108a0214d2","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:35f0d6d8ebde210823357c2b61c754adff9f6354d490de5e24dce918e634fa23","observation_id":"f26db762-5486-4517-a4e9-fc52d75aabbf","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:2f7c57534e70823a3ccd5f8f3a92dff3e8598241250353633fe80e5fedf87690","observation_id":"efea5a28-156d-4429-a782-1670591fc6b8","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:bd43e02d6a81393860cd2e3b0452f02c9423efc934ca1519123c3e3913ef24ea","observation_id":"87c2e03a-c29f-4039-96de-917ee4b7ae67","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:b795b60f7898a278bc4f2a6abaad64255232227893ea1897abe8450ac393be3c","observation_id":"bc22e830-5059-42ec-938a-a8677458187f","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:93f774122fe2f4dfd383770a37d1c9d2beb78e176976f4e2b90a6e6c31b42467","observation_id":"59e60dea-e881-4171-8c82-c5ed6923a23f","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":"1.1\", \"1.2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:12d0d03303b39198aab5cddaff4e0a9433927ef1ae8ee0290795916ad460b742","observation_id":"4d33a4b3-5511-4d5f-8bc6-6058cae862d3","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":"The player was drafted in the first round","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:87896382b0158fd86894b9149f9c65cff6437ccf9e2c341519469c1707afbe56","observation_id":"385a91ed-a641-466d-97b8-a5b2aae4812c","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":"completed","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:b95a5a9fe6b2b9f6da6f492e4103861028a6558e0a97272e6d78b0cfadb37d9c","observation_id":"ed1433e0-f8e4-4749-8ea3-88d37ce60d76","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:ee2ca6c5d93ed45f4afc0172f17cada7202aefc8547a58c35b60977eb6ca4357","observation_id":"b4fe9796-0fc0-41fe-8143-bfde4579ad3d","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:5ea95dc0d28220c8a4a50787f19e38af731d810688b9ed19289f7f83ebca7c9d","observation_id":"72d9c404-cecb-4a0e-a463-d24169ddb76d","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":"goals\": {","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:39da7e37ae2cdb766d3af9938e554047ec8af9fcb40f94c6a488e5c29de4c79e","observation_id":"d23028c1-65e7-4782-81b8-fe731575e6fa","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","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-27T10:13:10.932250Z","title":"three-stage develop- ment","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T10:13:10.932250Z"},"links":{"citing_paper":"/paper/2606.11662"},"observation_digest":"sha256:e3b69e40b25aa4ea028083b4e1425260f8fe71036bd0ffd569ecaf9dcc972b02","observation_id":"dadcd990-c3e4-404d-b465-8dd8d7d7cd36","resolution":{"observed_at":"2026-06-27T10:13:10.932250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.11662","last_updated":"2026-06-10T05:10:19Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T09:27:36.700376Z","submitted_at":"2026-06-10T05:10:19Z","title":"TreeSeeker: Tree-Structured Trial, Error, and Return in Deep Search"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":25,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":27},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2606.11662."}