{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ULIMPJ3EIYORDS3SGWSF2WNUOM","short_pith_number":"pith:ULIMPJ3E","schema_version":"1.0","canonical_sha256":"a2d0c7a764461d11cb7235a45d59b47328c435c13b9f3377b7f2432d2b93b1eb","source":{"kind":"arxiv","id":"1508.03720","version":1},"attestation_state":"computed","paper":{"title":"Classifying Relations via Long Short Term Memory Networks along Shortest Dependency Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Ge Li, Hao Peng, Lili Mou, Xu Yan, Yunchuan Chen, Zhi Jin","submitted_at":"2015-08-15T11:15:32Z","abstract_excerpt":"Relation classification is an important research arena in the field of natural language processing (NLP). In this paper, we present SDP-LSTM, a novel neural network to classify the relation of two entities in a sentence. Our neural architecture leverages the shortest dependency path (SDP) between two entities; multichannel recurrent neural networks, with long short term memory (LSTM) units, pick up heterogeneous information along the SDP. Our proposed model has several distinct features: (1) The shortest dependency paths retain most relevant information (to relation classification), while elim"},"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":"1508.03720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-08-15T11:15:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2702aa22a9419aaa9bbd3749ae5b2e6685589c7935c711c31a6fef7ea155287b","abstract_canon_sha256":"39b769037e712be89a430a58c08afe16891e8f8ba750722c4a2ae39eaf11d5d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:15.369435Z","signature_b64":"9yYE9wCeynQIQAplZ1PhgxNH6qtiBUn/vgonO5UGFSjRchxHGZlFQXzsxfB3jHBagkNxMkz7IqaI4oimc2daAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2d0c7a764461d11cb7235a45d59b47328c435c13b9f3377b7f2432d2b93b1eb","last_reissued_at":"2026-05-18T01:35:15.369006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:15.369006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classifying Relations via Long Short Term Memory Networks along Shortest Dependency Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Ge Li, Hao Peng, Lili Mou, Xu Yan, Yunchuan Chen, Zhi Jin","submitted_at":"2015-08-15T11:15:32Z","abstract_excerpt":"Relation classification is an important research arena in the field of natural language processing (NLP). In this paper, we present SDP-LSTM, a novel neural network to classify the relation of two entities in a sentence. Our neural architecture leverages the shortest dependency path (SDP) between two entities; multichannel recurrent neural networks, with long short term memory (LSTM) units, pick up heterogeneous information along the SDP. Our proposed model has several distinct features: (1) The shortest dependency paths retain most relevant information (to relation classification), while elim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03720","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":"1508.03720","created_at":"2026-05-18T01:35:15.369067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03720v1","created_at":"2026-05-18T01:35:15.369067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03720","created_at":"2026-05-18T01:35:15.369067+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULIMPJ3EIYOR","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULIMPJ3EIYORDS3S","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULIMPJ3E","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ULIMPJ3EIYORDS3SGWSF2WNUOM","json":"https://pith.science/pith/ULIMPJ3EIYORDS3SGWSF2WNUOM.json","graph_json":"https://pith.science/api/pith-number/ULIMPJ3EIYORDS3SGWSF2WNUOM/graph.json","events_json":"https://pith.science/api/pith-number/ULIMPJ3EIYORDS3SGWSF2WNUOM/events.json","paper":"https://pith.science/paper/ULIMPJ3E"},"agent_actions":{"view_html":"https://pith.science/pith/ULIMPJ3EIYORDS3SGWSF2WNUOM","download_json":"https://pith.science/pith/ULIMPJ3EIYORDS3SGWSF2WNUOM.json","view_paper":"https://pith.science/paper/ULIMPJ3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03720&json=true","fetch_graph":"https://pith.science/api/pith-number/ULIMPJ3EIYORDS3SGWSF2WNUOM/graph.json","fetch_events":"https://pith.science/api/pith-number/ULIMPJ3EIYORDS3SGWSF2WNUOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULIMPJ3EIYORDS3SGWSF2WNUOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULIMPJ3EIYORDS3SGWSF2WNUOM/action/storage_attestation","attest_author":"https://pith.science/pith/ULIMPJ3EIYORDS3SGWSF2WNUOM/action/author_attestation","sign_citation":"https://pith.science/pith/ULIMPJ3EIYORDS3SGWSF2WNUOM/action/citation_signature","submit_replication":"https://pith.science/pith/ULIMPJ3EIYORDS3SGWSF2WNUOM/action/replication_record"}},"created_at":"2026-05-18T01:35:15.369067+00:00","updated_at":"2026-05-18T01:35:15.369067+00:00"}