{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5MFWFPKORFPS3RNUOHIZSYQ76N","short_pith_number":"pith:5MFWFPKO","canonical_record":{"source":{"id":"1805.09007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-23T08:20:06Z","cross_cats_sorted":[],"title_canon_sha256":"14707993e6263acba7ffe43f0834f6b048ba91a111dee08bc3d79a0aa380a64d","abstract_canon_sha256":"97be7348589f6fd5be1b8325e262f5d703aa9da87107c2f44c17324e7bf1e291"},"schema_version":"1.0"},"canonical_sha256":"eb0b62bd4e895f2dc5b471d199621ff34ebfaeffc035e6260cd9792d28026851","source":{"kind":"arxiv","id":"1805.09007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09007","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09007v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09007","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"5MFWFPKORFPS","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5MFWFPKORFPS3RNU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5MFWFPKO","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5MFWFPKORFPS3RNUOHIZSYQ76N","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-23T08:20:06Z","cross_cats_sorted":[],"title_canon_sha256":"14707993e6263acba7ffe43f0834f6b048ba91a111dee08bc3d79a0aa380a64d","abstract_canon_sha256":"97be7348589f6fd5be1b8325e262f5d703aa9da87107c2f44c17324e7bf1e291"},"schema_version":"1.0"},"canonical_sha256":"eb0b62bd4e895f2dc5b471d199621ff34ebfaeffc035e6260cd9792d28026851","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:08.809947Z","signature_b64":"KsyanNt7MsS5l5A+fonb9RpW8yRkgWTHTEUGOTC7uyDQxU1G9SjIHVgJ723iMUpSlIjNVd/MljL39NN/ezhdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb0b62bd4e895f2dc5b471d199621ff34ebfaeffc035e6260cd9792d28026851","last_reissued_at":"2026-05-18T00:15:08.809521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:08.809521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09007","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:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2N77HwP7qT1w+lz4CtmtsenbNnGNUfK7RvQ1ORgVSghVtZIp3K6c1X67woKp95zoboy8fEkFUVF9i1uHcq3TCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:38:17.040819Z"},"content_sha256":"ae42b039d40ebe8de01f2af912722084bde7ef4848c710c816e305c6b6367cc8","schema_version":"1.0","event_id":"sha256:ae42b039d40ebe8de01f2af912722084bde7ef4848c710c816e305c6b6367cc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5MFWFPKORFPS3RNUOHIZSYQ76N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Transition-based Algorithm for Unrestricted AMR Parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Carlos G\\'omez-Rodr\\'iguez, David Vilares","submitted_at":"2018-05-23T08:20:06Z","abstract_excerpt":"Non-projective parsing can be useful to handle cycles and reentrancy in AMR graphs. We explore this idea and introduce a greedy left-to-right non-projective transition-based parser. At each parsing configuration, an oracle decides whether to create a concept or whether to connect a pair of existing concepts. The algorithm handles reentrancy and arbitrary cycles natively, i.e. within the transition system itself. The model is evaluated on the LDC2015E86 corpus, obtaining results close to the state of the art, including a Smatch of 64%, and showing good behavior on reentrant edges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09007","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:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHESV+Ycjg/AFpYJchvJkOlfZiIaLzMcJUOJmQ/8inYF0vIlIo2q+6m2H3CSeRJAOi762iKssvdt5HxonnnxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:38:17.041221Z"},"content_sha256":"05a763a569d65e077d3b15d75bc0a8eca0d5c8b9028ad522843bc67df4094087","schema_version":"1.0","event_id":"sha256:05a763a569d65e077d3b15d75bc0a8eca0d5c8b9028ad522843bc67df4094087"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MFWFPKORFPS3RNUOHIZSYQ76N/bundle.json","state_url":"https://pith.science/pith/5MFWFPKORFPS3RNUOHIZSYQ76N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MFWFPKORFPS3RNUOHIZSYQ76N/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-05T01:38:17Z","links":{"resolver":"https://pith.science/pith/5MFWFPKORFPS3RNUOHIZSYQ76N","bundle":"https://pith.science/pith/5MFWFPKORFPS3RNUOHIZSYQ76N/bundle.json","state":"https://pith.science/pith/5MFWFPKORFPS3RNUOHIZSYQ76N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MFWFPKORFPS3RNUOHIZSYQ76N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5MFWFPKORFPS3RNUOHIZSYQ76N","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":"97be7348589f6fd5be1b8325e262f5d703aa9da87107c2f44c17324e7bf1e291","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-23T08:20:06Z","title_canon_sha256":"14707993e6263acba7ffe43f0834f6b048ba91a111dee08bc3d79a0aa380a64d"},"schema_version":"1.0","source":{"id":"1805.09007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09007","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09007v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09007","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"5MFWFPKORFPS","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5MFWFPKORFPS3RNU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5MFWFPKO","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:05a763a569d65e077d3b15d75bc0a8eca0d5c8b9028ad522843bc67df4094087","target":"graph","created_at":"2026-05-18T00:15:08Z","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":"Non-projective parsing can be useful to handle cycles and reentrancy in AMR graphs. We explore this idea and introduce a greedy left-to-right non-projective transition-based parser. At each parsing configuration, an oracle decides whether to create a concept or whether to connect a pair of existing concepts. The algorithm handles reentrancy and arbitrary cycles natively, i.e. within the transition system itself. The model is evaluated on the LDC2015E86 corpus, obtaining results close to the state of the art, including a Smatch of 64%, and showing good behavior on reentrant edges.","authors_text":"Carlos G\\'omez-Rodr\\'iguez, David Vilares","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-23T08:20:06Z","title":"A Transition-based Algorithm for Unrestricted AMR Parsing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09007","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:ae42b039d40ebe8de01f2af912722084bde7ef4848c710c816e305c6b6367cc8","target":"record","created_at":"2026-05-18T00:15:08Z","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":"97be7348589f6fd5be1b8325e262f5d703aa9da87107c2f44c17324e7bf1e291","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-23T08:20:06Z","title_canon_sha256":"14707993e6263acba7ffe43f0834f6b048ba91a111dee08bc3d79a0aa380a64d"},"schema_version":"1.0","source":{"id":"1805.09007","kind":"arxiv","version":1}},"canonical_sha256":"eb0b62bd4e895f2dc5b471d199621ff34ebfaeffc035e6260cd9792d28026851","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb0b62bd4e895f2dc5b471d199621ff34ebfaeffc035e6260cd9792d28026851","first_computed_at":"2026-05-18T00:15:08.809521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:08.809521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KsyanNt7MsS5l5A+fonb9RpW8yRkgWTHTEUGOTC7uyDQxU1G9SjIHVgJ723iMUpSlIjNVd/MljL39NN/ezhdBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:08.809947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae42b039d40ebe8de01f2af912722084bde7ef4848c710c816e305c6b6367cc8","sha256:05a763a569d65e077d3b15d75bc0a8eca0d5c8b9028ad522843bc67df4094087"],"state_sha256":"4b5b4cbc2829891a48e6ffd5e61899736db2a5ceb1738130e4ea1512377de5dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a6ve9YdoBrUpxDl9+tUQZ99JWzztBkM3sRO2bBjr2vTZG9NRa0APvcBesoALjckRF/OPM8qDXqSrgSFIQOzyDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:38:17.044333Z","bundle_sha256":"8a8537510a5268d489143cb3e9cc86972d301cb9cb16b2e03babc800567eb073"}}