{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TUSXZRHAIA33ZDGDRMAESZXEM5","short_pith_number":"pith:TUSXZRHA","schema_version":"1.0","canonical_sha256":"9d257cc4e04037bc8cc38b004966e4675d47646718b62d28fa11265b59609407","source":{"kind":"arxiv","id":"2404.19192","version":1},"attestation_state":"computed","paper":{"title":"Mix of Experts Language Model for Named Entity Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jiangjian Guo, Kun Li, Tianyou Song, Xinwei Chen","submitted_at":"2024-04-30T01:41:03Z","abstract_excerpt":"Named Entity Recognition (NER) is an essential steppingstone in the field of natural language processing. Although promising performance has been achieved by various distantly supervised models, we argue that distant supervision inevitably introduces incomplete and noisy annotations, which may mislead the model training process. To address this issue, we propose a robust NER model named BOND-MoE based on Mixture of Experts (MoE). Instead of relying on a single model for NER prediction, multiple models are trained and ensembled under the Expectation-Maximization (EM) framework, so that noisy su"},"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":"2404.19192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-04-30T01:41:03Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a02ff6ce5d80fe41f5f2ac7491b64a57bab5ce35335ff154e618f22e287490ad","abstract_canon_sha256":"dd7c041314b84385d5b86934b288c8c45cee7f3bb7efee94bcfc60f89e821f43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:13:39.720139Z","signature_b64":"I2UnQkFD1vkM0EJyxqlroJqLiFX+QYDknqEtPyqSXbZ5HwiuTDyoQi9PEyGNMwMU7ne1tQ33mp42pVdFDQPIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d257cc4e04037bc8cc38b004966e4675d47646718b62d28fa11265b59609407","last_reissued_at":"2026-07-05T08:13:39.719622Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:13:39.719622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mix of Experts Language Model for Named Entity Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jiangjian Guo, Kun Li, Tianyou Song, Xinwei Chen","submitted_at":"2024-04-30T01:41:03Z","abstract_excerpt":"Named Entity Recognition (NER) is an essential steppingstone in the field of natural language processing. Although promising performance has been achieved by various distantly supervised models, we argue that distant supervision inevitably introduces incomplete and noisy annotations, which may mislead the model training process. To address this issue, we propose a robust NER model named BOND-MoE based on Mixture of Experts (MoE). Instead of relying on a single model for NER prediction, multiple models are trained and ensembled under the Expectation-Maximization (EM) framework, so that noisy su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.19192","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/2404.19192/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":"2404.19192","created_at":"2026-07-05T08:13:39.719691+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.19192v1","created_at":"2026-07-05T08:13:39.719691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.19192","created_at":"2026-07-05T08:13:39.719691+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUSXZRHAIA33","created_at":"2026-07-05T08:13:39.719691+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUSXZRHAIA33ZDGD","created_at":"2026-07-05T08:13:39.719691+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUSXZRHA","created_at":"2026-07-05T08:13:39.719691+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.02749","citing_title":"Intelligent logistics management robot path planning algorithm integrating transformer and GCN network","ref_index":59,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TUSXZRHAIA33ZDGDRMAESZXEM5","json":"https://pith.science/pith/TUSXZRHAIA33ZDGDRMAESZXEM5.json","graph_json":"https://pith.science/api/pith-number/TUSXZRHAIA33ZDGDRMAESZXEM5/graph.json","events_json":"https://pith.science/api/pith-number/TUSXZRHAIA33ZDGDRMAESZXEM5/events.json","paper":"https://pith.science/paper/TUSXZRHA"},"agent_actions":{"view_html":"https://pith.science/pith/TUSXZRHAIA33ZDGDRMAESZXEM5","download_json":"https://pith.science/pith/TUSXZRHAIA33ZDGDRMAESZXEM5.json","view_paper":"https://pith.science/paper/TUSXZRHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.19192&json=true","fetch_graph":"https://pith.science/api/pith-number/TUSXZRHAIA33ZDGDRMAESZXEM5/graph.json","fetch_events":"https://pith.science/api/pith-number/TUSXZRHAIA33ZDGDRMAESZXEM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUSXZRHAIA33ZDGDRMAESZXEM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUSXZRHAIA33ZDGDRMAESZXEM5/action/storage_attestation","attest_author":"https://pith.science/pith/TUSXZRHAIA33ZDGDRMAESZXEM5/action/author_attestation","sign_citation":"https://pith.science/pith/TUSXZRHAIA33ZDGDRMAESZXEM5/action/citation_signature","submit_replication":"https://pith.science/pith/TUSXZRHAIA33ZDGDRMAESZXEM5/action/replication_record"}},"created_at":"2026-07-05T08:13:39.719691+00:00","updated_at":"2026-07-05T08:13:39.719691+00:00"}