{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ICUUHXXV4DFRQKA3PMOEKT63EH","short_pith_number":"pith:ICUUHXXV","canonical_record":{"source":{"id":"1807.07186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-07-18T23:38:08Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b72b22931c004d59cc5698365fcb3cfd92eaa8f5c506eeb27dfd120b89490c95","abstract_canon_sha256":"13382153955b6cefc2ea7d89691afed6bec44bc598e0f87e5ab0c0a30d27f935"},"schema_version":"1.0"},"canonical_sha256":"40a943def5e0cb18281b7b1c454fdb21dffd1d8c083c6728d289c06f47a7fa55","source":{"kind":"arxiv","id":"1807.07186","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07186","created_at":"2026-05-18T00:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07186v1","created_at":"2026-05-18T00:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07186","created_at":"2026-05-18T00:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"ICUUHXXV4DFR","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"ICUUHXXV4DFRQKA3","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"ICUUHXXV","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ICUUHXXV4DFRQKA3PMOEKT63EH","target":"record","payload":{"canonical_record":{"source":{"id":"1807.07186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-07-18T23:38:08Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b72b22931c004d59cc5698365fcb3cfd92eaa8f5c506eeb27dfd120b89490c95","abstract_canon_sha256":"13382153955b6cefc2ea7d89691afed6bec44bc598e0f87e5ab0c0a30d27f935"},"schema_version":"1.0"},"canonical_sha256":"40a943def5e0cb18281b7b1c454fdb21dffd1d8c083c6728d289c06f47a7fa55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:20.983783Z","signature_b64":"8An96ji6eEXpAOdulLi61mXaZqU2iIsSwVaNnHfizWFSjoiC0EB0Hzh7ZdeEpLTnmniw/7wiFUv0vVukAD5yDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40a943def5e0cb18281b7b1c454fdb21dffd1d8c083c6728d289c06f47a7fa55","last_reissued_at":"2026-05-18T00:10:20.983123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:20.983123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.07186","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-18T00:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uuMPEAS6bsJmgaumkZsr/OVdftPRaO6cpAMBL92mKWhUV6DNp/kFfsWdmakLzWRq49kJq5cgQBrMoWw2Joo+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:56:00.185013Z"},"content_sha256":"cfb93622ab50554664c973247ae68826285854b196fd9fa351691406f32a9631","schema_version":"1.0","event_id":"sha256:cfb93622ab50554664c973247ae68826285854b196fd9fa351691406f32a9631"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ICUUHXXV4DFRQKA3PMOEKT63EH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evaluating Word Embeddings in Multi-label Classification Using Fine-grained Name Typing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Hinrich Sch\\\"utze, Katharina Kann, Yadollah Yaghoobzadeh","submitted_at":"2018-07-18T23:38:08Z","abstract_excerpt":"Embedding models typically associate each word with a single real-valued vector, representing its different properties. Evaluation methods, therefore, need to analyze the accuracy and completeness of these properties in embeddings. This requires fine-grained analysis of embedding subspaces. Multi-label classification is an appropriate way to do so. We propose a new evaluation method for word embeddings based on multi-label classification given a word embedding. The task we use is fine-grained name typing: given a large corpus, find all types that a name can refer to based on the name embedding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07186","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-18T00:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMOL4muiHTq1AebOctwAauB4KXYLBKw3pz9SACFQNVdVFCMYpXN5qb9zcgWBAZ7SS80JhiiUgyIey9+npmulAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:56:00.185702Z"},"content_sha256":"e421e3d31f5d06ce6c3f61fad61ae4ee8f5a4b8b2d6efe2149e142fc50b0a134","schema_version":"1.0","event_id":"sha256:e421e3d31f5d06ce6c3f61fad61ae4ee8f5a4b8b2d6efe2149e142fc50b0a134"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ICUUHXXV4DFRQKA3PMOEKT63EH/bundle.json","state_url":"https://pith.science/pith/ICUUHXXV4DFRQKA3PMOEKT63EH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ICUUHXXV4DFRQKA3PMOEKT63EH/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-06-06T21:56:00Z","links":{"resolver":"https://pith.science/pith/ICUUHXXV4DFRQKA3PMOEKT63EH","bundle":"https://pith.science/pith/ICUUHXXV4DFRQKA3PMOEKT63EH/bundle.json","state":"https://pith.science/pith/ICUUHXXV4DFRQKA3PMOEKT63EH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ICUUHXXV4DFRQKA3PMOEKT63EH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ICUUHXXV4DFRQKA3PMOEKT63EH","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":"13382153955b6cefc2ea7d89691afed6bec44bc598e0f87e5ab0c0a30d27f935","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-07-18T23:38:08Z","title_canon_sha256":"b72b22931c004d59cc5698365fcb3cfd92eaa8f5c506eeb27dfd120b89490c95"},"schema_version":"1.0","source":{"id":"1807.07186","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07186","created_at":"2026-05-18T00:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07186v1","created_at":"2026-05-18T00:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07186","created_at":"2026-05-18T00:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"ICUUHXXV4DFR","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"ICUUHXXV4DFRQKA3","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"ICUUHXXV","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:e421e3d31f5d06ce6c3f61fad61ae4ee8f5a4b8b2d6efe2149e142fc50b0a134","target":"graph","created_at":"2026-05-18T00:10:20Z","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":"Embedding models typically associate each word with a single real-valued vector, representing its different properties. Evaluation methods, therefore, need to analyze the accuracy and completeness of these properties in embeddings. This requires fine-grained analysis of embedding subspaces. Multi-label classification is an appropriate way to do so. We propose a new evaluation method for word embeddings based on multi-label classification given a word embedding. The task we use is fine-grained name typing: given a large corpus, find all types that a name can refer to based on the name embedding","authors_text":"Hinrich Sch\\\"utze, Katharina Kann, Yadollah Yaghoobzadeh","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-07-18T23:38:08Z","title":"Evaluating Word Embeddings in Multi-label Classification Using Fine-grained Name Typing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07186","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:cfb93622ab50554664c973247ae68826285854b196fd9fa351691406f32a9631","target":"record","created_at":"2026-05-18T00:10:20Z","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":"13382153955b6cefc2ea7d89691afed6bec44bc598e0f87e5ab0c0a30d27f935","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-07-18T23:38:08Z","title_canon_sha256":"b72b22931c004d59cc5698365fcb3cfd92eaa8f5c506eeb27dfd120b89490c95"},"schema_version":"1.0","source":{"id":"1807.07186","kind":"arxiv","version":1}},"canonical_sha256":"40a943def5e0cb18281b7b1c454fdb21dffd1d8c083c6728d289c06f47a7fa55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40a943def5e0cb18281b7b1c454fdb21dffd1d8c083c6728d289c06f47a7fa55","first_computed_at":"2026-05-18T00:10:20.983123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:20.983123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8An96ji6eEXpAOdulLi61mXaZqU2iIsSwVaNnHfizWFSjoiC0EB0Hzh7ZdeEpLTnmniw/7wiFUv0vVukAD5yDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:20.983783Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07186","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfb93622ab50554664c973247ae68826285854b196fd9fa351691406f32a9631","sha256:e421e3d31f5d06ce6c3f61fad61ae4ee8f5a4b8b2d6efe2149e142fc50b0a134"],"state_sha256":"ff882e79d99ee501f408cb367885ed7af57ea1f0c1b8f7f1235db3cebafe6d04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nm0WtAJRhoxM0BJ3rBMLW3uyYBCH/EGrCk+uuAXZC1iAoN/ErxY9/sgBZHlaHDzRKMij1hpdopfPPgKCIoCyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:56:00.189849Z","bundle_sha256":"109505ecfe3e84b762eb8ab9deda02f57b8d9ecc162c0e09e02801a6e67b4e79"}}