{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:K3FVQEHYDNUO57MBSDLVIQLHW2","short_pith_number":"pith:K3FVQEHY","schema_version":"1.0","canonical_sha256":"56cb5810f81b68eefd8190d7544167b6bf28fcc01c726de168299c52236fccec","source":{"kind":"arxiv","id":"1908.06926","version":1},"attestation_state":"computed","paper":{"title":"Neural Architectures for Nested NER through Linearization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Jana Strakov\\'a, Jan Haji\\v{c}, Milan Straka","submitted_at":"2019-08-19T16:54:53Z","abstract_excerpt":"We propose two neural network architectures for nested named entity recognition (NER), a setting in which named entities may overlap and also be labeled with more than one label. We encode the nested labels using a linearized scheme. In our first proposed approach, the nested labels are modeled as multilabels corresponding to the Cartesian product of the nested labels in a standard LSTM-CRF architecture. In the second one, the nested NER is viewed as a sequence-to-sequence problem, in which the input sequence consists of the tokens and output sequence of the labels, using hard attention on the"},"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":"1908.06926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-08-19T16:54:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8a32483960b28ee57924e03df3857d036ead3d6dcbb6c9ce0b8deacc19b52e66","abstract_canon_sha256":"81e87c9a31eef9f69302e0cf3c2bd08b91f222b87be89eb272ab22deda3d523c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:21.292433Z","signature_b64":"QymK4+B23zyDwA+hD09TTlaNRpNP3SkRkYwpG/fBl21WNNRpZ5kQ+1IG/MQwXMR03l3u1j9mreWIw+ERvQyVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56cb5810f81b68eefd8190d7544167b6bf28fcc01c726de168299c52236fccec","last_reissued_at":"2026-07-04T23:58:21.291983Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:21.291983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Architectures for Nested NER through Linearization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Jana Strakov\\'a, Jan Haji\\v{c}, Milan Straka","submitted_at":"2019-08-19T16:54:53Z","abstract_excerpt":"We propose two neural network architectures for nested named entity recognition (NER), a setting in which named entities may overlap and also be labeled with more than one label. We encode the nested labels using a linearized scheme. In our first proposed approach, the nested labels are modeled as multilabels corresponding to the Cartesian product of the nested labels in a standard LSTM-CRF architecture. In the second one, the nested NER is viewed as a sequence-to-sequence problem, in which the input sequence consists of the tokens and output sequence of the labels, using hard attention on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06926","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06926/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.06926","created_at":"2026-07-04T23:58:21.292040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06926v1","created_at":"2026-07-04T23:58:21.292040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06926","created_at":"2026-07-04T23:58:21.292040+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3FVQEHYDNUO","created_at":"2026-07-04T23:58:21.292040+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3FVQEHYDNUO57MB","created_at":"2026-07-04T23:58:21.292040+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3FVQEHY","created_at":"2026-07-04T23:58:21.292040+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07286","citing_title":"Small Language Model Makes an Effective Long Text Extractor","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K3FVQEHYDNUO57MBSDLVIQLHW2","json":"https://pith.science/pith/K3FVQEHYDNUO57MBSDLVIQLHW2.json","graph_json":"https://pith.science/api/pith-number/K3FVQEHYDNUO57MBSDLVIQLHW2/graph.json","events_json":"https://pith.science/api/pith-number/K3FVQEHYDNUO57MBSDLVIQLHW2/events.json","paper":"https://pith.science/paper/K3FVQEHY"},"agent_actions":{"view_html":"https://pith.science/pith/K3FVQEHYDNUO57MBSDLVIQLHW2","download_json":"https://pith.science/pith/K3FVQEHYDNUO57MBSDLVIQLHW2.json","view_paper":"https://pith.science/paper/K3FVQEHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06926&json=true","fetch_graph":"https://pith.science/api/pith-number/K3FVQEHYDNUO57MBSDLVIQLHW2/graph.json","fetch_events":"https://pith.science/api/pith-number/K3FVQEHYDNUO57MBSDLVIQLHW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3FVQEHYDNUO57MBSDLVIQLHW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3FVQEHYDNUO57MBSDLVIQLHW2/action/storage_attestation","attest_author":"https://pith.science/pith/K3FVQEHYDNUO57MBSDLVIQLHW2/action/author_attestation","sign_citation":"https://pith.science/pith/K3FVQEHYDNUO57MBSDLVIQLHW2/action/citation_signature","submit_replication":"https://pith.science/pith/K3FVQEHYDNUO57MBSDLVIQLHW2/action/replication_record"}},"created_at":"2026-07-04T23:58:21.292040+00:00","updated_at":"2026-07-04T23:58:21.292040+00:00"}