{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IAC6XKSG2YSMKXZHSDWRZHYUUW","short_pith_number":"pith:IAC6XKSG","canonical_record":{"source":{"id":"1506.04334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-13T23:39:09Z","cross_cats_sorted":[],"title_canon_sha256":"517405c65019bd1a971ae9e7f6356d9d0f0b2962968b35db84696ca908ad31cc","abstract_canon_sha256":"c78c48ce177d1a6e585fae5b58a2e76062107e9a1a09d642687d39d59746e836"},"schema_version":"1.0"},"canonical_sha256":"4005ebaa46d624c55f2790ed1c9f14a5b7b950228c82623c178aa47c49bc9bf8","source":{"kind":"arxiv","id":"1506.04334","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04334","created_at":"2026-05-18T01:37:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04334v2","created_at":"2026-05-18T01:37:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04334","created_at":"2026-05-18T01:37:47Z"},{"alias_kind":"pith_short_12","alias_value":"IAC6XKSG2YSM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IAC6XKSG2YSMKXZH","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IAC6XKSG","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IAC6XKSG2YSMKXZHSDWRZHYUUW","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-13T23:39:09Z","cross_cats_sorted":[],"title_canon_sha256":"517405c65019bd1a971ae9e7f6356d9d0f0b2962968b35db84696ca908ad31cc","abstract_canon_sha256":"c78c48ce177d1a6e585fae5b58a2e76062107e9a1a09d642687d39d59746e836"},"schema_version":"1.0"},"canonical_sha256":"4005ebaa46d624c55f2790ed1c9f14a5b7b950228c82623c178aa47c49bc9bf8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:47.102883Z","signature_b64":"T/atKc0DVHZGCM9+hTPdN5+SI4AmOKY92lRy3Hc6KkE54QEzFT585T/RUPgVrLsz4heBfs2bD0+xR+NiOq1HAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4005ebaa46d624c55f2790ed1c9f14a5b7b950228c82623c178aa47c49bc9bf8","last_reissued_at":"2026-05-18T01:37:47.102445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:47.102445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04334","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+wA5SVD/sRFaoAsxCpq82WriM9Zx1denVzL6320ySAjJ43pJ5N3CS8Y8WgvKVEXIpGdjzgBO09Y6OA81pPvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:23:05.819412Z"},"content_sha256":"93cbd2625da424b13b3eef78d3c9ca0c964d69ec89648a0e19601fadf8f531fc","schema_version":"1.0","event_id":"sha256:93cbd2625da424b13b3eef78d3c9ca0c964d69ec89648a0e19601fadf8f531fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IAC6XKSG2YSMKXZHSDWRZHYUUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bayesian Model for Generative Transition-based Dependency Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jan Buys, Phil Blunsom","submitted_at":"2015-06-13T23:39:09Z","abstract_excerpt":"We propose a simple, scalable, fully generative model for transition-based dependency parsing with high accuracy. The model, parameterized by Hierarchical Pitman-Yor Processes, overcomes the limitations of previous generative models by allowing fast and accurate inference. We propose an efficient decoding algorithm based on particle filtering that can adapt the beam size to the uncertainty in the model while jointly predicting POS tags and parse trees. The UAS of the parser is on par with that of a greedy discriminative baseline. As a language model, it obtains better perplexity than a n-gram "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04334","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Mac7gMi56YsTvEK2RLH2t6KWZS+vC7R+1fQFQF8sa3A21chRTAq6k6fqYxbmPKvvr4DuejOH0j/Cum4RW7JCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:23:05.820046Z"},"content_sha256":"8afff7f54c2c2670270bb91a2ef27e6ed70ed2980f3c75619d1288fad4d6e72d","schema_version":"1.0","event_id":"sha256:8afff7f54c2c2670270bb91a2ef27e6ed70ed2980f3c75619d1288fad4d6e72d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IAC6XKSG2YSMKXZHSDWRZHYUUW/bundle.json","state_url":"https://pith.science/pith/IAC6XKSG2YSMKXZHSDWRZHYUUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IAC6XKSG2YSMKXZHSDWRZHYUUW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T19:23:05Z","links":{"resolver":"https://pith.science/pith/IAC6XKSG2YSMKXZHSDWRZHYUUW","bundle":"https://pith.science/pith/IAC6XKSG2YSMKXZHSDWRZHYUUW/bundle.json","state":"https://pith.science/pith/IAC6XKSG2YSMKXZHSDWRZHYUUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IAC6XKSG2YSMKXZHSDWRZHYUUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IAC6XKSG2YSMKXZHSDWRZHYUUW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c78c48ce177d1a6e585fae5b58a2e76062107e9a1a09d642687d39d59746e836","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-13T23:39:09Z","title_canon_sha256":"517405c65019bd1a971ae9e7f6356d9d0f0b2962968b35db84696ca908ad31cc"},"schema_version":"1.0","source":{"id":"1506.04334","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04334","created_at":"2026-05-18T01:37:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04334v2","created_at":"2026-05-18T01:37:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04334","created_at":"2026-05-18T01:37:47Z"},{"alias_kind":"pith_short_12","alias_value":"IAC6XKSG2YSM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IAC6XKSG2YSMKXZH","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IAC6XKSG","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:8afff7f54c2c2670270bb91a2ef27e6ed70ed2980f3c75619d1288fad4d6e72d","target":"graph","created_at":"2026-05-18T01:37:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We propose a simple, scalable, fully generative model for transition-based dependency parsing with high accuracy. The model, parameterized by Hierarchical Pitman-Yor Processes, overcomes the limitations of previous generative models by allowing fast and accurate inference. We propose an efficient decoding algorithm based on particle filtering that can adapt the beam size to the uncertainty in the model while jointly predicting POS tags and parse trees. The UAS of the parser is on par with that of a greedy discriminative baseline. As a language model, it obtains better perplexity than a n-gram ","authors_text":"Jan Buys, Phil Blunsom","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-13T23:39:09Z","title":"A Bayesian Model for Generative Transition-based Dependency Parsing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04334","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:93cbd2625da424b13b3eef78d3c9ca0c964d69ec89648a0e19601fadf8f531fc","target":"record","created_at":"2026-05-18T01:37:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c78c48ce177d1a6e585fae5b58a2e76062107e9a1a09d642687d39d59746e836","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-13T23:39:09Z","title_canon_sha256":"517405c65019bd1a971ae9e7f6356d9d0f0b2962968b35db84696ca908ad31cc"},"schema_version":"1.0","source":{"id":"1506.04334","kind":"arxiv","version":2}},"canonical_sha256":"4005ebaa46d624c55f2790ed1c9f14a5b7b950228c82623c178aa47c49bc9bf8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4005ebaa46d624c55f2790ed1c9f14a5b7b950228c82623c178aa47c49bc9bf8","first_computed_at":"2026-05-18T01:37:47.102445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:47.102445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T/atKc0DVHZGCM9+hTPdN5+SI4AmOKY92lRy3Hc6KkE54QEzFT585T/RUPgVrLsz4heBfs2bD0+xR+NiOq1HAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:47.102883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04334","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93cbd2625da424b13b3eef78d3c9ca0c964d69ec89648a0e19601fadf8f531fc","sha256:8afff7f54c2c2670270bb91a2ef27e6ed70ed2980f3c75619d1288fad4d6e72d"],"state_sha256":"d57c037e997a8d924886a59ecce33f040ec32c5f8aaa3bfc71f6584ea7bc4eb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I7HsxXrdQwgG/9XNU4frJQvCUFgBlsLf1rtU79bboQ+gzfoZjYN1kFfTxED+OxqU41IsehZSNh96GjKcY8lrCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:23:05.823398Z","bundle_sha256":"57052d720ddea1a138c60b2e68ac6b235fbee377494299f457c16a31ec0438d5"}}