Pith. sign in

REVIEW 2 cited by

MoT: Modularization-of-Thought Prompting for Effective Code Generation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.12483 v2 pith:L7UPOUPX submitted 2025-03-16 cs.SE

classification cs.SE
keywords reasoningcodepromptingcomplexgenerationllmsmodularizationproblems
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Large Language Models are transforming software development by automatically generating code. Current prompting techniques such as Chain-of-Thought (CoT) suggest tasks step by step and the reasoning process follows a linear structure, which hampers the understanding of complex programming problems, particularly those requiring hierarchical solutions. Inspired by the principle of modularization in software development, in this work, we propose a novel prompting technique called MoT (Modularization of Thought), to enhance the code generation performance of LLMs. First, MoT exploits modularization principles to decompose complex programming problems into smaller, independent reasoning steps, enabling a more structured and interpretable problem-solving process. This hierarchical structure improves the LLMs' ability to comprehend complex programming problems. Then, it structures the reasoning process using an MLR Graph (Multi-Level Reasoning Graph), which hierarchically organizes reasoning steps. This approach enhances modular understanding and ensures better alignment between reasoning steps and the generated code, significantly improving code generation performance. Our experiments on two advanced LLMs (GPT-4o-mini and DeepSeek-R1), comparing MoT to six baseline prompting techniques across eight benchmarks, demonstrate that MoT significantly outperforms existing baselines (e.g., CoT and SCoT), achieving Pass@1 scores ranging from 58.1% to 95.1%.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Effective and Efficient Context Retrieval via Partial Dependency Graph for Repository-Level Code Generation

    cs.SE 2026-08 conditional novelty 6.0 of 10

    An LLM-driven partial dependency graph retriever improves repository-level code generation Pass@1 by 25.63% and 59.73% over RAG baselines on CoderEval and DevEval, with a 7.4x speedup over static graph construction.

  2. Talking Surveys: How Photorealistic Embodied Conversational Agents Shape Response Quality, Engagement, and Satisfaction

    cs.HC 2025-08 conditional novelty 6.0 of 10

    A photorealistic speaking avatar elicits longer, more information-dense survey responses than a text chatbot, but with worse clarity and no satisfaction benefit.

Pith tools