{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZYXNF6MESCNWOL3DFOOHEOKUIN","short_pith_number":"pith:ZYXNF6ME","canonical_record":{"source":{"id":"1803.01165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-03-03T13:57:37Z","cross_cats_sorted":[],"title_canon_sha256":"25f0b4dbdeb21867a40c566a066292c3f2e0e348c7856b832d35e8fe9325bd18","abstract_canon_sha256":"4051170ac49874ad1f159074ed3b15770b025db0a131819e252effba98624aa0"},"schema_version":"1.0"},"canonical_sha256":"ce2ed2f984909b672f632b9c723954434009933a763931420a86d1f52fb747e0","source":{"kind":"arxiv","id":"1803.01165","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01165","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01165v1","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01165","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZYXNF6MESCNW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZYXNF6MESCNWOL3D","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZYXNF6ME","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZYXNF6MESCNWOL3DFOOHEOKUIN","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-03-03T13:57:37Z","cross_cats_sorted":[],"title_canon_sha256":"25f0b4dbdeb21867a40c566a066292c3f2e0e348c7856b832d35e8fe9325bd18","abstract_canon_sha256":"4051170ac49874ad1f159074ed3b15770b025db0a131819e252effba98624aa0"},"schema_version":"1.0"},"canonical_sha256":"ce2ed2f984909b672f632b9c723954434009933a763931420a86d1f52fb747e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:01.610832Z","signature_b64":"yVb7p1v7RSpOcVq5Mb3Wp/dLg9iz8tBLpXKaGCQtmDHu4j/ZdLNm7m7xRnx7USEXG23bX+SAUFzWdR6/ws5nCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce2ed2f984909b672f632b9c723954434009933a763931420a86d1f52fb747e0","last_reissued_at":"2026-05-18T00:22:01.610268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:01.610268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01165","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-18T00:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G0eHIiZRJDT5nXVjelqAGtLYI0trpR4pmwgkX7BgVfYVjZ4eb4UCVepEGu2manaQiBU4NMC89CmpcWxpA0N+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:40:35.660823Z"},"content_sha256":"a1e5678e591d0bb0e43d5ad9dc4e6c7a1fadd1360ab608fe904cb2368cf8aeb2","schema_version":"1.0","event_id":"sha256:a1e5678e591d0bb0e43d5ad9dc4e6c7a1fadd1360ab608fe904cb2368cf8aeb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZYXNF6MESCNWOL3DFOOHEOKUIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tag-Enhanced Tree-Structured Neural Networks for Implicit Discourse Relation Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Houfeng Wang, Jingfeng Yang, Sujian Li, Xu Sun, Yizhong Wang","submitted_at":"2018-03-03T13:57:37Z","abstract_excerpt":"Identifying implicit discourse relations between text spans is a challenging task because it requires understanding the meaning of the text. To tackle this task, recent studies have tried several deep learning methods but few of them exploited the syntactic information. In this work, we explore the idea of incorporating syntactic parse tree into neural networks. Specifically, we employ the Tree-LSTM model and Tree-GRU model, which are based on the tree structure, to encode the arguments in a relation. Moreover, we further leverage the constituent tags to control the semantic composition proces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01165","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-18T00:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MaBKsOv1hfvwdD8ZCJRkQUYCnHLY9rL6JRjY/vvZtmxJmm7vqt5BWSLu+wQo9UGRosaBzvR+Y81h+vj3ulqlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:40:35.661205Z"},"content_sha256":"f3e6f8568cadcc4f9f90404c28978b167f83d58f69c3ce773d28e53bce6b8c3c","schema_version":"1.0","event_id":"sha256:f3e6f8568cadcc4f9f90404c28978b167f83d58f69c3ce773d28e53bce6b8c3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYXNF6MESCNWOL3DFOOHEOKUIN/bundle.json","state_url":"https://pith.science/pith/ZYXNF6MESCNWOL3DFOOHEOKUIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYXNF6MESCNWOL3DFOOHEOKUIN/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-27T03:40:35Z","links":{"resolver":"https://pith.science/pith/ZYXNF6MESCNWOL3DFOOHEOKUIN","bundle":"https://pith.science/pith/ZYXNF6MESCNWOL3DFOOHEOKUIN/bundle.json","state":"https://pith.science/pith/ZYXNF6MESCNWOL3DFOOHEOKUIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYXNF6MESCNWOL3DFOOHEOKUIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZYXNF6MESCNWOL3DFOOHEOKUIN","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":"4051170ac49874ad1f159074ed3b15770b025db0a131819e252effba98624aa0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-03-03T13:57:37Z","title_canon_sha256":"25f0b4dbdeb21867a40c566a066292c3f2e0e348c7856b832d35e8fe9325bd18"},"schema_version":"1.0","source":{"id":"1803.01165","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01165","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01165v1","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01165","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZYXNF6MESCNW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZYXNF6MESCNWOL3D","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZYXNF6ME","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:f3e6f8568cadcc4f9f90404c28978b167f83d58f69c3ce773d28e53bce6b8c3c","target":"graph","created_at":"2026-05-18T00:22:01Z","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":"Identifying implicit discourse relations between text spans is a challenging task because it requires understanding the meaning of the text. To tackle this task, recent studies have tried several deep learning methods but few of them exploited the syntactic information. In this work, we explore the idea of incorporating syntactic parse tree into neural networks. Specifically, we employ the Tree-LSTM model and Tree-GRU model, which are based on the tree structure, to encode the arguments in a relation. Moreover, we further leverage the constituent tags to control the semantic composition proces","authors_text":"Houfeng Wang, Jingfeng Yang, Sujian Li, Xu Sun, Yizhong Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-03-03T13:57:37Z","title":"Tag-Enhanced Tree-Structured Neural Networks for Implicit Discourse Relation Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01165","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:a1e5678e591d0bb0e43d5ad9dc4e6c7a1fadd1360ab608fe904cb2368cf8aeb2","target":"record","created_at":"2026-05-18T00:22:01Z","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":"4051170ac49874ad1f159074ed3b15770b025db0a131819e252effba98624aa0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-03-03T13:57:37Z","title_canon_sha256":"25f0b4dbdeb21867a40c566a066292c3f2e0e348c7856b832d35e8fe9325bd18"},"schema_version":"1.0","source":{"id":"1803.01165","kind":"arxiv","version":1}},"canonical_sha256":"ce2ed2f984909b672f632b9c723954434009933a763931420a86d1f52fb747e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce2ed2f984909b672f632b9c723954434009933a763931420a86d1f52fb747e0","first_computed_at":"2026-05-18T00:22:01.610268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:01.610268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yVb7p1v7RSpOcVq5Mb3Wp/dLg9iz8tBLpXKaGCQtmDHu4j/ZdLNm7m7xRnx7USEXG23bX+SAUFzWdR6/ws5nCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:01.610832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01165","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1e5678e591d0bb0e43d5ad9dc4e6c7a1fadd1360ab608fe904cb2368cf8aeb2","sha256:f3e6f8568cadcc4f9f90404c28978b167f83d58f69c3ce773d28e53bce6b8c3c"],"state_sha256":"f6d7177b85a598a8c77d1d06001720c52065d94f2a4fbb620f3b5f3f08fa4390"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tGScM48e0+jb78S5p1NdMtsTBU1Xk1OAiTNa7I9z/BYljeU/8WLXL9pxB/LZWJEc4PNLjrjEqX52yc1KkctdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:40:35.664233Z","bundle_sha256":"3a5c105cb3a72bf7caf294277483b77f5836f58d84a1aeef4ffbe93a66ddedf5"}}