{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AZUCIOJIDK5OGBBRYMVI7X33PU","short_pith_number":"pith:AZUCIOJI","canonical_record":{"source":{"id":"1903.04153","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-03-11T07:46:03Z","cross_cats_sorted":[],"title_canon_sha256":"fe9ac8f948491984ec88705ec6f94b86d1c7d8d6429fad5862406c6ce274f496","abstract_canon_sha256":"cdee7302d5dd899cb2aac00b232044a9922f4cbd0e9b9cec45a8f65c79a10e89"},"schema_version":"1.0"},"canonical_sha256":"06682439281abae30431c32a8fdf7b7d28f6c03ab28cf47b6498cb940037a81a","source":{"kind":"arxiv","id":"1903.04153","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04153","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04153v2","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04153","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"AZUCIOJIDK5O","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AZUCIOJIDK5OGBBR","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AZUCIOJI","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AZUCIOJIDK5OGBBRYMVI7X33PU","target":"record","payload":{"canonical_record":{"source":{"id":"1903.04153","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-03-11T07:46:03Z","cross_cats_sorted":[],"title_canon_sha256":"fe9ac8f948491984ec88705ec6f94b86d1c7d8d6429fad5862406c6ce274f496","abstract_canon_sha256":"cdee7302d5dd899cb2aac00b232044a9922f4cbd0e9b9cec45a8f65c79a10e89"},"schema_version":"1.0"},"canonical_sha256":"06682439281abae30431c32a8fdf7b7d28f6c03ab28cf47b6498cb940037a81a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:24.509188Z","signature_b64":"vMu8l1fawMDJyI8mRAzVsZDPWGSyGPbA1jw2k34ncap6BN3I+XliF3GUyqqnqNq99lqyezpPJmJ8aFZzOMLsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06682439281abae30431c32a8fdf7b7d28f6c03ab28cf47b6498cb940037a81a","last_reissued_at":"2026-05-17T23:49:24.508698Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:24.508698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.04153","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-17T23:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nAb4/E58syaBgLdll2/oyPQI8PVp99ao3R+Yj0/Ao/EX24VdkrWC2KB2mwvXTCAiN4ckvBHuRucJSl8pcaSuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:07:07.619430Z"},"content_sha256":"0bfa29563c5eaafdd864e67d9abb0015abb82c6191cae7aa80ec9fa8c10d0ec1","schema_version":"1.0","event_id":"sha256:0bfa29563c5eaafdd864e67d9abb0015abb82c6191cae7aa80ec9fa8c10d0ec1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AZUCIOJIDK5OGBBRYMVI7X33PU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HLT@SUDA at SemEval 2019 Task 1: UCCA Graph Parsing as Constituent Tree Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Min Zhang, Wei Jiang, Yu Zhang, Zhenghua Li","submitted_at":"2019-03-11T07:46:03Z","abstract_excerpt":"This paper describes a simple UCCA semantic graph parsing approach. The key idea is to convert a UCCA semantic graph into a constituent tree, in which extra labels are deliberately designed to mark remote edges and discontinuous nodes for future recovery. In this way, we can make use of existing syntactic parsing techniques. Based on the data statistics, we recover discontinuous nodes directly according to the output labels of the constituent parser and use a biaffine classification model to recover the more complex remote edges. The classification model and the constituent parser are simultan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04153","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-17T23:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIvQ7yArRBn7jqD9xAF3tf9bDQ5QHu7EXaMpOTmOVhYztvH8jCUzsuc3JSEh1xKkoR+F5f78P0GQGkLIbIWiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:07:07.620181Z"},"content_sha256":"9653219126d6cee9a146693e76c1e2a299ce1cbe62e155853cead4fba83d24c4","schema_version":"1.0","event_id":"sha256:9653219126d6cee9a146693e76c1e2a299ce1cbe62e155853cead4fba83d24c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZUCIOJIDK5OGBBRYMVI7X33PU/bundle.json","state_url":"https://pith.science/pith/AZUCIOJIDK5OGBBRYMVI7X33PU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZUCIOJIDK5OGBBRYMVI7X33PU/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-06-12T01:07:07Z","links":{"resolver":"https://pith.science/pith/AZUCIOJIDK5OGBBRYMVI7X33PU","bundle":"https://pith.science/pith/AZUCIOJIDK5OGBBRYMVI7X33PU/bundle.json","state":"https://pith.science/pith/AZUCIOJIDK5OGBBRYMVI7X33PU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZUCIOJIDK5OGBBRYMVI7X33PU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AZUCIOJIDK5OGBBRYMVI7X33PU","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":"cdee7302d5dd899cb2aac00b232044a9922f4cbd0e9b9cec45a8f65c79a10e89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-03-11T07:46:03Z","title_canon_sha256":"fe9ac8f948491984ec88705ec6f94b86d1c7d8d6429fad5862406c6ce274f496"},"schema_version":"1.0","source":{"id":"1903.04153","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04153","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04153v2","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04153","created_at":"2026-05-17T23:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"AZUCIOJIDK5O","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AZUCIOJIDK5OGBBR","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AZUCIOJI","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:9653219126d6cee9a146693e76c1e2a299ce1cbe62e155853cead4fba83d24c4","target":"graph","created_at":"2026-05-17T23:49:24Z","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":"This paper describes a simple UCCA semantic graph parsing approach. The key idea is to convert a UCCA semantic graph into a constituent tree, in which extra labels are deliberately designed to mark remote edges and discontinuous nodes for future recovery. In this way, we can make use of existing syntactic parsing techniques. Based on the data statistics, we recover discontinuous nodes directly according to the output labels of the constituent parser and use a biaffine classification model to recover the more complex remote edges. The classification model and the constituent parser are simultan","authors_text":"Min Zhang, Wei Jiang, Yu Zhang, Zhenghua Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-03-11T07:46:03Z","title":"HLT@SUDA at SemEval 2019 Task 1: UCCA Graph Parsing as Constituent Tree Parsing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04153","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:0bfa29563c5eaafdd864e67d9abb0015abb82c6191cae7aa80ec9fa8c10d0ec1","target":"record","created_at":"2026-05-17T23:49:24Z","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":"cdee7302d5dd899cb2aac00b232044a9922f4cbd0e9b9cec45a8f65c79a10e89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-03-11T07:46:03Z","title_canon_sha256":"fe9ac8f948491984ec88705ec6f94b86d1c7d8d6429fad5862406c6ce274f496"},"schema_version":"1.0","source":{"id":"1903.04153","kind":"arxiv","version":2}},"canonical_sha256":"06682439281abae30431c32a8fdf7b7d28f6c03ab28cf47b6498cb940037a81a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06682439281abae30431c32a8fdf7b7d28f6c03ab28cf47b6498cb940037a81a","first_computed_at":"2026-05-17T23:49:24.508698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:24.508698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vMu8l1fawMDJyI8mRAzVsZDPWGSyGPbA1jw2k34ncap6BN3I+XliF3GUyqqnqNq99lqyezpPJmJ8aFZzOMLsDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:24.509188Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04153","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bfa29563c5eaafdd864e67d9abb0015abb82c6191cae7aa80ec9fa8c10d0ec1","sha256:9653219126d6cee9a146693e76c1e2a299ce1cbe62e155853cead4fba83d24c4"],"state_sha256":"be54bc6135f5abc167abbcc892d86307a5fbd0db7ddfd8284a4d5e2ca35b7d86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c0TcFUKoUavrXxv0O6Jjm6yEc6NiZ9ntWcdJSfJWiLe3h8IkRhp0pIG4JlMVx3NVMyp34uWpYm11Uec6oN0LBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:07:07.624191Z","bundle_sha256":"45d836627b663b54c303a9ae6304a684f941e56274944807d527912b00979bd6"}}