{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ATY5VDXVE4BEMT3OGDIMOGFPCB","short_pith_number":"pith:ATY5VDXV","schema_version":"1.0","canonical_sha256":"04f1da8ef52702464f6e30d0c718af1043b910d3b30cd2e782ffaea9cae3c1dc","source":{"kind":"arxiv","id":"2301.01751","version":2},"attestation_state":"computed","paper":{"title":"Iterated Decomposition: Improving Science Q&A by Supervising Reasoning Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.HC"],"primary_cat":"cs.CL","authors_text":"Andreas Stuhlm\\\"uller, Ben Rachbach, Charlie George, Jungwon Byun, Justin Reppert, Luke Stebbing, Maggie Appleton","submitted_at":"2023-01-04T18:34:25Z","abstract_excerpt":"Language models (LMs) can perform complex reasoning either end-to-end, with hidden latent state, or compositionally, with transparent intermediate state. Composition offers benefits for interpretability and safety, but may need workflow support and infrastructure to remain competitive. We describe iterated decomposition, a human-in-the-loop workflow for developing and refining compositional LM programs. We improve the performance of compositions by zooming in on failing components and refining them through decomposition, additional context, chain of thought, etc. To support this workflow, we d"},"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":"2301.01751","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-01-04T18:34:25Z","cross_cats_sorted":["cs.AI","cs.HC"],"title_canon_sha256":"7a4b79e9c2032a0cbd44336f7f775338ff070a136dfad363adfbcc50098f674c","abstract_canon_sha256":"e9bc39e70b586c84c60da6cde9c909e6c47ed8385ca6c8b8b6cf13569aa63717"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:30:45.518065Z","signature_b64":"Wr3n7AG7O8VTBErcTznE0D8mGYR0XQE5nxPR87bam3KF9wSjGjRjmr86Ipn7pNpq7ih1i2mRwocNlA/NBtWNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04f1da8ef52702464f6e30d0c718af1043b910d3b30cd2e782ffaea9cae3c1dc","last_reissued_at":"2026-07-05T05:30:45.517562Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:30:45.517562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterated Decomposition: Improving Science Q&A by Supervising Reasoning Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.HC"],"primary_cat":"cs.CL","authors_text":"Andreas Stuhlm\\\"uller, Ben Rachbach, Charlie George, Jungwon Byun, Justin Reppert, Luke Stebbing, Maggie Appleton","submitted_at":"2023-01-04T18:34:25Z","abstract_excerpt":"Language models (LMs) can perform complex reasoning either end-to-end, with hidden latent state, or compositionally, with transparent intermediate state. Composition offers benefits for interpretability and safety, but may need workflow support and infrastructure to remain competitive. We describe iterated decomposition, a human-in-the-loop workflow for developing and refining compositional LM programs. We improve the performance of compositions by zooming in on failing components and refining them through decomposition, additional context, chain of thought, etc. To support this workflow, we d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.01751","kind":"arxiv","version":2},"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/2301.01751/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":"2301.01751","created_at":"2026-07-05T05:30:45.517621+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.01751v2","created_at":"2026-07-05T05:30:45.517621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.01751","created_at":"2026-07-05T05:30:45.517621+00:00"},{"alias_kind":"pith_short_12","alias_value":"ATY5VDXVE4BE","created_at":"2026-07-05T05:30:45.517621+00:00"},{"alias_kind":"pith_short_16","alias_value":"ATY5VDXVE4BEMT3O","created_at":"2026-07-05T05:30:45.517621+00:00"},{"alias_kind":"pith_short_8","alias_value":"ATY5VDXV","created_at":"2026-07-05T05:30:45.517621+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23023","citing_title":"How to Steer Your Multi-Agent System: Human-LLM Collaborative Planning","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17815","citing_title":"Navigating the Conceptual Multiverse","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ATY5VDXVE4BEMT3OGDIMOGFPCB","json":"https://pith.science/pith/ATY5VDXVE4BEMT3OGDIMOGFPCB.json","graph_json":"https://pith.science/api/pith-number/ATY5VDXVE4BEMT3OGDIMOGFPCB/graph.json","events_json":"https://pith.science/api/pith-number/ATY5VDXVE4BEMT3OGDIMOGFPCB/events.json","paper":"https://pith.science/paper/ATY5VDXV"},"agent_actions":{"view_html":"https://pith.science/pith/ATY5VDXVE4BEMT3OGDIMOGFPCB","download_json":"https://pith.science/pith/ATY5VDXVE4BEMT3OGDIMOGFPCB.json","view_paper":"https://pith.science/paper/ATY5VDXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.01751&json=true","fetch_graph":"https://pith.science/api/pith-number/ATY5VDXVE4BEMT3OGDIMOGFPCB/graph.json","fetch_events":"https://pith.science/api/pith-number/ATY5VDXVE4BEMT3OGDIMOGFPCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ATY5VDXVE4BEMT3OGDIMOGFPCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ATY5VDXVE4BEMT3OGDIMOGFPCB/action/storage_attestation","attest_author":"https://pith.science/pith/ATY5VDXVE4BEMT3OGDIMOGFPCB/action/author_attestation","sign_citation":"https://pith.science/pith/ATY5VDXVE4BEMT3OGDIMOGFPCB/action/citation_signature","submit_replication":"https://pith.science/pith/ATY5VDXVE4BEMT3OGDIMOGFPCB/action/replication_record"}},"created_at":"2026-07-05T05:30:45.517621+00:00","updated_at":"2026-07-05T05:30:45.517621+00:00"}