{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BES6Y3SSMJ24SFCPDIPF4V7ZFP","short_pith_number":"pith:BES6Y3SS","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"},"canonical_sha256":"0925ec6e526275c9144f1a1e5e57f92bd1836844dd42bff63a2c37d261ae9060","source":{"kind":"arxiv","id":"1608.07720","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07720","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07720v1","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07720","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"BES6Y3SSMJ24","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BES6Y3SSMJ24SFCP","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BES6Y3SS","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BES6Y3SSMJ24SFCPDIPF4V7ZFP","target":"record","payload":{"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"},"canonical_sha256":"0925ec6e526275c9144f1a1e5e57f92bd1836844dd42bff63a2c37d261ae9060","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"},"source_kind":"arxiv","source_id":"1608.07720","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6N+vaqEr1Pc57HkMCBCn0laQLHfJyk4n/iJqnUe7VV19he0CIcArJX9DEFTLVV+vC34OUOlhWJXerX1pI1hDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T12:19:32.831542Z"},"content_sha256":"0de5f1881ec74be5dbcbf42ae7aba6b64ec2f354a0e37b06c7c879187b463ba1","schema_version":"1.0","event_id":"sha256:0de5f1881ec74be5dbcbf42ae7aba6b64ec2f354a0e37b06c7c879187b463ba1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BES6Y3SSMJ24SFCPDIPF4V7ZFP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIhHg9RFw3+mjeArksnjcPvL+ZCrntLnlOq5r3tRF2StMQ5j+0Mu13EQHwRdWw7y4OobXzUFWy652MXIhbP5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T12:19:32.831909Z"},"content_sha256":"6fdd6551a1667e96cbf87bbcfe0a09028f51fe08cc4951e082f110adf3cfa649","schema_version":"1.0","event_id":"sha256:6fdd6551a1667e96cbf87bbcfe0a09028f51fe08cc4951e082f110adf3cfa649"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP/bundle.json","state_url":"https://pith.science/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-20T12:19:32Z","links":{"resolver":"https://pith.science/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP","bundle":"https://pith.science/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP/bundle.json","state":"https://pith.science/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BES6Y3SSMJ24SFCPDIPF4V7ZFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BES6Y3SSMJ24SFCPDIPF4V7ZFP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"31ad0636cf593bc1e015d5375f95c5731d34b1dce60ed8a2422e110ecebca80f","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CL","submitted_at":"2016-08-27T15:41:22Z","title_canon_sha256":"bc4e40b83b42f409aa5ae237e9bd09a2df950edd884b6ab3f631a702f6d5dc34"},"schema_version":"1.0","source":{"id":"1608.07720","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07720","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07720v1","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07720","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"BES6Y3SSMJ24","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BES6Y3SSMJ24SFCP","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BES6Y3SS","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:6fdd6551a1667e96cbf87bbcfe0a09028f51fe08cc4951e082f110adf3cfa649","target":"graph","created_at":"2026-05-18T01:07:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Donghong Ji, Fei Li, Guohong Fu, Meishan Zhang, Tao Qian","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CL","submitted_at":"2016-08-27T15:41:22Z","title":"A Bi-LSTM-RNN Model for Relation Classification Using Low-Cost Sequence Features"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07720","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0de5f1881ec74be5dbcbf42ae7aba6b64ec2f354a0e37b06c7c879187b463ba1","target":"record","created_at":"2026-05-18T01:07:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"31ad0636cf593bc1e015d5375f95c5731d34b1dce60ed8a2422e110ecebca80f","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CL","submitted_at":"2016-08-27T15:41:22Z","title_canon_sha256":"bc4e40b83b42f409aa5ae237e9bd09a2df950edd884b6ab3f631a702f6d5dc34"},"schema_version":"1.0","source":{"id":"1608.07720","kind":"arxiv","version":1}},"canonical_sha256":"0925ec6e526275c9144f1a1e5e57f92bd1836844dd42bff63a2c37d261ae9060","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0925ec6e526275c9144f1a1e5e57f92bd1836844dd42bff63a2c37d261ae9060","first_computed_at":"2026-05-18T01:07:50.051211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:50.051211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vI/Q3tJbd/Xb8dAZgA6IE8zlq5PxyhZYagWR7EJV1Jj5whfNcGB52K1BGWgg2znbmz+cXsksuogGfeQVfHr/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:50.051604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07720","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0de5f1881ec74be5dbcbf42ae7aba6b64ec2f354a0e37b06c7c879187b463ba1","sha256:6fdd6551a1667e96cbf87bbcfe0a09028f51fe08cc4951e082f110adf3cfa649"],"state_sha256":"e1350cb4133962401591dc07087fadae3959196e3245c4136a477892fa3d4a4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVeLAK5IC2H37TAV/dLZ6sGI3h0JMPZu0WrYk5OUaYzC+iZ8x3VcK+QhzihMnA2UIuGKqVDDdrQtHm4OARMXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T12:19:32.834124Z","bundle_sha256":"879cd155bd7ea095de35f1532d0e93fb149eac56ebc4551d315f98e69b02c055"}}