{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MVBOOAS2LANUXIU3PZEJMNHF62","short_pith_number":"pith:MVBOOAS2","schema_version":"1.0","canonical_sha256":"6542e7025a581b4ba29b7e489634e5f6ac42942a4101491a2bdc88a264c8cf44","source":{"kind":"arxiv","id":"2003.04807","version":1},"attestation_state":"computed","paper":{"title":"Efficient Intent Detection with Dual Sentence Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Daniela Gerz, I\\~nigo Casanueva, Ivan Vuli\\'c, Matthew Henderson, Tadas Tem\\v{c}inas","submitted_at":"2020-03-10T15:33:54Z","abstract_excerpt":"Building conversational systems in new domains and with added functionality requires resource-efficient models that work under low-data regimes (i.e., in few-shot setups). Motivated by these requirements, we introduce intent detection methods backed by pretrained dual sentence encoders such as USE and ConveRT. We demonstrate the usefulness and wide applicability of the proposed intent detectors, showing that: 1) they outperform intent detectors based on fine-tuning the full BERT-Large model or using BERT as a fixed black-box encoder on three diverse intent detection data sets; 2) the gains are"},"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":"2003.04807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-03-10T15:33:54Z","cross_cats_sorted":[],"title_canon_sha256":"dd3766d641af1babdfd12e58c3f63be878982dcbc57ce13f05572e0019183c02","abstract_canon_sha256":"d0c669b45d2f93ffe58e00d4c94a7c38d482efe0b7d28ad8e452abebd648dc5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:47:07.643278Z","signature_b64":"7H3Ci8UEKd67UgooLbQue1r/gpsmbBSS4QW5hDKRRCbUZel3/1VfRLarGKRlG02iSdBpdGrI7AEfOM6IDw7dDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6542e7025a581b4ba29b7e489634e5f6ac42942a4101491a2bdc88a264c8cf44","last_reissued_at":"2026-07-05T00:47:07.642834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:47:07.642834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Intent Detection with Dual Sentence Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Daniela Gerz, I\\~nigo Casanueva, Ivan Vuli\\'c, Matthew Henderson, Tadas Tem\\v{c}inas","submitted_at":"2020-03-10T15:33:54Z","abstract_excerpt":"Building conversational systems in new domains and with added functionality requires resource-efficient models that work under low-data regimes (i.e., in few-shot setups). Motivated by these requirements, we introduce intent detection methods backed by pretrained dual sentence encoders such as USE and ConveRT. We demonstrate the usefulness and wide applicability of the proposed intent detectors, showing that: 1) they outperform intent detectors based on fine-tuning the full BERT-Large model or using BERT as a fixed black-box encoder on three diverse intent detection data sets; 2) the gains are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.04807","kind":"arxiv","version":1},"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/2003.04807/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":"2003.04807","created_at":"2026-07-05T00:47:07.642896+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.04807v1","created_at":"2026-07-05T00:47:07.642896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.04807","created_at":"2026-07-05T00:47:07.642896+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVBOOAS2LANU","created_at":"2026-07-05T00:47:07.642896+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVBOOAS2LANUXIU3","created_at":"2026-07-05T00:47:07.642896+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVBOOAS2","created_at":"2026-07-05T00:47:07.642896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25674","citing_title":"BitNet Text Embeddings","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10610","citing_title":"Small Data, Big Noise: Adversarial Training for Robust Parameter-Efficient Fine-Tuning","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2401.03563","citing_title":"Data-CUBE: Data Curriculum for Instruction-based Sentence Representation Learning","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2502.15315","citing_title":"Tight Clusters Make Specialized Experts","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2503.05066","citing_title":"Capacity-Aware Inference: Mitigating the Straggler Effect in Mixture of Experts","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2512.21110","citing_title":"Beyond Context: Large Language Models' Failure to Grasp Users' Intent","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2405.17428","citing_title":"NV-Embed: Improved Techniques for Training LLMs as Generalist Embedding Models","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2603.28052","citing_title":"Meta-Harness: End-to-End Optimization of Model Harnesses","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05859","citing_title":"When Do We Need LLMs? A Diagnostic for Language-Driven Bandits","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20131","citing_title":"Whose Story Gets Told? Positionality and Bias in LLM Summaries of Life Narratives","ref_index":218,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MVBOOAS2LANUXIU3PZEJMNHF62","json":"https://pith.science/pith/MVBOOAS2LANUXIU3PZEJMNHF62.json","graph_json":"https://pith.science/api/pith-number/MVBOOAS2LANUXIU3PZEJMNHF62/graph.json","events_json":"https://pith.science/api/pith-number/MVBOOAS2LANUXIU3PZEJMNHF62/events.json","paper":"https://pith.science/paper/MVBOOAS2"},"agent_actions":{"view_html":"https://pith.science/pith/MVBOOAS2LANUXIU3PZEJMNHF62","download_json":"https://pith.science/pith/MVBOOAS2LANUXIU3PZEJMNHF62.json","view_paper":"https://pith.science/paper/MVBOOAS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.04807&json=true","fetch_graph":"https://pith.science/api/pith-number/MVBOOAS2LANUXIU3PZEJMNHF62/graph.json","fetch_events":"https://pith.science/api/pith-number/MVBOOAS2LANUXIU3PZEJMNHF62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVBOOAS2LANUXIU3PZEJMNHF62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVBOOAS2LANUXIU3PZEJMNHF62/action/storage_attestation","attest_author":"https://pith.science/pith/MVBOOAS2LANUXIU3PZEJMNHF62/action/author_attestation","sign_citation":"https://pith.science/pith/MVBOOAS2LANUXIU3PZEJMNHF62/action/citation_signature","submit_replication":"https://pith.science/pith/MVBOOAS2LANUXIU3PZEJMNHF62/action/replication_record"}},"created_at":"2026-07-05T00:47:07.642896+00:00","updated_at":"2026-07-05T00:47:07.642896+00:00"}