{"as_of":"2026-08-08T12:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3d1e6789af0867a302e09f48a70aa4e3715c757fb155f7e52857c5d820e07475","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:27:19.945871Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.18971/citation-record","integrity":"/paper/2505.18971/integrity","json":"/paper/2505.18971/citation-record.json","paper":"/paper/2505.18971"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.06267","last_updated":"2020-10-29T09:48:19Z","snapshot_observed_at":"2026-07-06T09:37:37.898615Z","submitted_at":"2020-07-13T09:40:49Z","title":"BoxE: A Box Embedding Model for Knowledge Base Completion","version":2},"cited_work":{"arxiv_id":"2007.06267","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.06267","snapshot_observed_at":"2026-08-07T14:27:20.186371Z","title":"BoxE: A Box Embedding Model for Knowledge Base Completion","venue":"cs.AI","work_id":"d9bd787f-d5e2-4c28-a971-8f73f47c9dd5","year":2020},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.090120Z"},"links":{"cited_paper":"/paper/2007.06267","citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:c60962b6479c364b8917c218f7abdcc8746b383cd9ff6e52765810ffc1593432","observation_id":"df8860d3-1d7e-4db3-ba18-51c84f044992","resolution":{"observed_at":"2026-08-07T14:27:20.191589Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.09590","last_updated":"2019-08-24T15:36:04Z","snapshot_observed_at":"2026-07-06T07:29:22.932462Z","submitted_at":"2019-01-28T10:42:26Z","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.09590","snapshot_observed_at":"2026-08-07T14:27:19.149035Z","title":"Tucker: Tensor factorization for knowledge graph completion.arXiv preprint arXiv:1901.09590, 2019","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.149035Z"},"links":{"cited_paper":"/paper/1901.09590","citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:4564f8fc5a5557127601cc0cb7595677f325d08d61e201b1d4c454b9f6d5a7c9","observation_id":"72475677-cc99-4ac4-902b-fd218fcdb1e8","resolution":{"observed_at":"2026-08-07T14:27:19.149035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:20.363714Z","title":"Translating embeddings for modeling multi-relational data","venue":null,"work_id":"961bc415-0993-4baa-8667-80aba57873bf","year":null},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.268716Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:6155540ca3a6d6b65493f5af241656d3e47d647aec33ff9f427e5ce9c3a422ea","observation_id":"9278d7f9-cba0-4697-94c9-26d900eeba56","resolution":{"observed_at":"2026-08-07T14:27:20.369072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:19.409672Z","title":"Translating embeddings for modeling multi-relational data.Advances in neural information processing systems, 26, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.409672Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:a371d9f92041db5fc94c79ad22278c26e82b2eb3655a4a282098d30e52b81a5c","observation_id":"d92a9b89-6171-4978-af83-d56cf028ee48","resolution":{"observed_at":"2026-08-07T14:27:19.409672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:19.532346Z","title":"Convolutional 2d knowledge graph embeddings","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.532346Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:5e5d96565fb4d21b7a1b4ffec40207f7e5fffd5285bcd17ce6192b371d9ae9b4","observation_id":"a767eeb2-74d9-43be-8855-09f6d1cc0083","resolution":{"observed_at":"2026-08-07T14:27:19.532346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:20.319815Z","title":"Knowledge hypergraphs: prediction beyond binary relations","venue":null,"work_id":"89cc56bd-0271-4995-ad07-4892627c08b1","year":2021},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.668267Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:6d88fc80024208234b0ac032325d24d1275e1867028bbfd1a351cc570539a20c","observation_id":"ea8e6598-8b23-4855-a19d-154e9b520dc9","resolution":{"observed_at":"2026-08-07T14:27:20.324627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:20.307524Z","title":"Learning to represent knowledge graphs with gaussian embedding","venue":null,"work_id":"5f021975-1b62-4c28-8dd4-4758419220b8","year":2020},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.680877Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:5f2d6ee696dc39c482e0e3691b1ba3e910465a028c821813ef304b9108be193b","observation_id":"ad802a7d-3dd5-4ead-80ea-f14a5f99d92d","resolution":{"observed_at":"2026-08-07T14:27:20.311692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.04868","last_updated":"2018-10-26T03:38:08Z","snapshot_observed_at":"2026-07-06T06:23:16.798440Z","submitted_at":"2018-02-13T21:41:32Z","title":"SimplE Embedding for Link Prediction in Knowledge Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.04868","snapshot_observed_at":"2026-08-07T14:27:19.756905Z","title":"Simple embedding for link prediction in knowledge graphs, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.756905Z"},"links":{"cited_paper":"/paper/1802.04868","citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:303b67cb02fa5549fe75a2e8e904cb4a52e01bd9adfed9ac2da998cb6beed22d","observation_id":"e9a5cf1c-4518-4380-9cc2-d292cb5de5df","resolution":{"observed_at":"2026-08-07T14:27:19.756905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:19.879500Z","title":"Generalizing tensor decomposition for n-ary relational knowledge bases","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.879500Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:922fbfc48eb9a41af263aee4d027d61e971549e0c456bf91b435908b8816338a","observation_id":"b42b809c-6f11-423c-a42a-382be5b33bf4","resolution":{"observed_at":"2026-08-07T14:27:19.879500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:19.887111Z","title":"Learning attention-based embeddings for relation prediction in knowledge graphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.887111Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:f62b40a81b91868f7008a6b98d5dfa1481b253d6775930465ce6530e2da666c6","observation_id":"adb23a83-ecc2-419c-bfec-4889549d12c7","resolution":{"observed_at":"2026-08-07T14:27:19.887111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:19.890942Z","title":"A three-way model for collective learning on multi-relational data","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.890942Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:49179f446c17b1355c09100cf33508cf77ff1cfe0c92944c3eaf39f91c31dfbf","observation_id":"08c2de66-cbec-4e9d-942a-9c9a888c8031","resolution":{"observed_at":"2026-08-07T14:27:19.890942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:20.285076Z","title":"The blessing of structural noise: Can adversarial perturbations improve kge generalization? InNeurIPS, 2023","venue":null,"work_id":"2e26b7ba-df80-4d80-a894-5efe7af758e1","year":2023},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.894322Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:64672cef559fa8e6b40f1da9e47421cf35f957815e1d95f134f6fa6136458927","observation_id":"80f4562c-df61-4f06-a538-9208186c99b2","resolution":{"observed_at":"2026-08-07T14:27:20.290056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05969","last_updated":"2020-02-29T03:59:06Z","snapshot_observed_at":"2026-08-05T22:05:56.883118Z","submitted_at":"2020-02-14T11:20:10Z","title":"Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05969","snapshot_observed_at":"2026-08-07T14:27:19.897818Z","title":"Query2box: Reasoning over knowledge graphs in vector space using box embeddings.CoRR, abs/2002.05969, 2020","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.897818Z"},"links":{"cited_paper":"/paper/2002.05969","citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:4bc05483c1547327579bac77bd6a4144bcbfd267f1eaefea4b2f112c08fb1a1a","observation_id":"53169d78-a0cc-4271-9fff-739afb25218d","resolution":{"observed_at":"2026-08-07T14:27:19.897818Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:20.267392Z","title":"You can teach an old dog new tricks! on training knowledge graph embeddings","venue":null,"work_id":"a9a79b4a-fdbf-4a04-af8b-7a7da8758a53","year":2020},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.901617Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:7fa7b02396580496ddaf0bc9aa86b00fb1389dd79cd9590b60bf25500f766325","observation_id":"2476e861-9869-41d3-8ac8-6f92f816b0d8","resolution":{"observed_at":"2026-08-07T14:27:20.272147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:20.252415Z","title":"Reasoning with neu- ral tensor networks for knowledge base completion","venue":null,"work_id":"72d865b7-02de-45a6-88e0-e70e803ab746","year":2013},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.905445Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:0c2da6f146b03b84243739efc49c1ca445919a17cd1efe99865535916d316054","observation_id":"39a2cbdc-9151-41de-94c8-559a22b2a173","resolution":{"observed_at":"2026-08-07T14:27:20.258665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.10197","last_updated":"2019-02-26T20:15:09Z","snapshot_observed_at":"2026-08-06T13:43:56.202740Z","submitted_at":"2019-02-26T20:15:09Z","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.10197","snapshot_observed_at":"2026-08-07T14:27:19.908590Z","title":"Rotate: Knowledge graph embed- ding by relational rotation in complex space.arXiv preprint arXiv:1902.10197, 2019","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.908590Z"},"links":{"cited_paper":"/paper/1902.10197","citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:44e7cfc2671418e987a5015a016641b38a89eb2f31f65b3e2651d8559e1bb5cd","observation_id":"c20b06ed-ee47-4146-bb5e-76dafc968fe1","resolution":{"observed_at":"2026-08-07T14:27:19.908590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.05474","last_updated":"2019-05-14T09:10:46Z","snapshot_observed_at":"2026-08-01T19:19:03.693253Z","submitted_at":"2019-05-14T09:10:46Z","title":"Categories of coarse groups: quasi-homomorphisms and functorial coarse structures","version":1},"cited_work":{"arxiv_id":"1905.05474","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.05474","snapshot_observed_at":"2026-08-07T14:27:20.049969Z","title":"Categories of coarse groups: quasi-homomorphisms and functorial coarse structures","venue":"math.GN","work_id":"5e6089a1-b85a-4d03-a96e-55aad4264df7","year":2019},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.912508Z"},"links":{"cited_paper":"/paper/1905.05474","citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:b04c7d961de30061f7755d1342b961a30e555cbd0cccea8081e82303579f60a2","observation_id":"d680ddf0-c670-40fa-88dc-1ea349338e80","resolution":{"observed_at":"2026-08-07T14:27:20.054906Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:19.916677Z","title":"Complex embeddings for simple link prediction","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.916677Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:609d54856ef24e65abb471a222791480801b09cd2e38ee53dbbe7f6f996d44e6","observation_id":"5ff05ae2-1351-4716-b18e-0ec8e16f35d8","resolution":{"observed_at":"2026-08-07T14:27:19.916677Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:19.919863Z","title":"Knowledge graph embedding by translating on hyperplanes","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.919863Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:230c93545205f6b7788993b1ee50fff9e55cafe008e1915bc845b4dc6d1d761d","observation_id":"f05bc79b-3805-44e2-b966-32620fc1e126","resolution":{"observed_at":"2026-08-07T14:27:19.919863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.08642","last_updated":"2016-04-28T22:42:38Z","snapshot_observed_at":"2026-08-04T04:24:16.193259Z","submitted_at":"2016-04-28T22:42:38Z","title":"On the representation and embedding of knowledge bases beyond binary relations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.08642","snapshot_observed_at":"2026-08-07T14:27:19.923787Z","title":"On the representation and embedding of knowledge bases beyond binary relations.CoRR, abs/1604.08642, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.923787Z"},"links":{"cited_paper":"/paper/1604.08642","citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:567494e1e2a08df1e5965570915e475e6660aecf3af8079710fb037638e5a598","observation_id":"777caaec-a6c4-4102-af76-a5647627ab13","resolution":{"observed_at":"2026-08-07T14:27:19.923787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.01168","last_updated":"2020-05-03T19:23:28Z","snapshot_observed_at":"2026-07-06T09:17:16.234956Z","submitted_at":"2020-05-03T19:23:28Z","title":"High Dimensional Classification for Spatially Dependent Data with Application to Neuroimaging","version":1},"cited_work":{"arxiv_id":"2005.01168","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.01168","snapshot_observed_at":"2026-08-07T14:27:20.016451Z","title":"High Dimensional Classification for Spatially Dependent Data with Application to Neuroimaging","venue":"stat.ME","work_id":"59ee06ee-915e-479e-8821-d660b70ff0d8","year":2020},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.927172Z"},"links":{"cited_paper":"/paper/2005.01168","citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:6df120dd7ebe447fad3c57a03e74469907a2d947230b7a050bb22ead65319e81","observation_id":"8be941fb-883c-4e9c-b839-0de95d669260","resolution":{"observed_at":"2026-08-07T14:27:20.022293Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6575","last_updated":"2015-08-29T15:08:45Z","snapshot_observed_at":"2026-07-06T04:04:18.621124Z","submitted_at":"2014-12-20T01:37:16Z","title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6575","snapshot_observed_at":"2026-08-07T14:27:19.930657Z","title":"Embedding entities and relations for learning and inference in knowledge bases, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.930657Z"},"links":{"cited_paper":"/paper/1412.6575","citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:6fb1587b632e06f7bc85f9de4f8ec7c70dd54f261094657b0f3ac2d7211afaec","observation_id":"fe246d6f-353a-4ebb-9684-520268c629ff","resolution":{"observed_at":"2026-08-07T14:27:19.930657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:19.934963Z","title":"Quaternion knowledge graph embeddings.Advances in neural information processing systems, 32, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.934963Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:5f953b43c6a9053c297c00ffd0c946c1eaf11adfd6a317bdf22fa63722356f09","observation_id":"6d929b75-be7a-4e83-8bbc-358401ee632f","resolution":{"observed_at":"2026-08-07T14:27:19.934963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:20.214194Z","title":"Ripple effects of adversarial perturbations in knowledge graph completion","venue":null,"work_id":"d81c9573-c932-4d31-aa8e-17ad21fcfd77","year":2022},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.938373Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:3fa90c63ceb96f16525a0243e260d6ba12c98666cb3934c0c5a6db48915ea038","observation_id":"69dff52a-63cf-4978-a64c-9bba97e74f12","resolution":{"observed_at":"2026-08-07T14:27:20.218835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:20.200710Z","title":"Learning hierarchy-aware knowledge graph embeddings for link prediction","venue":null,"work_id":"40d4b47f-8df0-4e82-9e3a-7222972111be","year":2020},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.941702Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:b04704069f7e917f489d6bdad258788caed9026567352aa6bab317e4e2256f01","observation_id":"85a0255e-7727-47b2-939f-9f99a16b40e9","resolution":{"observed_at":"2026-08-07T14:27:20.205563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3233/jifs-202177","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:19.974137Z","title":"Z-paradox","venue":null,"work_id":"28059edd-8729-4248-b277-c286de833aa3","year":2021},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.945871Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:113e020a89261a360734f56a8567c6a335a561665d5aa55f23b37d1e9c79a74e","observation_id":"0e05b542-11bb-4c9d-ba8f-154c453ea80e","resolution":{"observed_at":"2026-08-07T14:27:19.979350Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:27:20.349372Z","title":null,"venue":null,"work_id":"dfee64c2-0c0a-4fe5-b12d-4feb041d28d9","year":2013},"citing_paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-07T14:27:19.344949Z"},"links":{"citing_paper":"/paper/2505.18971"},"observation_digest":"sha256:ba237db99c24f215b59345e6449947ea3198601ab9297d34e7c93e465b794925","observation_id":"a21da4ef-a580-471a-8ac9-3bbcc32a12f9","resolution":{"observed_at":"2026-08-07T14:27:20.354241Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.18971","last_updated":"2025-05-25T04:36:52Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T14:20:20.658473Z","submitted_at":"2025-05-25T04:36:52Z","title":"Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":15,"verified_exact":2,"verified_fuzzy":8},"total_outbound_references":27},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2505.18971."}