{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SUJM24KJZRLRI6JL5ZNIS66UWC","short_pith_number":"pith:SUJM24KJ","schema_version":"1.0","canonical_sha256":"9512cd7149cc5714792bee5a897bd4b095cc740c97109726b885ca37f57c57fd","source":{"kind":"arxiv","id":"2205.12538","version":2},"attestation_state":"computed","paper":{"title":"Is a Question Decomposition Unit All We Need?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.HC","cs.LG"],"primary_cat":"cs.CL","authors_text":"Chitta Baral, Mihir Parmar, Pruthvi Patel, Swaroop Mishra","submitted_at":"2022-05-25T07:24:09Z","abstract_excerpt":"Large Language Models (LMs) have achieved state-of-the-art performance on many Natural Language Processing (NLP) benchmarks. With the growing number of new benchmarks, we build bigger and more complex LMs. However, building new LMs may not be an ideal option owing to the cost, time and environmental impact associated with it. We explore an alternative route: can we modify data by expressing it in terms of the model's strengths, so that a question becomes easier for models to answer? We investigate if humans can decompose a hard question into a set of simpler questions that are relatively easie"},"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":"2205.12538","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-05-25T07:24:09Z","cross_cats_sorted":["cs.AI","cs.HC","cs.LG"],"title_canon_sha256":"ecda8e0ffe3fe0e28b50a6ee8a4eebd0a81482cd0e84f7a5975ec8cb663bdbbf","abstract_canon_sha256":"6ccbf7da1638e87767936c52ae25123ac5c21f3a198886ccd012d85f46354992"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:10:55.974368Z","signature_b64":"DpEwRmhnJ2xMxsx7hsxbeAphIX4VogzaxJhnLMEGd7HmtGoyQVJhkVEFp+a1X2JHGb5bnXPYq7620v2Prr/OCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9512cd7149cc5714792bee5a897bd4b095cc740c97109726b885ca37f57c57fd","last_reissued_at":"2026-07-05T05:10:55.973952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:10:55.973952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Is a Question Decomposition Unit All We Need?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.HC","cs.LG"],"primary_cat":"cs.CL","authors_text":"Chitta Baral, Mihir Parmar, Pruthvi Patel, Swaroop Mishra","submitted_at":"2022-05-25T07:24:09Z","abstract_excerpt":"Large Language Models (LMs) have achieved state-of-the-art performance on many Natural Language Processing (NLP) benchmarks. With the growing number of new benchmarks, we build bigger and more complex LMs. However, building new LMs may not be an ideal option owing to the cost, time and environmental impact associated with it. We explore an alternative route: can we modify data by expressing it in terms of the model's strengths, so that a question becomes easier for models to answer? We investigate if humans can decompose a hard question into a set of simpler questions that are relatively easie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12538","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/2205.12538/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":"2205.12538","created_at":"2026-07-05T05:10:55.974018+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.12538v2","created_at":"2026-07-05T05:10:55.974018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12538","created_at":"2026-07-05T05:10:55.974018+00:00"},{"alias_kind":"pith_short_12","alias_value":"SUJM24KJZRLR","created_at":"2026-07-05T05:10:55.974018+00:00"},{"alias_kind":"pith_short_16","alias_value":"SUJM24KJZRLRI6JL","created_at":"2026-07-05T05:10:55.974018+00:00"},{"alias_kind":"pith_short_8","alias_value":"SUJM24KJ","created_at":"2026-07-05T05:10:55.974018+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.15101","citing_title":"Review-Then-Refine: A Dynamic Framework for Multi-Hop Question Answering with Temporal Adaptability","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SUJM24KJZRLRI6JL5ZNIS66UWC","json":"https://pith.science/pith/SUJM24KJZRLRI6JL5ZNIS66UWC.json","graph_json":"https://pith.science/api/pith-number/SUJM24KJZRLRI6JL5ZNIS66UWC/graph.json","events_json":"https://pith.science/api/pith-number/SUJM24KJZRLRI6JL5ZNIS66UWC/events.json","paper":"https://pith.science/paper/SUJM24KJ"},"agent_actions":{"view_html":"https://pith.science/pith/SUJM24KJZRLRI6JL5ZNIS66UWC","download_json":"https://pith.science/pith/SUJM24KJZRLRI6JL5ZNIS66UWC.json","view_paper":"https://pith.science/paper/SUJM24KJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.12538&json=true","fetch_graph":"https://pith.science/api/pith-number/SUJM24KJZRLRI6JL5ZNIS66UWC/graph.json","fetch_events":"https://pith.science/api/pith-number/SUJM24KJZRLRI6JL5ZNIS66UWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SUJM24KJZRLRI6JL5ZNIS66UWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SUJM24KJZRLRI6JL5ZNIS66UWC/action/storage_attestation","attest_author":"https://pith.science/pith/SUJM24KJZRLRI6JL5ZNIS66UWC/action/author_attestation","sign_citation":"https://pith.science/pith/SUJM24KJZRLRI6JL5ZNIS66UWC/action/citation_signature","submit_replication":"https://pith.science/pith/SUJM24KJZRLRI6JL5ZNIS66UWC/action/replication_record"}},"created_at":"2026-07-05T05:10:55.974018+00:00","updated_at":"2026-07-05T05:10:55.974018+00:00"}