{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6KB5UXWUONXCZE3C4QWF453WWM","short_pith_number":"pith:6KB5UXWU","canonical_record":{"source":{"id":"1402.2561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-18T21:08:40Z","cross_cats_sorted":[],"title_canon_sha256":"54eb19ae0f08a6cd628b34166affe1ddb15d772b8f99010c330e1f6aac903faa","abstract_canon_sha256":"5ce504372da1caa83ca6a172aa3f5ceb2f1efd8163b631cedb9de9dd0cce8198"},"schema_version":"1.0"},"canonical_sha256":"f283da5ed4736e2c9362e42c5e7776b319af430a0ee82f9f9af9f96f3b8fb3d9","source":{"kind":"arxiv","id":"1402.2561","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2561","created_at":"2026-05-18T02:59:19Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2561v1","created_at":"2026-05-18T02:59:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2561","created_at":"2026-05-18T02:59:19Z"},{"alias_kind":"pith_short_12","alias_value":"6KB5UXWUONXC","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6KB5UXWUONXCZE3C","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6KB5UXWU","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6KB5UXWUONXCZE3C4QWF453WWM","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-18T21:08:40Z","cross_cats_sorted":[],"title_canon_sha256":"54eb19ae0f08a6cd628b34166affe1ddb15d772b8f99010c330e1f6aac903faa","abstract_canon_sha256":"5ce504372da1caa83ca6a172aa3f5ceb2f1efd8163b631cedb9de9dd0cce8198"},"schema_version":"1.0"},"canonical_sha256":"f283da5ed4736e2c9362e42c5e7776b319af430a0ee82f9f9af9f96f3b8fb3d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:19.283995Z","signature_b64":"pvRzmLfofEc4vYzxhMwWKhDv7ity5CJoJ088Hajt18921OIKLK6m7szdsPkdpVEI74e1mSvfhNkaercIkPGLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f283da5ed4736e2c9362e42c5e7776b319af430a0ee82f9f9af9f96f3b8fb3d9","last_reissued_at":"2026-05-18T02:59:19.283225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:19.283225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2561","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:59:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pzHHzeiRgdDyTxp8b5XVfmLjcK5TWyFFm/Pcq32dlHg+7S7jZwPI/Fi2vcqF5bU7dxILXuJBUhwdOI+iSTKNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:38:21.058306Z"},"content_sha256":"df1578c0fae435e77d624219ee07510202db35055d85a4ae618e7b8c7fbbf95b","schema_version":"1.0","event_id":"sha256:df1578c0fae435e77d624219ee07510202db35055d85a4ae618e7b8c7fbbf95b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6KB5UXWUONXCZE3C4QWF453WWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The CQC Algorithm: Cycling in Graphs to Semantically Enrich and Enhance a Bilingual Dictionary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Roberto Navigli, Tiziano Flati","submitted_at":"2014-01-18T21:08:40Z","abstract_excerpt":"Bilingual machine-readable dictionaries are knowledge resources useful in many automatic tasks. However, compared to monolingual computational lexicons like WordNet, bilingual dictionaries typically provide a lower amount of structured information, such as lexical and semantic relations, and often do not cover the entire range of possible translations for a word of interest. In this paper we present Cycles and Quasi-Cycles (CQC), a novel algorithm for the automated disambiguation of ambiguous translations in the lexical entries of a bilingual machine-readable dictionary. The dictionary is repr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2561","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:59:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2pVp0ZdV1Ict0gjaunYun3YQu+WV107JDsucHWioPmvY6lB5sJkHQI1xzennjwz3CbU2Kw2Z96unqSxHtO/iAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:38:21.059007Z"},"content_sha256":"1e090249e8d84f963d76768c25e1d6e6f75aebbce1384f595217cbd1e5f1d32d","schema_version":"1.0","event_id":"sha256:1e090249e8d84f963d76768c25e1d6e6f75aebbce1384f595217cbd1e5f1d32d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM/bundle.json","state_url":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KB5UXWUONXCZE3C4QWF453WWM/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-30T21:38:21Z","links":{"resolver":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM","bundle":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM/bundle.json","state":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KB5UXWUONXCZE3C4QWF453WWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6KB5UXWUONXCZE3C4QWF453WWM","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":"5ce504372da1caa83ca6a172aa3f5ceb2f1efd8163b631cedb9de9dd0cce8198","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-18T21:08:40Z","title_canon_sha256":"54eb19ae0f08a6cd628b34166affe1ddb15d772b8f99010c330e1f6aac903faa"},"schema_version":"1.0","source":{"id":"1402.2561","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2561","created_at":"2026-05-18T02:59:19Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2561v1","created_at":"2026-05-18T02:59:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2561","created_at":"2026-05-18T02:59:19Z"},{"alias_kind":"pith_short_12","alias_value":"6KB5UXWUONXC","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6KB5UXWUONXCZE3C","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6KB5UXWU","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:1e090249e8d84f963d76768c25e1d6e6f75aebbce1384f595217cbd1e5f1d32d","target":"graph","created_at":"2026-05-18T02:59:19Z","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":"Bilingual machine-readable dictionaries are knowledge resources useful in many automatic tasks. However, compared to monolingual computational lexicons like WordNet, bilingual dictionaries typically provide a lower amount of structured information, such as lexical and semantic relations, and often do not cover the entire range of possible translations for a word of interest. In this paper we present Cycles and Quasi-Cycles (CQC), a novel algorithm for the automated disambiguation of ambiguous translations in the lexical entries of a bilingual machine-readable dictionary. The dictionary is repr","authors_text":"Roberto Navigli, Tiziano Flati","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-18T21:08:40Z","title":"The CQC Algorithm: Cycling in Graphs to Semantically Enrich and Enhance a Bilingual Dictionary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2561","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:df1578c0fae435e77d624219ee07510202db35055d85a4ae618e7b8c7fbbf95b","target":"record","created_at":"2026-05-18T02:59:19Z","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":"5ce504372da1caa83ca6a172aa3f5ceb2f1efd8163b631cedb9de9dd0cce8198","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-01-18T21:08:40Z","title_canon_sha256":"54eb19ae0f08a6cd628b34166affe1ddb15d772b8f99010c330e1f6aac903faa"},"schema_version":"1.0","source":{"id":"1402.2561","kind":"arxiv","version":1}},"canonical_sha256":"f283da5ed4736e2c9362e42c5e7776b319af430a0ee82f9f9af9f96f3b8fb3d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f283da5ed4736e2c9362e42c5e7776b319af430a0ee82f9f9af9f96f3b8fb3d9","first_computed_at":"2026-05-18T02:59:19.283225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:19.283225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pvRzmLfofEc4vYzxhMwWKhDv7ity5CJoJ088Hajt18921OIKLK6m7szdsPkdpVEI74e1mSvfhNkaercIkPGLBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:19.283995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2561","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df1578c0fae435e77d624219ee07510202db35055d85a4ae618e7b8c7fbbf95b","sha256:1e090249e8d84f963d76768c25e1d6e6f75aebbce1384f595217cbd1e5f1d32d"],"state_sha256":"09df3649523248365f769f2adc4630389fd1fd371e4deb8bd3e12d59bd43ce9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Fo6TErlBkHdymqPQLA0s9iW/jNxvfH/K3eU1JbEIoIv82WL9sxtX5PsMWGtLGjMuBl53rlcvSenNBcikTCXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:38:21.062706Z","bundle_sha256":"1f496b6935abea9e8a2f34633096a1b9a36b680ac744166148f80ff76fa3625c"}}