Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.08869

OntoKG-EQ: A provenance-grounded, competency-question-governed knowledge graph for auditable analyst querying

Furqan Nasir·Muhammad Atif Saeed·Muhammad Ehsan·Sher Jeel Ahmad·Abdul Moiz Altaf
View original source ↗Read source document ↗Export metadata ↓

Abstract

Analysts in emerging equity markets keep answering the same questions. Did fundamentals match the market's response? How does the local currency co-move with returns? Which firms outperform sector and benchmark, and which disclosures coincide with abnormal trading? These answers come from ad-hoc spreadsheets that are hard to reproduce, audit, or trust. We present OntoKG-EQ, a knowledge-based system that makes such queries reproducible, evidence-linked, temporally explicit, valid, and inspectable. It couples a bounded, competency-question-governed core ontology with a provenance-aware knowledge graph in which every class, property, shape, and metric is justified by one of five frozen questions. The system materialises market data into the graph, computes the metrics, validates its structure against declarative shape constraints, answers each competency question with a graph query, derives typed findings, and generates an explanation tracing each result to its observations, evidence, sources, and provenance. We evaluate on curated datasets from three emerging markets (Pakistan, Malaysia, Indonesia). Once each market's data is mapped into the common schema, the ontology, shapes, queries, and rules are reused unchanged. A relational-database baseline shows the graph changes no analytics. Its value is governance, provenance, and self-explaining structure. Because answers are rendered deterministically from the validated graph, their consistency with it is guaranteed by construction. Used as a reference, the system measures how consistently eight open language models transcribe the same evidence (provenance coverage 0.00 to 1.00). A study with a 17-participant convenience panel finds the evidence bundle significantly increased perceived trust and completeness. Code and data are openly released.

Explore related subjects

cs.ETcs.AIcs.DB

Keep this discovery

BibTeXRIS

Furqan Nasir, Muhammad Atif Saeed, Muhammad Ehsan, Sher Jeel Ahmad, Abdul Moiz Altaf. 2026-09-08. OntoKG-EQ: A provenance-grounded, competency-question-governed knowledge graph for auditable analyst querying. https://arxiv.org/abs/2609.08869

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.AI subjectcs.DB subjectcs.ET subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Improving Federated Graph Recommendation with Semantic Guidance

Graph-based recommendation models effectively capture high-order collaborative signals from user--item interaction graphs. Federated learning (FL) enables privacy-preserving training across distributed clients. However, directly aggregating graph representations under FL is challenging: locally learned structural embeddings are not globally aligned under non-IID data distributions, and naive parameter averaging fails to recover cross-client relational structure. Existing federated graph-based approaches primarily rely on structural aggregation, yet overlook the global semantic knowledge encoded in large language models (LLMs). In this work, we propose a semantic--structural federated graph recommendation framework that leverages LLM embeddings to guide cross-client alignment. Each client learns user representations from its local interaction graph and summarizes typical interaction patterns into compact semantic vectors using a frozen LLM encoder. These vectors are sent to the server, which identifies semantically related patterns across different clients and combines their structural representations accordingly. The updated representations are then returned to clients to refine subsequent local training. This design enables collaboration guided by shared semantic understanding without exposing raw interaction data, preserving both recommendation accuracy and privacy. Experiments on benchmark datasets demonstrate consistent improvements over existing federated graph-based baselines.

cs.IR↗
arXiv2026

Enhanced Dynamic Beamwidth Selection-based THz MAC Protocol for Wireless Data Center Networks

Terahertz (THz) wireless communication offers a promising alternative to traditional wired links in data centres (DCs), enabling ultra-high data rates, low latency, and greater scalability. However, THz signals suffer from high path loss, necessitating the use of directional antennas (DAs). While DAs enhance signal strength, they introduce challenges such as deafness and synchronisation, typically addressed through receiver-initiated MAC protocols. Most existing THz MAC protocols use fixed beamwidths, which results in a key performance trade-off: narrow beams improve gain for long-range links but reduce throughput for short distances due to increased alignment overhead, while wide beams benefit short links but degrade performance over longer distances. To overcome this limitation, we propose DBS-ADAPT, a dynamic beamwidth selection-based MAC protocol that adjusts the antenna beamwidth according to the distance between nodes, maximising throughput without compromising link range. We also introduce an enhanced version, EDBS-ADAPT, which further reduces beamwidth switching and control overhead while preserving throughput gains. Both protocols are evaluated using the NS-3 THz module. Simulation results show that DBS-ADAPT improves average throughput by up to 22% and reduces delay up to 10% compared to the baseline ADAPT-3 protocol. EDBS-ADAPT further cuts beamwidth switching overhead by 95%, making it more efficient for scalable and high-performance wireless DC environments.

cs.NI↗
arXiv2024

Practical Persistent Multi-Word Compare-and-Swap Algorithms for Many-Core CPUs

In the last decade, academic and industrial researchers have focused on persistent memory because of the development of the first practical product, Intel Optane. One of the main challenges of persistent memory programming is to guarantee consistent durability over separate memory addresses, and Wang et al. proposed a persistent multi-word compare-and-swap (PMwCAS) algorithm to solve this problem. However, their algorithm contains redundant compare-and-swap (CAS) and cache flush instructions and does not achieve sufficient performance on many-core CPUs. This paper proposes a new algorithm to improve performance on many-core CPUs by removing useless CAS/flush instructions from PMwCAS operations. We also exclude dirty flags, which help ensure consistent durability in the original algorithm, from our algorithm using PMwCAS descriptors as write-ahead logs. Experimental results show that the proposed method is up to ten times faster than the original algorithm and suggests several productive uses of PMwCAS operations.

cs.DB↗