{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QQYY7HM4S7ZBXKYX4DXHF7ERCG","short_pith_number":"pith:QQYY7HM4","schema_version":"1.0","canonical_sha256":"84318f9d9c97f21bab17e0ee72fc91119e179a05f027d51d46ae5ca8054e921d","source":{"kind":"arxiv","id":"1908.00300","version":1},"attestation_state":"computed","paper":{"title":"Simple and Effective Text Matching with Richer Alignment Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Feng Ji, Haiqing Chen, Jianhai Zhang, Runqi Yang, Xing Gao","submitted_at":"2019-08-01T10:07:07Z","abstract_excerpt":"In this paper, we present a fast and strong neural approach for general purpose text matching applications. We explore what is sufficient to build a fast and well-performed text matching model and propose to keep three key features available for inter-sequence alignment: original point-wise features, previous aligned features, and contextual features while simplifying all the remaining components. We conduct experiments on four well-studied benchmark datasets across tasks of natural language inference, paraphrase identification and answer selection. The performance of our model is on par with "},"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":"1908.00300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-01T10:07:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6b7457ed2adc27d12eae432fff7f247227267b89a34d173eb93ab1cf3325f78a","abstract_canon_sha256":"f797636743220addb4e1cb2fa51839df44040159e77e84ef68752c69011468c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:50:59.106736Z","signature_b64":"XRKSgjLKKS+J40LWeZjfzDouAHKPP4uYT+ElCxgLa3mPJQfzbETprdrZEZzKpJ4Eyulp/bOJ7qKF+/TzBx6xBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84318f9d9c97f21bab17e0ee72fc91119e179a05f027d51d46ae5ca8054e921d","last_reissued_at":"2026-07-04T23:50:59.106264Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:50:59.106264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple and Effective Text Matching with Richer Alignment Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Feng Ji, Haiqing Chen, Jianhai Zhang, Runqi Yang, Xing Gao","submitted_at":"2019-08-01T10:07:07Z","abstract_excerpt":"In this paper, we present a fast and strong neural approach for general purpose text matching applications. We explore what is sufficient to build a fast and well-performed text matching model and propose to keep three key features available for inter-sequence alignment: original point-wise features, previous aligned features, and contextual features while simplifying all the remaining components. We conduct experiments on four well-studied benchmark datasets across tasks of natural language inference, paraphrase identification and answer selection. The performance of our model is on par with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00300","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/1908.00300/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":"1908.00300","created_at":"2026-07-04T23:50:59.106338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.00300v1","created_at":"2026-07-04T23:50:59.106338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00300","created_at":"2026-07-04T23:50:59.106338+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQYY7HM4S7ZB","created_at":"2026-07-04T23:50:59.106338+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQYY7HM4S7ZBXKYX","created_at":"2026-07-04T23:50:59.106338+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQYY7HM4","created_at":"2026-07-04T23:50:59.106338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.07220","citing_title":"Comateformer: Combined Attention Transformer for Semantic Sentence Matching","ref_index":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QQYY7HM4S7ZBXKYX4DXHF7ERCG","json":"https://pith.science/pith/QQYY7HM4S7ZBXKYX4DXHF7ERCG.json","graph_json":"https://pith.science/api/pith-number/QQYY7HM4S7ZBXKYX4DXHF7ERCG/graph.json","events_json":"https://pith.science/api/pith-number/QQYY7HM4S7ZBXKYX4DXHF7ERCG/events.json","paper":"https://pith.science/paper/QQYY7HM4"},"agent_actions":{"view_html":"https://pith.science/pith/QQYY7HM4S7ZBXKYX4DXHF7ERCG","download_json":"https://pith.science/pith/QQYY7HM4S7ZBXKYX4DXHF7ERCG.json","view_paper":"https://pith.science/paper/QQYY7HM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.00300&json=true","fetch_graph":"https://pith.science/api/pith-number/QQYY7HM4S7ZBXKYX4DXHF7ERCG/graph.json","fetch_events":"https://pith.science/api/pith-number/QQYY7HM4S7ZBXKYX4DXHF7ERCG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQYY7HM4S7ZBXKYX4DXHF7ERCG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQYY7HM4S7ZBXKYX4DXHF7ERCG/action/storage_attestation","attest_author":"https://pith.science/pith/QQYY7HM4S7ZBXKYX4DXHF7ERCG/action/author_attestation","sign_citation":"https://pith.science/pith/QQYY7HM4S7ZBXKYX4DXHF7ERCG/action/citation_signature","submit_replication":"https://pith.science/pith/QQYY7HM4S7ZBXKYX4DXHF7ERCG/action/replication_record"}},"created_at":"2026-07-04T23:50:59.106338+00:00","updated_at":"2026-07-04T23:50:59.106338+00:00"}