{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EO4URKSLFBOLK5TX5TK4MDLGWQ","short_pith_number":"pith:EO4URKSL","schema_version":"1.0","canonical_sha256":"23b948aa4b285cb57677ecd5c60d66b412fba8471e341f6a6920965c46f08737","source":{"kind":"arxiv","id":"2104.07081","version":2},"attestation_state":"computed","paper":{"title":"TWEAC: Transformer with Extendable QA Agent Classifiers","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Andreas R\\\"uckl\\'e, Gregor Geigle, Iryna Gurevych, Nils Reimers","submitted_at":"2021-04-14T19:06:11Z","abstract_excerpt":"Question answering systems should help users to access knowledge on a broad range of topics and to answer a wide array of different questions. Most systems fall short of this expectation as they are only specialized in one particular setting, e.g., answering factual questions with Wikipedia data. To overcome this limitation, we propose composing multiple QA agents within a meta-QA system. We argue that there exist a wide range of specialized QA agents in literature. Thus, we address the central research question of how to effectively and efficiently identify suitable QA agents for any given qu"},"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":"2104.07081","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2021-04-14T19:06:11Z","cross_cats_sorted":[],"title_canon_sha256":"4d9cc947df0fd6ecf573d091525fd9a89a39026134eb73be862e4764bf609918","abstract_canon_sha256":"495e74ec3a5d33647e62709b652347287517fc1f7757c93e1b79020bef9ae3a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:14:54.954780Z","signature_b64":"YSVAoIdD5D834Ks5qF/K9X4oQejAV41SFUryebcqAaGDxSDDglbrMpaCcT6/ABWLKx+j6gXpHMlDF/ASC8aJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23b948aa4b285cb57677ecd5c60d66b412fba8471e341f6a6920965c46f08737","last_reissued_at":"2026-07-05T03:14:54.954327Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:14:54.954327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TWEAC: Transformer with Extendable QA Agent Classifiers","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Andreas R\\\"uckl\\'e, Gregor Geigle, Iryna Gurevych, Nils Reimers","submitted_at":"2021-04-14T19:06:11Z","abstract_excerpt":"Question answering systems should help users to access knowledge on a broad range of topics and to answer a wide array of different questions. Most systems fall short of this expectation as they are only specialized in one particular setting, e.g., answering factual questions with Wikipedia data. To overcome this limitation, we propose composing multiple QA agents within a meta-QA system. We argue that there exist a wide range of specialized QA agents in literature. Thus, we address the central research question of how to effectively and efficiently identify suitable QA agents for any given qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.07081","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/2104.07081/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":"2104.07081","created_at":"2026-07-05T03:14:54.954394+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.07081v2","created_at":"2026-07-05T03:14:54.954394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.07081","created_at":"2026-07-05T03:14:54.954394+00:00"},{"alias_kind":"pith_short_12","alias_value":"EO4URKSLFBOL","created_at":"2026-07-05T03:14:54.954394+00:00"},{"alias_kind":"pith_short_16","alias_value":"EO4URKSLFBOLK5TX","created_at":"2026-07-05T03:14:54.954394+00:00"},{"alias_kind":"pith_short_8","alias_value":"EO4URKSL","created_at":"2026-07-05T03:14:54.954394+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31100","citing_title":"Vector Linking via Cross-Model Local Isometric Consistency","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2401.03563","citing_title":"Data-CUBE: Data Curriculum for Instruction-based Sentence Representation Learning","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22544","citing_title":"One prompt is not enough: Instruction Sensitivity Undermines Embedding Model Evaluation","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2405.17428","citing_title":"NV-Embed: Improved Techniques for Training LLMs as Generalist Embedding Models","ref_index":87,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EO4URKSLFBOLK5TX5TK4MDLGWQ","json":"https://pith.science/pith/EO4URKSLFBOLK5TX5TK4MDLGWQ.json","graph_json":"https://pith.science/api/pith-number/EO4URKSLFBOLK5TX5TK4MDLGWQ/graph.json","events_json":"https://pith.science/api/pith-number/EO4URKSLFBOLK5TX5TK4MDLGWQ/events.json","paper":"https://pith.science/paper/EO4URKSL"},"agent_actions":{"view_html":"https://pith.science/pith/EO4URKSLFBOLK5TX5TK4MDLGWQ","download_json":"https://pith.science/pith/EO4URKSLFBOLK5TX5TK4MDLGWQ.json","view_paper":"https://pith.science/paper/EO4URKSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.07081&json=true","fetch_graph":"https://pith.science/api/pith-number/EO4URKSLFBOLK5TX5TK4MDLGWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/EO4URKSLFBOLK5TX5TK4MDLGWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EO4URKSLFBOLK5TX5TK4MDLGWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EO4URKSLFBOLK5TX5TK4MDLGWQ/action/storage_attestation","attest_author":"https://pith.science/pith/EO4URKSLFBOLK5TX5TK4MDLGWQ/action/author_attestation","sign_citation":"https://pith.science/pith/EO4URKSLFBOLK5TX5TK4MDLGWQ/action/citation_signature","submit_replication":"https://pith.science/pith/EO4URKSLFBOLK5TX5TK4MDLGWQ/action/replication_record"}},"created_at":"2026-07-05T03:14:54.954394+00:00","updated_at":"2026-07-05T03:14:54.954394+00:00"}