{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:M54ZEV2IU53VM2HHNLN25CYYXN","short_pith_number":"pith:M54ZEV2I","schema_version":"1.0","canonical_sha256":"6779925748a7775668e76adbae8b18bb70697d68f2e46d91065ac531ca1f6be5","source":{"kind":"arxiv","id":"1503.05615","version":2},"attestation_state":"computed","paper":{"title":"Learning to Search for Dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Hal Daum\\'e III, He He, John Langford, Kai-Wei Chang","submitted_at":"2015-03-18T23:33:17Z","abstract_excerpt":"We demonstrate that a dependency parser can be built using a credit assignment compiler which removes the burden of worrying about low-level machine learning details from the parser implementation. The result is a simple parser which robustly applies to many languages that provides similar statistical and computational performance with best-to-date transition-based parsing approaches, while avoiding various downsides including randomization, extra feature requirements, and custom learning algorithms."},"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":"1503.05615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-03-18T23:33:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"20465464c112769dec25756091943b340d21d95cb450b9cfe4b1cf86f999d25c","abstract_canon_sha256":"3a8b6bc321299561aade0ca5679f991d93c40e2c095288b4d17bb8ef2a40752b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:38.922592Z","signature_b64":"jSOCtfnBbmwNWpb9bUo1b7ucVy5s4A2TVhOdqO/qG+2AD9a50dOVoyOThpSH/C9BuFp/9GAVrf8t5jvg3Qg/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6779925748a7775668e76adbae8b18bb70697d68f2e46d91065ac531ca1f6be5","last_reissued_at":"2026-05-18T02:16:38.922170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:38.922170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Search for Dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Hal Daum\\'e III, He He, John Langford, Kai-Wei Chang","submitted_at":"2015-03-18T23:33:17Z","abstract_excerpt":"We demonstrate that a dependency parser can be built using a credit assignment compiler which removes the burden of worrying about low-level machine learning details from the parser implementation. The result is a simple parser which robustly applies to many languages that provides similar statistical and computational performance with best-to-date transition-based parsing approaches, while avoiding various downsides including randomization, extra feature requirements, and custom learning algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05615","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":"1503.05615","created_at":"2026-05-18T02:16:38.922230+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05615v2","created_at":"2026-05-18T02:16:38.922230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05615","created_at":"2026-05-18T02:16:38.922230+00:00"},{"alias_kind":"pith_short_12","alias_value":"M54ZEV2IU53V","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"M54ZEV2IU53VM2HH","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"M54ZEV2I","created_at":"2026-05-18T12:29:32.376354+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/M54ZEV2IU53VM2HHNLN25CYYXN","json":"https://pith.science/pith/M54ZEV2IU53VM2HHNLN25CYYXN.json","graph_json":"https://pith.science/api/pith-number/M54ZEV2IU53VM2HHNLN25CYYXN/graph.json","events_json":"https://pith.science/api/pith-number/M54ZEV2IU53VM2HHNLN25CYYXN/events.json","paper":"https://pith.science/paper/M54ZEV2I"},"agent_actions":{"view_html":"https://pith.science/pith/M54ZEV2IU53VM2HHNLN25CYYXN","download_json":"https://pith.science/pith/M54ZEV2IU53VM2HHNLN25CYYXN.json","view_paper":"https://pith.science/paper/M54ZEV2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05615&json=true","fetch_graph":"https://pith.science/api/pith-number/M54ZEV2IU53VM2HHNLN25CYYXN/graph.json","fetch_events":"https://pith.science/api/pith-number/M54ZEV2IU53VM2HHNLN25CYYXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M54ZEV2IU53VM2HHNLN25CYYXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M54ZEV2IU53VM2HHNLN25CYYXN/action/storage_attestation","attest_author":"https://pith.science/pith/M54ZEV2IU53VM2HHNLN25CYYXN/action/author_attestation","sign_citation":"https://pith.science/pith/M54ZEV2IU53VM2HHNLN25CYYXN/action/citation_signature","submit_replication":"https://pith.science/pith/M54ZEV2IU53VM2HHNLN25CYYXN/action/replication_record"}},"created_at":"2026-05-18T02:16:38.922230+00:00","updated_at":"2026-05-18T02:16:38.922230+00:00"}