{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QJWAH3C7DVEFMYWDOMDJ6ZIAXR","short_pith_number":"pith:QJWAH3C7","schema_version":"1.0","canonical_sha256":"826c03ec5f1d485662c373069f6500bc7dee9dc973567fb3b722228445ef324a","source":{"kind":"arxiv","id":"1804.10615","version":2},"attestation_state":"computed","paper":{"title":"Improving Coverage and Runtime Complexity for Exact Inference in Non-Projective Transition-Based Dependency Parsers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Carlos G\\'omez-Rodr\\'iguez, Lillian Lee, Tianze Shi","submitted_at":"2018-04-27T17:59:15Z","abstract_excerpt":"We generalize Cohen, G\\'omez-Rodr\\'iguez, and Satta's (2011) parser to a family of non-projective transition-based dependency parsers allowing polynomial-time exact inference. This includes novel parsers with better coverage than Cohen et al. (2011), and even a variant that reduces time complexity to $O(n^6)$, improving over the known bounds in exact inference for non-projective transition-based parsing. We hope that this piece of theoretical work inspires design of novel transition systems with better coverage and better run-time guarantees.\n  Code available at https://github.com/tzshi/nonpro"},"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":"1804.10615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-27T17:59:15Z","cross_cats_sorted":[],"title_canon_sha256":"2da1e287e51cf19b2bca01bb9508c7833fcf8b08e82b49af1dd11164c80448a0","abstract_canon_sha256":"eba8de6b5f298c25e7c2bff908a4fe74327ad8df4ac396ed44d7e15caf79f50a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:58.849153Z","signature_b64":"apYoAV6C2ZKD4kD2iXXazx98OzdTf+G2439k7A3HnPDQL5/Ys4olXhfY+e58pZgVpl9UiWldkSf1zF4NGxxEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"826c03ec5f1d485662c373069f6500bc7dee9dc973567fb3b722228445ef324a","last_reissued_at":"2026-05-18T00:16:58.848484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:58.848484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Coverage and Runtime Complexity for Exact Inference in Non-Projective Transition-Based Dependency Parsers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Carlos G\\'omez-Rodr\\'iguez, Lillian Lee, Tianze Shi","submitted_at":"2018-04-27T17:59:15Z","abstract_excerpt":"We generalize Cohen, G\\'omez-Rodr\\'iguez, and Satta's (2011) parser to a family of non-projective transition-based dependency parsers allowing polynomial-time exact inference. This includes novel parsers with better coverage than Cohen et al. (2011), and even a variant that reduces time complexity to $O(n^6)$, improving over the known bounds in exact inference for non-projective transition-based parsing. We hope that this piece of theoretical work inspires design of novel transition systems with better coverage and better run-time guarantees.\n  Code available at https://github.com/tzshi/nonpro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10615","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":"1804.10615","created_at":"2026-05-18T00:16:58.848600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10615v2","created_at":"2026-05-18T00:16:58.848600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10615","created_at":"2026-05-18T00:16:58.848600+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJWAH3C7DVEF","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJWAH3C7DVEFMYWD","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJWAH3C7","created_at":"2026-05-18T12:32:46.962924+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/QJWAH3C7DVEFMYWDOMDJ6ZIAXR","json":"https://pith.science/pith/QJWAH3C7DVEFMYWDOMDJ6ZIAXR.json","graph_json":"https://pith.science/api/pith-number/QJWAH3C7DVEFMYWDOMDJ6ZIAXR/graph.json","events_json":"https://pith.science/api/pith-number/QJWAH3C7DVEFMYWDOMDJ6ZIAXR/events.json","paper":"https://pith.science/paper/QJWAH3C7"},"agent_actions":{"view_html":"https://pith.science/pith/QJWAH3C7DVEFMYWDOMDJ6ZIAXR","download_json":"https://pith.science/pith/QJWAH3C7DVEFMYWDOMDJ6ZIAXR.json","view_paper":"https://pith.science/paper/QJWAH3C7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10615&json=true","fetch_graph":"https://pith.science/api/pith-number/QJWAH3C7DVEFMYWDOMDJ6ZIAXR/graph.json","fetch_events":"https://pith.science/api/pith-number/QJWAH3C7DVEFMYWDOMDJ6ZIAXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJWAH3C7DVEFMYWDOMDJ6ZIAXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJWAH3C7DVEFMYWDOMDJ6ZIAXR/action/storage_attestation","attest_author":"https://pith.science/pith/QJWAH3C7DVEFMYWDOMDJ6ZIAXR/action/author_attestation","sign_citation":"https://pith.science/pith/QJWAH3C7DVEFMYWDOMDJ6ZIAXR/action/citation_signature","submit_replication":"https://pith.science/pith/QJWAH3C7DVEFMYWDOMDJ6ZIAXR/action/replication_record"}},"created_at":"2026-05-18T00:16:58.848600+00:00","updated_at":"2026-05-18T00:16:58.848600+00:00"}