{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GWAB62J4VVWUMVWMXHVVY3HWQM","short_pith_number":"pith:GWAB62J4","canonical_record":{"source":{"id":"1706.03357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-06-11T14:37:22Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"dc8d3c53f9a468962b0f5968fc4ea5d02cbd376d9d0e5e3285a6cacd03bf04a7","abstract_canon_sha256":"48216c8babf31723510593030599b017cc6c99913fd9225704f77406910f9d63"},"schema_version":"1.0"},"canonical_sha256":"35801f693cad6d4656ccb9eb5c6cf683074fff2d31b5727b6e370e567b69f61b","source":{"kind":"arxiv","id":"1706.03357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03357","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03357v1","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03357","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"GWAB62J4VVWU","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GWAB62J4VVWUMVWM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GWAB62J4","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GWAB62J4VVWUMVWMXHVVY3HWQM","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-06-11T14:37:22Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"dc8d3c53f9a468962b0f5968fc4ea5d02cbd376d9d0e5e3285a6cacd03bf04a7","abstract_canon_sha256":"48216c8babf31723510593030599b017cc6c99913fd9225704f77406910f9d63"},"schema_version":"1.0"},"canonical_sha256":"35801f693cad6d4656ccb9eb5c6cf683074fff2d31b5727b6e370e567b69f61b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:37.698971Z","signature_b64":"rckmYcCarLwtcBa0jey0cyqrH+q1VlklANUHMbDck5snEGxMIlR9JOxnu6lRZASUyHuFjAxCMDeR+FYeEVUgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35801f693cad6d4656ccb9eb5c6cf683074fff2d31b5727b6e370e567b69f61b","last_reissued_at":"2026-05-18T00:42:37.698394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:37.698394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03357","source_version":1,"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:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QA0k6hYb79Jupworcjq6q95ww7HWToZ0hgQX2ehXb//hOvsRAPdGt3UwPErOayvBOaZTj8sJysuwhoX3bB3KAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:30:01.817269Z"},"content_sha256":"2d6c80ddc2e15414c518ddcb2258f3e4c78bce121c90992f02644a5735025599","schema_version":"1.0","event_id":"sha256:2d6c80ddc2e15414c518ddcb2258f3e4c78bce121c90992f02644a5735025599"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GWAB62J4VVWUMVWMXHVVY3HWQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CL","authors_text":"Anssi Yli-Jyr\\\"a, Carlos G\\'omez-Rodr\\'iguez","submitted_at":"2017-06-11T14:37:22Z","abstract_excerpt":"We present a simple encoding for unlabeled noncrossing graphs and show how its latent counterpart helps us to represent several families of directed and undirected graphs used in syntactic and semantic parsing of natural language as context-free languages. The families are separated purely on the basis of forbidden patterns in latent encoding, eliminating the need to differentiate the families of non-crossing graphs in inference algorithms: one algorithm works for all when the search space can be controlled in parser input."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03357","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"},"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:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSRuaLWviJwLoU3El1p/KxnJygxAC88Q2WwGVJgHpX7hjJ9DrmggdTUr7rwTsKMLnl3PfS5pZq73b6DfgLcIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:30:01.817994Z"},"content_sha256":"c2f438db7604b821df103d28e3863a6db0fb39ba7473c3d9960e42fc2944e769","schema_version":"1.0","event_id":"sha256:c2f438db7604b821df103d28e3863a6db0fb39ba7473c3d9960e42fc2944e769"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWAB62J4VVWUMVWMXHVVY3HWQM/bundle.json","state_url":"https://pith.science/pith/GWAB62J4VVWUMVWMXHVVY3HWQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWAB62J4VVWUMVWMXHVVY3HWQM/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-04T22:30:01Z","links":{"resolver":"https://pith.science/pith/GWAB62J4VVWUMVWMXHVVY3HWQM","bundle":"https://pith.science/pith/GWAB62J4VVWUMVWMXHVVY3HWQM/bundle.json","state":"https://pith.science/pith/GWAB62J4VVWUMVWMXHVVY3HWQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWAB62J4VVWUMVWMXHVVY3HWQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GWAB62J4VVWUMVWMXHVVY3HWQM","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":"48216c8babf31723510593030599b017cc6c99913fd9225704f77406910f9d63","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-06-11T14:37:22Z","title_canon_sha256":"dc8d3c53f9a468962b0f5968fc4ea5d02cbd376d9d0e5e3285a6cacd03bf04a7"},"schema_version":"1.0","source":{"id":"1706.03357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03357","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03357v1","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03357","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"GWAB62J4VVWU","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GWAB62J4VVWUMVWM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GWAB62J4","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:c2f438db7604b821df103d28e3863a6db0fb39ba7473c3d9960e42fc2944e769","target":"graph","created_at":"2026-05-18T00:42:37Z","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 present a simple encoding for unlabeled noncrossing graphs and show how its latent counterpart helps us to represent several families of directed and undirected graphs used in syntactic and semantic parsing of natural language as context-free languages. The families are separated purely on the basis of forbidden patterns in latent encoding, eliminating the need to differentiate the families of non-crossing graphs in inference algorithms: one algorithm works for all when the search space can be controlled in parser input.","authors_text":"Anssi Yli-Jyr\\\"a, Carlos G\\'omez-Rodr\\'iguez","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-06-11T14:37:22Z","title":"Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03357","kind":"arxiv","version":1},"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:2d6c80ddc2e15414c518ddcb2258f3e4c78bce121c90992f02644a5735025599","target":"record","created_at":"2026-05-18T00:42:37Z","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":"48216c8babf31723510593030599b017cc6c99913fd9225704f77406910f9d63","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-06-11T14:37:22Z","title_canon_sha256":"dc8d3c53f9a468962b0f5968fc4ea5d02cbd376d9d0e5e3285a6cacd03bf04a7"},"schema_version":"1.0","source":{"id":"1706.03357","kind":"arxiv","version":1}},"canonical_sha256":"35801f693cad6d4656ccb9eb5c6cf683074fff2d31b5727b6e370e567b69f61b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35801f693cad6d4656ccb9eb5c6cf683074fff2d31b5727b6e370e567b69f61b","first_computed_at":"2026-05-18T00:42:37.698394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:37.698394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rckmYcCarLwtcBa0jey0cyqrH+q1VlklANUHMbDck5snEGxMIlR9JOxnu6lRZASUyHuFjAxCMDeR+FYeEVUgCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:37.698971Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d6c80ddc2e15414c518ddcb2258f3e4c78bce121c90992f02644a5735025599","sha256:c2f438db7604b821df103d28e3863a6db0fb39ba7473c3d9960e42fc2944e769"],"state_sha256":"605e8b12ad60cea4fef9467a52994a89645340c86ceb3221bf48b7b1a9b23d43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fe+RPqRsh6IN88ecphsXHbQpUyCey3nNfer3UM2Dqyfv50jkukDB7Datv4UX3lBU0BAPj6AJZciotQNGsmptAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:30:01.821695Z","bundle_sha256":"8383c60d5bf3996b3c0539441038791243d37e65640e08d048506ce99318e7e6"}}