{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AUNUTNAKVSCLZMPA52ZGSTRVGT","short_pith_number":"pith:AUNUTNAK","schema_version":"1.0","canonical_sha256":"051b49b40aac84bcb1e0eeb2694e3534d4120c5dcd9750b369592533f3c31451","source":{"kind":"arxiv","id":"2503.00735","version":3},"attestation_state":"computed","paper":{"title":"LADDER: Self-Improving LLMs Through Recursive Problem Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Akira Yoshiyama, Toby Simonds","submitted_at":"2025-03-02T05:16:43Z","abstract_excerpt":"We introduce LADDER (Learning through Autonomous Difficulty-Driven Example Recursion), a framework which enables Large Language Models to autonomously improve their problem-solving capabilities through self-guided learning by recursively generating and solving progressively simpler variants of complex problems. Unlike prior approaches that require curated datasets or human feedback, LADDER leverages a model's own capabilities to generate easier question variants. We demonstrate LADDER's effectiveness in the subject of mathematical integration, improving Llama 3.2 3B's accuracy from 1% to 82% o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2503.00735","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-02T05:16:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f64c1ef682fdd85d6e6f6eadd150aa3dcdde65d8a2c90db64a90a79a12ed8de4","abstract_canon_sha256":"70791680872741257946870ff4dbec50e2c3d7b1b85bef7d4b2716c8dc408ed1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:24:32.339767Z","signature_b64":"9qyR0yZSOmND0YccrEt2JpcYZuvQTHhnFMauL+8w2o4j76QB5gxzoptXVORAlsjh9a13XYkgPluEalaavq3iDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"051b49b40aac84bcb1e0eeb2694e3534d4120c5dcd9750b369592533f3c31451","last_reissued_at":"2026-07-05T10:24:32.338984Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:24:32.338984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LADDER: Self-Improving LLMs Through Recursive Problem Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Akira Yoshiyama, Toby Simonds","submitted_at":"2025-03-02T05:16:43Z","abstract_excerpt":"We introduce LADDER (Learning through Autonomous Difficulty-Driven Example Recursion), a framework which enables Large Language Models to autonomously improve their problem-solving capabilities through self-guided learning by recursively generating and solving progressively simpler variants of complex problems. Unlike prior approaches that require curated datasets or human feedback, LADDER leverages a model's own capabilities to generate easier question variants. We demonstrate LADDER's effectiveness in the subject of mathematical integration, improving Llama 3.2 3B's accuracy from 1% to 82% o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.00735","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.00735/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2503.00735","created_at":"2026-07-05T10:24:32.339081+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.00735v3","created_at":"2026-07-05T10:24:32.339081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.00735","created_at":"2026-07-05T10:24:32.339081+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUNUTNAKVSCL","created_at":"2026-07-05T10:24:32.339081+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUNUTNAKVSCLZMPA","created_at":"2026-07-05T10:24:32.339081+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUNUTNAK","created_at":"2026-07-05T10:24:32.339081+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18961","citing_title":"Be Your Own Teacher: Steering Protein Language Models via Unsupervised Reward Optimization","ref_index":63,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19444","citing_title":"Detecting and Mitigating the Correct-Answer Extinction Window in Test-Time Reinforcement Learning with Majority Voting","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2507.21046","citing_title":"A Survey of Self-Evolving Agents: What, When, How, and Where to Evolve on the Path to Artificial Super Intelligence","ref_index":264,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AUNUTNAKVSCLZMPA52ZGSTRVGT","json":"https://pith.science/pith/AUNUTNAKVSCLZMPA52ZGSTRVGT.json","graph_json":"https://pith.science/api/pith-number/AUNUTNAKVSCLZMPA52ZGSTRVGT/graph.json","events_json":"https://pith.science/api/pith-number/AUNUTNAKVSCLZMPA52ZGSTRVGT/events.json","paper":"https://pith.science/paper/AUNUTNAK"},"agent_actions":{"view_html":"https://pith.science/pith/AUNUTNAKVSCLZMPA52ZGSTRVGT","download_json":"https://pith.science/pith/AUNUTNAKVSCLZMPA52ZGSTRVGT.json","view_paper":"https://pith.science/paper/AUNUTNAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.00735&json=true","fetch_graph":"https://pith.science/api/pith-number/AUNUTNAKVSCLZMPA52ZGSTRVGT/graph.json","fetch_events":"https://pith.science/api/pith-number/AUNUTNAKVSCLZMPA52ZGSTRVGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUNUTNAKVSCLZMPA52ZGSTRVGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUNUTNAKVSCLZMPA52ZGSTRVGT/action/storage_attestation","attest_author":"https://pith.science/pith/AUNUTNAKVSCLZMPA52ZGSTRVGT/action/author_attestation","sign_citation":"https://pith.science/pith/AUNUTNAKVSCLZMPA52ZGSTRVGT/action/citation_signature","submit_replication":"https://pith.science/pith/AUNUTNAKVSCLZMPA52ZGSTRVGT/action/replication_record"}},"created_at":"2026-07-05T10:24:32.339081+00:00","updated_at":"2026-07-05T10:24:32.339081+00:00"}