{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HHWBYNJTOJ4Z4FT4JOQNGDJBVV","short_pith_number":"pith:HHWBYNJT","canonical_record":{"source":{"id":"1405.1406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-05-06T19:26:35Z","cross_cats_sorted":[],"title_canon_sha256":"1a6fd2e35dcc193e754f550f10fca7daeba5930b021aa39d024f132a9a035776","abstract_canon_sha256":"4ea2948bf214ba49505afafe86955ab4202be1cc3f39b54247548b8dc95f5858"},"schema_version":"1.0"},"canonical_sha256":"39ec1c353372799e167c4ba0d30d21ad77726d69ab5be96c4877f4256c8a5ef2","source":{"kind":"arxiv","id":"1405.1406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1406","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1406v1","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1406","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"HHWBYNJTOJ4Z","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HHWBYNJTOJ4Z4FT4","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HHWBYNJT","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HHWBYNJTOJ4Z4FT4JOQNGDJBVV","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-05-06T19:26:35Z","cross_cats_sorted":[],"title_canon_sha256":"1a6fd2e35dcc193e754f550f10fca7daeba5930b021aa39d024f132a9a035776","abstract_canon_sha256":"4ea2948bf214ba49505afafe86955ab4202be1cc3f39b54247548b8dc95f5858"},"schema_version":"1.0"},"canonical_sha256":"39ec1c353372799e167c4ba0d30d21ad77726d69ab5be96c4877f4256c8a5ef2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:32.852251Z","signature_b64":"brftQaooz+nGFDTmr7T9vvhfSs+iUbZ+2lzOmwH+n3u+pEFPXJM8V9anVFx1VFeulnqhUkyb7x83Ls+vtdb0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39ec1c353372799e167c4ba0d30d21ad77726d69ab5be96c4877f4256c8a5ef2","last_reissued_at":"2026-05-18T02:52:32.851726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:32.851726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1406","source_version":1,"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-05-18T02:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gvk5O36mAlG6Z7RWuFZ5xcYSORXoR/ShzqMcfzN9NstBPNOACdEZZHEwA95oMw5Sg5F9nb1D46x/kQv7WPSACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:33:42.357455Z"},"content_sha256":"ce78bda65abc3fdba615343f9fa5b783d7e979ff6ed184f7ec12ced1dcdd01bd","schema_version":"1.0","event_id":"sha256:ce78bda65abc3fdba615343f9fa5b783d7e979ff6ed184f7ec12ced1dcdd01bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HHWBYNJTOJ4Z4FT4JOQNGDJBVV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"D-Bees: A Novel Method Inspired by Bee Colony Optimization for Solving Word Sense Disambiguation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Karl-Heinz Zimmermann, Sallam Abualhaija","submitted_at":"2014-05-06T19:26:35Z","abstract_excerpt":"Word sense disambiguation (WSD) is a problem in the field of computational linguistics given as finding the intended sense of a word (or a set of words) when it is activated within a certain context. WSD was recently addressed as a combinatorial optimization problem in which the goal is to find a sequence of senses that maximize the semantic relatedness among the target words. In this article, a novel algorithm for solving the WSD problem called D-Bees is proposed which is inspired by bee colony optimization (BCO)where artificial bee agents collaborate to solve the problem. The D-Bees algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1406","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"},"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-05-18T02:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6Thn4W+PB+huzAhfNXnraI4e//j2iuqUBI2WPzcFPFVmnOqw1eanG3lBJuHWxVTyU4A/80tgy9nD9SAPph2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:33:42.357804Z"},"content_sha256":"d0f2e23f804149f6dfa7118b43287bed1c2cb0b9135503e98cc30678e57d52e3","schema_version":"1.0","event_id":"sha256:d0f2e23f804149f6dfa7118b43287bed1c2cb0b9135503e98cc30678e57d52e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHWBYNJTOJ4Z4FT4JOQNGDJBVV/bundle.json","state_url":"https://pith.science/pith/HHWBYNJTOJ4Z4FT4JOQNGDJBVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHWBYNJTOJ4Z4FT4JOQNGDJBVV/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-05-30T06:33:42Z","links":{"resolver":"https://pith.science/pith/HHWBYNJTOJ4Z4FT4JOQNGDJBVV","bundle":"https://pith.science/pith/HHWBYNJTOJ4Z4FT4JOQNGDJBVV/bundle.json","state":"https://pith.science/pith/HHWBYNJTOJ4Z4FT4JOQNGDJBVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHWBYNJTOJ4Z4FT4JOQNGDJBVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HHWBYNJTOJ4Z4FT4JOQNGDJBVV","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":"4ea2948bf214ba49505afafe86955ab4202be1cc3f39b54247548b8dc95f5858","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-05-06T19:26:35Z","title_canon_sha256":"1a6fd2e35dcc193e754f550f10fca7daeba5930b021aa39d024f132a9a035776"},"schema_version":"1.0","source":{"id":"1405.1406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1406","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1406v1","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1406","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"HHWBYNJTOJ4Z","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HHWBYNJTOJ4Z4FT4","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HHWBYNJT","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:d0f2e23f804149f6dfa7118b43287bed1c2cb0b9135503e98cc30678e57d52e3","target":"graph","created_at":"2026-05-18T02:52:32Z","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"},"paper":{"abstract_excerpt":"Word sense disambiguation (WSD) is a problem in the field of computational linguistics given as finding the intended sense of a word (or a set of words) when it is activated within a certain context. WSD was recently addressed as a combinatorial optimization problem in which the goal is to find a sequence of senses that maximize the semantic relatedness among the target words. In this article, a novel algorithm for solving the WSD problem called D-Bees is proposed which is inspired by bee colony optimization (BCO)where artificial bee agents collaborate to solve the problem. The D-Bees algorith","authors_text":"Karl-Heinz Zimmermann, Sallam Abualhaija","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-05-06T19:26:35Z","title":"D-Bees: A Novel Method Inspired by Bee Colony Optimization for Solving Word Sense Disambiguation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1406","kind":"arxiv","version":1},"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:ce78bda65abc3fdba615343f9fa5b783d7e979ff6ed184f7ec12ced1dcdd01bd","target":"record","created_at":"2026-05-18T02:52:32Z","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":"4ea2948bf214ba49505afafe86955ab4202be1cc3f39b54247548b8dc95f5858","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-05-06T19:26:35Z","title_canon_sha256":"1a6fd2e35dcc193e754f550f10fca7daeba5930b021aa39d024f132a9a035776"},"schema_version":"1.0","source":{"id":"1405.1406","kind":"arxiv","version":1}},"canonical_sha256":"39ec1c353372799e167c4ba0d30d21ad77726d69ab5be96c4877f4256c8a5ef2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39ec1c353372799e167c4ba0d30d21ad77726d69ab5be96c4877f4256c8a5ef2","first_computed_at":"2026-05-18T02:52:32.851726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:32.851726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"brftQaooz+nGFDTmr7T9vvhfSs+iUbZ+2lzOmwH+n3u+pEFPXJM8V9anVFx1VFeulnqhUkyb7x83Ls+vtdb0DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:32.852251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce78bda65abc3fdba615343f9fa5b783d7e979ff6ed184f7ec12ced1dcdd01bd","sha256:d0f2e23f804149f6dfa7118b43287bed1c2cb0b9135503e98cc30678e57d52e3"],"state_sha256":"76266d80567354ee62fbad7543bc23bb16a8911defb9243c403518d2552cae18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vns0w+ENRsuHWO9CuRdPWeOgInOrUssbNfIbg4AnK5mrGuYY2DwyQ+j4PjaGDBveztrsfCUG3oLVP/klL+9GAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:33:42.359849Z","bundle_sha256":"4a51230c977bdc4ee14778fff5e625bab4e13fc5677b1438a123c849ba42f967"}}