{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EDGYYXFBA66WOEJPZWJ3OVSUSE","short_pith_number":"pith:EDGYYXFB","schema_version":"1.0","canonical_sha256":"20cd8c5ca107bd67112fcd93b75654913b81cf083d8651c260a3287d7be818f7","source":{"kind":"arxiv","id":"1903.08445","version":1},"attestation_state":"computed","paper":{"title":"Left-to-Right Dependency Parsing with Pointer Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Carlos G\\'omez-Rodr\\'iguez, Daniel Fern\\'andez-Gonz\\'alez","submitted_at":"2019-03-20T11:19:58Z","abstract_excerpt":"We propose a novel transition-based algorithm that straightforwardly parses sentences from left to right by building $n$ attachments, with $n$ being the length of the input sentence. Similarly to the recent stack-pointer parser by Ma et al. (2018), we use the pointer network framework that, given a word, can directly point to a position from the sentence. However, our left-to-right approach is simpler than the original top-down stack-pointer parser (not requiring a stack) and reduces transition sequence length in half, from 2$n$-1 actions to $n$. This results in a quadratic non-projective pars"},"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":"1903.08445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-03-20T11:19:58Z","cross_cats_sorted":[],"title_canon_sha256":"6c56b417e8a6b57d562ffeec4dc497bf2827f266a096a2b74ed6127e2d01b473","abstract_canon_sha256":"b0f53bf4e612ec20d1bdc2d423af00ee6a5e262c3cf384c77c9e85abe1b457b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:48.072918Z","signature_b64":"Xy4xeCVzAOb9fjkCZWpwXKGF8EmNFGafBjE+MCrEvvs/haOp3WGBnKsymxJiNdIBwZeEctMuf7Buu2ZHhzR0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20cd8c5ca107bd67112fcd93b75654913b81cf083d8651c260a3287d7be818f7","last_reissued_at":"2026-05-17T23:50:48.072287Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:48.072287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Left-to-Right Dependency Parsing with Pointer Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Carlos G\\'omez-Rodr\\'iguez, Daniel Fern\\'andez-Gonz\\'alez","submitted_at":"2019-03-20T11:19:58Z","abstract_excerpt":"We propose a novel transition-based algorithm that straightforwardly parses sentences from left to right by building $n$ attachments, with $n$ being the length of the input sentence. Similarly to the recent stack-pointer parser by Ma et al. (2018), we use the pointer network framework that, given a word, can directly point to a position from the sentence. However, our left-to-right approach is simpler than the original top-down stack-pointer parser (not requiring a stack) and reduces transition sequence length in half, from 2$n$-1 actions to $n$. This results in a quadratic non-projective pars"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08445","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.08445","created_at":"2026-05-17T23:50:48.072397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.08445v1","created_at":"2026-05-17T23:50:48.072397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08445","created_at":"2026-05-17T23:50:48.072397+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDGYYXFBA66W","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDGYYXFBA66WOEJP","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDGYYXFB","created_at":"2026-05-18T12:33:15.570797+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/EDGYYXFBA66WOEJPZWJ3OVSUSE","json":"https://pith.science/pith/EDGYYXFBA66WOEJPZWJ3OVSUSE.json","graph_json":"https://pith.science/api/pith-number/EDGYYXFBA66WOEJPZWJ3OVSUSE/graph.json","events_json":"https://pith.science/api/pith-number/EDGYYXFBA66WOEJPZWJ3OVSUSE/events.json","paper":"https://pith.science/paper/EDGYYXFB"},"agent_actions":{"view_html":"https://pith.science/pith/EDGYYXFBA66WOEJPZWJ3OVSUSE","download_json":"https://pith.science/pith/EDGYYXFBA66WOEJPZWJ3OVSUSE.json","view_paper":"https://pith.science/paper/EDGYYXFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.08445&json=true","fetch_graph":"https://pith.science/api/pith-number/EDGYYXFBA66WOEJPZWJ3OVSUSE/graph.json","fetch_events":"https://pith.science/api/pith-number/EDGYYXFBA66WOEJPZWJ3OVSUSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDGYYXFBA66WOEJPZWJ3OVSUSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDGYYXFBA66WOEJPZWJ3OVSUSE/action/storage_attestation","attest_author":"https://pith.science/pith/EDGYYXFBA66WOEJPZWJ3OVSUSE/action/author_attestation","sign_citation":"https://pith.science/pith/EDGYYXFBA66WOEJPZWJ3OVSUSE/action/citation_signature","submit_replication":"https://pith.science/pith/EDGYYXFBA66WOEJPZWJ3OVSUSE/action/replication_record"}},"created_at":"2026-05-17T23:50:48.072397+00:00","updated_at":"2026-05-17T23:50:48.072397+00:00"}