{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HLRD2HURW7MTPPXM7HE2SEVSBB","short_pith_number":"pith:HLRD2HUR","schema_version":"1.0","canonical_sha256":"3ae23d1e91b7d937beecf9c9a912b20869927db51b2d9b2014a0ed5426181243","source":{"kind":"arxiv","id":"1206.6735","version":1},"attestation_state":"computed","paper":{"title":"Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Carlos G\\'omez-Rodr\\'iguez, Giorgio Satta, Shay B. Cohen","submitted_at":"2012-06-28T15:43:57Z","abstract_excerpt":"We present a novel technique to remove spurious ambiguity from transition systems for dependency parsing. Our technique chooses a canonical sequence of transition operations (computation) for a given dependency tree. Our technique can be applied to a large class of bottom-up transition systems, including for instance Nivre (2004) and Attardi (2006)."},"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":"1206.6735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2012-06-28T15:43:57Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9c48f0340712ffc15b0a7b47e08f0923ad264cae9e2a38e8e592e108abb531aa","abstract_canon_sha256":"2f9cab4f174197f55bc6564108085be292ec72df2f0a9e2f3777081ea7a42002"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:25.132143Z","signature_b64":"GDLg1UZX+bnyLPKwbITs5CzO8l8i6TRhiUFta8GFTZHgWPmrIOyd5ef2WdBgAwaxwx3Hb3h7J0uWoz+LFCHIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ae23d1e91b7d937beecf9c9a912b20869927db51b2d9b2014a0ed5426181243","last_reissued_at":"2026-05-18T03:52:25.131471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:25.131471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Carlos G\\'omez-Rodr\\'iguez, Giorgio Satta, Shay B. Cohen","submitted_at":"2012-06-28T15:43:57Z","abstract_excerpt":"We present a novel technique to remove spurious ambiguity from transition systems for dependency parsing. Our technique chooses a canonical sequence of transition operations (computation) for a given dependency tree. Our technique can be applied to a large class of bottom-up transition systems, including for instance Nivre (2004) and Attardi (2006)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6735","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":"1206.6735","created_at":"2026-05-18T03:52:25.131570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6735v1","created_at":"2026-05-18T03:52:25.131570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6735","created_at":"2026-05-18T03:52:25.131570+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLRD2HURW7MT","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLRD2HURW7MTPPXM","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLRD2HUR","created_at":"2026-05-18T12:27:09.501522+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/HLRD2HURW7MTPPXM7HE2SEVSBB","json":"https://pith.science/pith/HLRD2HURW7MTPPXM7HE2SEVSBB.json","graph_json":"https://pith.science/api/pith-number/HLRD2HURW7MTPPXM7HE2SEVSBB/graph.json","events_json":"https://pith.science/api/pith-number/HLRD2HURW7MTPPXM7HE2SEVSBB/events.json","paper":"https://pith.science/paper/HLRD2HUR"},"agent_actions":{"view_html":"https://pith.science/pith/HLRD2HURW7MTPPXM7HE2SEVSBB","download_json":"https://pith.science/pith/HLRD2HURW7MTPPXM7HE2SEVSBB.json","view_paper":"https://pith.science/paper/HLRD2HUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6735&json=true","fetch_graph":"https://pith.science/api/pith-number/HLRD2HURW7MTPPXM7HE2SEVSBB/graph.json","fetch_events":"https://pith.science/api/pith-number/HLRD2HURW7MTPPXM7HE2SEVSBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLRD2HURW7MTPPXM7HE2SEVSBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLRD2HURW7MTPPXM7HE2SEVSBB/action/storage_attestation","attest_author":"https://pith.science/pith/HLRD2HURW7MTPPXM7HE2SEVSBB/action/author_attestation","sign_citation":"https://pith.science/pith/HLRD2HURW7MTPPXM7HE2SEVSBB/action/citation_signature","submit_replication":"https://pith.science/pith/HLRD2HURW7MTPPXM7HE2SEVSBB/action/replication_record"}},"created_at":"2026-05-18T03:52:25.131570+00:00","updated_at":"2026-05-18T03:52:25.131570+00:00"}