Paper Citation Record · LEDGER

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer

As of 8 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2608.03461.

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

pith.paper-citation-record.v1
2608.03461 v1

Coverage vector

measured 39 of 39 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-05T18:51:31.244551Z

measured 39 of 39 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+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

39 of 39 outbound references displayed

verified exact5
verified fuzzy21
unresolved12
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation af439342-f6fc-43fa-8d35-50fcdd53e03d · outbound

This paper cites Towards a generic algorithm for identifying high-quality decompositions of optimization problems.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Towards a generic algorithm for identifying high-quality decompositions of optimization problems

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.699580Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation e450b669-dd58-4305-970a-e5a541a48153 · outbound

This paper cites Syntax- guided synthesis.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Syntax- guided synthesis

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.691262Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation ad2d51b0-b75c-440f-ac0a-af33e8e21c76 · outbound

This paper cites DeepCoder: Learning to Write Programs.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer DeepCoder: Learning to Write Programs

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-05T18:51:29.021512Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2adb7d50-964d-43f1-9b16-b9b143ca2091 · outbound

This paper cites Flashfill++: Scaling programming by example by cutting to the chase.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Flashfill++: Scaling programming by example by cutting to the chase

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.683778Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 095a3986-6726-4781-94d8-7017a26af1fd · outbound

This paper cites Hipo: Instruction hierarchy via constrained reinforcement learning.arXiv preprint arXiv:2603.16152, 2026.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Hipo: Instruction hierarchy via constrained reinforcement learning.arXiv preprint arXiv:2603.16152, 2026

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-05T18:51:29.114010Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 31b2c117-e21e-45f8-b345-eea9bed3a9ab · outbound

This paper cites Compositional generalization via neural-symbolic stack machines.Advances in Neural Information Processing Systems, 33:1690–1701, 2020.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Compositional generalization via neural-symbolic stack machines.Advances in Neural Information Processing Systems, 33:1690–1701, 2020

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.675729Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 8dd688c0-8405-427a-8583-a137d61576e9 · outbound

This paper cites Generating Planning Feedback for Open-Ended Programming Exercises with LLMs.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Generating Planning Feedback for Open-Ended Programming Exercises with LLMs

Reference 7

Resolution: verified exact; local_arxiv, observed 2026-08-05T18:51:31.408672Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation f440cb6a-8ee9-4db2-a775-00b24c1f9d93 · outbound

This paper cites Robustfill: Neural program learning under noisy i/o.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Robustfill: Neural program learning under noisy i/o

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.667736Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 5ec0486c-4ab2-4ef9-a4d9-552c3ea7786a · outbound

This paper cites Synthesizing data structure transformations from input-output examples.ACM SIGPLAN Notices, 50(6):229–239, 2015.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Synthesizing data structure transformations from input-output examples.ACM SIGPLAN Notices, 50(6):229–239, 2015

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.659737Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 139fd342-d5ea-4885-9e74-01fcaaef730d · outbound

This paper cites Au- tomated curriculum learning for neural networks.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Au- tomated curriculum learning for neural networks

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.650891Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation f84f4926-0f72-46cc-ac07-81744874c136 · outbound

This paper cites Automating string processing in spreadsheets using input-output examples.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Automating string processing in spreadsheets using input-output examples

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.642727Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 65281f93-a9c2-423e-9d9d-aef2f0331b27 · outbound

This paper cites Latent program- mer: Discrete latent codes for program synthesis.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Latent program- mer: Discrete latent codes for program synthesis

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.634449Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 9ef69ba3-016e-43d3-ae4c-fbeb343bc51f · outbound

This paper cites Compositional Program Generation for Few-Shot Systematic Generalization.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Compositional Program Generation for Few-Shot Systematic Generalization

Reference 13

Resolution: verified exact; local_arxiv, observed 2026-08-05T18:51:31.397635Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 2306de7a-8fa8-4706-938f-3b8db7da364f · outbound

This paper cites Addison-Wesley Professional, 1998.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Addison-Wesley Professional, 1998

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.626661Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation ad921d69-71b8-43e7-a3b1-308926986366 · outbound

This paper cites Coderl: Mastering code generation through pretrained models and deep reinforcement learning.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Coderl: Mastering code generation through pretrained models and deep reinforcement learning

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.618907Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 6ac28254-5831-4f15-8669-13fd9660a111 · outbound

This paper cites Accelerating search-based program synthesis using learned probabilistic models.ACM SIGPLAN Notices, 53(4):436–449, 2018.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Accelerating search-based program synthesis using learned probabilistic models.ACM SIGPLAN Notices, 53(4):436–449, 2018

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.610499Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 235982fa-b2bd-4f42-9d0f-0c91eca8843f · outbound

This paper cites Is Programming by Example solved by LLMs?.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Is Programming by Example solved by LLMs?

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-05T18:51:29.830507Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30226096-acc3-484f-a07f-5363a4927d17 · outbound

This paper cites Hierarchical programmatic reinforcement learning via learning to compose programs.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Hierarchical programmatic reinforcement learning via learning to compose programs

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-05T18:51:29.904675Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fcec38c6-ebf0-41b8-9b39-c2fa97d3348a · outbound

This paper cites Self-refine: Iterative refinement with self-feedback.Advances in neural information processing systems, pages 46534–46594, 2023.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Self-refine: Iterative refinement with self-feedback.Advances in neural information processing systems, pages 46534–46594, 2023

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.597504Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 63f0922d-824e-4e1a-92cb-07d86f038901 · outbound

This paper cites Teacher–student curriculum learning.IEEE transactions on neural networks and learning systems, 31(9):3732–3740, 2019.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Teacher–student curriculum learning.IEEE transactions on neural networks and learning systems, 31(9):3732–3740, 2019

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.589657Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation dda985b0-42f4-47ad-bcef-5fce053f399d · outbound

This paper cites Neural Sketch Learning for Conditional Program Generation.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Neural Sketch Learning for Conditional Program Generation

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-05T18:51:30.115219Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4170095d-49f4-4602-93ba-84c0ea097b82 · outbound

This paper cites Learning to infer program sketches.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Learning to infer program sketches

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.581879Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 74643d82-c2ea-49c6-8c8b-460ce83edb48 · outbound

This paper cites Is Self-Repair a Silver Bullet for Code Generation?.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Is Self-Repair a Silver Bullet for Code Generation?

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-05T18:51:30.162658Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a8a5977-0b94-4b52-9048-8bdf7e68eae8 · outbound

This paper cites Doing experiments and revising rules with natural language and probabilistic reasoning.Advances in Neural Information Processing Systems, 37:53102–53137, 2024.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Doing experiments and revising rules with natural language and probabilistic reasoning.Advances in Neural Information Processing Systems, 37:53102–53137, 2024

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.573393Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 923ed18c-373b-422f-9132-77c2d3eb5ae9 · outbound

This paper cites Automatic Curriculum Learning For Deep RL: A Short Survey.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Automatic Curriculum Learning For Deep RL: A Short Survey

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-05T18:51:30.449280Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3711e986-a8a8-4db6-bd90-561e9bb6f0a4 · outbound

This paper cites ADaPT: As-Needed Decomposition and Planning with Language Models.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer ADaPT: As-Needed Decomposition and Planning with Language Models

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-05T18:51:30.565648Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e451f00-9172-4bea-94f2-4e38dc7074c0 · outbound

This paper cites Phenomenal Yet Puzzling: Testing Inductive Reasoning Capabilities of Language Models with Hypothesis Refinement.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Phenomenal Yet Puzzling: Testing Inductive Reasoning Capabilities of Language Models with Hypothesis Refinement

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-05T18:51:30.714339Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cc13da93-6b69-489f-a87d-c246661b235a · outbound

This paper cites Sequence Level Training with Recurrent Neural Networks.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Sequence Level Training with Recurrent Neural Networks

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-05T18:51:30.831063Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 44632b90-f252-4267-9861-3af626e8a71b · outbound

This paper cites Self- critical sequence training for image captioning.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Self- critical sequence training for image captioning

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.564615Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 0ea1d8ef-a77f-4df9-a968-8b1255fc20b7 · outbound

This paper cites Lambdabeam: Neural program search with higher-order functions and lambdas.Advances in Neural Information Processing Systems, pages 51327–51346, 2023.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Lambdabeam: Neural program search with higher-order functions and lambdas.Advances in Neural Information Processing Systems, pages 51327–51346, 2023

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.556721Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 36da0d9a-39af-4cf7-9209-3a5af2c7053f · outbound

This paper cites ExeDec: Execution Decomposition for Compositional Generalization in Neural Program Synthesis.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer ExeDec: Execution Decomposition for Compositional Generalization in Neural Program Synthesis

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-05T18:51:31.217308Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ac6f732-a317-47f8-a2e0-9685a297554b · outbound

This paper cites Synthetic Datasets for Neural Program Synthesis.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Synthetic Datasets for Neural Program Synthesis

Reference 32

Resolution: verified exact; local_arxiv, observed 2026-08-05T18:51:31.324462Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation cf187b88-0e45-4278-bc5a-689778af4f39 · outbound

This paper cites University of California, Berkeley, 2008.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer University of California, Berkeley, 2008

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.548258Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 2fad472a-e13c-4d14-9c87-7d2dfb9cb840 · outbound

This paper cites Learning to synthesize programs as interpretable and generalizable policies.Advances in neural information processing systems, 34:25146–25163, 2021.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Learning to synthesize programs as interpretable and generalizable policies.Advances in neural information processing systems, 34:25146–25163, 2021

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.540292Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 6a881051-4e9f-4ee4-bfc2-f677d019a542 · outbound

This paper cites A Divide-Align-Conquer Strategy for Program Synthesis.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer A Divide-Align-Conquer Strategy for Program Synthesis

Reference 35

Resolution: verified exact; local_arxiv, observed 2026-08-05T18:51:31.312954Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 8e9dc693-bfd6-4a2a-8fc1-c1c47bc021fe · outbound

This paper cites A Syntactic Neural Model for General-Purpose Code Generation.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer A Syntactic Neural Model for General-Purpose Code Generation

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-05T18:51:31.233876Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8bccfc85-65ff-47b5-a0fb-3e9641fc88d6 · outbound

This paper cites Beyond Either-Or Reasoning: Transduction and Induction as Cooperative Problem-Solving Paradigms.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Beyond Either-Or Reasoning: Transduction and Induction as Cooperative Problem-Solving Paradigms

Reference 37

Resolution: verified exact; local_arxiv, observed 2026-08-05T18:51:31.288534Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 34c9818c-a02b-4a85-975d-a0df969a136d · outbound

This paper cites Planning with Large Language Models for Code Generation.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Planning with Large Language Models for Code Generation

Reference 38

Resolution: malformed identifier; no resolver link, observed 2026-08-05T18:51:31.240272Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 232d7d57-5563-4e7e-a9bd-b7a1bbe60c05 · outbound

This paper cites Guidelines: 30 • The answer [N/A] means that the paper does not involve crowdsourcing nor research with human subjects.

Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer Guidelines: 30 • The answer [N/A] means that the paper does not involve crowdsourcing nor research with human subjects

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T18:51:31.532343Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Pith citing papers

No inbound Pith citation observations are available.