{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZPYF65RCIUAKIETYZYGN6B2YZF","short_pith_number":"pith:ZPYF65RC","canonical_record":{"source":{"id":"1907.03230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-07-07T06:21:47Z","cross_cats_sorted":[],"title_canon_sha256":"804bb5077bae72d1a9ad9707f485df9104f7814dff47e6f5995d9a06ed52f026","abstract_canon_sha256":"18543ccbce6ac727e376346eed00f2638ce6fe03857a3fbde01ecd36b8ef1f4b"},"schema_version":"1.0"},"canonical_sha256":"cbf05f76224500a41278ce0cdf0758c95ec82541f5b662847f730c36dbc26e10","source":{"kind":"arxiv","id":"1907.03230","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03230","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03230v1","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03230","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZPYF65RCIUAK","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZPYF65RCIUAKIETY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZPYF65RC","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZPYF65RCIUAKIETYZYGN6B2YZF","target":"record","payload":{"canonical_record":{"source":{"id":"1907.03230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-07-07T06:21:47Z","cross_cats_sorted":[],"title_canon_sha256":"804bb5077bae72d1a9ad9707f485df9104f7814dff47e6f5995d9a06ed52f026","abstract_canon_sha256":"18543ccbce6ac727e376346eed00f2638ce6fe03857a3fbde01ecd36b8ef1f4b"},"schema_version":"1.0"},"canonical_sha256":"cbf05f76224500a41278ce0cdf0758c95ec82541f5b662847f730c36dbc26e10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:16.822793Z","signature_b64":"pjk4exXEC+/GwCB1pjmmJ4nVZ+fi/oo9wfO9qzc/DNkCwJ5saUuQttFL/vw46Oe2OoClskUB94vKjrvl8LkcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbf05f76224500a41278ce0cdf0758c95ec82541f5b662847f730c36dbc26e10","last_reissued_at":"2026-05-17T23:41:16.822349Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:16.822349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.03230","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-17T23:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IddaJjJ94bof8dYsjgGX8HW4MLgkKQYclMYMkX3lXQU6qugZSZOTm66caYArwA1IMJ6BMf7kcL9qz+nAvLB1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:31:49.128722Z"},"content_sha256":"931a4b47be7b21e000d3e690af127e2362c7b191341535915dd618bc3874b3af","schema_version":"1.0","event_id":"sha256:931a4b47be7b21e000d3e690af127e2362c7b191341535915dd618bc3874b3af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZPYF65RCIUAKIETYZYGN6B2YZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Cross-Domain Performance for Relation Extraction via Dependency Prediction and Information Flow Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Amir Pouran Ben Veyseh, Dejing Dou, Thien Huu Nguyen","submitted_at":"2019-07-07T06:21:47Z","abstract_excerpt":"Relation Extraction (RE) is one of the fundamental tasks in Information Extraction and Natural Language Processing. Dependency trees have been shown to be a very useful source of information for this task. The current deep learning models for relation extraction has mainly exploited this dependency information by guiding their computation along the structures of the dependency trees. One potential problem with this approach is it might prevent the models from capturing important context information beyond syntactic structures and cause the poor cross-domain generalization. This paper introduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03230","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-17T23:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUuRGutIsdL1P3pUxLRh+BRtnCAE8YzBV2Rc+yDUX5P/gDQehU6nD/i8Tq8fDfUUP0ekmQPV8cJEdQpeyfPUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:31:49.129085Z"},"content_sha256":"d565098f4690469e903088934ab12f469b710da3d2c05ef222dc637be3570b75","schema_version":"1.0","event_id":"sha256:d565098f4690469e903088934ab12f469b710da3d2c05ef222dc637be3570b75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZPYF65RCIUAKIETYZYGN6B2YZF/bundle.json","state_url":"https://pith.science/pith/ZPYF65RCIUAKIETYZYGN6B2YZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZPYF65RCIUAKIETYZYGN6B2YZF/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-27T07:31:49Z","links":{"resolver":"https://pith.science/pith/ZPYF65RCIUAKIETYZYGN6B2YZF","bundle":"https://pith.science/pith/ZPYF65RCIUAKIETYZYGN6B2YZF/bundle.json","state":"https://pith.science/pith/ZPYF65RCIUAKIETYZYGN6B2YZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZPYF65RCIUAKIETYZYGN6B2YZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZPYF65RCIUAKIETYZYGN6B2YZF","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":"18543ccbce6ac727e376346eed00f2638ce6fe03857a3fbde01ecd36b8ef1f4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-07-07T06:21:47Z","title_canon_sha256":"804bb5077bae72d1a9ad9707f485df9104f7814dff47e6f5995d9a06ed52f026"},"schema_version":"1.0","source":{"id":"1907.03230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03230","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03230v1","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03230","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZPYF65RCIUAK","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZPYF65RCIUAKIETY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZPYF65RC","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:d565098f4690469e903088934ab12f469b710da3d2c05ef222dc637be3570b75","target":"graph","created_at":"2026-05-17T23:41:16Z","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 Extraction (RE) is one of the fundamental tasks in Information Extraction and Natural Language Processing. Dependency trees have been shown to be a very useful source of information for this task. The current deep learning models for relation extraction has mainly exploited this dependency information by guiding their computation along the structures of the dependency trees. One potential problem with this approach is it might prevent the models from capturing important context information beyond syntactic structures and cause the poor cross-domain generalization. This paper introduce","authors_text":"Amir Pouran Ben Veyseh, Dejing Dou, Thien Huu Nguyen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-07-07T06:21:47Z","title":"Improving Cross-Domain Performance for Relation Extraction via Dependency Prediction and Information Flow Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03230","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:931a4b47be7b21e000d3e690af127e2362c7b191341535915dd618bc3874b3af","target":"record","created_at":"2026-05-17T23:41:16Z","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":"18543ccbce6ac727e376346eed00f2638ce6fe03857a3fbde01ecd36b8ef1f4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-07-07T06:21:47Z","title_canon_sha256":"804bb5077bae72d1a9ad9707f485df9104f7814dff47e6f5995d9a06ed52f026"},"schema_version":"1.0","source":{"id":"1907.03230","kind":"arxiv","version":1}},"canonical_sha256":"cbf05f76224500a41278ce0cdf0758c95ec82541f5b662847f730c36dbc26e10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbf05f76224500a41278ce0cdf0758c95ec82541f5b662847f730c36dbc26e10","first_computed_at":"2026-05-17T23:41:16.822349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:16.822349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pjk4exXEC+/GwCB1pjmmJ4nVZ+fi/oo9wfO9qzc/DNkCwJ5saUuQttFL/vw46Oe2OoClskUB94vKjrvl8LkcCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:16.822793Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:931a4b47be7b21e000d3e690af127e2362c7b191341535915dd618bc3874b3af","sha256:d565098f4690469e903088934ab12f469b710da3d2c05ef222dc637be3570b75"],"state_sha256":"9e0f827793f1f0890199036de4d81730b476acc3783a491908701d57e7aa2914"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBAUak7KoKUe2wpKfAQtYP7hjif1ZAkO2abWoY1metpcybPLWEItxO1XUnKbnzJGfHyS1r12yyUw5h9gdBGuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:31:49.132235Z","bundle_sha256":"387d24042514b3d65bae5c5755d0e204a5669c662cf5250c3c825bd0df3465da"}}