{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QIJBYFETNLWCFU4OEZRU76EPCP","short_pith_number":"pith:QIJBYFET","canonical_record":{"source":{"id":"1702.06794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-02-22T13:49:18Z","cross_cats_sorted":[],"title_canon_sha256":"1691b2e850e0a6eb1746cff64a73b621228c86b594298c0496c966df6a8d37d3","abstract_canon_sha256":"79c59c63728320d3497d36c594f3f1d2174780ee51a201e9a862976bc6cf406d"},"schema_version":"1.0"},"canonical_sha256":"82121c14936aec22d38e26634ff88f13daa3a4da53a167608c7ae8c883dfa28c","source":{"kind":"arxiv","id":"1702.06794","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06794","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06794v1","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06794","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"pith_short_12","alias_value":"QIJBYFETNLWC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QIJBYFETNLWCFU4O","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QIJBYFET","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QIJBYFETNLWCFU4OEZRU76EPCP","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-02-22T13:49:18Z","cross_cats_sorted":[],"title_canon_sha256":"1691b2e850e0a6eb1746cff64a73b621228c86b594298c0496c966df6a8d37d3","abstract_canon_sha256":"79c59c63728320d3497d36c594f3f1d2174780ee51a201e9a862976bc6cf406d"},"schema_version":"1.0"},"canonical_sha256":"82121c14936aec22d38e26634ff88f13daa3a4da53a167608c7ae8c883dfa28c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:12.108353Z","signature_b64":"56TXEc+IimIF1vN5G7/Yod4BZ+x7ctLV/oSfc1lrOXP+EuhH4Yc2mb1CQ2aP1dXy7rbBSblN2W9kVvddL6NpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82121c14936aec22d38e26634ff88f13daa3a4da53a167608c7ae8c883dfa28c","last_reissued_at":"2026-05-18T00:50:12.107755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:12.107755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06794","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:50:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/oujB+YJv6KH4WvnQJmABifd8ZDA1gq5iPPykHgzE4p6ZAbluPsomCkxzo4JuQ1nj/0S/Isi8nQ5B4m/7dVzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:19:22.786050Z"},"content_sha256":"8012e3d82389c2d960810c44017a45bbf99aa42b4fbcdaa2c4800fb9f4cca155","schema_version":"1.0","event_id":"sha256:8012e3d82389c2d960810c44017a45bbf99aa42b4fbcdaa2c4800fb9f4cca155"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QIJBYFETNLWCFU4OEZRU76EPCP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tackling Error Propagation through Reinforcement Learning: A Case of Greedy Dependency Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Antske Fokkens, Minh Le","submitted_at":"2017-02-22T13:49:18Z","abstract_excerpt":"Error propagation is a common problem in NLP. Reinforcement learning explores erroneous states during training and can therefore be more robust when mistakes are made early in a process. In this paper, we apply reinforcement learning to greedy dependency parsing which is known to suffer from error propagation. Reinforcement learning improves accuracy of both labeled and unlabeled dependencies of the Stanford Neural Dependency Parser, a high performance greedy parser, while maintaining its efficiency. We investigate the portion of errors which are the result of error propagation and confirm tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06794","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:50:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4PAbimm7hNS3MvIR0szO4ZcO1lwNVBfZ8NeId7LGCp7emn3tH4CYx27fBIvBzraOH96zJyt8ZEvuI78ZFbYxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:19:22.786406Z"},"content_sha256":"ecb234e132271f6a351531c5701b90dc8824b1a1b7ed74055c73164ce0d43189","schema_version":"1.0","event_id":"sha256:ecb234e132271f6a351531c5701b90dc8824b1a1b7ed74055c73164ce0d43189"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIJBYFETNLWCFU4OEZRU76EPCP/bundle.json","state_url":"https://pith.science/pith/QIJBYFETNLWCFU4OEZRU76EPCP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIJBYFETNLWCFU4OEZRU76EPCP/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-06-22T22:19:22Z","links":{"resolver":"https://pith.science/pith/QIJBYFETNLWCFU4OEZRU76EPCP","bundle":"https://pith.science/pith/QIJBYFETNLWCFU4OEZRU76EPCP/bundle.json","state":"https://pith.science/pith/QIJBYFETNLWCFU4OEZRU76EPCP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIJBYFETNLWCFU4OEZRU76EPCP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QIJBYFETNLWCFU4OEZRU76EPCP","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":"79c59c63728320d3497d36c594f3f1d2174780ee51a201e9a862976bc6cf406d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-02-22T13:49:18Z","title_canon_sha256":"1691b2e850e0a6eb1746cff64a73b621228c86b594298c0496c966df6a8d37d3"},"schema_version":"1.0","source":{"id":"1702.06794","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06794","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06794v1","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06794","created_at":"2026-05-18T00:50:12Z"},{"alias_kind":"pith_short_12","alias_value":"QIJBYFETNLWC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QIJBYFETNLWCFU4O","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QIJBYFET","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:ecb234e132271f6a351531c5701b90dc8824b1a1b7ed74055c73164ce0d43189","target":"graph","created_at":"2026-05-18T00:50:12Z","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":"Error propagation is a common problem in NLP. Reinforcement learning explores erroneous states during training and can therefore be more robust when mistakes are made early in a process. In this paper, we apply reinforcement learning to greedy dependency parsing which is known to suffer from error propagation. Reinforcement learning improves accuracy of both labeled and unlabeled dependencies of the Stanford Neural Dependency Parser, a high performance greedy parser, while maintaining its efficiency. We investigate the portion of errors which are the result of error propagation and confirm tha","authors_text":"Antske Fokkens, Minh Le","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-02-22T13:49:18Z","title":"Tackling Error Propagation through Reinforcement Learning: A Case of Greedy Dependency Parsing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06794","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:8012e3d82389c2d960810c44017a45bbf99aa42b4fbcdaa2c4800fb9f4cca155","target":"record","created_at":"2026-05-18T00:50:12Z","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":"79c59c63728320d3497d36c594f3f1d2174780ee51a201e9a862976bc6cf406d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-02-22T13:49:18Z","title_canon_sha256":"1691b2e850e0a6eb1746cff64a73b621228c86b594298c0496c966df6a8d37d3"},"schema_version":"1.0","source":{"id":"1702.06794","kind":"arxiv","version":1}},"canonical_sha256":"82121c14936aec22d38e26634ff88f13daa3a4da53a167608c7ae8c883dfa28c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82121c14936aec22d38e26634ff88f13daa3a4da53a167608c7ae8c883dfa28c","first_computed_at":"2026-05-18T00:50:12.107755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:12.107755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"56TXEc+IimIF1vN5G7/Yod4BZ+x7ctLV/oSfc1lrOXP+EuhH4Yc2mb1CQ2aP1dXy7rbBSblN2W9kVvddL6NpCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:12.108353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06794","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8012e3d82389c2d960810c44017a45bbf99aa42b4fbcdaa2c4800fb9f4cca155","sha256:ecb234e132271f6a351531c5701b90dc8824b1a1b7ed74055c73164ce0d43189"],"state_sha256":"5eeea3088063c035d90d07d999432e98088958f16ba03c53120226e00586252f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5xc2ZksmamZismKgim2cMYZbm6xdFmRxtD4VBWWDdBKnB1SOQP9P+ssnCbqVduyIsX+/htfGZhJwVs+j+cyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:19:22.788354Z","bundle_sha256":"217994e1a2548ae93ed3dc46cc31567b371e6389b15f1929edd1105d75fa1979"}}