{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VUWCZUNGCGHL4HXDCY2D3MJ4EU","short_pith_number":"pith:VUWCZUNG","schema_version":"1.0","canonical_sha256":"ad2c2cd1a6118ebe1ee316343db13c252079bc3514c3f1700842b6b6adedb8df","source":{"kind":"arxiv","id":"1810.01808","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.01808","created_at":"2026-05-18T00:04:10.931131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01808v1","created_at":"2026-05-18T00:04:10.931131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01808","created_at":"2026-05-18T00:04:10.931131+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUWCZUNGCGHL","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUWCZUNGCGHL4HXD","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUWCZUNG","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU","json":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU.json","graph_json":"https://pith.science/api/pith-number/VUWCZUNGCGHL4HXDCY2D3MJ4EU/graph.json","events_json":"https://pith.science/api/pith-number/VUWCZUNGCGHL4HXDCY2D3MJ4EU/events.json","paper":"https://pith.science/paper/VUWCZUNG"},"agent_actions":{"view_html":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU","download_json":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU.json","view_paper":"https://pith.science/paper/VUWCZUNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01808&json=true","fetch_graph":"https://pith.science/api/pith-number/VUWCZUNGCGHL4HXDCY2D3MJ4EU/graph.json","fetch_events":"https://pith.science/api/pith-number/VUWCZUNGCGHL4HXDCY2D3MJ4EU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU/action/storage_attestation","attest_author":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU/action/author_attestation","sign_citation":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU/action/citation_signature","submit_replication":"https://pith.science/pith/VUWCZUNGCGHL4HXDCY2D3MJ4EU/action/replication_record"}},"created_at":"2026-05-18T00:04:10.931131+00:00","updated_at":"2026-05-18T00:04:10.931131+00:00"}