{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:5UVT6NIPA5U32HPT46OHBQSB6P","short_pith_number":"pith:5UVT6NIP","canonical_record":{"source":{"id":"2208.04534","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2022-08-09T04:33:46Z","cross_cats_sorted":[],"title_canon_sha256":"bf4b57ed253c82b816bba29af3da84063c4c572eb9764487b3421c94fc0a65c8","abstract_canon_sha256":"87de1c97b1c9cd57599ae54bb78c8e01d34a5572c792d07e53e33d99439a77af"},"schema_version":"1.0"},"canonical_sha256":"ed2b3f350f0769bd1df3e79c70c241f3d69d33c7730bffd5aa4471234b53f2d4","source":{"kind":"arxiv","id":"2208.04534","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.04534","created_at":"2026-07-05T04:57:48Z"},{"alias_kind":"arxiv_version","alias_value":"2208.04534v3","created_at":"2026-07-05T04:57:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.04534","created_at":"2026-07-05T04:57:48Z"},{"alias_kind":"pith_short_12","alias_value":"5UVT6NIPA5U3","created_at":"2026-07-05T04:57:48Z"},{"alias_kind":"pith_short_16","alias_value":"5UVT6NIPA5U32HPT","created_at":"2026-07-05T04:57:48Z"},{"alias_kind":"pith_short_8","alias_value":"5UVT6NIP","created_at":"2026-07-05T04:57:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:5UVT6NIPA5U32HPT46OHBQSB6P","target":"record","payload":{"canonical_record":{"source":{"id":"2208.04534","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2022-08-09T04:33:46Z","cross_cats_sorted":[],"title_canon_sha256":"bf4b57ed253c82b816bba29af3da84063c4c572eb9764487b3421c94fc0a65c8","abstract_canon_sha256":"87de1c97b1c9cd57599ae54bb78c8e01d34a5572c792d07e53e33d99439a77af"},"schema_version":"1.0"},"canonical_sha256":"ed2b3f350f0769bd1df3e79c70c241f3d69d33c7730bffd5aa4471234b53f2d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:57:48.200332Z","signature_b64":"cNwploL9zuN5rlXt3xXkYr+8p7+Aeg+6fR0EAZM0df0i+RNirpoQMjvCVkaRrUGHKV5VkCKVXpTpcD4XFgCwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed2b3f350f0769bd1df3e79c70c241f3d69d33c7730bffd5aa4471234b53f2d4","last_reissued_at":"2026-07-05T04:57:48.199952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:57:48.199952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.04534","source_version":3,"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-05T04:57:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pMiKiLmsUWlatW3iIlpOf57p6nPgtkKRDPM1PawXqXlX0hpKTS72g5bIeaJwiPs9dthkElt4ZMIfb/S8JubtAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:36:01.729193Z"},"content_sha256":"751f4979b5e73acf3474add14ba66c78c5dab667903b060c80f0292c7867e9e0","schema_version":"1.0","event_id":"sha256:751f4979b5e73acf3474add14ba66c78c5dab667903b060c80f0292c7867e9e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:5UVT6NIPA5U32HPT46OHBQSB6P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hang Yan, Xiaonan Li, Xipeng Qiu, Yu Sun","submitted_at":"2022-08-09T04:33:46Z","abstract_excerpt":"Named entity recognition (NER) is the task to detect and classify the entity spans in the text. When entity spans overlap between each other, this problem is named as nested NER. Span-based methods have been widely used to tackle the nested NER. Most of these methods will get a score $n \\times n$ matrix, where $n$ means the length of sentence, and each entry corresponds to a span. However, previous work ignores spatial relations in the score matrix. In this paper, we propose using Convolutional Neural Network (CNN) to model these spatial relations in the score matrix. Despite being simple, exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.04534","kind":"arxiv","version":3},"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/2208.04534/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-05T04:57:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xme54m5bVZXJPCnQGsyWOPPGNoriUGL/LZNJ4tmhVBKlYjnPdjggDtxK+vB9urvcf8do4AOFURgfwewhz4VwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:36:01.729563Z"},"content_sha256":"de1eb1ccadf8852c0642cd31f485afdd6ee1ae56923e7ca704c36c01ae9f5229","schema_version":"1.0","event_id":"sha256:de1eb1ccadf8852c0642cd31f485afdd6ee1ae56923e7ca704c36c01ae9f5229"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UVT6NIPA5U32HPT46OHBQSB6P/bundle.json","state_url":"https://pith.science/pith/5UVT6NIPA5U32HPT46OHBQSB6P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UVT6NIPA5U32HPT46OHBQSB6P/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-08-05T18:36:01Z","links":{"resolver":"https://pith.science/pith/5UVT6NIPA5U32HPT46OHBQSB6P","bundle":"https://pith.science/pith/5UVT6NIPA5U32HPT46OHBQSB6P/bundle.json","state":"https://pith.science/pith/5UVT6NIPA5U32HPT46OHBQSB6P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UVT6NIPA5U32HPT46OHBQSB6P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:5UVT6NIPA5U32HPT46OHBQSB6P","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":"87de1c97b1c9cd57599ae54bb78c8e01d34a5572c792d07e53e33d99439a77af","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2022-08-09T04:33:46Z","title_canon_sha256":"bf4b57ed253c82b816bba29af3da84063c4c572eb9764487b3421c94fc0a65c8"},"schema_version":"1.0","source":{"id":"2208.04534","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.04534","created_at":"2026-07-05T04:57:48Z"},{"alias_kind":"arxiv_version","alias_value":"2208.04534v3","created_at":"2026-07-05T04:57:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.04534","created_at":"2026-07-05T04:57:48Z"},{"alias_kind":"pith_short_12","alias_value":"5UVT6NIPA5U3","created_at":"2026-07-05T04:57:48Z"},{"alias_kind":"pith_short_16","alias_value":"5UVT6NIPA5U32HPT","created_at":"2026-07-05T04:57:48Z"},{"alias_kind":"pith_short_8","alias_value":"5UVT6NIP","created_at":"2026-07-05T04:57:48Z"}],"graph_snapshots":[{"event_id":"sha256:de1eb1ccadf8852c0642cd31f485afdd6ee1ae56923e7ca704c36c01ae9f5229","target":"graph","created_at":"2026-07-05T04:57:48Z","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/2208.04534/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Named entity recognition (NER) is the task to detect and classify the entity spans in the text. When entity spans overlap between each other, this problem is named as nested NER. Span-based methods have been widely used to tackle the nested NER. Most of these methods will get a score $n \\times n$ matrix, where $n$ means the length of sentence, and each entry corresponds to a span. However, previous work ignores spatial relations in the score matrix. In this paper, we propose using Convolutional Neural Network (CNN) to model these spatial relations in the score matrix. Despite being simple, exp","authors_text":"Hang Yan, Xiaonan Li, Xipeng Qiu, Yu Sun","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2022-08-09T04:33:46Z","title":"An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.04534","kind":"arxiv","version":3},"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:751f4979b5e73acf3474add14ba66c78c5dab667903b060c80f0292c7867e9e0","target":"record","created_at":"2026-07-05T04:57:48Z","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":"87de1c97b1c9cd57599ae54bb78c8e01d34a5572c792d07e53e33d99439a77af","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2022-08-09T04:33:46Z","title_canon_sha256":"bf4b57ed253c82b816bba29af3da84063c4c572eb9764487b3421c94fc0a65c8"},"schema_version":"1.0","source":{"id":"2208.04534","kind":"arxiv","version":3}},"canonical_sha256":"ed2b3f350f0769bd1df3e79c70c241f3d69d33c7730bffd5aa4471234b53f2d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed2b3f350f0769bd1df3e79c70c241f3d69d33c7730bffd5aa4471234b53f2d4","first_computed_at":"2026-07-05T04:57:48.199952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:57:48.199952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cNwploL9zuN5rlXt3xXkYr+8p7+Aeg+6fR0EAZM0df0i+RNirpoQMjvCVkaRrUGHKV5VkCKVXpTpcD4XFgCwDA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:57:48.200332Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.04534","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:751f4979b5e73acf3474add14ba66c78c5dab667903b060c80f0292c7867e9e0","sha256:de1eb1ccadf8852c0642cd31f485afdd6ee1ae56923e7ca704c36c01ae9f5229"],"state_sha256":"2de565a248a8b6e07edbb7ffeb48a0488ac8afb2fff5395fed9aadb8c0a08b9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C5RS+0pP26wU83KTAVSZVExrgO7PIfqU0gz5BhwxsORZT85fecr/1hF7qQz/D+2MVqRtaf1/uvcINWxNVjb4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T18:36:01.731812Z","bundle_sha256":"c1a9c9d607fe4756ef5a38e118be40d1a898dbe5b00006f27ba005ccb429664f"}}