{"as_of":"2026-08-16T21:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:310c24cbf52f939a661256e247f179b8f1f9adfae122a5ed9b5b1826c9c5c71d","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:53:51.421512Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2505.02576/citation-record","integrity":"/paper/2505.02576/integrity","json":"/paper/2505.02576/citation-record.json","paper":"/paper/2505.02576"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:53:51.189912Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.189912Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:e3ec5c451293a0dcbacf3977d749d688e471737df06c30fda9be8af68a369a6f","observation_id":"8929a25a-4567-46f4-afd2-1bfb44a32b25","resolution":{"observed_at":"2026-08-16T00:53:51.189912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11805","last_updated":"2025-05-09T21:04:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-19T02:39:27Z","title":"Gemini: A Family of Highly Capable Multimodal Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11805","snapshot_observed_at":"2026-08-16T00:53:51.194302Z","title":"Dai, Anja Hauth, Katie Millican, David Silver, et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.194302Z"},"links":{"cited_paper":"/paper/2312.11805","citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:da1533de231338f7fd8c818d50ad8104ebeba7db6d16eb4f249dca0f1c7f2399","observation_id":"573688ce-9941-4aff-8360-7598a5131cc9","resolution":{"observed_at":"2026-08-16T00:53:51.194302Z","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-16T00:53:52.005709Z","title":"Introducing the next generation of Claude , 2024","venue":null,"work_id":"de092791-bc1f-4d8f-9d6d-88c1bfd10851","year":2024},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.198615Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:296cb3c6eabe4f9be9f8f09d56fa4882d18d7eb734222c214039dbb8d1fde708","observation_id":"c1d241b2-e36e-431b-b274-fc15651a47e9","resolution":{"observed_at":"2026-08-16T00:53:52.050512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.980198Z","title":"Graph of Thoughts : Solving Elaborate Problems with Large Language Models","venue":null,"work_id":"c6cd2414-049c-4710-97f9-3bbfc7df8982","year":2024},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.202312Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:82bda83ef1546daa38b548a12a8f4def68c07d8defafab12296b1bc83d4c5006","observation_id":"b4221e85-6640-464d-8b9c-94891dc4fcac","resolution":{"observed_at":"2026-08-16T00:53:51.983876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.969738Z","title":"Language Models are Few-Shot Learners","venue":null,"work_id":"f34b1c75-d141-424b-9409-45f7cce7ce24","year":1901},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.205990Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:944b79a36eb3818995ca94f82619ecbbc8ccf66f45548cbcdcf3c4be6e64a3be","observation_id":"7e62d03a-d512-4314-b98d-5e85db608b86","resolution":{"observed_at":"2026-08-16T00:53:51.973827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.958621Z","title":null,"venue":null,"work_id":"c8ecb4d7-0417-4a2b-809a-6d04ac01a5d3","year":2023},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.209949Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:38ca9f3eb53869024579f9898b37e112d9e92ade3430bedcc01ccfd3b1a178a1","observation_id":"608e6cdb-fa9c-4fd4-ba7a-cd01811e833a","resolution":{"observed_at":"2026-08-16T00:53:51.962338Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.947532Z","title":"PaLM : Scaling Language Modeling with Pathways","venue":null,"work_id":"518fe2cc-b22e-4143-b7da-578d14b696e3","year":2023},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.213238Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:889849925617b67060763cae80f6e8572a07452f6811bde9599a0a3c7cad4038","observation_id":"546c9671-c069-4e5f-a856-5f1359373f94","resolution":{"observed_at":"2026-08-16T00:53:51.951139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.936471Z","title":null,"venue":null,"work_id":"07d24cd9-bf2c-4a01-ba7b-c676211f6591","year":2022},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.216950Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:43f448e14022b2a685c44d40a8db7f2e33d5fee1ac263564f6691ff1ed9f5fb1","observation_id":"16daf5dc-92ee-4597-a0cb-f77504658774","resolution":{"observed_at":"2026-08-16T00:53:51.940223Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.871062Z","title":"Hwang, Soumya Sanyal, Xiang Ren, Allyson Ettinger, Zaid Harchaoui, and Yejin Choi","venue":null,"work_id":"d195c274-4d63-4aab-9c0a-526d3ae90850","year":2023},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.220309Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:ab21b647e486a9c218d5ac83c64e80b2b4c9ca3006b6c41a82aa8aac84d7b171","observation_id":"dc8c704f-7a34-47b8-a605-cb13ebe32ade","resolution":{"observed_at":"2026-08-16T00:53:51.907638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.860197Z","title":"PAL : Program-aided Language Models","venue":null,"work_id":"ec30a51f-4d64-4db3-9bcc-7dcfd4003304","year":2023},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.223963Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:2c6fbab386469fc05417c0aa3f2521dc9fb68c32650e4a949fc2788fa8066cf1","observation_id":"cb5df102-16d5-4cc2-bf75-30f9b69a50a8","resolution":{"observed_at":"2026-08-16T00:53:51.863648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.848826Z","title":"Decomposed Prompting : A Modular Approach for Solving Complex Tasks","venue":null,"work_id":"edccc00b-3cbb-4102-af2f-77758153d0ba","year":2022},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.227298Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:47af7268e9fbac4d09a03d3a1da38693a6fd1f702b392098bd6b45509e43e244","observation_id":"bd285b45-e87d-471c-81a5-033604cbe319","resolution":{"observed_at":"2026-08-16T00:53:51.853044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf03391719","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T00:53:51.475180Z","title":"A Comparison of Most-to-Least and Least-to-Most Prompting on the Acquisition of Solitary Play Skills","venue":null,"work_id":"5e2abb67-ae05-438f-bcb7-b51caed68c4b","year":2008},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.230802Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:6a53a85a74b2ebc06c726659ffb25d934b1d3f142c8b1718de44f5cde87c2838","observation_id":"2c6b34ec-68bc-4fac-95e8-8450a408f6cb","resolution":{"observed_at":"2026-08-16T00:53:51.481554Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.234098Z","title":"Introducing Meta Llama 3: The most capable openly available LLM to date, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.234098Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:832ac6b063ce06a5b226512fce7bc57497484fe1f981319fc8359725f8b0cf48","observation_id":"177a4972-80e6-4e8a-9a45-0625b3f8d384","resolution":{"observed_at":"2026-08-16T00:53:51.234098Z","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-16T00:53:51.831332Z","title":"Large Language Models as General Pattern Machines","venue":null,"work_id":"9cad2b08-b915-45ce-890f-0c8efc0a5f8d","year":2023},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.237291Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:495e74933c3483f80144b7f9749bfd745484c018b914bce0f4e4f1435a091fab","observation_id":"641c1cbd-4b7d-43ec-a936-e44935b03565","resolution":{"observed_at":"2026-08-16T00:53:51.835033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.819414Z","title":"Skeleton-of- Thought : Prompting LLMs for Efficient Parallel Generation","venue":null,"work_id":"aba7e7f6-7400-4158-a0f6-bc138b8b893a","year":2023},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.240384Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:888cb5a1eee6b677d02c831dce08fcbc36001ca554205b0219ec34ae5fa0a4b8","observation_id":"b9c9c5dd-b4bd-43fe-ad61-825fd2c25959","resolution":{"observed_at":"2026-08-16T00:53:51.823278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.13019","last_updated":"2021-04-12T19:58:27Z","snapshot_observed_at":"2026-08-16T18:42:58.085754Z","submitted_at":"2021-02-25T17:22:53Z","title":"Investigating the Limitations of Transformers with Simple Arithmetic Tasks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.13019","snapshot_observed_at":"2026-08-16T00:53:51.243936Z","title":"Investigating the Limitations of Transformers with Simple Arithmetic Tasks , April 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.243936Z"},"links":{"cited_paper":"/paper/2102.13019","citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:dab393cf582e84779b9cdd091e39b0efa89435ee2d0163d31f50feed77a85fd3","observation_id":"86ef0425-3bea-4f50-9b50-b2492147bd11","resolution":{"observed_at":"2026-08-16T00:53:51.243936Z","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-16T00:53:51.763525Z","title":"Introducing ChatGPT , November 2022","venue":null,"work_id":"3ff47747-3f7f-4e9c-9e51-394f621ae15c","year":2022},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.247748Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:0bedc4bbe6850fd8bd59753528cad94a33026c6fd1bb91334dd74660a92d5bf1","observation_id":"9c600f69-e886-40f7-bf6b-33b26b41319e","resolution":{"observed_at":"2026-08-16T00:53:51.802242Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-16T19:40:28.523700Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-16T00:53:51.263144Z","title":"GPT-4 Technical Report , March 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.263144Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:025ff43eb9e012e3cb43f4775e0b6490eadebd2581a64b0714c3c5eb93212823","observation_id":"2424178b-702d-46a0-bb4f-1b78ab00be0b","resolution":{"observed_at":"2026-08-16T00:53:51.263144Z","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-16T00:53:51.292717Z","title":"Unsupervised Question Decomposition for Question Answering","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.292717Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:09bf4e49f06e0093efe9af2581ace3a33518ecb455f5f57db218a3e9a5acfa5d","observation_id":"47ab3558-c2f5-4eb3-93fa-dce52057635a","resolution":{"observed_at":"2026-08-16T00:53:51.292717Z","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-16T00:53:51.690573Z","title":"Child, D","venue":null,"work_id":"8e7aad77-5a40-46ae-950d-a7c99ee0e52c","year":2019},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.327917Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:cbbbd681cc3bc03024e96993e0001a07ad922df19980c4a769e89eb4ee165fdd","observation_id":"21eaf651-be49-4578-9413-94c540587d52","resolution":{"observed_at":"2026-08-16T00:53:51.722142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.368497Z","title":"Distilling Reasoning Capabilities into Smaller Language Models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.368497Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:465e29ece3fdbdd0d77163aeeb650120187bd7100477da5d56a6649100501ec8","observation_id":"a61a2db8-3156-47fb-9124-f7b488180503","resolution":{"observed_at":"2026-08-16T00:53:51.368497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-16T00:53:51.392057Z","title":"LLaMA : Open and Efficient Foundation Language Models , February 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.392057Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:0641c300a63da929ebb0fdcb8a2638fc5c6bb39890a4b8ac0ad3d5b3017e61df","observation_id":"0b24fe9d-9341-40df-bd44-b4fa977a3726","resolution":{"observed_at":"2026-08-16T00:53:51.392057Z","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-16T00:53:51.395886Z","title":"Iteratively Prompt Pre-trained Language Models for Chain of Thought","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.395886Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:dac929f4b4b59ea6566d4ef2ef57e39ebc16d8c0438736c08902dde2d3514383","observation_id":"98f2e98e-0494-4691-a814-e56efac450ff","resolution":{"observed_at":"2026-08-16T00:53:51.395886Z","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-16T00:53:51.399989Z","title":"Plan-and- Solve Prompting : Improving Zero-Shot Chain-of-Thought Reasoning by Large Language Models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.399989Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:34acd25b802ddab7678037ab16c37de7dfea230956c14d4473cff176407eaac2","observation_id":"973ddff2-cb93-4445-84fa-6218bbc23251","resolution":{"observed_at":"2026-08-16T00:53:51.399989Z","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-16T00:53:51.678143Z","title":"Le, Ed H","venue":null,"work_id":"a4797b6c-a239-46ea-8bfd-1caf7bee7ea0","year":2022},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.403845Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:6f5682345a44ab217fdd7b51c5bb0f7b147e7c2d166d82821e64cf3ae4c53811","observation_id":"122c85f0-6615-47d1-806f-be3c53039a11","resolution":{"observed_at":"2026-08-16T00:53:51.682530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.666709Z","title":"Chi, Quoc V","venue":null,"work_id":"2a255c71-235b-412a-a8bb-b7c0d852e6e2","year":2022},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.407206Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:107ca6da9ef10ca64c15b92b1b3fe96492d8b2934bdf3dc0111922af9eaaf1a6","observation_id":"f30689ce-2e69-4466-a568-c968349ec6c8","resolution":{"observed_at":"2026-08-16T00:53:51.670286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.653850Z","title":"Griffiths, Yuan Cao, and Karthik R","venue":null,"work_id":"de0b7963-64a4-4b2a-b439-63c683a4c0c3","year":2023},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.410750Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:1b28fb93b0597841d208b102f632be91010bb088aa645a3aba37757fa2c9fce4","observation_id":"fbaaeffe-c61d-4e59-9489-662b1109c371","resolution":{"observed_at":"2026-08-16T00:53:51.657907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-16T00:53:51.637136Z","title":"Parsel : Algorithmic Reasoning with Language Models by Composing Decompositions","venue":null,"work_id":"ec6c6056-8a6e-4e4c-9ab4-06b50c803c3a","year":2023},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.414442Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:f1017231ac089a13c6666ef3b7e6613d0529a90f2241831afebbfd7407a6cdc3","observation_id":"05f6bd51-6a80-4103-9fd7-91f0103a294c","resolution":{"observed_at":"2026-08-16T00:53:51.646198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05359","last_updated":"2024-07-02T18:18:18Z","snapshot_observed_at":"2026-08-16T14:20:23.334377Z","submitted_at":"2024-02-08T02:37:30Z","title":"An Examination on the Effectiveness of Divide-and-Conquer Prompting in Large Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05359","snapshot_observed_at":"2026-08-16T00:53:51.418202Z","title":"An examination on the effectiveness of divide-and-conquer prompting in large language models, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.418202Z"},"links":{"cited_paper":"/paper/2402.05359","citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:e8ce7fb330363ebdb03f0c6c4e90fdeb67a1ee87fe5a9ac8c81006300c72193a","observation_id":"d134f64d-5ca1-43e1-8984-9a4b3c98546e","resolution":{"observed_at":"2026-08-16T00:53:51.418202Z","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-16T00:53:51.539118Z","title":"Le, and Ed H","venue":null,"work_id":"d6ec1d9e-2a7f-4553-b186-8298016f6969","year":2022},"citing_paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T00:53:51.421512Z"},"links":{"citing_paper":"/paper/2505.02576"},"observation_digest":"sha256:61af418fb6d985c3d3a71d9675f532f4b482284fc88c67fd1eedb3d6addc2190","observation_id":"3505b630-2a93-4aa2-9093-4eb449160084","resolution":{"observed_at":"2026-08-16T00:53:51.590080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.02576","last_updated":"2025-05-05T11:24:20Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T00:45:09.087494Z","submitted_at":"2025-05-05T11:24:20Z","title":"Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":1,"verified_fuzzy":16},"total_outbound_references":30},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2505.02576."}