{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MFPG4X5DMIZFHDE3N2GQ3RRY63","short_pith_number":"pith:MFPG4X5D","canonical_record":{"source":{"id":"1708.00790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-08-02T15:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"0c9b674da593fdeff3a1c324dadbe73b198b69987d91632cc00ddeb0e6719b47","abstract_canon_sha256":"7f12c76a45f03410d78d944f2a0a639a8e6d952043b8fdd5f22272f2bb936006"},"schema_version":"1.0"},"canonical_sha256":"615e6e5fa36232538c9b6e8d0dc638f6d0c16f534cd4ac1dfaf270dcbc295b1a","source":{"kind":"arxiv","id":"1708.00790","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00790","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00790v2","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00790","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"pith_short_12","alias_value":"MFPG4X5DMIZF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MFPG4X5DMIZFHDE3","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MFPG4X5D","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MFPG4X5DMIZFHDE3N2GQ3RRY63","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-08-02T15:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"0c9b674da593fdeff3a1c324dadbe73b198b69987d91632cc00ddeb0e6719b47","abstract_canon_sha256":"7f12c76a45f03410d78d944f2a0a639a8e6d952043b8fdd5f22272f2bb936006"},"schema_version":"1.0"},"canonical_sha256":"615e6e5fa36232538c9b6e8d0dc638f6d0c16f534cd4ac1dfaf270dcbc295b1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:28.911943Z","signature_b64":"KceK9q2EjADll9uhg12IowgpJDtyVkSk2RPcd6U6V4RwyjfMwU2AQ3ZCCnGs7tyygSbBJ0KRGimfh3GfikRAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"615e6e5fa36232538c9b6e8d0dc638f6d0c16f534cd4ac1dfaf270dcbc295b1a","last_reissued_at":"2026-05-18T00:34:28.911296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:28.911296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00790","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-18T00:34:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5qYCSqpp/gC6xI8UqgvqIq+/Ut/8MFvosdDkFC8+1peKf+q0oTk1hSp1mQ7qI1j6b84Zwgd101v53ox5F5ofDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T14:24:05.530965Z"},"content_sha256":"fd3c1b776f6a59595379f517e4512f26c41b2ff0b2614ecd8581f5f874b223e1","schema_version":"1.0","event_id":"sha256:fd3c1b776f6a59595379f517e4512f26c41b2ff0b2614ecd8581f5f874b223e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MFPG4X5DMIZFHDE3N2GQ3RRY63","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combining Generative and Discriminative Approaches to Unsupervised Dependency Parsing via Dual Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Kewei Tu, Wenjuan Han, Yong Jiang","submitted_at":"2017-08-02T15:10:28Z","abstract_excerpt":"Unsupervised dependency parsing aims to learn a dependency parser from unannotated sentences. Existing work focuses on either learning generative models using the expectation-maximization algorithm and its variants, or learning discriminative models using the discriminative clustering algorithm. In this paper, we propose a new learning strategy that learns a generative model and a discriminative model jointly based on the dual decomposition method. Our method is simple and general, yet effective to capture the advantages of both models and improve their learning results. We tested our method o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00790","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-18T00:34:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3GEEgH6Xnis55NI4oOcI0i9FLkrq3VEhJ57As+xgHzqhmvMsj0OCVdK0i9LHhsNzhM43DtPJuQ/CGKusaiacDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T14:24:05.531520Z"},"content_sha256":"1b9cfa04932d82037a24d27e47ea8ac692160777d5cd7b3461f7cac500832b51","schema_version":"1.0","event_id":"sha256:1b9cfa04932d82037a24d27e47ea8ac692160777d5cd7b3461f7cac500832b51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MFPG4X5DMIZFHDE3N2GQ3RRY63/bundle.json","state_url":"https://pith.science/pith/MFPG4X5DMIZFHDE3N2GQ3RRY63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MFPG4X5DMIZFHDE3N2GQ3RRY63/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-08-20T14:24:05Z","links":{"resolver":"https://pith.science/pith/MFPG4X5DMIZFHDE3N2GQ3RRY63","bundle":"https://pith.science/pith/MFPG4X5DMIZFHDE3N2GQ3RRY63/bundle.json","state":"https://pith.science/pith/MFPG4X5DMIZFHDE3N2GQ3RRY63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MFPG4X5DMIZFHDE3N2GQ3RRY63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MFPG4X5DMIZFHDE3N2GQ3RRY63","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":"7f12c76a45f03410d78d944f2a0a639a8e6d952043b8fdd5f22272f2bb936006","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-08-02T15:10:28Z","title_canon_sha256":"0c9b674da593fdeff3a1c324dadbe73b198b69987d91632cc00ddeb0e6719b47"},"schema_version":"1.0","source":{"id":"1708.00790","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00790","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00790v2","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00790","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"pith_short_12","alias_value":"MFPG4X5DMIZF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MFPG4X5DMIZFHDE3","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MFPG4X5D","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:1b9cfa04932d82037a24d27e47ea8ac692160777d5cd7b3461f7cac500832b51","target":"graph","created_at":"2026-05-18T00:34:28Z","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":"Unsupervised dependency parsing aims to learn a dependency parser from unannotated sentences. Existing work focuses on either learning generative models using the expectation-maximization algorithm and its variants, or learning discriminative models using the discriminative clustering algorithm. In this paper, we propose a new learning strategy that learns a generative model and a discriminative model jointly based on the dual decomposition method. Our method is simple and general, yet effective to capture the advantages of both models and improve their learning results. We tested our method o","authors_text":"Kewei Tu, Wenjuan Han, Yong Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-08-02T15:10:28Z","title":"Combining Generative and Discriminative Approaches to Unsupervised Dependency Parsing via Dual Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00790","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:fd3c1b776f6a59595379f517e4512f26c41b2ff0b2614ecd8581f5f874b223e1","target":"record","created_at":"2026-05-18T00:34:28Z","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":"7f12c76a45f03410d78d944f2a0a639a8e6d952043b8fdd5f22272f2bb936006","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-08-02T15:10:28Z","title_canon_sha256":"0c9b674da593fdeff3a1c324dadbe73b198b69987d91632cc00ddeb0e6719b47"},"schema_version":"1.0","source":{"id":"1708.00790","kind":"arxiv","version":2}},"canonical_sha256":"615e6e5fa36232538c9b6e8d0dc638f6d0c16f534cd4ac1dfaf270dcbc295b1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"615e6e5fa36232538c9b6e8d0dc638f6d0c16f534cd4ac1dfaf270dcbc295b1a","first_computed_at":"2026-05-18T00:34:28.911296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:28.911296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KceK9q2EjADll9uhg12IowgpJDtyVkSk2RPcd6U6V4RwyjfMwU2AQ3ZCCnGs7tyygSbBJ0KRGimfh3GfikRAAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:28.911943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00790","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd3c1b776f6a59595379f517e4512f26c41b2ff0b2614ecd8581f5f874b223e1","sha256:1b9cfa04932d82037a24d27e47ea8ac692160777d5cd7b3461f7cac500832b51"],"state_sha256":"9f3c3b943507d122f12642d614a86668ca3746ae6e70d39516fd57c36b4d55b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rUneFhCoDykjRhHk0EFRPCxjKZp1fhx3vllkG0hwYvN7pnrpT9ANtOb/Nzj2aQG7nGMNAdofTPgZxZtJyUJmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T14:24:05.535628Z","bundle_sha256":"79b93ee324323b3e159886865a23bbd98fff76f8e62e7920862fad66baa1d93a"}}