{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TQHSTAYDS6RTIM3JDSNJQ2DCJS","short_pith_number":"pith:TQHSTAYD","schema_version":"1.0","canonical_sha256":"9c0f29830397a33433691c9a9868624c821a3ad20bbafc410689cc9726bfc97b","source":{"kind":"arxiv","id":"1507.04646","version":1},"attestation_state":"computed","paper":{"title":"A Dependency-Based Neural Network for Relation Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Furu Wei, Heng Ji, Houfeng Wang, Ming Zhou, Sujian Li, Yang Liu","submitted_at":"2015-07-16T16:43:55Z","abstract_excerpt":"Previous research on relation classification has verified the effectiveness of using dependency shortest paths or subtrees. In this paper, we further explore how to make full use of the combination of these dependency information. We first propose a new structure, termed augmented dependency path (ADP), which is composed of the shortest dependency path between two entities and the subtrees attached to the shortest path. To exploit the semantic representation behind the ADP structure, we develop dependency-based neural networks (DepNN): a recursive neural network designed to model the subtrees,"},"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":"1507.04646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-07-16T16:43:55Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"a892f843a09b31ae5ee56b09f1f3eb5e063fb4dfa070e898edec6e707dfdcb9f","abstract_canon_sha256":"237405a3244ae8284dd348543cd0603b3565aa6057bc18df6c7558000701a0bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:46.794826Z","signature_b64":"z7UMcEZ/8X4/D8J64eCGXSO56ai10TlSWfuHvU5CvQHRC0IcHRhLW6NjNTKBPrlvBHqK+cZCf7gdAmZ7lM5rBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c0f29830397a33433691c9a9868624c821a3ad20bbafc410689cc9726bfc97b","last_reissued_at":"2026-05-18T01:36:46.794292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:46.794292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dependency-Based Neural Network for Relation Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Furu Wei, Heng Ji, Houfeng Wang, Ming Zhou, Sujian Li, Yang Liu","submitted_at":"2015-07-16T16:43:55Z","abstract_excerpt":"Previous research on relation classification has verified the effectiveness of using dependency shortest paths or subtrees. In this paper, we further explore how to make full use of the combination of these dependency information. We first propose a new structure, termed augmented dependency path (ADP), which is composed of the shortest dependency path between two entities and the subtrees attached to the shortest path. To exploit the semantic representation behind the ADP structure, we develop dependency-based neural networks (DepNN): a recursive neural network designed to model the subtrees,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04646","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":"1507.04646","created_at":"2026-05-18T01:36:46.794395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04646v1","created_at":"2026-05-18T01:36:46.794395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04646","created_at":"2026-05-18T01:36:46.794395+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQHSTAYDS6RT","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQHSTAYDS6RTIM3J","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQHSTAYD","created_at":"2026-05-18T12:29:42.218222+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/TQHSTAYDS6RTIM3JDSNJQ2DCJS","json":"https://pith.science/pith/TQHSTAYDS6RTIM3JDSNJQ2DCJS.json","graph_json":"https://pith.science/api/pith-number/TQHSTAYDS6RTIM3JDSNJQ2DCJS/graph.json","events_json":"https://pith.science/api/pith-number/TQHSTAYDS6RTIM3JDSNJQ2DCJS/events.json","paper":"https://pith.science/paper/TQHSTAYD"},"agent_actions":{"view_html":"https://pith.science/pith/TQHSTAYDS6RTIM3JDSNJQ2DCJS","download_json":"https://pith.science/pith/TQHSTAYDS6RTIM3JDSNJQ2DCJS.json","view_paper":"https://pith.science/paper/TQHSTAYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04646&json=true","fetch_graph":"https://pith.science/api/pith-number/TQHSTAYDS6RTIM3JDSNJQ2DCJS/graph.json","fetch_events":"https://pith.science/api/pith-number/TQHSTAYDS6RTIM3JDSNJQ2DCJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQHSTAYDS6RTIM3JDSNJQ2DCJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQHSTAYDS6RTIM3JDSNJQ2DCJS/action/storage_attestation","attest_author":"https://pith.science/pith/TQHSTAYDS6RTIM3JDSNJQ2DCJS/action/author_attestation","sign_citation":"https://pith.science/pith/TQHSTAYDS6RTIM3JDSNJQ2DCJS/action/citation_signature","submit_replication":"https://pith.science/pith/TQHSTAYDS6RTIM3JDSNJQ2DCJS/action/replication_record"}},"created_at":"2026-05-18T01:36:46.794395+00:00","updated_at":"2026-05-18T01:36:46.794395+00:00"}