{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KFGKMGMPX7E4P72ADB6BL7O2A4","short_pith_number":"pith:KFGKMGMP","canonical_record":{"source":{"id":"1910.11476","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-10-25T01:06:07Z","cross_cats_sorted":[],"title_canon_sha256":"bd961cd2102168ddd71acda6225fd40b9700c788cc106da463bebf804e48962c","abstract_canon_sha256":"04e11c7666c3c9700551cba6508a9df5fc096e18ae50251ca3f52ec71cc62a9f"},"schema_version":"1.0"},"canonical_sha256":"514ca6198fbfc9c7ff40187c15fdda070da186d2cb445f9b183257abfb12230f","source":{"kind":"arxiv","id":"1910.11476","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.11476","created_at":"2026-07-05T05:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"1910.11476v7","created_at":"2026-07-05T05:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.11476","created_at":"2026-07-05T05:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"KFGKMGMPX7E4","created_at":"2026-07-05T05:17:57Z"},{"alias_kind":"pith_short_16","alias_value":"KFGKMGMPX7E4P72A","created_at":"2026-07-05T05:17:57Z"},{"alias_kind":"pith_short_8","alias_value":"KFGKMGMP","created_at":"2026-07-05T05:17:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KFGKMGMPX7E4P72ADB6BL7O2A4","target":"record","payload":{"canonical_record":{"source":{"id":"1910.11476","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-10-25T01:06:07Z","cross_cats_sorted":[],"title_canon_sha256":"bd961cd2102168ddd71acda6225fd40b9700c788cc106da463bebf804e48962c","abstract_canon_sha256":"04e11c7666c3c9700551cba6508a9df5fc096e18ae50251ca3f52ec71cc62a9f"},"schema_version":"1.0"},"canonical_sha256":"514ca6198fbfc9c7ff40187c15fdda070da186d2cb445f9b183257abfb12230f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:57.819335Z","signature_b64":"nufqV9oKAGwYMIOvi56BDtNWJf5s16ABD75Ex1v19V6vsUd9APej8nKdnzIgMpFs8df9PgLughZa2X13phD2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"514ca6198fbfc9c7ff40187c15fdda070da186d2cb445f9b183257abfb12230f","last_reissued_at":"2026-07-05T05:17:57.818850Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:57.818850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.11476","source_version":7,"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-07-05T05:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dtg+Cf2zSYCRM+13X0T0k61Ex1U706WTR6qh2OQjPA7FKlIUL9P8JcROsUdSoFp2M3B73qSsiC+4qiwpAbDHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:02:04.060440Z"},"content_sha256":"e757a9b1c00326c8718f367bbb360bd6f987a19073e54654f133881d129b1425","schema_version":"1.0","event_id":"sha256:e757a9b1c00326c8718f367bbb360bd6f987a19073e54654f133881d129b1425"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KFGKMGMPX7E4P72ADB6BL7O2A4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified MRC Framework for Named Entity Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Fei Wu, Jingrong Feng, Jiwei Li, Qinghong Han, Xiaoya Li, Yuxian Meng","submitted_at":"2019-10-25T01:06:07Z","abstract_excerpt":"The task of named entity recognition (NER) is normally divided into nested NER and flat NER depending on whether named entities are nested or not. Models are usually separately developed for the two tasks, since sequence labeling models, the most widely used backbone for flat NER, are only able to assign a single label to a particular token, which is unsuitable for nested NER where a token may be assigned several labels.\n  In this paper, we propose a unified framework that is capable of handling both flat and nested NER tasks. Instead of treating the task of NER as a sequence labeling problem,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.11476","kind":"arxiv","version":7},"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/1910.11476/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"},"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-07-05T05:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4cO3HQdHhRNge2Mg+WhdKeq2jWFCgJjfWKrhqP3TpByowbeVbSMMM8tM6kuVslqqfUE4ruannEgXgkV6zlVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:02:04.060855Z"},"content_sha256":"6a9491fbb55229b85dbc22fc772c6ef61140aa6e2952e29a837814a8b9e4aa1b","schema_version":"1.0","event_id":"sha256:6a9491fbb55229b85dbc22fc772c6ef61140aa6e2952e29a837814a8b9e4aa1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFGKMGMPX7E4P72ADB6BL7O2A4/bundle.json","state_url":"https://pith.science/pith/KFGKMGMPX7E4P72ADB6BL7O2A4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFGKMGMPX7E4P72ADB6BL7O2A4/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-07-08T22:02:04Z","links":{"resolver":"https://pith.science/pith/KFGKMGMPX7E4P72ADB6BL7O2A4","bundle":"https://pith.science/pith/KFGKMGMPX7E4P72ADB6BL7O2A4/bundle.json","state":"https://pith.science/pith/KFGKMGMPX7E4P72ADB6BL7O2A4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFGKMGMPX7E4P72ADB6BL7O2A4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KFGKMGMPX7E4P72ADB6BL7O2A4","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":"04e11c7666c3c9700551cba6508a9df5fc096e18ae50251ca3f52ec71cc62a9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-10-25T01:06:07Z","title_canon_sha256":"bd961cd2102168ddd71acda6225fd40b9700c788cc106da463bebf804e48962c"},"schema_version":"1.0","source":{"id":"1910.11476","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.11476","created_at":"2026-07-05T05:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"1910.11476v7","created_at":"2026-07-05T05:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.11476","created_at":"2026-07-05T05:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"KFGKMGMPX7E4","created_at":"2026-07-05T05:17:57Z"},{"alias_kind":"pith_short_16","alias_value":"KFGKMGMPX7E4P72A","created_at":"2026-07-05T05:17:57Z"},{"alias_kind":"pith_short_8","alias_value":"KFGKMGMP","created_at":"2026-07-05T05:17:57Z"}],"graph_snapshots":[{"event_id":"sha256:6a9491fbb55229b85dbc22fc772c6ef61140aa6e2952e29a837814a8b9e4aa1b","target":"graph","created_at":"2026-07-05T05:17:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.11476/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The task of named entity recognition (NER) is normally divided into nested NER and flat NER depending on whether named entities are nested or not. Models are usually separately developed for the two tasks, since sequence labeling models, the most widely used backbone for flat NER, are only able to assign a single label to a particular token, which is unsuitable for nested NER where a token may be assigned several labels.\n  In this paper, we propose a unified framework that is capable of handling both flat and nested NER tasks. Instead of treating the task of NER as a sequence labeling problem,","authors_text":"Fei Wu, Jingrong Feng, Jiwei Li, Qinghong Han, Xiaoya Li, Yuxian Meng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-10-25T01:06:07Z","title":"A Unified MRC Framework for Named Entity Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.11476","kind":"arxiv","version":7},"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:e757a9b1c00326c8718f367bbb360bd6f987a19073e54654f133881d129b1425","target":"record","created_at":"2026-07-05T05:17:57Z","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":"04e11c7666c3c9700551cba6508a9df5fc096e18ae50251ca3f52ec71cc62a9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-10-25T01:06:07Z","title_canon_sha256":"bd961cd2102168ddd71acda6225fd40b9700c788cc106da463bebf804e48962c"},"schema_version":"1.0","source":{"id":"1910.11476","kind":"arxiv","version":7}},"canonical_sha256":"514ca6198fbfc9c7ff40187c15fdda070da186d2cb445f9b183257abfb12230f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"514ca6198fbfc9c7ff40187c15fdda070da186d2cb445f9b183257abfb12230f","first_computed_at":"2026-07-05T05:17:57.818850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:17:57.818850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nufqV9oKAGwYMIOvi56BDtNWJf5s16ABD75Ex1v19V6vsUd9APej8nKdnzIgMpFs8df9PgLughZa2X13phD2Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:17:57.819335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.11476","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e757a9b1c00326c8718f367bbb360bd6f987a19073e54654f133881d129b1425","sha256:6a9491fbb55229b85dbc22fc772c6ef61140aa6e2952e29a837814a8b9e4aa1b"],"state_sha256":"91261e5c2f08334769e6ae6f23ccdfda5d048788539674207a5ba3dab5b5aec8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7CZFG5JfZuhVnhoSXo6ObxCa4ttwN+Fk5I9m9nvXxtyHByuTJB+aTR8tfh/LfUKvvVLXEt5n51qGNcD+9ZbhAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T22:02:04.063014Z","bundle_sha256":"f4ce62b76e57d714bafdebc0a240f5a47eb1a6808b98f62a3e970f172cff3929"}}