{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IGRCN2TDRTEV3TGWHND7AJY3CP","short_pith_number":"pith:IGRCN2TD","schema_version":"1.0","canonical_sha256":"41a226ea638cc95dccd63b47f0271b13e8b50ac8e6e1ab6cefa42fa799a30007","source":{"kind":"arxiv","id":"2009.00751","version":2},"attestation_state":"computed","paper":{"title":"Text Modular Networks: Learning to Decompose Tasks in the Language of Existing Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Ashish Sabharwal, Daniel Khashabi, Kyle Richardson, Peter Clark, Tushar Khot","submitted_at":"2020-09-01T23:45:42Z","abstract_excerpt":"We propose a general framework called Text Modular Networks(TMNs) for building interpretable systems that learn to solve complex tasks by decomposing them into simpler ones solvable by existing models. To ensure solvability of simpler tasks, TMNs learn the textual input-output behavior (i.e., language) of existing models through their datasets. This differs from prior decomposition-based approaches which, besides being designed specifically for each complex task, produce decompositions independent of existing sub-models. Specifically, we focus on Question Answering (QA) and show how to train a"},"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":"2009.00751","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-09-01T23:45:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7541eb07ca2d8957aa5b59e8bfe9790b831a406a0f0ac12830bd6de21116ada9","abstract_canon_sha256":"fdaa56c560d3bc544aacf9e6344762fd614a0876a2f92251e70049e595cf0f28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:31:19.091835Z","signature_b64":"0I6+rojC3bnf5GZym5QE5cwdgtZfwAzKnHodqDJYQ/1iftypJ1G61+ADdIc3uiSw77jURAfGhWgQ08VbX21vAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41a226ea638cc95dccd63b47f0271b13e8b50ac8e6e1ab6cefa42fa799a30007","last_reissued_at":"2026-07-05T02:31:19.091437Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:31:19.091437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Text Modular Networks: Learning to Decompose Tasks in the Language of Existing Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Ashish Sabharwal, Daniel Khashabi, Kyle Richardson, Peter Clark, Tushar Khot","submitted_at":"2020-09-01T23:45:42Z","abstract_excerpt":"We propose a general framework called Text Modular Networks(TMNs) for building interpretable systems that learn to solve complex tasks by decomposing them into simpler ones solvable by existing models. To ensure solvability of simpler tasks, TMNs learn the textual input-output behavior (i.e., language) of existing models through their datasets. This differs from prior decomposition-based approaches which, besides being designed specifically for each complex task, produce decompositions independent of existing sub-models. Specifically, we focus on Question Answering (QA) and show how to train a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.00751","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/2009.00751/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":"2009.00751","created_at":"2026-07-05T02:31:19.091490+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.00751v2","created_at":"2026-07-05T02:31:19.091490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.00751","created_at":"2026-07-05T02:31:19.091490+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGRCN2TDRTEV","created_at":"2026-07-05T02:31:19.091490+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGRCN2TDRTEV3TGW","created_at":"2026-07-05T02:31:19.091490+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGRCN2TD","created_at":"2026-07-05T02:31:19.091490+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2104.08773","citing_title":"Cross-Task Generalization via Natural Language Crowdsourcing Instructions","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IGRCN2TDRTEV3TGWHND7AJY3CP","json":"https://pith.science/pith/IGRCN2TDRTEV3TGWHND7AJY3CP.json","graph_json":"https://pith.science/api/pith-number/IGRCN2TDRTEV3TGWHND7AJY3CP/graph.json","events_json":"https://pith.science/api/pith-number/IGRCN2TDRTEV3TGWHND7AJY3CP/events.json","paper":"https://pith.science/paper/IGRCN2TD"},"agent_actions":{"view_html":"https://pith.science/pith/IGRCN2TDRTEV3TGWHND7AJY3CP","download_json":"https://pith.science/pith/IGRCN2TDRTEV3TGWHND7AJY3CP.json","view_paper":"https://pith.science/paper/IGRCN2TD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.00751&json=true","fetch_graph":"https://pith.science/api/pith-number/IGRCN2TDRTEV3TGWHND7AJY3CP/graph.json","fetch_events":"https://pith.science/api/pith-number/IGRCN2TDRTEV3TGWHND7AJY3CP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGRCN2TDRTEV3TGWHND7AJY3CP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGRCN2TDRTEV3TGWHND7AJY3CP/action/storage_attestation","attest_author":"https://pith.science/pith/IGRCN2TDRTEV3TGWHND7AJY3CP/action/author_attestation","sign_citation":"https://pith.science/pith/IGRCN2TDRTEV3TGWHND7AJY3CP/action/citation_signature","submit_replication":"https://pith.science/pith/IGRCN2TDRTEV3TGWHND7AJY3CP/action/replication_record"}},"created_at":"2026-07-05T02:31:19.091490+00:00","updated_at":"2026-07-05T02:31:19.091490+00:00"}