{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:U7S26K2PU4CPU7ZUUR3M6WHFCW","short_pith_number":"pith:U7S26K2P","schema_version":"1.0","canonical_sha256":"a7e5af2b4fa704fa7f34a476cf58e515a1ccf5dfdf810ff40e5f0f224959c887","source":{"kind":"arxiv","id":"1611.01747","version":1},"attestation_state":"computed","paper":{"title":"A Compare-Aggregate Model for Matching Text Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jing Jiang, Shuohang Wang","submitted_at":"2016-11-06T09:50:24Z","abstract_excerpt":"Many NLP tasks including machine comprehension, answer selection and text entailment require the comparison between sequences. Matching the important units between sequences is a key to solve these problems. In this paper, we present a general \"compare-aggregate\" framework that performs word-level matching followed by aggregation using Convolutional Neural Networks. We particularly focus on the different comparison functions we can use to match two vectors. We use four different datasets to evaluate the model. We find that some simple comparison functions based on element-wise operations can w"},"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":"1611.01747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-11-06T09:50:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3768bc5864f0c4daa40291d55b445fdeb545e413d968f654f301bc976ec62f83","abstract_canon_sha256":"8fb26d019fa30fe15029f7aa324725396e28c0afd8bff4bb200a0c832cd16ec6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:04.548807Z","signature_b64":"n5NQ/ZdQUeGkqiVes6h+ZQ+Kwq6zXb6oB3tU7BjqtmLSynX/2UDuHzyWKaZIdVoC/lbgYfGeiTFh7QeT0NlABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7e5af2b4fa704fa7f34a476cf58e515a1ccf5dfdf810ff40e5f0f224959c887","last_reissued_at":"2026-05-18T01:00:04.548224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:04.548224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Compare-Aggregate Model for Matching Text Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jing Jiang, Shuohang Wang","submitted_at":"2016-11-06T09:50:24Z","abstract_excerpt":"Many NLP tasks including machine comprehension, answer selection and text entailment require the comparison between sequences. Matching the important units between sequences is a key to solve these problems. In this paper, we present a general \"compare-aggregate\" framework that performs word-level matching followed by aggregation using Convolutional Neural Networks. We particularly focus on the different comparison functions we can use to match two vectors. We use four different datasets to evaluate the model. We find that some simple comparison functions based on element-wise operations can w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01747","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":""},"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":"1611.01747","created_at":"2026-05-18T01:00:04.548338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01747v1","created_at":"2026-05-18T01:00:04.548338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01747","created_at":"2026-05-18T01:00:04.548338+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7S26K2PU4CP","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7S26K2PU4CPU7ZU","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7S26K2P","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05338","citing_title":"To Tune or Not To Tune? How About the Best of Both Worlds?","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U7S26K2PU4CPU7ZUUR3M6WHFCW","json":"https://pith.science/pith/U7S26K2PU4CPU7ZUUR3M6WHFCW.json","graph_json":"https://pith.science/api/pith-number/U7S26K2PU4CPU7ZUUR3M6WHFCW/graph.json","events_json":"https://pith.science/api/pith-number/U7S26K2PU4CPU7ZUUR3M6WHFCW/events.json","paper":"https://pith.science/paper/U7S26K2P"},"agent_actions":{"view_html":"https://pith.science/pith/U7S26K2PU4CPU7ZUUR3M6WHFCW","download_json":"https://pith.science/pith/U7S26K2PU4CPU7ZUUR3M6WHFCW.json","view_paper":"https://pith.science/paper/U7S26K2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01747&json=true","fetch_graph":"https://pith.science/api/pith-number/U7S26K2PU4CPU7ZUUR3M6WHFCW/graph.json","fetch_events":"https://pith.science/api/pith-number/U7S26K2PU4CPU7ZUUR3M6WHFCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7S26K2PU4CPU7ZUUR3M6WHFCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7S26K2PU4CPU7ZUUR3M6WHFCW/action/storage_attestation","attest_author":"https://pith.science/pith/U7S26K2PU4CPU7ZUUR3M6WHFCW/action/author_attestation","sign_citation":"https://pith.science/pith/U7S26K2PU4CPU7ZUUR3M6WHFCW/action/citation_signature","submit_replication":"https://pith.science/pith/U7S26K2PU4CPU7ZUUR3M6WHFCW/action/replication_record"}},"created_at":"2026-05-18T01:00:04.548338+00:00","updated_at":"2026-05-18T01:00:04.548338+00:00"}