Paper Citation Record · LEDGER

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE

As of 18 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2505.18971.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2505.18971 v1

Coverage vector

measured 27 of 27 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T14:27:19.945871Z

measured 27 of 27 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

27 of 27 outbound references displayed

verified exact2
verified fuzzy8
unresolved15
parse uncertain0
malformed identifier0
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation df8860d3-1d7e-4db3-ba18-51c84f044992 · outbound

This paper cites BoxE: A Box Embedding Model for Knowledge Base Completion.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE BoxE: A Box Embedding Model for Knowledge Base Completion

Reference 1

Resolution: verified exact; local_arxiv, observed 2026-08-07T14:27:20.191589Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 72475677-cc99-4ac4-902b-fd218fcdb1e8 · outbound

This paper cites TuckER: Tensor Factorization for Knowledge Graph Completion.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE TuckER: Tensor Factorization for Knowledge Graph Completion

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.149035Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9278d7f9-cba0-4697-94c9-26d900eeba56 · outbound

This paper cites Translating embeddings for modeling multi-relational data.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Translating embeddings for modeling multi-relational data

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T14:27:20.369072Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation d92a9b89-6171-4978-af83-d56cf028ee48 · outbound

This paper cites Translating embeddings for modeling multi-relational data.Advances in neural information processing systems, 26, 2013.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Translating embeddings for modeling multi-relational data.Advances in neural information processing systems, 26, 2013

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.409672Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a767eeb2-74d9-43be-8855-09f6d1cc0083 · outbound

This paper cites Convolutional 2d knowledge graph embeddings.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Convolutional 2d knowledge graph embeddings

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.532346Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ea8e6598-8b23-4855-a19d-154e9b520dc9 · outbound

This paper cites Knowledge hypergraphs: prediction beyond binary relations.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Knowledge hypergraphs: prediction beyond binary relations

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T14:27:20.324627Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation ad802a7d-3dd5-4ead-80ea-f14a5f99d92d · outbound

This paper cites Learning to represent knowledge graphs with gaussian embedding.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Learning to represent knowledge graphs with gaussian embedding

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T14:27:20.311692Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation e9a5cf1c-4518-4380-9cc2-d292cb5de5df · outbound

This paper cites SimplE Embedding for Link Prediction in Knowledge Graphs.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE SimplE Embedding for Link Prediction in Knowledge Graphs

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.756905Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b42b809c-6f11-423c-a42a-382be5b33bf4 · outbound

This paper cites Generalizing tensor decomposition for n-ary relational knowledge bases.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Generalizing tensor decomposition for n-ary relational knowledge bases

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.879500Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation adb23a83-ecc2-419c-bfec-4889549d12c7 · outbound

This paper cites Learning attention-based embeddings for relation prediction in knowledge graphs.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Learning attention-based embeddings for relation prediction in knowledge graphs

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.887111Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08c2de66-cbec-4e9d-942a-9c9a888c8031 · outbound

This paper cites A three-way model for collective learning on multi-relational data.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE A three-way model for collective learning on multi-relational data

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.890942Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 80f4562c-df61-4f06-a538-9208186c99b2 · outbound

This paper cites The blessing of structural noise: Can adversarial perturbations improve kge generalization? InNeurIPS, 2023.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE The blessing of structural noise: Can adversarial perturbations improve kge generalization? InNeurIPS, 2023

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T14:27:20.290056Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 53169d78-a0cc-4271-9fff-739afb25218d · outbound

This paper cites Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.897818Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2476e861-9869-41d3-8ac8-6f92f816b0d8 · outbound

This paper cites You can teach an old dog new tricks! on training knowledge graph embeddings.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE You can teach an old dog new tricks! on training knowledge graph embeddings

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T14:27:20.272147Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 39a2cbdc-9151-41de-94c8-559a22b2a173 · outbound

This paper cites Reasoning with neu- ral tensor networks for knowledge base completion.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Reasoning with neu- ral tensor networks for knowledge base completion

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T14:27:20.258665Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation c20b06ed-ee47-4146-bb5e-76dafc968fe1 · outbound

This paper cites RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.908590Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d680ddf0-c670-40fa-88dc-1ea349338e80 · outbound

This paper cites Categories of coarse groups: quasi-homomorphisms and functorial coarse structures.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Categories of coarse groups: quasi-homomorphisms and functorial coarse structures

Reference 17

Resolution: metadata mismatch; local_arxiv, observed 2026-08-07T14:27:20.054906Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 5ff05ae2-1351-4716-b18e-0ec8e16f35d8 · outbound

This paper cites Complex embeddings for simple link prediction.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Complex embeddings for simple link prediction

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.916677Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f05bc79b-3805-44e2-b966-32620fc1e126 · outbound

This paper cites Knowledge graph embedding by translating on hyperplanes.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Knowledge graph embedding by translating on hyperplanes

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.919863Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 777caaec-a6c4-4102-af76-a5647627ab13 · outbound

This paper cites On the representation and embedding of knowledge bases beyond binary relations.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE On the representation and embedding of knowledge bases beyond binary relations

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.923787Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8be941fb-883c-4e9c-b839-0de95d669260 · outbound

This paper cites High Dimensional Classification for Spatially Dependent Data with Application to Neuroimaging.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE High Dimensional Classification for Spatially Dependent Data with Application to Neuroimaging

Reference 21

Resolution: metadata mismatch; local_arxiv, observed 2026-08-07T14:27:20.022293Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation fe246d6f-353a-4ebb-9684-520268c629ff · outbound

This paper cites Embedding Entities and Relations for Learning and Inference in Knowledge Bases.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Embedding Entities and Relations for Learning and Inference in Knowledge Bases

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.930657Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6d929b75-be7a-4e83-8bbc-358401ee632f · outbound

This paper cites Quaternion knowledge graph embeddings.Advances in neural information processing systems, 32, 2019.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Quaternion knowledge graph embeddings.Advances in neural information processing systems, 32, 2019

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:19.934963Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 69dff52a-63cf-4978-a64c-9bba97e74f12 · outbound

This paper cites Ripple effects of adversarial perturbations in knowledge graph completion.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Ripple effects of adversarial perturbations in knowledge graph completion

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T14:27:20.218835Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 85a0255e-7727-47b2-939f-9f99a16b40e9 · outbound

This paper cites Learning hierarchy-aware knowledge graph embeddings for link prediction.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Learning hierarchy-aware knowledge graph embeddings for link prediction

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T14:27:20.205563Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 0e05b542-11bb-4c9d-ba8f-154c453ea80e · outbound

This paper cites Z-paradox.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Z-paradox

Reference 26

Resolution: verified exact; doi, observed 2026-08-07T14:27:19.979350Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation a21da4ef-a580-471a-8ac9-3bbcc32a12f9 · outbound

This paper cites an unresolved cited work.

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE Unresolved cited work

Reference 2013

Resolution: unresolved; raw_fallback, observed 2026-08-07T14:27:20.354241Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Pith citing papers

No inbound Pith citation observations are available.