{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6KB5UXWUONXCZE3C4QWF453WWM","short_pith_number":"pith:6KB5UXWU","schema_version":"1.0","canonical_sha256":"f283da5ed4736e2c9362e42c5e7776b319af430a0ee82f9f9af9f96f3b8fb3d9","source":{"kind":"arxiv","id":"1402.2561","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.2561","created_at":"2026-05-18T02:59:19.283331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2561v1","created_at":"2026-05-18T02:59:19.283331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2561","created_at":"2026-05-18T02:59:19.283331+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KB5UXWUONXC","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KB5UXWUONXCZE3C","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KB5UXWU","created_at":"2026-05-18T12:28:16.859392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM","json":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM.json","graph_json":"https://pith.science/api/pith-number/6KB5UXWUONXCZE3C4QWF453WWM/graph.json","events_json":"https://pith.science/api/pith-number/6KB5UXWUONXCZE3C4QWF453WWM/events.json","paper":"https://pith.science/paper/6KB5UXWU"},"agent_actions":{"view_html":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM","download_json":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM.json","view_paper":"https://pith.science/paper/6KB5UXWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2561&json=true","fetch_graph":"https://pith.science/api/pith-number/6KB5UXWUONXCZE3C4QWF453WWM/graph.json","fetch_events":"https://pith.science/api/pith-number/6KB5UXWUONXCZE3C4QWF453WWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM/action/storage_attestation","attest_author":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM/action/author_attestation","sign_citation":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM/action/citation_signature","submit_replication":"https://pith.science/pith/6KB5UXWUONXCZE3C4QWF453WWM/action/replication_record"}},"created_at":"2026-05-18T02:59:19.283331+00:00","updated_at":"2026-05-18T02:59:19.283331+00:00"}