{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:73Y3AUXMMBLNSNY75H4YVXEBFY","short_pith_number":"pith:73Y3AUXM","schema_version":"1.0","canonical_sha256":"fef1b052ec6056d9371fe9f98adc812e1d3a8b3c3937db7ff36b42f6f5d00b75","source":{"kind":"arxiv","id":"1603.00375","version":2},"attestation_state":"computed","paper":{"title":"Easy-First Dependency Parsing with Hierarchical Tree LSTMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Eliyahu Kiperwasser, Yoav Goldberg","submitted_at":"2016-03-01T17:43:37Z","abstract_excerpt":"We suggest a compositional vector representation of parse trees that relies on a recursive combination of recurrent-neural network encoders. To demonstrate its effectiveness, we use the representation as the backbone of a greedy, bottom-up dependency parser, achieving state-of-the-art accuracies for English and Chinese, without relying on external word embeddings. The parser's implementation is available for download at the first author's webpage."},"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":"1603.00375","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-03-01T17:43:37Z","cross_cats_sorted":[],"title_canon_sha256":"ea22839f20ce0584f8c70d4252fac4a6683c48d8545eedbe6ce273247fb8e7a5","abstract_canon_sha256":"ca676fcd0b0ff1c7178c852b517728bbdbb2f61ec9733320694e210a3a11bd82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:46.537538Z","signature_b64":"8dZtFGWX0CE3svPMvmHMquKSdffV5T9qjS5b17q80LlN5cNmArx9izvWVO1SkkEvWHjb4WK3AjNf4mA2uCCjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fef1b052ec6056d9371fe9f98adc812e1d3a8b3c3937db7ff36b42f6f5d00b75","last_reissued_at":"2026-05-18T00:17:46.536939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:46.536939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Easy-First Dependency Parsing with Hierarchical Tree LSTMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Eliyahu Kiperwasser, Yoav Goldberg","submitted_at":"2016-03-01T17:43:37Z","abstract_excerpt":"We suggest a compositional vector representation of parse trees that relies on a recursive combination of recurrent-neural network encoders. To demonstrate its effectiveness, we use the representation as the backbone of a greedy, bottom-up dependency parser, achieving state-of-the-art accuracies for English and Chinese, without relying on external word embeddings. The parser's implementation is available for download at the first author's webpage."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00375","kind":"arxiv","version":2},"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":"1603.00375","created_at":"2026-05-18T00:17:46.537028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00375v2","created_at":"2026-05-18T00:17:46.537028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00375","created_at":"2026-05-18T00:17:46.537028+00:00"},{"alias_kind":"pith_short_12","alias_value":"73Y3AUXMMBLN","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"73Y3AUXMMBLNSNY7","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"73Y3AUXM","created_at":"2026-05-18T12:30:04.600751+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/73Y3AUXMMBLNSNY75H4YVXEBFY","json":"https://pith.science/pith/73Y3AUXMMBLNSNY75H4YVXEBFY.json","graph_json":"https://pith.science/api/pith-number/73Y3AUXMMBLNSNY75H4YVXEBFY/graph.json","events_json":"https://pith.science/api/pith-number/73Y3AUXMMBLNSNY75H4YVXEBFY/events.json","paper":"https://pith.science/paper/73Y3AUXM"},"agent_actions":{"view_html":"https://pith.science/pith/73Y3AUXMMBLNSNY75H4YVXEBFY","download_json":"https://pith.science/pith/73Y3AUXMMBLNSNY75H4YVXEBFY.json","view_paper":"https://pith.science/paper/73Y3AUXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00375&json=true","fetch_graph":"https://pith.science/api/pith-number/73Y3AUXMMBLNSNY75H4YVXEBFY/graph.json","fetch_events":"https://pith.science/api/pith-number/73Y3AUXMMBLNSNY75H4YVXEBFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73Y3AUXMMBLNSNY75H4YVXEBFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73Y3AUXMMBLNSNY75H4YVXEBFY/action/storage_attestation","attest_author":"https://pith.science/pith/73Y3AUXMMBLNSNY75H4YVXEBFY/action/author_attestation","sign_citation":"https://pith.science/pith/73Y3AUXMMBLNSNY75H4YVXEBFY/action/citation_signature","submit_replication":"https://pith.science/pith/73Y3AUXMMBLNSNY75H4YVXEBFY/action/replication_record"}},"created_at":"2026-05-18T00:17:46.537028+00:00","updated_at":"2026-05-18T00:17:46.537028+00:00"}