Jun 2026· arXiv.org· Vol abs/2606.27347· 0 citations· 65 references
Computer Science
TL;DR
A modular, fully open-weight pipeline for multilingual joint entity-relation extraction that builds signed, temporal knowledge graphs from massive unstructured news corpora is presented, providing a robust, replicable foundation for cross-national empirical computational social science.
Abstract
Whether political elites organise into rent-seeking coalitions that capture public resources or civic networks that sustain governance is a central question in comparative politics. Yet observing these complex, informal, and adversarial ties at scale has historically required intensive manual coding, while automated text-as-data methods have largely been limited to simple co-occurrence. Recent large language model (LLM) approaches offer a path forward but often rely on proprietary APIs, lack cross-lingual capability, and struggle with scalable entity resolution. We present a modular, fully open-weight pipeline for multilingual joint entity-relation extraction that builds signed, temporal knowledge graphs from massive unstructured news corpora. It combines span-based named-entity recognition (NER) with a three-stage linking cascade mapping mentions to language-independent Wikidata identifiers; a high-throughput, ontology-constrained mixture-of-experts model then uses guided decoding to extract directed, signed relationships grounded in a domain ontology. A full-coverage spot-check against a 3491-relation gold standard shows high textual correctness (68.2% strict to 93.7% lenient). Two large-scale case studies validate the pipeline against the public record. In Austria, it reconstructs a political party's complete lifecycle, dating internal fractures and tracking personnel into successor factions and court convictions. In a Polish corpus, it uncovers the overlapping economic and governance networks of state-enterprise patronage, alongside the structurally balanced, signed conflict network of the polarized Civic Platform (Platforma Obywatelska, PO)--Law and Justice (Prawo i Sprawiedliwo\'s\'c, PiS) duopoly. By bridging raw multilingual text and structured relational data, our framework provides a robust, replicable foundation for cross-national empirical computational social science.
Accurate attribution of scholarly work to specific sub-institutional units, such as schools or departments of a university, is crucial for granular research assessment and policymaking. While robust identifiers exist for top-level institutions, standardized data for sub-level units remains scarce due to the linguistic and structural variability of affiliation strings. In this study, we introduce OpenSubAffil, a large-scale dataset mapping raw affiliation strings from OpenAlex to disambiguated sub-institutional entities and their hierarchical structures. We developed a pipeline integrating named entity recognition (NER) with embedding-based clustering. Furthermore, we proposed a multi-signal scoring function that synthesizes lexical and co-occurrence evidence to reconstruct the sub-institutional hierarchy. OpenSubAffil comprises mappings for 40 million affiliation strings to 638,843 disambiguated sub-units across 18,635 top-level institutions, together with their hierarchical relationships. Validation against Wikidata benchmarks and manual investigation show that our method achieves promising performance. Overall, this dataset bridges the granularity gap between individual researchers and top-level institutions, enabling high-resolution analyses of scholarly output and communication at the sub-institutional level. The OpenSubAffil dataset is publicly available at https://doi.org/10.5281/zenodo.19602782.
Zhentao Liang, Jin Mao, Gang Li· Scientific Data· 0 citations
An innovative model which combines transformer-based context embedding, BiLSTM for capturing of sentiment flows, and GAT for examining relational data is introduced which incorporates contextual, sequential and relational modelling of multilingual opinion mining.
Manoharan Thangavel, A. Kalpana, Saravanan Ananth· Serbian Journal of Electrica...· 0 citations
This team investigates how far a lightweight, interpretable system can go without any pretrained language model at the relation classification stage on the HIPE-2026 shared task, finding that minimum character distance alone captures most of the classification signal.
We present an interpretable network-based framework for representing idiomatic and figurative meaning across eight typologically diverse languages, totaling 160 conventional expressions, the large majority of which are idiomatic. Each expression is annotated with binary conceptual features (containment, concealment, emotional, social, etc.) derived from cognitive-linguistic theory, and pairwise Jaccard similarities define a weighted graph. Community detection reveals that idioms cluster by conceptual schema rather than by language, producing a structure consistent with cognitive-linguistic predictions. The conceptual network captures unique semantic information not present in distributional embeddings, can be scaled via automatic annotation with LLMs, improves downstream idiom detection, and remains robust when enriched with corpus frequencies. Cross-lingual transfer experiments show that conceptual proximity alone can identify acceptable translation equivalents across five language families, with substantial gains over embedding-based baselines. Ablation studies demonstrate that all three feature dimensions -- schemas, roles, and valence -- contribute non-redundantly to both the network's organizational properties and its performance on idiom detection, and that specific graph-derived signals (community membership, neighbor similarity) are particularly informative. The framework offers an interpretable, cross-linguistically stable representation of idiomatic meaning, combining theoretical grounding with practical utility.