Pith. sign in

REVIEW 4 major objections 5 minor 62 references

From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis

T0 review · 4 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Prime-coded paths let simple models match or beat graph neural networks on three graph tasks.

desk verdict Solid extension of the PAM framework with a correct lossless k-hop algorithm; the relation prediction protocol needs a clear masking statement before Table 4 can be trusted. read the letter →

arxiv 2411.11149 v1 pith:2FP5XVOU submitted 2024-11-17 cs.LG cs.SI

Konstantinos Bougiatiotis , Georgios Paliouras This is my paper · ORCID
classification cs.LGcs.SI
keywords multi-relationalgraphsprimeadjacencymatricesbagofpathsknowledgenodeclassificationrelationpredictiongraphregressioninterpretablepathfeatures
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper claims that a multi-relational graph can be compressed into one adjacency matrix whose entries are products of prime numbers, one prime per relation type, and that powers of this matrix track all multi-hop relational chains. It adds a lossless algorithm that builds $P^k$ so that each non-zero cell factorises back into the exact set of $k$-hop paths between the two nodes, and a Bag of Paths feature representation that turns those values into interpretable histograms for nodes, edges, and whole graphs. With these features, an out-of-the-box tree classifier or a nearest-neighbor model matches or beats trained graph neural networks on node classification, relation prediction, and graph regression benchmarks, while running on CPU in minutes and using no trainable parameters. A reader should care because the same feature can be read two ways: as a number in a matrix and, by prime factorisation, as a specific relational chain, which makes the model's decisions inspectable.

What carries the argument

The central object is the Prime Adjacency Matrix (PAM), an $N\times N$ matrix in which entry $P[i,j]$ is the product (or, in the lossy variant, the sum) of the primes assigned to the relations on the edge $i\to j$; unique prime factorisation lets the entry record exactly which relations occur. The lossless $k$-hop extension replaces matrix multiplication's multiply-and-add with a chaining step (factorise the $k$-hop value and the final 1-hop value, map primes back to paths, concatenate them) and an aggregation step (map each distinct path to a new prime and multiply), so $P^k[i,j]$ factorises into the exact multiset of $k$-hop paths between the two nodes. The Bag of Paths (BoP) representation then concatenates the non-zero entries of $P^1,\dots,P^k$ for the cells relevant to a node, an edge, or a graph, applies tf-idf weighting, and feeds the resulting histogram to a simple classifier or regressor.

What would settle it

Rerun the relation-prediction experiments with every test triple's edge removed from the graph before $P$ and $P^k$ are computed; if MRR or Hit@3 drops materially, the reported numbers depended on the target edge being present in the path matrices.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that the ordinary matrix-power operation, which loses information when entries are products or sums, can be replaced by a two-step lossless pipeline: chain a $k$-hop path with a final 1-hop relation by factorising the two matrix entries, recovering the paths, and concatenating them; then aggregate the resulting collection of $(k+1)$-hop paths by assigning each distinct path a fresh prime and multiplying those primes. The Fundamental Theorem of Arithmetic guarantees that the resulting cell value decomposes uniquely, so $P^{k+1}[i,j]$ is exactly the multiset of $(k+1)$-hop relational chains from $i$ to $j$. Built on this, the Bag of Paths features—concatenated non-zero entries from $P^1,\dots,P^k$ with tf-idf weighting—let simple, parameter-free predictors match or beat neural baselines in the reported experiments, and any important feature can be factored back into the underlying path.

Load-bearing premise

The relation-prediction numbers assume that the true edge being predicted is not already sitting in the graph when the path matrices are built.

Editorial extensions

If this is right

  • On node-classification benchmarks, BoP features plus a gradient-boosted tree outperform all compared models on MUTAG and AM and finish in under a minute per dataset on CPU.
  • On relation prediction, the lossless BoP variant reaches the best Hit@3 on all three knowledge graphs while using zero trainable parameters.
  • On graph regression, BoP beats GAT and GIN on ZINC, AQSOL, and Peptides-struct and matches or beats a graph transformer on two of the three datasets.
  • The interpretability claim is concrete: a feature value like $77$ factorises as $7\times 11$, mapping to the two-hop chain C-Single-C-Double-C, so task-important paths can be reported directly.
  • The paper's discussion implies that rule mining and path-guided reasoning reduce to lookups over $P^k$ and $P$ once the matrices are built.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • An implication the paper leaves implicit is that the default sum-based powers are lossy: distinct path multisets can collide to the same numeric value, so deployments that need exact path counts should use the lossless algorithm and accept its higher runtime.
  • Because BoP features are just histograms over path symbols, the same feature vectors could be fed to other classifiers, and ablating tf-idf, neighborhood aggregation, and hop count would show which design choice carries the performance.
  • A testable extension for true link prediction is to mask the candidate edge before building the PAMs; the paper's relation-prediction protocol follows a prior setup but does not state that masking explicitly, so re-running with masking would settle whether the scores reflect path reasoning rather than the target edge's presence.
  • The prime assignment is arbitrary, so scores should be invariant under renumbering of relations; running the pipeline with several random prime assignments would provide a cheap stability check.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper extends the Prime Adjacency Matrix (PAM) framework for multi-relational graphs in three ways: a lossless algorithm for computing k-hop matrices whose nonzero cells encode relational chains as products of path-primes, a Bag of Paths (BoP) feature extraction methodology producing tf-idf-weighted histograms of path values at node, edge, and graph level, and a GraphBLAS implementation with reported speedups. The BoP features are evaluated with simple classifiers (CatBoost, k-NN) on node classification (AIFB, MUTAG, BGS, AM), relation prediction (WN18RR, NELL995, DDB14), and graph regression (ZINC, AQSOL, Peptides-struct), claiming performance comparable to or better than several neural baselines while using CPU only and no trainable parameters.

Significance. If the evaluations are valid, the paper offers a fast, interpretable, CPU-only alternative to trained GNNs for several graph-analysis tasks, with the notable strengths that the lossless construction is simple and correct for relational chains, the code is released, and the interpretability analysis (e.g., Table 6) is concrete and falsifiable. The lossless property is essentially built into the definition via the Fundamental Theorem of Arithmetic, but that is a sound construction rather than a damaging circularity. The main weaknesses are empirical: the relation-prediction protocol leaves open a possible leakage of test edges into the PAM construction, and the headline tables lack error bars, so the strength of the empirical claims is not yet fully established.

major comments (4)
  1. [Section 3.2 / Appendix C.2, Eq. (29)] The paper nowhere states whether the graph G used to build P and P^k includes the validation and test triples. Since the pair feature F(h,t) concatenates P^n[h,t] for n=1..k (Eq. 29), a test triple (h,r,t) present in G makes P[h,t] = phi(r), so a k-NN over these features can rank r trivially. This would invalidate the MRR and Hit@3 numbers in Table 4 and also the hyperparameter selection in Table 9. Please state explicitly that P and P^k are built from the training edges only, with validation and test edges masked before any PAM computation; if that is not the case, the experiments must be rerun with the held-out edges removed.
  2. [Section 2.5, Eq. (6), footnote 3] The lossless claim is for relational chains (sequences of relation types), not for node-level paths. In the Aggregation Process, phi_k maps a path to a prime based only on the relation sequence (r1,...,rk), and the cell value P^k[i,j] does not encode the intermediate node identities. Consequently, two node-level paths that share the same relation chain are represented by the same prime with multiplicity, and the nodes visited cannot be recovered from the matrix value. This is internally consistent with the paper's own definition of 'path' in Eq. (4), but the abstract and several later passages say 'paths' without this qualification. Please revise the wording to 'relational chains' consistently, or explain how intermediate nodes are recovered.
  3. [Tables 2, 4, 5] The empirical comparisons are reported without any measure of uncertainty. Table 2 reports averages over 5 runs, Table 5 averages over 4 runs, and Table 4 gives single numbers, while several margins are small (e.g., BoP lossless 0.874 vs DistMult 0.847 on WN18RR MRR; BoP 92.22 vs R-GCN 95.83 on AIFB). Without standard deviations, confidence intervals, or seed counts, the claims of 'outperforms' and 'competitive performance' are hard to assess. Please report variance information for all three tables.
  4. [Section 2.4 / Section 2.6 / Table 6] The default BoP variant uses P+ (Eq. 3), whose powers are sums of products of relation primes, so a cell value such as 24 in the running example does not have a unique prime factorization into a path multiset. This limits the 'interpretable by design' claim for the default variant: a feature value cannot in general be uniquely traced back to a set of relational chains without additional computation. Please either restrict the interpretability guarantee to the lossless variant and to the targeted path-extraction procedure described in Section 2.5, or explain how the default variant resolves the ambiguity in feature-to-path mapping.
minor comments (5)
  1. [Table 5] The ZINC training-set size is printed as '1,0000', which appears to be a typo for 10,000.
  2. [Figure 3 and Algorithm 1] The visual layout of the AP/CP steps is dense and the notation is hard to follow; in particular, Algorithm 1 line 4 passes the product Pk[i,nc] * P[nc,j] to ChainingProcess, and the reader must infer that both operands are lossless products and that factorization precedes concatenation. Renaming the variable or adding a comment would clarify this.
  3. [Section 3.2] The paper says the evaluation follows Wang et al. (2021) but does not specify the candidate-ranking protocol, e.g., whether inverse triples are filtered out or whether all relations are candidates for every (h,t) pair. Please state this explicitly.
  4. [Section 3.1] The claim that the BoP model 'takes less than a minute on average across all datasets' should state whether this includes P^k construction, feature extraction, tf-idf computation, and hyperparameter selection.
  5. [Appendix C.1] The tf-idf pre-filtering rules (skip paths in fewer than 2 nodes, skip paths in more than 99% of nodes) are applied to node features; it would be useful to state whether analogous filters are applied to edge and graph features.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: lossless PAM is an FTA-based encoding, BoP results are empirical, and self-citations are not load-bearing.

full rationale

The paper's central derivation chain is self-contained. The PAM definition (Eq. 2) maps each relation to a prime and defines matrix entries as products; the lossless k-hop construction (Section 2.5, Eq. 6) defines P^k[i,j] as the product of primes assigned to the path multiset, so factorization via the Fundamental Theorem of Arithmetic recovers the paths by construction. This is an encoding/decoding scheme, not a fitted parameter renamed as a prediction, and it does not make the downstream BoP results circular; those results are empirical comparisons against external baselines (WL, R-GCN, TransE, RotatE, GAT, GIN, GT, etc.). The self-citations to Bougiatiotis and Paliouras (2023a, 2023b) introduce the prior PAM framework and the PAM-knn baseline, but all definitions and proofs needed for the present claims are reproduced or proved in this manuscript, so the self-citations are not load-bearing. One non-circular correctness risk should be noted: Section 3.2 and Appendix C.2 do not explicitly state that validation/test triples are masked when building the PAMs for relation prediction; if they are not, Table 4 could reflect leakage. That is a protocol/validity concern, not a circularity of the derivation.

Assumptions & free parameters 5 free parameters · 3 assumptions · 0 invented entities

The math rests on the fundamental theorem of arithmetic and standard adjacency-matrix path counting. The only fitted values are hyperparameters chosen on validation splits and arbitrary prime-assignment maps. No new physical entities are introduced.

free parameters (5)
  • relation-to-prime mapping phi = arbitrary injective assignment, sequential primes 2, 3, 5, ...
    A design choice that does not change the information content but affects integer magnitudes and factorization cost.
  • k, number of hops = AIFB 4, MUTAG 3, BGS 2, AM 2; relation prediction default 5/4/5, lossless 2/2/3; graph regression 5/5/6
    The main BoP hyperparameter, selected on the validation split for each dataset.
  • alpha, self-weight in node feature aggregation = 2, 2, 5, 5 for AIFB, MUTAG, BGS, AM
    Selected on validation split in node classification.
  • N, number of k-NN neighbors = default 100/20/20 and lossless 100/100/20 for WN18RR/NELL995/DDB14
    Selected on validation split in relation prediction.
  • triple-to-prime mapping in graph regression = arbitrary per (atom type, bond, atom type)
    Design choice for molecular graphs; does not affect expressivity.
assumptions (3)
  • standard math Fundamental Theorem of Arithmetic: every positive integer factors uniquely into primes.
    Invoked in Appendix B.1 and used to justify decoding P and P^k values into relations and relation chains.
  • domain assumption Standard adjacency matrix powers count walks of length k.
    Section 2.3 generalizes the classical adjacency-matrix power property to relational chains; the paper assumes this extension is meaningful.
  • domain assumption A 'path' is defined as a sequence of relation types, not a sequence of nodes.
    Section 2.5 Eq. (4) defines paths as tuples of relations; the lossless claim only guarantees recovery of these relation chains, not of the actual intermediate vertices.

how reviews work

0 comments
Cite this review

Pith. "Pith review of From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis." pith.science (2026). https://pith.science/paper/2FP5XVOU

@misc{pith2026241111149,
  author       = {Pith},
  title        = {Pith review of: From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2FP5XVOU}},
  note         = {Machine review of arXiv:2411.11149}
}
read the original abstract

Multi-relational networks capture intricate relationships in data and have diverse applications across fields such as biomedical, financial, and social sciences. As networks derived from increasingly large datasets become more common, identifying efficient methods for representing and analyzing them becomes crucial. This work extends the Prime Adjacency Matrices (PAMs) framework, which employs prime numbers to represent distinct relations within a network uniquely. This enables a compact representation of a complete multi-relational graph using a single adjacency matrix, which, in turn, facilitates quick computation of multi-hop adjacency matrices. In this work, we enhance the framework by introducing a lossless algorithm for calculating the multi-hop matrices and propose the Bag of Paths (BoP) representation, a versatile feature extraction methodology for various graph analytics tasks, at the node, edge, and graph level. We demonstrate the efficiency of the framework across various tasks and datasets, showing that simple BoP-based models perform comparably to or better than commonly used neural models while offering improved speed and interpretability.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

62 extracted references · 57 canonical work pages

  1. [1]

    In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp 1995--2010

    Akrami F, Saeef MS, Zhang Q, et al (2020) Realistic re-evaluation of knowledge graph completion methods: An experimental study. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp 1995--2010

    work page 2020

  2. [2]

    Chaos: An Interdisciplinary Journal of Nonlinear Science 27(4):047,404

    Battiston F, Nicosia V, Chavez M, et al (2017) Multilayer motif analysis of brain networks. Chaos: An Interdisciplinary Journal of Nonlinear Science 27(4):047,404

    work page 2017

  3. [3]

    Physics reports 424(4-5):175--308

    Boccaletti S, Latora V, Moreno Y, et al (2006) Complex networks: Structure and dynamics. Physics reports 424(4-5):175--308

    work page 2006

  4. [4]

    Physics reports 544(1):1--122

    Boccaletti S, Bianconi G, Criado R, et al (2014) The structure and dynamics of multilayer networks. Physics reports 544(1):1--122

    work page 2014

  5. [5]

    In: 2023 IEEE 36th International Symposium on Computer-Based Medical Systems (CBMS), IEEE, pp 628--633

    Bougiatiotis K, Paliouras G (2023 a ) Analysing biomedical knowledge graphs using prime adjacency matrices. In: 2023 IEEE 36th International Symposium on Computer-Based Medical Systems (CBMS), IEEE, pp 628--633

    work page 2023

  6. [6]

    In: International Conference on Complex Networks and Their Applications, Springer, pp 75--86

    Bougiatiotis K, Paliouras G (2023 b ) Efficient complex network representation using prime numbers. In: International Conference on Complex Networks and Their Applications, Springer, pp 75--86

    work page 2023

  7. [7]

    In: Twenty-Fourth AAAI conference on artificial intelligence

    Carlson A, Betteridge J, Kisiel B, et al (2010) Toward an architecture for never-ending language learning. In: Twenty-Fourth AAAI conference on artificial intelligence

    work page 2010

  8. [8]

    In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp 179--189

    Cheng K, Liu J, Wang W, et al (2022) Rlogic: Recursive logical rule learning from knowledge graphs. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp 179--189

    work page 2022

Show all 62 references
  1. [9]

    arXiv preprint arXiv:160506523

    Cohen WW (2016) Tensorlog: A differentiable deductive database. arXiv preprint arXiv:160506523

    2016

  2. [10]

    Michigan State University Libraries

    Cooper M, Klymkowsky M (2020) CLUE: Chemistry, life, the universe and everything. Michigan State University Libraries

    2020

  3. [11]

    arXiv preprint arXiv:160701426

    Das R, Neelakantan A, Belanger D, et al (2016) Chains of reasoning over entities, relations, and text using recurrent neural networks. arXiv preprint arXiv:160701426

    2016

  4. [12]

    arXiv preprint arXiv:171105851

    Das R, Dhuliawala S, Zaheer M, et al (2017) Go for a walk and arrive at the answer: Reasoning over paths in knowledge bases using reinforcement learning. arXiv preprint arXiv:171105851

    2017

  5. [13]

    In: Proceedings of the AAAI Conference on Artificial Intelligence

    Dettmers T, Minervini P, Stenetorp P, et al (2018) Convolutional 2d knowledge graph embeddings. In: Proceedings of the AAAI Conference on Artificial Intelligence

    2018

  6. [14]

    arXiv preprint arXiv:201209699

    Dwivedi VP, Bresson X (2020) A generalization of transformer networks to graphs. arXiv preprint arXiv:201209699

    2020

  7. [15]

    Advances in Neural Information Processing Systems 35:22,326--22,340

    Dwivedi VP, Ramp \'a s ek L, Galkin M, et al (2022) Long range graph benchmark. Advances in Neural Information Processing Systems 35:22,326--22,340

    2022

  8. [16]

    Journal of Machine Learning Research 24(43):1--48

    Dwivedi VP, Joshi CK, Luu AT, et al (2023) Benchmarking graph neural networks. Journal of Machine Learning Research 24(43):1--48

    2023

  9. [17]

    arXiv preprint arXiv:211110625

    Edwards G, Nilsson S, Rozemberczki B, et al (2021) Explainable biomedical recommendations via reinforcement learning reasoning on knowledge graphs. arXiv preprint arXiv:211110625

    2021

  10. [18]

    Transactions on Machine Learning Research

    Gabrielsson RB, Yurochkin M, Solomon J (2023) Rewiring with positional encodings for graph neural networks. Transactions on Machine Learning Research

    2023

  11. [19]

    In: Proceedings of the 22nd international conference on World Wide Web, pp 413--422

    Gal \'a rraga LA, Teflioudi C, Hose K, et al (2013) Amie: association rule mining under incomplete evidence in ontological knowledge bases. In: Proceedings of the 22nd international conference on World Wide Web, pp 413--422

    2013

  12. [20]

    Science advances 2(2):e1500,445

    Gallotti R, Porter MA, Barthelemy M (2016) Lost in transportation: Information measures and cognitive limits in multilayer navigation. Science advances 2(2):e1500,445

    2016

  13. [21]

    Courier Corporation

    Gross JL, Tucker TW (2001) Topological graph theory. Courier Corporation

    2001

  14. [22]

    In: Proceedings of the ACM Web Conference 2023, pp 511--522

    Guo J, Du L, Bi W, et al (2023) Homophily-oriented heterogeneous graph rewiring. In: Proceedings of the ACM Web Conference 2023, pp 511--522

    2023

  15. [23]

    Journal of big data 7(1):94

    Hancock JT, Khoshgoftaar TM (2020) Catboost for big data: an interdisciplinary review. Journal of big data 7(1):94

    2020

  16. [24]

    In: International Conference on Machine Learning, PMLR, pp 12,724--12,745

    He X, Hooi B, Laurent T, et al (2023) A generalization of vit/mlp-mixer to graphs. In: International Conference on Machine Learning, PMLR, pp 12,724--12,745

    2023

  17. [25]

    Elife 6:e26,726

    Himmelstein DS, Lizee A, Hessler C, et al (2017) Systematic integration of biomedical knowledge prioritizes drugs for repurposing. Elife 6:e26,726

    2017

  18. [26]

    IEEE Transactions on Neural Networks and Learning Systems

    Ji S, Pan S, Cambria E, et al (2021) A survey on knowledge graphs: Representation, acquisition, and applications. IEEE Transactions on Neural Networks and Learning Systems

    2021

  19. [27]

    Journal of complex networks 2(3):203--271

    Kivel \"a M, Arenas A, Barthelemy M, et al (2014) Multilayer networks. Journal of complex networks 2(3):203--271

    2014

  20. [28]

    SIAM review 51(3):455--500

    Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM review 51(3):455--500

    2009

  21. [29]

    In: Proceedings of the 2011 conference on empirical methods in natural language processing, pp 529--539

    Lao N, Mitchell T, Cohen W (2011) Random walk inference and learning in a large scale knowledge base. In: Proceedings of the 2011 conference on empirical methods in natural language processing, pp 529--539

    2011

  22. [30]

    In: IEEE INFOCOM 2014-IEEE Conference on Computer Communications, IEEE, pp 1698--1706

    Liu G, Yang Q, Wang H, et al (2014) Assessment of multi-hop interpersonal trust in social networks by three-valued subjective logic. In: IEEE INFOCOM 2014-IEEE Conference on Computer Communications, IEEE, pp 1698--1706

    2014

  23. [31]

    arXiv preprint arXiv:220506454

    Lu S, Liu B, Mills KG, et al (2022) R5: Rule discovery with reinforced and recurrent relational reasoning. arXiv preprint arXiv:220506454

    2022

  24. [32]

    The VLDB Journal 33(1):131--161

    Meilicke C, Chekol MW, Betz P, et al (2024) Anytime bottom-up rule learning for large-scale knowledge graph completion. The VLDB Journal 33(1):131--161

    2024

  25. [33]

    In: International Conference on Machine Learning, PMLR, pp 24,737--24,755

    Michel G, Nikolentzos G, Lutzeyer JF, et al (2023) Path neural networks: Expressive and accurate graph neural networks. In: International Conference on Machine Learning, PMLR, pp 24,737--24,755

    2023

  26. [34]

    IEEE Robotics and Automation Letters 8(3):1531--1538

    Monninger T, Schmidt J, Rupprecht J, et al (2023) Scene: Reasoning about traffic scenes using heterogeneous graph neural networks. IEEE Robotics and Automation Letters 8(3):1531--1538

    2023

  27. [35]

    arXiv preprint arXiv:150406662

    Neelakantan A, Roth B, McCallum A (2015) Compositional vector space models for knowledge base completion. arXiv preprint arXiv:150406662

    2015

  28. [36]

    In: Proceedings of the AAAI Conference on Artificial Intelligence, pp 2975--2982

    Pirr \`o G (2020) Relatedness and tbox-driven rule learning in large knowledge bases. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp 2975--2982

    2020

  29. [37]

    arXiv preprint arXiv:201004029

    Qu M, Chen J, Xhonneux LP, et al (2020) Rnnlogic: Learning logic rules for reasoning on knowledge graphs. arXiv preprint arXiv:201004029

    2020

  30. [38]

    In: The Semantic Web--ISWC 2016: 15th International Semantic Web Conference, Kobe, Japan, October 17--21, 2016, Proceedings, Part II 15, Springer, pp 186--194

    Ristoski P, De Vries GKD, Paulheim H (2016) A collection of benchmark datasets for systematic evaluations of machine learning on the semantic web. In: The Semantic Web--ISWC 2016: 15th International Semantic Web Conference, Kobe, Japan, October 17--21, 2016, Proceedings, Part ...

    2016

  31. [39]

    Advances in Neural Information Processing Systems 32

    Sadeghian A, Armandpour M, Ding P, et al (2019) Drum: End-to-end differentiable rule mining on knowledge graphs. Advances in Neural Information Processing Systems 32

    2019

  32. [40]

    2009.07810

    Safavi T, Koutra D (2020) Codex: A comprehensive knowledge graph completion benchmark. 2009.07810

    2020 arXiv

  33. [41]

    arXiv preprint arXiv:200304078

    Sato R (2020) A survey on the expressive power of graph neural networks. arXiv preprint arXiv:200304078

    2020

  34. [42]

    Schlichtkrull M, Kipf TN, Bloem P, et al (2017) Modeling relational data with graph convolutional networks

    2017

  35. [43]

    Frontiers in pharmacology 8:880

    Sharma AK, Srivastava GN, Roy A, et al (2017) Toxim: a toxicity prediction tool for small molecules developed using machine learning and chemoinformatics approaches. Frontiers in pharmacology 8:880

    2017

  36. [44]

    Journal of Machine Learning Research 12(9)

    Shervashidze N, Schweitzer P, Van Leeuwen EJ, et al (2011) Weisfeiler-lehman graph kernels. Journal of Machine Learning Research 12(9)

    2011

  37. [45]

    Combinatorial scientific computing 18

    Spielman D (2012) Spectral graph theory. Combinatorial scientific computing 18

    2012

  38. [46]

    Data Mining and Knowledge Discovery 36(2):620--667

    Steenwinckel B, Vandewiele G, Weyns M, et al (2022) Ink: knowledge graph embeddings for node classification. Data Mining and Knowledge Discovery 36(2):620--667

    2022

  39. [47]

    In: Proceedings of the 2015 conference on empirical methods in natural language processing, pp 1499--1509

    Toutanova K, Chen D, Pantel P, et al (2015) Representing text for joint embedding of text and knowledge bases. In: Proceedings of the 2015 conference on empirical methods in natural language processing, pp 1499--1509

    2015

  40. [48]

    In: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp 1434--1444

    Toutanova K, Lin XV, Yih Wt, et al (2016) Compositional learning of embeddings for relation paths in knowledge base and text. In: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp 1434--1444

    2016

  41. [49]

    In: SEPDA2019, the 4th International workshop on semantics-powered data mining and analytics, pp 1--6

    Vandewiele G, Steenwinckel B, Ongenae F, et al (2019) Inducing a decision tree with discriminative paths to classify entities in a knowledge graph. In: SEPDA2019, the 4th International workshop on semantics-powered data mining and analytics, pp 1--6

    2019

  42. [50]

    arXiv preprint arXiv:171010903

    Veli c kovi \'c P, Cucurull G, Casanova A, et al (2017) Graph attention networks. arXiv preprint arXiv:171010903

    2017

  43. [51]

    In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining

    Wang H, Ren H, Leskovec J (2021) Relational message passing for knowledge graph completion. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. Association for Computing Machinery, New York, NY, USA, KDD '21, p 1697–1707

    2021

  44. [52]

    IEEE Transactions on Knowledge and Data Engineering 29(12):2724--2743

    Wang Q, Mao Z, Wang B, et al (2017) Knowledge graph embedding: A survey of approaches and applications. IEEE Transactions on Knowledge and Data Engineering 29(12):2724--2743

    2017

  45. [53]

    Welch E, Kitchen J, Orazbayev S, et al (2024) python-graphblas/python-graphblas: 2024.2.0

    2024

  46. [54]

    arXiv preprint arXiv:170706690

    Xiong W, Hoang T, Wang WY (2017) Deeppath: A reinforcement learning method for knowledge graph reasoning. arXiv preprint arXiv:170706690

    2017

  47. [55]

    Xu K, Hu W, Leskovec J, et al (2018) How powerful are graph neural networks? arXiv preprint arXiv:181000826

    2018

  48. [56]

    Advances in neural information processing systems 30

    Yang F, Yang Z, Cohen WW (2017) Differentiable learning of logical rules for knowledge base reasoning. Advances in neural information processing systems 30

    2017

  49. [57]

    In: Proceedings of the ACM web conference 2022, pp 912--924

    Zhang Y, Yao Q (2022) Knowledge graph reasoning with relational digraph. In: Proceedings of the ACM web conference 2022, pp 912--924

    2022

  50. [58]

    AI Open 1:57--81

    Zhou J, Cui G, Hu S, et al (2020) Graph neural networks: A review of methods and applications. AI Open 1:57--81

    2020

  51. [59]

    Advances in Neural Information Processing Systems 36

    Zhu Z, Yuan X, Galkin M, et al (2024) A* net: A scalable path-based reasoning approach for knowledge graphs. Advances in Neural Information Processing Systems 36

    2024

  52. [60]

    In: Journal of Physics: Conference Series, IOP Publishing, p 012016

    Zou X (2020) A survey on application of knowledge graph. In: Journal of Physics: Conference Series, IOP Publishing, p 012016

    2020

  53. [61]

    , " * write output.state after.block = add.period write newline

    ENTRY address archive author booktitle chapter doi edition editor eid eprint howpublished institution journal key keywords month note number organization pages publisher school series title type url volume year archivePrefix primaryClass adsurl adsnote version label extra.labe...

  54. [62]

    write newline

    " write newline "" before.all 'output.state := FUNCTION add.period duplicate empty 'skip "." * add.blank if FUNCTION if.digit duplicate "0" = swap duplicate "1" = swap duplicate "2" = swap duplicate "3" = swap duplicate "4" = swap duplicate "5" = swap duplicate "6" = swap dupl...

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.