{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EIOLBNYPS42Z2LGK67BSBNX6C2","short_pith_number":"pith:EIOLBNYP","canonical_record":{"source":{"id":"1704.07157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-24T11:49:08Z","cross_cats_sorted":[],"title_canon_sha256":"cf66bd080d11959396b3883313203562cc7977cdcdb952506c3caef1d544c6ab","abstract_canon_sha256":"627e49ce7622ed6d2921d5785a5bbeac4f5015cdb05adfc94715b3da5bf17d19"},"schema_version":"1.0"},"canonical_sha256":"221cb0b70f97359d2ccaf7c320b6fe16a2a27656e019951eec5d540fc7163f7d","source":{"kind":"arxiv","id":"1704.07157","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07157","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07157v1","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07157","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"EIOLBNYPS42Z","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EIOLBNYPS42Z2LGK","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EIOLBNYP","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EIOLBNYPS42Z2LGK67BSBNX6C2","target":"record","payload":{"canonical_record":{"source":{"id":"1704.07157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-24T11:49:08Z","cross_cats_sorted":[],"title_canon_sha256":"cf66bd080d11959396b3883313203562cc7977cdcdb952506c3caef1d544c6ab","abstract_canon_sha256":"627e49ce7622ed6d2921d5785a5bbeac4f5015cdb05adfc94715b3da5bf17d19"},"schema_version":"1.0"},"canonical_sha256":"221cb0b70f97359d2ccaf7c320b6fe16a2a27656e019951eec5d540fc7163f7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:42.263187Z","signature_b64":"fF+oB/HwPUQLA0XTCJQ0KkUr3JdEWWw1oNgYx8qmwIRz4gT8KCiFiQLxdLehTSXAfi7HRRJAPkGrQpHC4rNDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"221cb0b70f97359d2ccaf7c320b6fe16a2a27656e019951eec5d540fc7163f7d","last_reissued_at":"2026-05-18T00:15:42.262515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:42.262515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.07157","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:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8uEszObrq7/49lLaWSSvAniUNyhMbPNh155O01/tlwYjFNBmJx86r2SFtLBOc9cykNScA+TSWGNHmPn6Bs7iDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T18:10:53.474204Z"},"content_sha256":"5203d92339c378c16448870b25208dd2fc477566a44bd67b5e26968942581423","schema_version":"1.0","event_id":"sha256:5203d92339c378c16448870b25208dd2fc477566a44bd67b5e26968942581423"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EIOLBNYPS42Z2LGK67BSBNX6C2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Watset: Automatic Induction of Synsets from a Graph of Synonyms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alexander Panchenko, Chris Biemann, Dmitry Ustalov","submitted_at":"2017-04-24T11:49:08Z","abstract_excerpt":"This paper presents a new graph-based approach that induces synsets using synonymy dictionaries and word embeddings. First, we build a weighted graph of synonyms extracted from commonly available resources, such as Wiktionary. Second, we apply word sense induction to deal with ambiguous words. Finally, we cluster the disambiguated version of the ambiguous input graph into synsets. Our meta-clustering approach lets us use an efficient hard clustering algorithm to perform a fuzzy clustering of the graph. Despite its simplicity, our approach shows excellent results, outperforming five competitive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07157","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:15:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nV13Vn/MIhUgsuzA+7XK/HfV/oMq7c36RzPnCHBCdDaB/5M3dNxPGjxQzzcw9psE1BUZSMXR08K/fR0WNixcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T18:10:53.474564Z"},"content_sha256":"7620f50d47fd8ebf904ab6b0351b2884b7bdebef1ec694b56d1652fbe1e4f2bc","schema_version":"1.0","event_id":"sha256:7620f50d47fd8ebf904ab6b0351b2884b7bdebef1ec694b56d1652fbe1e4f2bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIOLBNYPS42Z2LGK67BSBNX6C2/bundle.json","state_url":"https://pith.science/pith/EIOLBNYPS42Z2LGK67BSBNX6C2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIOLBNYPS42Z2LGK67BSBNX6C2/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-26T18:10:53Z","links":{"resolver":"https://pith.science/pith/EIOLBNYPS42Z2LGK67BSBNX6C2","bundle":"https://pith.science/pith/EIOLBNYPS42Z2LGK67BSBNX6C2/bundle.json","state":"https://pith.science/pith/EIOLBNYPS42Z2LGK67BSBNX6C2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIOLBNYPS42Z2LGK67BSBNX6C2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EIOLBNYPS42Z2LGK67BSBNX6C2","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":"627e49ce7622ed6d2921d5785a5bbeac4f5015cdb05adfc94715b3da5bf17d19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-24T11:49:08Z","title_canon_sha256":"cf66bd080d11959396b3883313203562cc7977cdcdb952506c3caef1d544c6ab"},"schema_version":"1.0","source":{"id":"1704.07157","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07157","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07157v1","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07157","created_at":"2026-05-18T00:15:42Z"},{"alias_kind":"pith_short_12","alias_value":"EIOLBNYPS42Z","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EIOLBNYPS42Z2LGK","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EIOLBNYP","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:7620f50d47fd8ebf904ab6b0351b2884b7bdebef1ec694b56d1652fbe1e4f2bc","target":"graph","created_at":"2026-05-18T00:15:42Z","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":"This paper presents a new graph-based approach that induces synsets using synonymy dictionaries and word embeddings. First, we build a weighted graph of synonyms extracted from commonly available resources, such as Wiktionary. Second, we apply word sense induction to deal with ambiguous words. Finally, we cluster the disambiguated version of the ambiguous input graph into synsets. Our meta-clustering approach lets us use an efficient hard clustering algorithm to perform a fuzzy clustering of the graph. Despite its simplicity, our approach shows excellent results, outperforming five competitive","authors_text":"Alexander Panchenko, Chris Biemann, Dmitry Ustalov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-24T11:49:08Z","title":"Watset: Automatic Induction of Synsets from a Graph of Synonyms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07157","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:5203d92339c378c16448870b25208dd2fc477566a44bd67b5e26968942581423","target":"record","created_at":"2026-05-18T00:15:42Z","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":"627e49ce7622ed6d2921d5785a5bbeac4f5015cdb05adfc94715b3da5bf17d19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-24T11:49:08Z","title_canon_sha256":"cf66bd080d11959396b3883313203562cc7977cdcdb952506c3caef1d544c6ab"},"schema_version":"1.0","source":{"id":"1704.07157","kind":"arxiv","version":1}},"canonical_sha256":"221cb0b70f97359d2ccaf7c320b6fe16a2a27656e019951eec5d540fc7163f7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"221cb0b70f97359d2ccaf7c320b6fe16a2a27656e019951eec5d540fc7163f7d","first_computed_at":"2026-05-18T00:15:42.262515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:42.262515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fF+oB/HwPUQLA0XTCJQ0KkUr3JdEWWw1oNgYx8qmwIRz4gT8KCiFiQLxdLehTSXAfi7HRRJAPkGrQpHC4rNDAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:42.263187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07157","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5203d92339c378c16448870b25208dd2fc477566a44bd67b5e26968942581423","sha256:7620f50d47fd8ebf904ab6b0351b2884b7bdebef1ec694b56d1652fbe1e4f2bc"],"state_sha256":"2388b7a2ba5d292216a929565fb244f51504e76878b95f8c87d58e6d5dab26bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8tqYxfU+r53rmpDJcQgzPuevhAaVc5AlGx2Y2UXYbMmGcj7Mtd4DyX/zXtIONmpu7dU60jIzolSuQpddu7d0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T18:10:53.476429Z","bundle_sha256":"c658cd2ea631802010893daa73ec4bc9f9816575ec3ef3728cd1fc2cae0518b8"}}