{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RFA6JI2JRTWT3BJIPQJECHECI6","short_pith_number":"pith:RFA6JI2J","schema_version":"1.0","canonical_sha256":"8941e4a3498ced3d85287c12411c8247be20650811b22ce674b00de44f25f8fc","source":{"kind":"arxiv","id":"1509.06664","version":4},"attestation_state":"computed","paper":{"title":"Reasoning about Entailment with Neural Attention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Edward Grefenstette, Karl Moritz Hermann, Phil Blunsom, Tim Rockt\\\"aschel, Tom\\'a\\v{s} Ko\\v{c}isk\\'y","submitted_at":"2015-09-22T16:08:24Z","abstract_excerpt":"While most approaches to automatically recognizing entailment relations have used classifiers employing hand engineered features derived from complex natural language processing pipelines, in practice their performance has been only slightly better than bag-of-word pair classifiers using only lexical similarity. The only attempt so far to build an end-to-end differentiable neural network for entailment failed to outperform such a simple similarity classifier. In this paper, we propose a neural model that reads two sentences to determine entailment using long short-term memory units. We extend "},"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":"1509.06664","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-09-22T16:08:24Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"40f065d87255a8188d1e6770b3861a09514f1e047fb5a9651b338c4b0123b4b9","abstract_canon_sha256":"845431e94d00eb3cbf703299a548f5e76895c466ba4e9374acc639f6772231bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:48.143286Z","signature_b64":"yrqZHDQP1MIR2ckHxtSrcD+j7SgUFhse8XFjPB9jB8bYWKCkpVq9+MObYWJeYCmcRLWEPbD5bfzY5hn+Ha87Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8941e4a3498ced3d85287c12411c8247be20650811b22ce674b00de44f25f8fc","last_reissued_at":"2026-05-18T01:19:48.142709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:48.142709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reasoning about Entailment with Neural Attention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Edward Grefenstette, Karl Moritz Hermann, Phil Blunsom, Tim Rockt\\\"aschel, Tom\\'a\\v{s} Ko\\v{c}isk\\'y","submitted_at":"2015-09-22T16:08:24Z","abstract_excerpt":"While most approaches to automatically recognizing entailment relations have used classifiers employing hand engineered features derived from complex natural language processing pipelines, in practice their performance has been only slightly better than bag-of-word pair classifiers using only lexical similarity. The only attempt so far to build an end-to-end differentiable neural network for entailment failed to outperform such a simple similarity classifier. In this paper, we propose a neural model that reads two sentences to determine entailment using long short-term memory units. We extend "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06664","kind":"arxiv","version":4},"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":"1509.06664","created_at":"2026-05-18T01:19:48.142792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06664v4","created_at":"2026-05-18T01:19:48.142792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06664","created_at":"2026-05-18T01:19:48.142792+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFA6JI2JRTWT","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFA6JI2JRTWT3BJI","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFA6JI2J","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21088","citing_title":"Jet Quenching Identification via Supervised Learning in Simulated Heavy-Ion Collisions","ref_index":58,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RFA6JI2JRTWT3BJIPQJECHECI6","json":"https://pith.science/pith/RFA6JI2JRTWT3BJIPQJECHECI6.json","graph_json":"https://pith.science/api/pith-number/RFA6JI2JRTWT3BJIPQJECHECI6/graph.json","events_json":"https://pith.science/api/pith-number/RFA6JI2JRTWT3BJIPQJECHECI6/events.json","paper":"https://pith.science/paper/RFA6JI2J"},"agent_actions":{"view_html":"https://pith.science/pith/RFA6JI2JRTWT3BJIPQJECHECI6","download_json":"https://pith.science/pith/RFA6JI2JRTWT3BJIPQJECHECI6.json","view_paper":"https://pith.science/paper/RFA6JI2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06664&json=true","fetch_graph":"https://pith.science/api/pith-number/RFA6JI2JRTWT3BJIPQJECHECI6/graph.json","fetch_events":"https://pith.science/api/pith-number/RFA6JI2JRTWT3BJIPQJECHECI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFA6JI2JRTWT3BJIPQJECHECI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFA6JI2JRTWT3BJIPQJECHECI6/action/storage_attestation","attest_author":"https://pith.science/pith/RFA6JI2JRTWT3BJIPQJECHECI6/action/author_attestation","sign_citation":"https://pith.science/pith/RFA6JI2JRTWT3BJIPQJECHECI6/action/citation_signature","submit_replication":"https://pith.science/pith/RFA6JI2JRTWT3BJIPQJECHECI6/action/replication_record"}},"created_at":"2026-05-18T01:19:48.142792+00:00","updated_at":"2026-05-18T01:19:48.142792+00:00"}