{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BES6Y3SSMJ24SFCPDIPF4V7ZFP","short_pith_number":"pith:BES6Y3SS","schema_version":"1.0","canonical_sha256":"0925ec6e526275c9144f1a1e5e57f92bd1836844dd42bff63a2c37d261ae9060","source":{"kind":"arxiv","id":"1608.07720","version":1},"attestation_state":"computed","paper":{"title":"A Bi-LSTM-RNN Model for Relation Classification Using Low-Cost Sequence Features","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Donghong Ji, Fei Li, Guohong Fu, Meishan Zhang, Tao Qian","submitted_at":"2016-08-27T15:41:22Z","abstract_excerpt":"Relation classification is associated with many potential applications in the artificial intelligence area. Recent approaches usually leverage neural networks based on structure features such as syntactic or dependency features to solve this problem. However, high-cost structure features make such approaches inconvenient to be directly used. In addition, structure features are probably domain-dependent. Therefore, this paper proposes a bi-directional long-short-term-memory recurrent-neural-network (Bi-LSTM-RNN) model based on low-cost sequence features to address relation classification. This "},"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":"1608.07720","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CL","submitted_at":"2016-08-27T15:41:22Z","cross_cats_sorted":[],"title_canon_sha256":"bc4e40b83b42f409aa5ae237e9bd09a2df950edd884b6ab3f631a702f6d5dc34","abstract_canon_sha256":"31ad0636cf593bc1e015d5375f95c5731d34b1dce60ed8a2422e110ecebca80f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:50.051604Z","signature_b64":"vI/Q3tJbd/Xb8dAZgA6IE8zlq5PxyhZYagWR7EJV1Jj5whfNcGB52K1BGWgg2znbmz+cXsksuogGfeQVfHr/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0925ec6e526275c9144f1a1e5e57f92bd1836844dd42bff63a2c37d261ae9060","last_reissued_at":"2026-05-18T01:07:50.051211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:50.051211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bi-LSTM-RNN Model for Relation Classification Using Low-Cost Sequence Features","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Donghong Ji, Fei Li, Guohong Fu, Meishan Zhang, Tao Qian","submitted_at":"2016-08-27T15:41:22Z","abstract_excerpt":"Relation classification is associated with many potential applications in the artificial intelligence area. Recent approaches usually leverage neural networks based on structure features such as syntactic or dependency features to solve this problem. However, high-cost structure features make such approaches inconvenient to be directly used. In addition, structure features are probably domain-dependent. Therefore, this paper proposes a bi-directional long-short-term-memory recurrent-neural-network (Bi-LSTM-RNN) model based on low-cost sequence features to address relation classification. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07720","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":"1608.07720","created_at":"2026-05-18T01:07:50.051264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07720v1","created_at":"2026-05-18T01:07:50.051264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07720","created_at":"2026-05-18T01:07:50.051264+00:00"},{"alias_kind":"pith_short_12","alias_value":"BES6Y3SSMJ24","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BES6Y3SSMJ24SFCP","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BES6Y3SS","created_at":"2026-05-18T12:30:07.202191+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/BES6Y3SSMJ24SFCPDIPF4V7ZFP","json":"https://pith.science/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP.json","graph_json":"https://pith.science/api/pith-number/BES6Y3SSMJ24SFCPDIPF4V7ZFP/graph.json","events_json":"https://pith.science/api/pith-number/BES6Y3SSMJ24SFCPDIPF4V7ZFP/events.json","paper":"https://pith.science/paper/BES6Y3SS"},"agent_actions":{"view_html":"https://pith.science/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP","download_json":"https://pith.science/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP.json","view_paper":"https://pith.science/paper/BES6Y3SS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07720&json=true","fetch_graph":"https://pith.science/api/pith-number/BES6Y3SSMJ24SFCPDIPF4V7ZFP/graph.json","fetch_events":"https://pith.science/api/pith-number/BES6Y3SSMJ24SFCPDIPF4V7ZFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP/action/storage_attestation","attest_author":"https://pith.science/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP/action/author_attestation","sign_citation":"https://pith.science/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP/action/citation_signature","submit_replication":"https://pith.science/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP/action/replication_record"}},"created_at":"2026-05-18T01:07:50.051264+00:00","updated_at":"2026-05-18T01:07:50.051264+00:00"}