Pith. sign in

Paper Citation Record · LEDGER

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning

As of 17 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2505.02576.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2505.02576 v1

Coverage vector

measured 30 of 30 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T00:53:51.421512Z

measured 30 of 30 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

30 of 30 outbound references displayed

  • verified exact1
  • verified fuzzy16
  • unresolved13
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 8929a25a-4567-46f4-afd2-1bfb44a32b25 · outbound

This paper cites write newline.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning write newline

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-16T00:53:51.189912Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T00:53:51.189912Z digest=sha256:e3ec5c451293a0dcbacf3977d749d688e471737df06c30fda9be8af68a369a6f

Observation 573688ce-9941-4aff-8360-7598a5131cc9 · outbound

This paper cites Gemini: A Family of Highly Capable Multimodal Models.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Gemini: A Family of Highly Capable Multimodal Models

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-16T00:53:51.194302Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T00:53:51.194302Z digest=sha256:da1533de231338f7fd8c818d50ad8104ebeba7db6d16eb4f249dca0f1c7f2399

Observation c1d241b2-e36e-431b-b274-fc15651a47e9 · outbound

This paper cites Introducing the next generation of Claude , 2024.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Introducing the next generation of Claude , 2024

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:52.050512Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.198615Z digest=sha256:90cfd95e12f6da4d867c759320571afb00bc6fcbb26b6193cd8ddc7af42b6255

Observation b4221e85-6640-464d-8b9c-94891dc4fcac · outbound

This paper cites Graph of Thoughts : Solving Elaborate Problems with Large Language Models.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Graph of Thoughts : Solving Elaborate Problems with Large Language Models

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.983876Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.202312Z digest=sha256:fe4c5b1cac59becbca59d4e2074140fa1dde00699b7943af9f4220273cb1c87c

Observation 7e62d03a-d512-4314-b98d-5e85db608b86 · outbound

This paper cites Language Models are Few-Shot Learners.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Language Models are Few-Shot Learners

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.973827Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.205990Z digest=sha256:d1f3fb8c1bca6d85dc00897fbe49faa12e64ba7b7377efa69a76cfae92a8032d

Observation 608e6cdb-fa9c-4fd4-ba7a-cd01811e833a · outbound

This paper cites an unresolved cited work.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Unresolved cited work

Reference 6

Resolution
unresolved
raw_fallback, observed 2026-08-16T00:53:51.962338Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.209949Z digest=sha256:a8b1a13e7038e0fd8a97baea06a5749fb4e077c8a47a8c842fc216d305b8ca8d

Observation 546c9671-c069-4e5f-a856-5f1359373f94 · outbound

This paper cites PaLM : Scaling Language Modeling with Pathways.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning PaLM : Scaling Language Modeling with Pathways

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.951139Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.213238Z digest=sha256:e2df39033e055fd732b7082d441d5327bcd06fdf2e428370452b87029fbf981e

Observation 16daf5dc-92ee-4597-a0cb-f77504658774 · outbound

This paper cites an unresolved cited work.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Unresolved cited work

Reference 8

Resolution
unresolved
raw_fallback, observed 2026-08-16T00:53:51.940223Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.216950Z digest=sha256:c034d05c4a526146756f5e7bb4ee08fd8c6dc504802963a3054415710db2c82e

Observation dc8c704f-7a34-47b8-a605-cb13ebe32ade · outbound

This paper cites Hwang, Soumya Sanyal, Xiang Ren, Allyson Ettinger, Zaid Harchaoui, and Yejin Choi.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Hwang, Soumya Sanyal, Xiang Ren, Allyson Ettinger, Zaid Harchaoui, and Yejin Choi

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.907638Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.220309Z digest=sha256:852e2e3e5dfc0518102f38b96e5bbbd32005f921b550f789c8fcf317d692b576

Observation cb5df102-16d5-4cc2-bf75-30f9b69a50a8 · outbound

This paper cites PAL : Program-aided Language Models.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning PAL : Program-aided Language Models

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.863648Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.223963Z digest=sha256:3315a7076b4338fc67145776d076ceb913be8cf6ea53a6da3074303d65acb34b

Observation bd285b45-e87d-471c-81a5-033604cbe319 · outbound

This paper cites Decomposed Prompting : A Modular Approach for Solving Complex Tasks.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Decomposed Prompting : A Modular Approach for Solving Complex Tasks

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.853044Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.227298Z digest=sha256:88c92719c21101cdfae7e378d95ecc0aa486f3c2a83f1454d2a6809ad7b013cc

Observation 2c6b34ec-68bc-4fac-95e8-8450a408f6cb · outbound

This paper cites A Comparison of Most-to-Least and Least-to-Most Prompting on the Acquisition of Solitary Play Skills.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning A Comparison of Most-to-Least and Least-to-Most Prompting on the Acquisition of Solitary Play Skills

Reference 12

Resolution
verified exact
doi, observed 2026-08-16T00:53:51.481554Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.230802Z digest=sha256:e5fbe18734cbd4da395516033f4c423872ee73ef9586bf33fe29ce68c5ca2150

Observation 177a4972-80e6-4e8a-9a45-0625b3f8d384 · outbound

This paper cites Introducing Meta Llama 3: The most capable openly available LLM to date, 2024.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Introducing Meta Llama 3: The most capable openly available LLM to date, 2024

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-16T00:53:51.234098Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T00:53:51.234098Z digest=sha256:832ac6b063ce06a5b226512fce7bc57497484fe1f981319fc8359725f8b0cf48

Observation 641c1cbd-4b7d-43ec-a936-e44935b03565 · outbound

This paper cites Large Language Models as General Pattern Machines.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Large Language Models as General Pattern Machines

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.835033Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.237291Z digest=sha256:9c9bb12a356bfb91803740e86bb5f9d2a0d920e4dba4e33d93800c154df00dbe

Observation b9c9c5dd-b4bd-43fe-ad61-825fd2c25959 · outbound

This paper cites Skeleton-of- Thought : Prompting LLMs for Efficient Parallel Generation.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Skeleton-of- Thought : Prompting LLMs for Efficient Parallel Generation

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.823278Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.240384Z digest=sha256:850e96eefce7b92ada391abcdf2ea35223038d4e1d28632a8f7f3ca93f119987

Observation 86ef0425-3bea-4f50-9b50-b2492147bd11 · outbound

This paper cites Investigating the Limitations of Transformers with Simple Arithmetic Tasks.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Investigating the Limitations of Transformers with Simple Arithmetic Tasks

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-16T00:53:51.243936Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T00:53:51.243936Z digest=sha256:dab393cf582e84779b9cdd091e39b0efa89435ee2d0163d31f50feed77a85fd3

Observation 9c600f69-e886-40f7-bf6b-33b26b41319e · outbound

This paper cites Introducing ChatGPT , November 2022.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Introducing ChatGPT , November 2022

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.802242Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.247748Z digest=sha256:d8d530a243340382dee0982b2bdbfc2f8244c8d0e59bae95693eb2800480f01b

Observation 2424178b-702d-46a0-bb4f-1b78ab00be0b · outbound

This paper cites GPT-4 Technical Report.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning GPT-4 Technical Report

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-16T00:53:51.263144Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T00:53:51.263144Z digest=sha256:04b0e70bcdff2931ae3e9868b69939621d602fef90e6b83baf271d81122b5eb7

Observation 47ab3558-c2f5-4eb3-93fa-dce52057635a · outbound

This paper cites Unsupervised Question Decomposition for Question Answering.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Unsupervised Question Decomposition for Question Answering

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-16T00:53:51.292717Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T00:53:51.292717Z digest=sha256:09bf4e49f06e0093efe9af2581ace3a33518ecb455f5f57db218a3e9a5acfa5d

Observation 21eaf651-be49-4578-9413-94c540587d52 · outbound

This paper cites Child, D.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Child, D

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.722142Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.327917Z digest=sha256:87fd74ebbe661553fd9f050edd3686bd7d08ce10ae770d0e2190088d5027226e

Observation a61a2db8-3156-47fb-9124-f7b488180503 · outbound

This paper cites Distilling Reasoning Capabilities into Smaller Language Models.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Distilling Reasoning Capabilities into Smaller Language Models

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-16T00:53:51.368497Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T00:53:51.368497Z digest=sha256:465e29ece3fdbdd0d77163aeeb650120187bd7100477da5d56a6649100501ec8

Observation 0b24fe9d-9341-40df-bd44-b4fa977a3726 · outbound

This paper cites LLaMA: Open and Efficient Foundation Language Models.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning LLaMA: Open and Efficient Foundation Language Models

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-16T00:53:51.392057Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T00:53:51.392057Z digest=sha256:0641c300a63da929ebb0fdcb8a2638fc5c6bb39890a4b8ac0ad3d5b3017e61df

Observation 98f2e98e-0494-4691-a814-e56efac450ff · outbound

This paper cites Iteratively Prompt Pre-trained Language Models for Chain of Thought.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Iteratively Prompt Pre-trained Language Models for Chain of Thought

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-16T00:53:51.395886Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T00:53:51.395886Z digest=sha256:dac929f4b4b59ea6566d4ef2ef57e39ebc16d8c0438736c08902dde2d3514383

Observation 973ddff2-cb93-4445-84fa-6218bbc23251 · outbound

This paper cites Plan-and- Solve Prompting : Improving Zero-Shot Chain-of-Thought Reasoning by Large Language Models.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Plan-and- Solve Prompting : Improving Zero-Shot Chain-of-Thought Reasoning by Large Language Models

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-16T00:53:51.399989Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T00:53:51.399989Z digest=sha256:34acd25b802ddab7678037ab16c37de7dfea230956c14d4473cff176407eaac2

Observation 122c85f0-6615-47d1-806f-be3c53039a11 · outbound

This paper cites Le, Ed H.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Le, Ed H

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.682530Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.403845Z digest=sha256:b069f3417f3ab2927e3d2eaddf42a9772edf3610f282eb9eb52a6d17b156e709

Observation f30689ce-2e69-4466-a568-c968349ec6c8 · outbound

This paper cites Chi, Quoc V.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Chi, Quoc V

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.670286Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.407206Z digest=sha256:064d9bc19562561c62ec5a4493159c23f30eaf715fbb7f21ee793c2d253dc5f9

Observation fbaaeffe-c61d-4e59-9489-662b1109c371 · outbound

This paper cites Griffiths, Yuan Cao, and Karthik R.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Griffiths, Yuan Cao, and Karthik R

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.657907Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.410750Z digest=sha256:e7535163e6884e28c1056451a7f7deccb377353354db3edc10501bc98369116f

Observation 05f6bd51-6a80-4103-9fd7-91f0103a294c · outbound

This paper cites Parsel : Algorithmic Reasoning with Language Models by Composing Decompositions.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Parsel : Algorithmic Reasoning with Language Models by Composing Decompositions

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.646198Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.414442Z digest=sha256:2565a6f9c25a8a8e14945d33e4ab8f8b0062ceb1d3042a23c58448a0bd2810d9

Observation d134f64d-5ca1-43e1-8984-9a4b3c98546e · outbound

This paper cites An Examination on the Effectiveness of Divide-and-Conquer Prompting in Large Language Models.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning An Examination on the Effectiveness of Divide-and-Conquer Prompting in Large Language Models

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-16T00:53:51.418202Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T00:53:51.418202Z digest=sha256:e8ce7fb330363ebdb03f0c6c4e90fdeb67a1ee87fe5a9ac8c81006300c72193a

Observation 3505b630-2a93-4aa2-9093-4eb449160084 · outbound

This paper cites Le, and Ed H.

Recursive Decomposition with Dependencies for Generic Divide-and-Conquer Reasoning Le, and Ed H

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T00:53:51.590080Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-16T00:53:51.421512Z digest=sha256:26b6d64bc8bc39f0b21b8a429a51edc0d7da5f93c44ff302721a7abfc1bd8020

Pith citing papers

No inbound Pith citation observations are available.