{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VUWCZUNGCGHL4HXDCY2D3MJ4EU","short_pith_number":"pith:VUWCZUNG","canonical_record":{"source":{"id":"1810.01808","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2018-10-03T15:53:37Z","cross_cats_sorted":[],"title_canon_sha256":"48d53aa042bd0ecc084e1dddf7da5607bf60e6c42f0f29a30682bcafc3f754bd","abstract_canon_sha256":"607a5b27e2314ff8c1bf3bcb8b34ecd327c11d71e8e4b6db343d6d0d0103be01"},"schema_version":"1.0"},"canonical_sha256":"ad2c2cd1a6118ebe1ee316343db13c252079bc3514c3f1700842b6b6adedb8df","source":{"kind":"arxiv","id":"1810.01808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01808","created_at":"2026-05-18T00:04:10Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01808v1","created_at":"2026-05-18T00:04:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01808","created_at":"2026-05-18T00:04:10Z"},{"alias_kind":"pith_short_12","alias_value":"VUWCZUNGCGHL","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VUWCZUNGCGHL4HXD","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VUWCZUNG","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VUWCZUNGCGHL4HXDCY2D3MJ4EU","target":"record","payload":{"canonical_record":{"source":{"id":"1810.01808","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2018-10-03T15:53:37Z","cross_cats_sorted":[],"title_canon_sha256":"48d53aa042bd0ecc084e1dddf7da5607bf60e6c42f0f29a30682bcafc3f754bd","abstract_canon_sha256":"607a5b27e2314ff8c1bf3bcb8b34ecd327c11d71e8e4b6db343d6d0d0103be01"},"schema_version":"1.0"},"canonical_sha256":"ad2c2cd1a6118ebe1ee316343db13c252079bc3514c3f1700842b6b6adedb8df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:10.931651Z","signature_b64":"DZdb0ZNFBPTL97u2SsRoKRdvieQMhA8y4nPDP9fGUMc9mYn0G1I8HyjKASLrFcZDx5Lw9GMfsStFC0qH9qjtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad2c2cd1a6118ebe1ee316343db13c252079bc3514c3f1700842b6b6adedb8df","last_reissued_at":"2026-05-18T00:04:10.931055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:10.931055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.01808","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:04:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/5b6IqAwvinAxeZYfJOSboezC7wsfJGCMG2C+Zq+QDD1kJ8R3Nfxh5f8Ahur5gjOig3KCgS0qa92WNAS/MgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:37:37.463719Z"},"content_sha256":"1605c49aa7dad0aaf92aab2fae9400e35f7106416ef4d4538f9d0fde4b0f129c","schema_version":"1.0","event_id":"sha256:1605c49aa7dad0aaf92aab2fae9400e35f7106416ef4d4538f9d0fde4b0f129c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VUWCZUNGCGHL4HXDCY2D3MJ4EU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Neural Transition-based Model for Nested Mention Recognition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bailin Wang, Hongxia Jin, Wei Lu, Yu Wang","submitted_at":"2018-10-03T15:53:37Z","abstract_excerpt":"It is common that entity mentions can contain other mentions recursively. This paper introduces a scalable transition-based method to model the nested structure of mentions. We first map a sentence with nested mentions to a designated forest where each mention corresponds to a constituent of the forest. Our shift-reduce based system then learns to construct the forest structure in a bottom-up manner through an action sequence whose maximal length is guaranteed to be three times of the sentence length. Based on Stack-LSTM which is employed to efficiently and effectively represent the states of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01808","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:04:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U3zd7JGOd5bwbus4fDq0VcIu576he6UPg2wa2ZcumCaN//R5UvdAiTUAP96kqGCtgM2LyLh22LCTDEF3+6maCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:37:37.464066Z"},"content_sha256":"96f81f742cdd8eac33e43e6e0298952e2d16e304867236efaa8256d92d45b747","schema_version":"1.0","event_id":"sha256:96f81f742cdd8eac33e43e6e0298952e2d16e304867236efaa8256d92d45b747"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU/bundle.json","state_url":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU/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-28T08:37:37Z","links":{"resolver":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU","bundle":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU/bundle.json","state":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VUWCZUNGCGHL4HXDCY2D3MJ4EU","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":"607a5b27e2314ff8c1bf3bcb8b34ecd327c11d71e8e4b6db343d6d0d0103be01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2018-10-03T15:53:37Z","title_canon_sha256":"48d53aa042bd0ecc084e1dddf7da5607bf60e6c42f0f29a30682bcafc3f754bd"},"schema_version":"1.0","source":{"id":"1810.01808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01808","created_at":"2026-05-18T00:04:10Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01808v1","created_at":"2026-05-18T00:04:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01808","created_at":"2026-05-18T00:04:10Z"},{"alias_kind":"pith_short_12","alias_value":"VUWCZUNGCGHL","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VUWCZUNGCGHL4HXD","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VUWCZUNG","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:96f81f742cdd8eac33e43e6e0298952e2d16e304867236efaa8256d92d45b747","target":"graph","created_at":"2026-05-18T00:04:10Z","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":"It is common that entity mentions can contain other mentions recursively. This paper introduces a scalable transition-based method to model the nested structure of mentions. We first map a sentence with nested mentions to a designated forest where each mention corresponds to a constituent of the forest. Our shift-reduce based system then learns to construct the forest structure in a bottom-up manner through an action sequence whose maximal length is guaranteed to be three times of the sentence length. Based on Stack-LSTM which is employed to efficiently and effectively represent the states of ","authors_text":"Bailin Wang, Hongxia Jin, Wei Lu, Yu Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2018-10-03T15:53:37Z","title":"A Neural Transition-based Model for Nested Mention Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01808","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:1605c49aa7dad0aaf92aab2fae9400e35f7106416ef4d4538f9d0fde4b0f129c","target":"record","created_at":"2026-05-18T00:04:10Z","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":"607a5b27e2314ff8c1bf3bcb8b34ecd327c11d71e8e4b6db343d6d0d0103be01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2018-10-03T15:53:37Z","title_canon_sha256":"48d53aa042bd0ecc084e1dddf7da5607bf60e6c42f0f29a30682bcafc3f754bd"},"schema_version":"1.0","source":{"id":"1810.01808","kind":"arxiv","version":1}},"canonical_sha256":"ad2c2cd1a6118ebe1ee316343db13c252079bc3514c3f1700842b6b6adedb8df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad2c2cd1a6118ebe1ee316343db13c252079bc3514c3f1700842b6b6adedb8df","first_computed_at":"2026-05-18T00:04:10.931055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:10.931055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DZdb0ZNFBPTL97u2SsRoKRdvieQMhA8y4nPDP9fGUMc9mYn0G1I8HyjKASLrFcZDx5Lw9GMfsStFC0qH9qjtBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:10.931651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1605c49aa7dad0aaf92aab2fae9400e35f7106416ef4d4538f9d0fde4b0f129c","sha256:96f81f742cdd8eac33e43e6e0298952e2d16e304867236efaa8256d92d45b747"],"state_sha256":"ab41613bb7021df02b69995ce01876f39e465201321ac8b9915a8adb234a14a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XbokW+zi0D0exPVI6rJP46veURIYc2N+XNnnfvBf/gCdWmQljfDGa6mUp3TC+KX/NKZBp808rBtGLIBWenGRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:37:37.466067Z","bundle_sha256":"541c9bae0aebd587023f6c6507d72181b23eb4d348be0bb120245ebd840f0ced"}}