Jul 2026· 2026 IEEE International Conference on Industry 4.0, Artificial Intelligence, and Communications Technology (IAICT)· pp. 563-570· 0 citations· 21 references
Abstract
Building on GraphLawPH, the first knowledge graph of Philippine Republic Acts, this study benchmarks three graph neural network (GNN) architectures—GAT, GCN, and GraphSAGE—and compares them to a high-dimensional Legal-BERT baseline to determine their suitability for statutory legal embedding. Using a corpus of 12,124 Republic Acts linked by 3,721 citation edges, the researchers evaluate the models as high-fidelity semantic compressors that reduce dimensionality by 91.7% while maintaining extreme representational alignment. Performance was rigorously assessed on semantic similarity detection and community discovery using retrieval metrics and structural alignment scores. The results reveal a 3.1% graph-gain for GAT in semantic retrieval (MRR=0.7870) and a massive 2,680% modularity improvement for GCN (0.4227) over the text-only baseline (0.0152), meeting established benchmarks for substantial community structure. These findings resolve the Sparsity Paradox for the corpus’s 81.79% isolated nodes, proving that transferable inductive biases from the connected minority effectively preserve semantic integrity across the entire legal graph. This study provides the first empirical benchmark for Philippine statutory GNNs, delivering guidance for selecting architectures that balance local semantic precision with global structural coherence.
Assessing scientific novelty is inherently complex, requiring evaluation of both a paper's internal structure and its contribution within the broader research landscape. Existing large language model (LLM) approaches often rely on surface-level similarity or citation retrieval, overlooking the integration between a pap...
Italo Luis da Silva, Hanqi Yan, Lin Gui et al.· Proceedings of the 32nd ACM...· 1 citation
This work proposes RTA, a simple MLP-based framework that replaces structural message passing with label-aware retrieval and propagation and provides theoretical insights that connect retrieval-based aggregation to softmax-attention message passing and establish the robustness of retrieved-context supervision to mis-re...
Jintang Li, Yuhong Chen, Ruo-Fan Wu et al.· 0 citations
Similarity-guided Structural Matching Learning for Graph Dataset Condensation (SSGDC) is proposed, which efficiently reduces repository size while maintaining both task performance and structural information.
Yi-Yang Zhang, Yutong Ye, Ying-Bo Zhou et al.· Proceedings of the Thirty-Fi...· 0 citations
Experiments show that replacing PageRank with alternative centralities yields similar F1-scores while offering notable runtime savings, and that GraphHD-Order remains competitive with the original GraphHD baseline while providing consistent speedups in encoding time.
Financial regulatory documents are characterized by their fine-grained complexity and pronounced heterogeneity, featuring specialized domain-specific content and diverse structural formats that vary across different regulatory frameworks and jurisdictions. These characteristics challenge modern Question-Answering (QA)...
Amal Ben Abdelhafidh, Montassar Ben Messaoud, M. Tounsi et al.· Annual International Compute...· 0 citations
Under the official 3rd-stage 60%/40% NatUKE split, the best CareWeavers configuration per task exceeds the published NatUKE reference baseline on 4 of 5 property types.
KhyatiPatni, DakshSammi, Rahul Kharkwal et al.· TEXT2KG/BiKE@ESWC· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.