{"as_of":"2026-08-07T18:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d38e7452d616d195fc2e5b4aa59155f82ab624ca67ca693443e62f54f9220f96","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-07T05:38:34.216078Z","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-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/2506.07557/citation-record","integrity":"/paper/2506.07557/integrity","json":"/paper/2506.07557/citation-record.json","paper":"/paper/2506.07557"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:38:32.233765Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:32.233765Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:3da9ccca48278d99d5803bf1a510c1a1bcabe9b386869c0f42c1013c6b682218","observation_id":"72019160-142b-49f4-84ba-2b4cfa1f30c5","resolution":{"observed_at":"2026-08-07T05:38:32.233765Z","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-07T05:38:32.323362Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:32.323362Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:4829f327d94e4e920a64d60130fb0c5c13b6582ed21146b73b15f52318f859ec","observation_id":"80ab5b0d-4ec8-4a68-ac7b-fe91e22ebfce","resolution":{"observed_at":"2026-08-07T05:38:32.323362Z","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-07T05:38:32.433752Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:32.433752Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:d36fe597eac6f85d290cc0e38a56dfe34e139833cfe0d2959f500f40d1cbdc8f","observation_id":"532c5f09-6663-418b-87a9-d02c43347deb","resolution":{"observed_at":"2026-08-07T05:38:32.433752Z","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-07T05:38:32.507538Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:32.507538Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:d9c10e05a546ddd718e8dae02f5683bef176d11e3fd24b40d908baf0b5da6375","observation_id":"bbe7c772-fe73-4c34-864f-81ab80c8c1b6","resolution":{"observed_at":"2026-08-07T05:38:32.507538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10668","last_updated":"2024-03-18T23:15:47Z","snapshot_observed_at":"2026-07-06T16:20:36.866744Z","submitted_at":"2023-09-19T14:50:38Z","title":"Language Modeling Is Compression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10668","snapshot_observed_at":"2026-08-07T05:38:32.602455Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:32.602455Z"},"links":{"cited_paper":"/paper/2309.10668","citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:6e39b2ef0370915e84997088ef4ddfbb0940f2af6f40661e44d3f467a42e78b5","observation_id":"3161dad6-c801-4a10-a855-93b35c952c88","resolution":{"observed_at":"2026-08-07T05:38:32.602455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T05:38:32.683977Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:32.683977Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:e67e2d563bbf547feb86b838321470dc273aad7d9d97a45de1f7c27ccba7e070","observation_id":"b1796a4e-effc-400d-b059-f41f2b9244bc","resolution":{"observed_at":"2026-08-07T05:38:32.683977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:38:35.696645Z","title":null,"venue":null,"work_id":"7a2da1bb-cf86-40bf-8900-cd983dc13c56","year":2006},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:32.803092Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:cbc8abe3dec7915888fcf9e13ccb5e3030e3c9e593ad541480ac274d0b2d06a4","observation_id":"33d0cc4b-71c7-46f4-8862-b62707a12136","resolution":{"observed_at":"2026-08-07T05:38:35.815699Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08-07T05:38:32.906922Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:32.906922Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:05cd667906d39beeaa90dd831bdf34a3dac06e7ba35a7fb333580032166a8065","observation_id":"4428bf4b-faad-48aa-bcca-b93fb13ab2ae","resolution":{"observed_at":"2026-08-07T05:38:32.906922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03300","last_updated":"2021-01-12T18:57:11Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-09-07T17:59:25Z","title":"Measuring Massive Multitask Language Understanding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03300","snapshot_observed_at":"2026-08-07T05:38:32.965304Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:32.965304Z"},"links":{"cited_paper":"/paper/2009.03300","citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:6460c640a476df2f594ae7010f5628543873da20efc01baf07353765698d45c2","observation_id":"214a9f60-420c-4da6-b571-157db75f702d","resolution":{"observed_at":"2026-08-07T05:38:32.965304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:38:35.507052Z","title":null,"venue":null,"work_id":"7bb41e5b-a0d1-44d6-b8e1-a5ba7cd86b1e","year":2023},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:33.017939Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:99d59b39e22440ac8ed5298c2918dddc647124521878dd28bd728c8287ba9ccf","observation_id":"61ecb876-8428-4678-bbce-9b333c4d185d","resolution":{"observed_at":"2026-08-07T05:38:35.543155Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:38:35.331530Z","title":null,"venue":null,"work_id":"bea88150-2c39-4335-a526-4008df3d9e84","year":2024},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:33.070616Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:607cbb28c1ef6730b07681f2d2416eb57de2215da24f30a6b3c6fb49af2724b8","observation_id":"216380ac-5146-49ba-824a-cfe4b7e6680b","resolution":{"observed_at":"2026-08-07T05:38:35.419952Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:38:35.162501Z","title":null,"venue":null,"work_id":"91276fae-9716-4bed-a464-acb5fbfc7747","year":2003},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:33.158128Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:f63d0d599db66571b15b55a57af45cb9e28a96b74c645d3ef36a05afb38f72fa","observation_id":"e3e5d406-a7dc-4da5-a5ef-ab65f3c84dd7","resolution":{"observed_at":"2026-08-07T05:38:35.257319Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-07T05:38:33.259482Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:33.259482Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:c5cc155fb79e81d82070713708e99419b56096d05c0526bbd9940e438a2dcc61","observation_id":"14e930b1-484c-43c6-ba27-746d9c7e029c","resolution":{"observed_at":"2026-08-07T05:38:33.259482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.12253","last_updated":"2024-12-10T18:19:29Z","snapshot_observed_at":"2026-08-05T22:35:55.296192Z","submitted_at":"2024-04-18T15:21:34Z","title":"Toward Self-Improvement of LLMs via Imagination, Searching, and Criticizing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.12253","snapshot_observed_at":"2026-08-07T05:38:33.299806Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:33.299806Z"},"links":{"cited_paper":"/paper/2404.12253","citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:1d5fe0cabd07379e94f50c16760cc3000ade173437b377481ecf20b60a81e062","observation_id":"27a21eb2-fe1d-4337-a4d5-9ce439a5ab1c","resolution":{"observed_at":"2026-08-07T05:38:33.299806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:38:35.013459Z","title":null,"venue":null,"work_id":"7e9b66f0-ae00-4c57-a3d7-7da9691cbb37","year":2007},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:33.413754Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:19c7ee978725b045acabed64ad5dcb925351807f2bf9b2fc0c8404d209a6c5c6","observation_id":"793b15a5-a081-4256-8ed3-d60321e4fed2","resolution":{"observed_at":"2026-08-07T05:38:35.073792Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08-07T05:38:33.525348Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:33.525348Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:52d7d67b337edf7dfd1d4d753cecdadde35f22abcc77edbbef2900581d633968","observation_id":"222953b2-7679-43ed-9de7-9a8318d7c6a6","resolution":{"observed_at":"2026-08-07T05:38:33.525348Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:38:34.812483Z","title":null,"venue":null,"work_id":"a80f4e18-b1b5-45a8-85a7-d7ecbb53b636","year":2024},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:33.580654Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:56f420e593f642c8e4494dc66afc82b2ce0d7e0b1e04a0b4d19dcc5557b7837a","observation_id":"09cf0729-26ba-426f-97e7-3044bb15972e","resolution":{"observed_at":"2026-08-07T05:38:34.845605Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08-07T05:38:33.662595Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:33.662595Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:515a82e84f8b784b40232481cde7f9fdf1edc4b338682edf22549606d693cfad","observation_id":"cbd5a58e-f7cc-4eaf-8787-ba8b78d2347e","resolution":{"observed_at":"2026-08-07T05:38:33.662595Z","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-07T05:38:33.786234Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:33.786234Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:e478ee1aded962c9791d9b5545be748b7cf83f2067b755308df834cb328fc988","observation_id":"6989de67-90de-40ec-9bf3-ce25d601888b","resolution":{"observed_at":"2026-08-07T05:38:33.786234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:38:34.673889Z","title":null,"venue":null,"work_id":"72d28353-863a-4fa6-ace0-764381080a65","year":2025},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:33.862565Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:da7b39794d3a1d2413df7af000ccda3369a3bd0e124cf4ea47668bbf85815b10","observation_id":"f9cd570a-1970-42d0-a0bb-7ccd97d735e6","resolution":{"observed_at":"2026-08-07T05:38:34.728639Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2406.07394","last_updated":"2024-06-13T07:19:06Z","snapshot_observed_at":"2026-07-06T18:29:00.001236Z","submitted_at":"2024-06-11T16:01:07Z","title":"Accessing GPT-4 level Mathematical Olympiad Solutions via Monte Carlo Tree Self-refine with LLaMa-3 8B","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.07394","snapshot_observed_at":"2026-08-07T05:38:33.952668Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:33.952668Z"},"links":{"cited_paper":"/paper/2406.07394","citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:2f0774999a8467eb0e39922efcdff5dc37265a8b223abf43556c20e0691b2a57","observation_id":"e2c6b26e-99e2-404a-8ff1-d6eedf388ce3","resolution":{"observed_at":"2026-08-07T05:38:33.952668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02884","last_updated":"2024-11-21T07:07:59Z","snapshot_observed_at":"2026-08-07T12:03:21.367108Z","submitted_at":"2024-10-03T18:12:29Z","title":"LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02884","snapshot_observed_at":"2026-08-07T05:38:34.047050Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:34.047050Z"},"links":{"cited_paper":"/paper/2410.02884","citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:9b43bf10bb7046e63210989950b96fe528e91384a38e93efc4bf5ab8a927ab54","observation_id":"f8eaf83f-44f6-4818-8360-306b7170690b","resolution":{"observed_at":"2026-08-07T05:38:34.047050Z","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-07T05:38:34.115686Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:34.115686Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:449d8fb0f55c9bf507c1f67d08106403093d2cc63feded405a7624b72b8f7b4e","observation_id":"e7b98658-80ac-4818-8e0b-ada713995b07","resolution":{"observed_at":"2026-08-07T05:38:34.115686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:38:34.529181Z","title":null,"venue":null,"work_id":"014224f0-667c-4efc-b8ae-12d2a36163bf","year":2024},"citing_paper":{"arxiv_id":"2506.07557","last_updated":"2025-06-09T08:52:27Z","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T05:38:34.216078Z"},"links":{"citing_paper":"/paper/2506.07557"},"observation_digest":"sha256:0b085766a975cb574229fb50d5140efdd3b30a671d2575ec4426ecefc3e5f186","observation_id":"42012d01-59ba-4863-a743-d04ac604013f","resolution":{"observed_at":"2026-08-07T05:38:34.576440Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2506.07557","last_updated":"2025-06-09T08:52:27Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T05:28:24.761670Z","submitted_at":"2025-06-09T08:52:27Z","title":"SELT: Self-Evaluation Tree Search for LLMs with Task Decomposition"},"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-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 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2506.07557."}