{"as_of":"2026-08-11T02:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7ef5329a7a1bae9070ced4c1b368236a439ffb84d456b35202aff46e923eb8cf","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T21:23:09.690870Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2501.19095/citation-record","integrity":"/paper/2501.19095/integrity","json":"/paper/2501.19095/citation-record.json","paper":"/paper/2501.19095"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T21:23:10.245996Z","title":"Boxe: A box embedding model for knowledge base completion","venue":null,"work_id":"de7e2677-6493-4c49-a290-bddaafac4f0f","year":2020},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.032319Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:b4e37908a5f5e8d5ca3f0e6ec0448df0a489c787749a8449f45194a4cc4eebfe","observation_id":"fc8fa9d3-698a-43a1-8c89-6dfac6546141","resolution":{"observed_at":"2026-08-09T21:23:10.249334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.235291Z","title":"PyKEEN 1.0: A Python Library for Training and Evaluating Knowledge Graph Embeddings","venue":null,"work_id":"4b06aa39-4d9c-49a9-94f1-034f45ee1ac4","year":2021},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.036791Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:6a2659d26b2ff29d658355a9c75d27808e110b6ec9a0e93f7b077a51256924b6","observation_id":"492d08f5-8560-48c3-98ce-35dd1587ca16","resolution":{"observed_at":"2026-08-09T21:23:10.239499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.223725Z","title":"PRRL: path rotation based knowledge graph representation learning method","venue":null,"work_id":"1717b91c-aa25-484e-a557-26026b424474","year":2021},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.040775Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:5c2f7447c5c175ee773948e9d93bf3c4b4457059ee71deedf9593b6d39695be0","observation_id":"3df8f20b-c1ac-46a0-8926-326c04fb7a43","resolution":{"observed_at":"2026-08-09T21:23:10.227641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.213629Z","title":"Freebase: a collaboratively created graph database for structuring human knowledge","venue":null,"work_id":"55028230-90da-481d-bf50-04b0a69dfe3b","year":2008},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.044722Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:f0958ce1fe59764f4a24d6a0ab01c8688d09cd7a2e31cbcbe5910d27cdcb16f3","observation_id":"b99c4880-9e9f-42e1-8d4c-6cd39119014a","resolution":{"observed_at":"2026-08-09T21:23:10.217252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.203373Z","title":"Translating embeddings for modeling multi-relational data","venue":null,"work_id":"446ef5bf-56f2-4ec6-9946-cf534c586f8a","year":2013},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.060243Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:2ecb242dd82c3bbd6feb09bddb1bfb036f622c6c1e3301b2ccaf52ef8b4c723b","observation_id":"ad6dc691-892f-4279-a3d7-44df03015e1c","resolution":{"observed_at":"2026-08-09T21:23:10.207053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.191796Z","title":"Meta relational learning for few-shot link prediction in knowledge graphs","venue":null,"work_id":"572db487-b2fe-49ff-ba3b-cbad508beb73","year":2019},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.082644Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:3acbf6a461e2ad22980b6408e3c8ca76c90dab082c78f98d9618ed395555cb25","observation_id":"729c1fc4-380a-465f-b426-a45ce085123f","resolution":{"observed_at":"2026-08-09T21:23:10.195791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.180463Z","title":"Pan, and Huajun Chen","venue":null,"work_id":"77994669-016c-44ff-a15e-e8292533a327","year":2023},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.089824Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:ea3960009ac638f9dbaa15f11513da72463dd86185d8d0d2a7c62eedbce46948","observation_id":"1c36120b-14a2-4f64-ada0-3ea7bca66764","resolution":{"observed_at":"2026-08-09T21:23:10.184318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.169345Z","title":"Go for a walk and arrive at the answer: Reasoning over paths in knowledge bases using reinforcement learning","venue":null,"work_id":"cdbe1c8b-1ac1-4250-8161-b824cd894341","year":2018},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.151117Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:88593c38e26467f14bcbdc46b13ded0b46e67c8fd6174c50ce148fee01443823","observation_id":"c038a5ae-170a-4af3-b6dc-a444b74c732a","resolution":{"observed_at":"2026-08-09T21:23:10.173353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.158270Z","title":"Convolutional 2d knowledge graph embeddings","venue":null,"work_id":"4d36750b-f45c-4fc5-8e0e-21d9ad5eaf32","year":2018},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.188625Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:7464ad1d70b0dcb143ddbcbf4c849b67d489d278f7abb610d743edfb0207e2cf","observation_id":"8992c171-5c0b-4ce0-bb1f-b4c40667da44","resolution":{"observed_at":"2026-08-09T21:23:10.162271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-07-30T09:12:38.100527Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-09T21:23:09.227952Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.227952Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:71af861beccc5bb928a39bf0456fd40e92fed5b2698dbc22d418ba28c9bff1cb","observation_id":"b93e9b3d-f8e2-4e6b-b416-f67c39980fa9","resolution":{"observed_at":"2026-08-09T21:23:09.227952Z","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-09T21:23:10.147801Z","title":"Denis, Jiapeng Wu, and William L","venue":null,"work_id":"f4716dc5-0d2e-4e56-9364-59f2867a5aae","year":2022},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.267423Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:2d1f70ca7a9cc9bd5ddae2485e7b3c869bed72c3fc405b246988a055b11bfee9","observation_id":"8294f894-095c-4ed3-9713-219820c03338","resolution":{"observed_at":"2026-08-09T21:23:10.151472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.136544Z","title":"A survey on knowledge graph-based recommender systems","venue":null,"work_id":"bda051b8-e12c-4414-b5cd-a42ccbd4e4d6","year":2022},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.304278Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:b0e2f32803d8ffe65aaf8793c2c37c4c1d6a1ea7f5b6e3eda675ad6348805578","observation_id":"3c3c4f07-d600-4b0b-8019-f5a75b3d64c1","resolution":{"observed_at":"2026-08-09T21:23:10.140628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.372697Z","title":"Long short-term memory","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.372697Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:76171c035ee2c4de0057db9ef15784ddca76f0c54b24025f1b6386fccb5fb9a0","observation_id":"e560b21f-06cc-4a93-a7d3-2537674c3054","resolution":{"observed_at":"2026-08-09T21:23:09.372697Z","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-09T21:23:10.120154Z","title":null,"venue":null,"work_id":"3a5a268c-0b82-4826-9391-f7d82a9c4d5d","year":2022},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.411348Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:3dc3bb3857749bf338e4571f7c8738c291d30272e343bd7b95f293276311af76","observation_id":"c783972f-a343-4e18-8ea0-bebd7baa677a","resolution":{"observed_at":"2026-08-09T21:23:10.123627Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.110204Z","title":"Path-specific knowledge graph embedding","venue":null,"work_id":"41842768-2658-4903-aa10-1071d325b32a","year":2018},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.419602Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:bf4a5036e1006d22defb7f5cec268430286ccfe2a406dc3724aa87ee55480c06","observation_id":"7d09c319-d2f4-4fd4-a330-45818d62983d","resolution":{"observed_at":"2026-08-09T21:23:10.113360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.101103Z","title":"Roboplanner: autonomous robotic action planning via knowledge graph queries","venue":null,"work_id":"b8304e00-9b56-4e88-a0c7-95e9a6d317a1","year":2019},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.426028Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:49410d4587da1e8b0e8a8824be7bd53f0829b49133e16849de57133e2c570e92","observation_id":"d6ebf11a-e1d7-497b-b3cf-66e2c8de1ff9","resolution":{"observed_at":"2026-08-09T21:23:10.104372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.092373Z","title":"Suchanek","venue":null,"work_id":"f4a122d4-4d71-4b92-9655-b4a2be11a7e4","year":2020},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.432118Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:6de8fd28bae9ba32954ac4d3e957ceadde2ac38548dbb6ac93cfe51d4d6d0393","observation_id":"675a3a97-268b-4dba-bf3d-21698b62156d","resolution":{"observed_at":"2026-08-09T21:23:10.095210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.082849Z","title":"Improving knowledge graph completion via increasing embedding interactions","venue":null,"work_id":"39877681-749c-4640-a6f4-20b5177e64f1","year":2022},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.437727Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:de1c0e295c9482df7bd5a344413477b2a15778092e4437af5850edf9ee7b91c3","observation_id":"23af0a5c-4fae-4e71-b8fc-ee726bb702f8","resolution":{"observed_at":"2026-08-09T21:23:10.086351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.072931Z","title":"Modeling relation paths for representation learning of knowledge bases","venue":null,"work_id":"3cb777ae-6b33-4820-9f39-6f2c67225206","year":2015},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.445211Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:a2a72c09010f9254d0f86e9ccb572a374242d305bffb2eb4e31d6baa2e6bb0d0","observation_id":"c035f3b7-9ebd-4b8e-bb8d-45495e941b9f","resolution":{"observed_at":"2026-08-09T21:23:10.076543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.062662Z","title":"Relation path embedding in knowledge graphs","venue":null,"work_id":"c796111b-feda-49cd-8264-b852c6a95ba4","year":2019},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.452580Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:5b697ecc8f168079aa6d90fab3fcde32bfce82b63d9c5fc9f19d4a5e3bfb7c2f","observation_id":"49ab0519-41fa-4ed1-87be-7e328fdac2ba","resolution":{"observed_at":"2026-08-09T21:23:10.066639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.052492Z","title":"Adapting meta knowledge graph information for multi-hop reasoning over few-shot relations","venue":null,"work_id":"112c3f2c-3939-439a-bd88-c58962414a72","year":2019},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.456733Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:075c8c21cb79c14ef4c1aa1bcfe38116615a14165360ed74ab458b6a28ac4498","observation_id":"cef57d20-096b-4359-a7a2-d6de2f5e3802","resolution":{"observed_at":"2026-08-09T21:23:10.056235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.042513Z","title":"Fine-grained evaluation of rule- and embedding-based systems for knowledge graph completion","venue":null,"work_id":"68b7f661-1083-4991-b712-a9a181bba5ab","year":2018},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.460133Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:d9a4a79984789379e39486d231e9432faf1a65cf8d1f7cee5ee1337056cb887f","observation_id":"6ff37849-f27f-481f-9664-df80a503d1c2","resolution":{"observed_at":"2026-08-09T21:23:10.046082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.031724Z","title":"Anytime bottom-up rule learning for knowledge graph completion","venue":null,"work_id":"7a01b7f7-197c-4ada-bc6a-9ced3e41be61","year":2019},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.463176Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:ce04d0adbfe4f61796f0ab4e7fe356baed47eff60472b02abf674d62ee7c0b1e","observation_id":"ae708340-0731-4c40-b751-9fa219238d48","resolution":{"observed_at":"2026-08-09T21:23:10.035492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.021341Z","title":"Wordnet: a lexical database for english","venue":null,"work_id":"45755d13-b8df-4e9e-a2ed-aeb327527e63","year":1995},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.466557Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:015995b196e82a3d5148e06e83ba23df9802e430579559940d789a91d1a9c4bf","observation_id":"ece9ec74-f59a-435d-b62f-bea80362c562","resolution":{"observed_at":"2026-08-09T21:23:10.025046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:10.011060Z","title":"SKILL: structured knowledge infusion for large language models","venue":null,"work_id":"104387ce-8f98-476a-a567-58e3d918a4e0","year":2022},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.470288Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:4a93250c4b794c9ee6ecc99c3f640b5b83a35ff5bb1ad4569ed63074f135688d","observation_id":"f1adff70-0f58-4047-84cd-9f5d6035b8b5","resolution":{"observed_at":"2026-08-09T21:23:10.014829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.999963Z","title":"Compositional vector space models for knowledge base completion","venue":null,"work_id":"6c88e231-7cfe-4a90-8c58-db763504c3c3","year":2015},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.473563Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:66800af285a6fa19aacbfc769260edb3b93fb241802f95de6139c377fe7d5b47","observation_id":"0c38b857-b3a2-43b9-a9a5-991fb5a8fded","resolution":{"observed_at":"2026-08-09T21:23:10.003894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.990122Z","title":null,"venue":null,"work_id":"4a6635de-f243-4932-ac46-dc706e81c937","year":2016},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.476864Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:537c215aa3bef89f191151ca0f07221b69a940fbc71fa130e8b599176cd3bd94","observation_id":"0dcb4f30-89a8-49d7-b8ae-8f9ddf7be8a3","resolution":{"observed_at":"2026-08-09T21:23:09.993723Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.979207Z","title":"Rule-guided compositional representation learning on knowledge graphs","venue":null,"work_id":"c31c3304-6fc4-4979-bb8a-8d96b692e222","year":2020},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.480650Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:f506991fa64f2824249a9d0d3fb5a8eba6a0d7cb194a9a9e5a56bbc6cde6d4e8","observation_id":"3f15e3d8-e0c6-427d-a50f-99f537b9ca53","resolution":{"observed_at":"2026-08-09T21:23:09.983409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.969543Z","title":"SAFRAN: an interpretable, rule-based link prediction method outperforming embedding models","venue":null,"work_id":"ae09fc38-8cb8-45aa-a4e9-d555c119a710","year":2021},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.505818Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:d811d73a8d9bf4e1a5ab7b1d0b241a1dda37614669316a6f24a471a6a5773589","observation_id":"c8839b70-723c-4978-b1aa-71b113d4f78f","resolution":{"observed_at":"2026-08-09T21:23:09.972761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.960496Z","title":"Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala","venue":null,"work_id":"021e136a-5669-401a-a14f-c6398db20fa2","year":2019},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.545497Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:7ff50ffbde7dc5c64f025738c6ac458589bb7d7e8c90b257b03d390177151777","observation_id":"dc8e020d-e211-4a4a-9c27-df2001bf25a8","resolution":{"observed_at":"2026-08-09T21:23:09.963600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.949230Z","title":"You CAN teach an old dog new tricks! on training knowledge graph embeddings","venue":null,"work_id":"13f5bcf2-d10b-49fc-b197-600cd1204df0","year":2020},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.580574Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:b24f0e591a0e945b2961f4a5e2af5ffa682fac0bd91d15a660883aa0e2caa7b0","observation_id":"f23570c0-e275-468b-bb5f-16cfd92b41f2","resolution":{"observed_at":"2026-08-09T21:23:09.953355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.07810","last_updated":"2020-10-06T09:10:10Z","snapshot_observed_at":"2026-08-10T00:27:04.070269Z","submitted_at":"2020-09-16T17:08:23Z","title":"CoDEx: A Comprehensive Knowledge Graph Completion Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.07810","snapshot_observed_at":"2026-08-09T21:23:09.617564Z","title":"Codex: A comprehensive knowledge graph completion benchmark","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.617564Z"},"links":{"cited_paper":"/paper/2009.07810","citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:1023bd59b50c41e8ee536fdc69d65e1e1da416421504b197439bb255d3bc702c","observation_id":"6ee539b2-220b-4c7e-958f-aa0c77dfbf49","resolution":{"observed_at":"2026-08-09T21:23:09.617564Z","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-09T21:23:09.937835Z","title":"Learning multi-granularity and adaptive representation for knowledge graph reasoning","venue":null,"work_id":"c12578ff-25c0-4959-a58a-ce94084e12cf","year":2024},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.620874Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:67b032f55a6ec4580395fec5c470044b303230c24535de269d0217bf2c1d2924","observation_id":"9517d067-187c-409e-bf00-76a87be342e8","resolution":{"observed_at":"2026-08-09T21:23:09.941965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.925988Z","title":"M-walk: Learning to walk over graphs using monte carlo tree search","venue":null,"work_id":"d1c4de5e-e0d9-4be4-b687-40fa7da8b105","year":2018},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.623754Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:fc8744262b1b84fb72da766f3d2b847bb88e887bf111b1b54de9449f9247aa16","observation_id":"d69ad0a6-92a6-48a3-a63f-58ca5d285395","resolution":{"observed_at":"2026-08-09T21:23:09.930072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.914262Z","title":"Rotate: Knowledge graph embedding by relational rotation in complex space","venue":null,"work_id":"4b422fa2-4667-42c3-ab34-0242e65d8197","year":2019},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.626644Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:e79d2f79a2e0837fd80061d70aac70882c1d4d3874094ce81057676b8b0c57b0","observation_id":"37fe8a83-8474-47eb-828b-b115fd277458","resolution":{"observed_at":"2026-08-09T21:23:09.918712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.903331Z","title":"Teru, Etienne G","venue":null,"work_id":"677fa154-932a-43c1-8ced-87e10108114c","year":2020},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.629711Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:188c47017d2869e3babe7bfd48ae023878c51aa94f6938cc288dba0e2a9190b1","observation_id":"83238aeb-a2a4-457d-a99c-3be02ed32b12","resolution":{"observed_at":"2026-08-09T21:23:09.906984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.891942Z","title":"Representing text for joint embedding of text and knowledge bases","venue":null,"work_id":"d760822c-46e6-4d19-aea2-ec65269bb111","year":2015},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.633409Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:48eb096fc046a86a2e3fe61dc02fa3d44ce221615ee9baf53bf7ada18c7c17da","observation_id":"5f562b84-6a32-44ce-9909-de2c8bdaf786","resolution":{"observed_at":"2026-08-09T21:23:09.896330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.881501Z","title":"Compositional learning of embeddings for relation paths in knowledge base and text","venue":null,"work_id":"46c9cd34-15e9-4595-bbe2-192ef19792a0","year":2016},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.637259Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:ae485d2513293c6f3ca4a3c6d88ee47a648fef7606ec55fb594688d93f16f793","observation_id":"4d8f5ef2-41bf-435a-9e5b-77b7d52d66da","resolution":{"observed_at":"2026-08-09T21:23:09.885254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.640901Z","title":"Complex embeddings for simple link prediction","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.640901Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:853ce2f8f5f796ae9f6c489d3e57ccc551f28467709e98dc12db9b54ece62d7d","observation_id":"1a991f2b-f5c6-45bb-865d-4c87b96e3964","resolution":{"observed_at":"2026-08-09T21:23:09.640901Z","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-09T21:23:09.864084Z","title":"Talukdar","venue":null,"work_id":"d3dbbb02-dbcb-43be-b08f-d4466c9e874c","year":2020},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.644564Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:05891ad67dcb652c7c771d6fd6987d8f93b2510b0a0434fef5226c58e9fb0154","observation_id":"b1eb0fe6-9e13-4b02-b193-8bb4a9e8dd17","resolution":{"observed_at":"2026-08-09T21:23:09.867710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.648251Z","title":"Gomez, Lukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.648251Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:4dac89a71dcfb9e733e7318a982eda281e6d8f26962cd8f2d7029d4175b016c4","observation_id":"890c623e-6b63-432e-9637-435c65009a5b","resolution":{"observed_at":"2026-08-09T21:23:09.648251Z","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-09T21:23:09.847179Z","title":"Relational message passing for knowledge graph completion","venue":null,"work_id":"b0c3cb14-105e-4677-9d61-615757f56808","year":2021},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.651729Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:5d3112bff262bccc87c7e99fc1634c92f5700fd092cee2eff6e697ef6422240a","observation_id":"7481b2f1-7410-416a-a34d-2d5bbe5d9ef5","resolution":{"observed_at":"2026-08-09T21:23:09.851220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.836893Z","title":"Deeppath: A reinforcement learning method for knowledge graph reasoning","venue":null,"work_id":"e8623fc5-26a8-4f9d-9098-57fcba713ef2","year":2017},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.655133Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:a3a95fd27c64d9065149dfcedf9f34ce861e83d25774f159e4746bd45e413fca","observation_id":"c7511388-3072-491b-b2d5-982c634b2a8e","resolution":{"observed_at":"2026-08-09T21:23:09.840538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.827143Z","title":"One-shot relational learning for knowledge graphs","venue":null,"work_id":"fa52de48-8676-467c-bac0-904a29cf04cb","year":2018},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.658919Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:1f4a95c3b3608141a3aae5bb5a529f6b26c8f5e3d44e0038180b3b38909b1ac8","observation_id":"61d17839-f54f-4e5e-a23b-96bc36d9fea3","resolution":{"observed_at":"2026-08-09T21:23:09.830707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.816918Z","title":"Subgraph neighboring relations infomax for inductive link prediction on knowledge graphs","venue":null,"work_id":"51281766-e6e1-4fac-bb8d-11affdbd6e51","year":2022},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.662506Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:afe8b6903d0553d6619480712fde9c32ade34e22c3c66005f88b5abdd1d3da2e","observation_id":"f9ae32bc-b226-4142-986b-f9ae61bd7839","resolution":{"observed_at":"2026-08-09T21:23:09.820641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.808423Z","title":"Modeling complex relationship paths for knowledge graph completion","venue":null,"work_id":"18848f21-d974-44f5-b341-39ce37cdd1db","year":2018},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.666077Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:02f339cf4065c7f402f2e1130f16522e1f0e326796f82174750dbf63dcde1cae","observation_id":"8c6f8cbe-5996-4cce-9fdd-cb3b9c9f8911","resolution":{"observed_at":"2026-08-09T21:23:09.811420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.799019Z","title":"Knowledge graph reasoning with relational digraph","venue":null,"work_id":"700c7755-e356-4190-b236-488ffc01dab2","year":2022},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.669484Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:8f2aa940e8d18434993e7918a76b28b5b3db9993587f07ab1fac6360dff3e9c0","observation_id":"64453afd-56f3-4e63-affe-d2b7c73b0abe","resolution":{"observed_at":"2026-08-09T21:23:09.802222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.789155Z","title":"Discriminative path-based knowledge graph embedding for precise link prediction","venue":null,"work_id":"4986d58a-f305-4514-9bde-7595d0eac116","year":2018},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.672958Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:597b36421bb03502b3644b59c5343883892144262c65ef52aa08843e32c6237c","observation_id":"7acacd08-8665-4125-8d7e-1d7d16043b8e","resolution":{"observed_at":"2026-08-09T21:23:09.792739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.778722Z","title":"Path-rotate: Knowledge graph embedding by relational rotation of path in complex space","venue":null,"work_id":"0522d504-e56a-4d29-91d4-763241a28743","year":2021},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.676472Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:59a244bed73f957720ef6765b66cbf859884996a43e61f43dd51209fc6d71333","observation_id":"7d11ca1d-8f71-445d-b3dd-5db714a8918f","resolution":{"observed_at":"2026-08-09T21:23:09.782627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.768191Z","title":null,"venue":null,"work_id":"b37d65db-0b82-4818-95c6-8539385f1981","year":2021},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.680014Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:c5b8bc6c7414d7f745f4070c5f4148ed4e37af8e72ce6dc11a3a260aebf459f8","observation_id":"5f39d4a0-bd14-4d7e-a04b-502c4c048a4e","resolution":{"observed_at":"2026-08-09T21:23:09.772045Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.757275Z","title":"A*net: a scalable path-based reasoning approach for knowledge graphs","venue":null,"work_id":"71ffec14-eccb-426d-9392-2bf7888bf2ac","year":2024},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.683422Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:1ab361da578d05bfca8cb1d41bc1c0ab88de77a18a254579d906fa0a99c06a14","observation_id":"a1011713-5ff8-43e3-9167-ffa157d0d507","resolution":{"observed_at":"2026-08-09T21:23:09.761203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.743276Z","title":"A survey on application of knowledge graph","venue":null,"work_id":"8211b308-317c-43c2-93c6-6c220b792e8f","year":2020},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.687277Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:2166aff8a03c8f5369d075e591aaad2d4e3fbff5232348ad865f7a13a6c6c148","observation_id":"c5ab970a-9817-47d1-97a0-b307e22b2eb0","resolution":{"observed_at":"2026-08-09T21:23:09.749421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:23:09.690870Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-09T21:23:09.690870Z"},"links":{"citing_paper":"/paper/2501.19095"},"observation_digest":"sha256:4664217fc07ce6a9cf0868d82ec546b16fa8cf528b3e46bdd08f7cc3ae29e330","observation_id":"e58980c7-dedc-494e-bed9-1e57e3faee86","resolution":{"observed_at":"2026-08-09T21:23:09.690870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.19095","last_updated":"2025-01-31T12:41:02Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-10T00:27:20.752933Z","submitted_at":"2025-01-31T12:41:02Z","title":"PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":44},"total_outbound_references":53},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2501.19095."}