{"as_of":"2026-08-11T20:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d74568e902dfc92285f69108a880ea46a2e88aedfe22cb53b8370671825880cc","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:04:06.929115Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2507.03947/citation-record","integrity":"/paper/2507.03947/integrity","json":"/paper/2507.03947/citation-record.json","paper":"/paper/2507.03947"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1409.0473","last_updated":"2016-05-19T21:53:22Z","snapshot_observed_at":"2026-07-06T03:53:10.336430Z","submitted_at":"2014-09-01T16:33:02Z","title":"Neural Machine Translation by Jointly Learning to Align and Translate","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.0473","snapshot_observed_at":"2026-08-06T20:04:01.357849Z","title":"Neural machine translation by jointly learning to align and translate","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:01.357849Z"},"links":{"cited_paper":"/paper/1409.0473","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:6b84892ee87e261f2381b12d0783b0540bed0ee8022c8a05b73215f12ec5c33f","observation_id":"845dbd86-518b-4c75-9f32-5c30e0f7c351","resolution":{"observed_at":"2026-08-06T20:04:01.357849Z","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-06T20:04:13.864071Z","title":"Video suggestion and discovery for youtube: taking random walks through the view graph","venue":null,"work_id":"4fce881a-06eb-4a11-b135-2c8baf324c6f","year":2008},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:01.492790Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:059a53bf97b6a727dde6b0d1e9847d0a2720405c3d01a3c6bd9658c13b34a266","observation_id":"2bfe5b38-ee85-4557-9aa8-2c7399e52687","resolution":{"observed_at":"2026-08-06T20:04:13.921746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.00816","last_updated":"2018-06-01T13:18:29Z","snapshot_observed_at":"2026-08-09T19:51:59.440377Z","submitted_at":"2018-03-02T11:49:32Z","title":"NetGAN: Generating Graphs via Random Walks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.00816","snapshot_observed_at":"2026-08-06T20:04:01.597720Z","title":"Netgan: Generating graphs via random walks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:01.597720Z"},"links":{"cited_paper":"/paper/1803.00816","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:18fd2e926bcd3c223b2d6e67a0d8b4f1123340e15ccb531e9c58034d2c8c05c0","observation_id":"cc84f3a8-8cd3-4509-b47f-e7c4e35f4689","resolution":{"observed_at":"2026-08-06T20:04:01.597720Z","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-06T20:04:13.698146Z","title":"Translating embeddings for modeling multi-relational data","venue":null,"work_id":"78131b7f-ab36-4e9d-9e6c-c53dab3db03f","year":2013},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:01.713192Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:73590b27bd0381f0c425807ca541a73c4c726d6410f7eac91c25e4692e7bd4f3","observation_id":"b85d79d8-d498-42ec-b4eb-32c1146a2dac","resolution":{"observed_at":"2026-08-06T20:04:13.771638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:13.524488Z","title":"A comprehensive survey of graph embedding: Prob- lems, techniques, and applications","venue":null,"work_id":"d0e78645-bae9-487b-841b-52f79c443d22","year":2018},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:01.831733Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:ccc11da56c2d14017b787dcc1ca10f84ec26b043c1f000a75f65d6084909f845","observation_id":"2a5d4dc8-6af4-4b08-9d34-d7e1f96f9fe2","resolution":{"observed_at":"2026-08-06T20:04:13.595499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:13.370459Z","title":"Grarep: Learning graph representations with global structural information","venue":null,"work_id":"dacee8dd-55d5-4eff-a2a0-ba051d1f0f04","year":null},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:01.962001Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:357328b3bf207b186368a078ab42fc11550c0bcad9a4c9ae767cb3f8487a3e9a","observation_id":"14fea2b0-7ac0-475d-b888-f0553bddf2a3","resolution":{"observed_at":"2026-08-06T20:04:13.454323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03584","last_updated":"2020-01-10T09:06:09Z","snapshot_observed_at":"2026-08-11T16:28:23.001625Z","submitted_at":"2019-11-08T23:48:38Z","title":"On the Relationship between Self-Attention and Convolutional Layers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03584","snapshot_observed_at":"2026-08-06T20:04:02.100755Z","title":"On the relationship between self-attention and convolutional layers","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:02.100755Z"},"links":{"cited_paper":"/paper/1911.03584","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:6ff63999d5e86d4720723f88d8e39cfc574e67bd301ce397ce429d87a385043f","observation_id":"9bbb0a99-a740-43d8-af83-abfb3903a314","resolution":{"observed_at":"2026-08-06T20:04:02.100755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.16362","last_updated":"2021-05-20T14:48:30Z","snapshot_observed_at":"2026-08-09T06:13:20.021836Z","submitted_at":"2020-06-29T20:28:52Z","title":"Multi-Head Attention: Collaborate Instead of Concatenate","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.16362","snapshot_observed_at":"2026-08-06T20:04:02.222947Z","title":"Multi-head attention: Collaborate instead of concatenate","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:02.222947Z"},"links":{"cited_paper":"/paper/2006.16362","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:1d2807169f95aa3dbc3692a34653a020cc4c71f82ec253974b57f8a584b80099","observation_id":"3217490d-0618-4117-b085-1b8e2a061a55","resolution":{"observed_at":"2026-08-06T20:04:02.222947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.01476","last_updated":"2018-07-04T09:53:46Z","snapshot_observed_at":"2026-08-02T12:35:52.676931Z","submitted_at":"2017-07-05T17:18:17Z","title":"Convolutional 2D Knowledge Graph Embeddings","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.01476","snapshot_observed_at":"2026-08-06T20:04:02.341830Z","title":"Convolutional 2d knowledge graph embed- dings","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:02.341830Z"},"links":{"cited_paper":"/paper/1707.01476","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:c98e2646ae4036bf4ae0ffacf922c0b6ac71969055e2471741f4257b69e4d184","observation_id":"e2b4810e-0cdc-48d6-aaf5-e5f601a1214f","resolution":{"observed_at":"2026-08-06T20:04:02.341830Z","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-06T20:04:13.069657Z","title":"Convolutional 2d knowledge graph em- beddings","venue":null,"work_id":"9e58d307-189e-438c-b1bc-9cbcd5b9e0e0","year":2018},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:02.452808Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:3d91f14e7484ac06aff04320a2c0ffb79d40a65a8236b8f2c3dbf03f419e41a0","observation_id":"5db983c9-d7e0-453b-a072-c032f9dd5cb7","resolution":{"observed_at":"2026-08-06T20:04:13.228431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:12.809350Z","title":"Fast rule mining in ontological knowledge bases with amie","venue":null,"work_id":"25f28d4a-1d77-4abd-9f33-ccd46a616147","year":2015},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:02.578912Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:078ff5fcd1609bd8febadb432974a44c8be7f563832b091ecc7cfe4f2f5306ee","observation_id":"9aa745c3-f2d8-468e-9a71-930b9cee39d7","resolution":{"observed_at":"2026-08-06T20:04:12.916829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:12.589752Z","title":"Introducing the Knowledge Graph: things, not strings, 2020 (accessed on August 27, 2020)","venue":null,"work_id":"f373b83e-30fc-4f30-8f49-4bfd3809af9a","year":2020},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:02.709229Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:870c0c76947f00ab4efc4cbc5cc60e95bdb68b2d30636315078977128abc8e11","observation_id":"ce13dca7-485f-4c5d-aa38-e23f397162ed","resolution":{"observed_at":"2026-08-06T20:04:12.703508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:12.383376Z","title":"Graph embedding tech- niques, applications, and performance: A survey","venue":null,"work_id":"ead2957b-217b-47e5-8431-320bb551ca44","year":2018},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:02.827326Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:ba2b85cf9e0a6314ab96ed5e84ec2f7a497a8cc3dba4d97523bead04baec59db","observation_id":"6d07ac66-29e7-48ae-b273-4a275d1d723d","resolution":{"observed_at":"2026-08-06T20:04:12.453848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:12.113886Z","title":"node2vec: Scalable feature learning for networks","venue":null,"work_id":"b8f27e1f-9b11-4e21-9e0f-a6497b31a964","year":2016},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:02.939629Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:b94b1b70519828b61ec9f9775121369771394f69edeb9833c0b895f41c627cfe","observation_id":"d3eaadcb-52d2-4f3a-8d97-9fc419de84ef","resolution":{"observed_at":"2026-08-06T20:04:12.204516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.04914","last_updated":"2019-05-13T08:53:31Z","snapshot_observed_at":"2026-07-06T07:52:32.758734Z","submitted_at":"2019-05-13T08:53:31Z","title":"Learning to Exploit Long-term Relational Dependencies in Knowledge Graphs","version":1},"cited_work":{"arxiv_id":"1905.04914","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.04914","snapshot_observed_at":"2026-08-06T20:04:07.713857Z","title":"Learning to Exploit Long-term Relational Dependencies in Knowledge Graphs","venue":"cs.AI","work_id":"6af674a1-5cb0-4816-b544-417c3fc403e1","year":2019},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:03.036858Z"},"links":{"cited_paper":"/paper/1905.04914","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:2ebcd90413a81b8eb95dda1cafe7553568b0a472065c94a44005aedc48c5d482","observation_id":"57af573e-0117-40b1-9503-cb10ec44e4f2","resolution":{"observed_at":"2026-08-06T20:04:07.836575Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:11.841283Z","title":"Hopfield network","venue":null,"work_id":"b7e0387f-cdea-44bd-a2ca-462c3e21cb72","year":1977},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:03.126304Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:640bf83446535371caae3103f8d2f01411bec3601b4a245cf69223093a3efc87","observation_id":"8446f5d3-3e4d-4ce9-ba18-ad46d962d080","resolution":{"observed_at":"2026-08-06T20:04:11.947267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.11921","last_updated":"2018-06-08T09:31:56Z","snapshot_observed_at":"2026-08-03T19:35:07.537874Z","submitted_at":"2018-05-30T12:43:47Z","title":"Anonymous Walk Embeddings","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.11921","snapshot_observed_at":"2026-08-06T20:04:03.274777Z","title":"Anonymous walk em- beddings","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:03.274777Z"},"links":{"cited_paper":"/paper/1805.11921","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:3a89eb481f653f7406542e8ee212d57a30ffb6eb9816617f33cab97fab110a3e","observation_id":"f026a8de-2aa1-4d2d-8bb2-da5ab013a4d2","resolution":{"observed_at":"2026-08-06T20:04:03.274777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.00388","last_updated":"2021-04-01T05:48:44Z","snapshot_observed_at":"2026-08-11T01:15:52.144068Z","submitted_at":"2020-02-02T13:17:31Z","title":"A Survey on Knowledge Graphs: Representation, Acquisition and Applications","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.00388","snapshot_observed_at":"2026-08-06T20:04:03.430937Z","title":"A survey on knowledge graphs: Rep- resentation, acquisition and applications","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:03.430937Z"},"links":{"cited_paper":"/paper/2002.00388","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:56d3493f154e65e53af0df271916cd9ba332915c8129c1e197f708b6adcbc6ea","observation_id":"ac89735e-50f6-4402-aa95-fdc311a64f54","resolution":{"observed_at":"2026-08-06T20:04:03.430937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-06T20:04:03.555418Z","title":"Semi-supervised classi- fication with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:03.555418Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:7867848730ac7364415f31ed5de146ee5f710f55fe9f02d24df0acf651e983f2","observation_id":"b43ea082-ddf7-476c-be41-4009ce919846","resolution":{"observed_at":"2026-08-06T20:04:03.555418Z","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-06T20:04:03.717934Z","title":"Object recognition with gradient-based learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:03.717934Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:eb7a7d50546771f70ad76b981e170b810e46f0824b9f52a2148a17198af8d1f0","observation_id":"340b58c9-ed6a-4cd5-9e7d-06ebb7593520","resolution":{"observed_at":"2026-08-06T20:04:03.717934Z","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-06T20:04:11.596055Z","title":"Makowsky","venue":null,"work_id":"71a5cd84-3b40-4955-8010-99ad2a428429","year":1987},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:03.853562Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:40caef40fb7cfa6675d5829895366a02acf0a705ca37b96c98c1235688838aa3","observation_id":"b5cab50d-5026-46f5-8b95-1cd381d605c2","resolution":{"observed_at":"2026-08-06T20:04:11.725695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:11.289047Z","title":"Fine- grained evaluation of rule-and embedding-based systems for knowledge graph completion","venue":null,"work_id":"44f03410-6fe3-4a8c-9c47-f1c542af4bc7","year":2018},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:04.035695Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:d8f136b04074edf2bebc7537f8c2020d88de729b5a27d02f6089d435b9069eb6","observation_id":"5cc64427-aa13-47b1-8aa3-03bb024f27a8","resolution":{"observed_at":"2026-08-06T20:04:11.455308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:11.055962Z","title":"Anytime Bottom- Up Rule Learning for Knowledge Graph Completion, 2019","venue":null,"work_id":"e0ae291a-6d4c-4f1a-8c63-f8b10ea8c5bf","year":2019},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:04.198146Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:56e5d4bc363c8d34e2226d9333e5094eef04ad9b14dc210f95f280632fd63709","observation_id":"38d1b3d1-cec2-4361-a6bc-3ccd0b920238","resolution":{"observed_at":"2026-08-06T20:04:11.177408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-06T20:04:04.330141Z","title":"Efficient estimation of word representations in vector space","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:04.330141Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:f16501b3e0adf9b8cbce13e6e969191a5ffcf57eb625534e41c74022e869b863","observation_id":"415b3d79-b1ef-4679-bd4d-19eb60b68815","resolution":{"observed_at":"2026-08-06T20:04:04.330141Z","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-06T20:04:10.840862Z","title":"Hierarchical graph embedding in vector space by graph pyramid","venue":null,"work_id":"c88ee183-943c-45ea-8499-6ec0587dfb8c","year":2017},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:04.407783Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:1435555384aa6da9426ce742e6dc7b3714c90e01db5c24de1fe4142e52d9b294","observation_id":"e86ac7dc-6c13-4d9b-8d79-de035b25fb9e","resolution":{"observed_at":"2026-08-06T20:04:10.881816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01195","last_updated":"2019-06-04T04:59:08Z","snapshot_observed_at":"2026-08-09T06:14:01.235519Z","submitted_at":"2019-06-04T04:59:08Z","title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","version":1},"cited_work":{"arxiv_id":"1906.01195","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.01195","snapshot_observed_at":"2026-08-06T20:04:07.412676Z","title":"Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs","venue":"cs.LG","work_id":"28497eda-1d59-47fe-922b-2eb36832f19f","year":2019},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:04.536529Z"},"links":{"cited_paper":"/paper/1906.01195","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:ba6645571d600a7ba5816ed245c04eb110787d5db673301a2570f28c941a8f6f","observation_id":"fe9b575f-0651-4b47-aeff-1972c3591aa0","resolution":{"observed_at":"2026-08-06T20:04:07.501438Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.02121","last_updated":"2018-03-13T07:45:20Z","snapshot_observed_at":"2026-08-10T15:47:03.650389Z","submitted_at":"2017-12-06T10:41:47Z","title":"A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.02121","snapshot_observed_at":"2026-08-06T20:04:04.689818Z","title":"A novel embedding model for knowledge base completion based on convolutional neural network","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:04.689818Z"},"links":{"cited_paper":"/paper/1712.02121","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:0576c75a9f9933edd3d81bcaf284197be4b3a447ce9d212475a0b3de10167bdf","observation_id":"dbdc96d7-af55-44b7-81d2-6892a6c6e62b","resolution":{"observed_at":"2026-08-06T20:04:04.689818Z","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-06T20:04:10.549163Z","title":"Memory and Attention, 2020","venue":null,"work_id":"be3518cb-25e5-45ae-9d4b-6cccbb5f63e9","year":2020},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:04.812861Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:2ae5b61d3ff01f6e99989cece9a34c61e17128c266b32ad5a6b1bc211f55180d","observation_id":"6ee77f95-8f51-44ed-b40a-3dd8bcbb92aa","resolution":{"observed_at":"2026-08-06T20:04:10.691627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:10.294282Z","title":"Robust discovery of positive and negative rules in knowledge bases","venue":null,"work_id":"2e55f93d-643d-4d25-95bb-e836a4e930c5","year":2018},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:04.976677Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:fe25225829ddacd6520aee0907fae76fd2ca6d12ead180d05e3b8491f26cd8f8","observation_id":"a4916292-72c0-4a87-b4d6-3dd3c59f59b2","resolution":{"observed_at":"2026-08-06T20:04:10.392992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:10.001811Z","title":"Deepwalk: Online learning of social representations","venue":null,"work_id":"6d01696e-674c-4726-9b3d-ce810a905087","year":2014},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:05.130372Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:c6b4cc996642cd615d39a82345bd23af8a66f036c38a05ce49c1d0cddb8889f8","observation_id":"0327776d-5bd5-45f9-baab-7bd7f2cf6c23","resolution":{"observed_at":"2026-08-06T20:04:10.131009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05909","last_updated":"2019-06-13T19:43:01Z","snapshot_observed_at":"2026-07-06T08:00:13.822686Z","submitted_at":"2019-06-13T19:43:01Z","title":"Stand-Alone Self-Attention in Vision Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05909","snapshot_observed_at":"2026-08-06T20:04:05.259360Z","title":"Stand- alone self-attention in vision models","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:05.259360Z"},"links":{"cited_paper":"/paper/1906.05909","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:e7c13ef32515f0923accae347daf621be8c0c6264ff13c8ede1156a491adc863","observation_id":"b349a713-c645-4b6c-b308-132a8748da19","resolution":{"observed_at":"2026-08-06T20:04:05.259360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.00819","last_updated":"2021-01-21T21:15:36Z","snapshot_observed_at":"2026-08-08T14:42:18.618261Z","submitted_at":"2020-02-03T15:21:25Z","title":"Knowledge Graph Embedding for Link Prediction: A Comparative Analysis","version":4},"cited_work":{"arxiv_id":"2002.00819","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.00819","snapshot_observed_at":"2026-08-06T20:04:07.153943Z","title":"Knowledge Graph Embedding for Link Prediction: A Comparative Analysis","venue":"cs.LG","work_id":"3061674e-2ee2-4558-9599-22f8a6bbbf58","year":2020},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:05.419084Z"},"links":{"cited_paper":"/paper/2002.00819","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:cf7e3bce6552e03f24980d107e7fff129cfc14ee87a5c2b72acdfbd148741ef0","observation_id":"60211d37-1437-4d21-afda-1c3d7b3fc639","resolution":{"observed_at":"2026-08-06T20:04:07.260795Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:09.747301Z","title":"Dy- namic routing between capsules","venue":null,"work_id":"82d42245-d8c3-4dfd-98ae-b7ba65d91ec6","year":2017},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:05.546697Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:ca22749768782e7377b5cd8728deeffa81031c41b03dd16f901b60a8bec69f68","observation_id":"831a61d7-696e-4e5b-a092-f87b870fda8b","resolution":{"observed_at":"2026-08-06T20:04:09.854190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.08053","last_updated":"2020-03-13T23:45:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2019-09-17T19:42:54Z","title":"Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelism","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.08053","snapshot_observed_at":"2026-08-06T20:04:05.691716Z","title":"Megatron-lm: Training multi-billion parameter language models using gpu model parallelism","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:05.691716Z"},"links":{"cited_paper":"/paper/1909.08053","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:056043ad24f5fcebfca69c7d616b6b79074c752f3d4cfb6ee5f5fde58972019a","observation_id":"38ca8a8d-a6e8-479e-b39f-cfe39bd371da","resolution":{"observed_at":"2026-08-06T20:04:05.691716Z","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-06T20:04:09.557802Z","title":"Line: Large-scale information network em- bedding","venue":null,"work_id":"e694f808-e04d-476e-a894-d7ba2c7acd91","year":2015},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:05.819809Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:e8abff1bf57b871e156abf7fecf905f509797910fb28682df7e300f3259a1840","observation_id":"1b507a47-4ce2-4b4f-9207-57e62ac4b49b","resolution":{"observed_at":"2026-08-06T20:04:09.636396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.10821","last_updated":"2020-05-21T17:55:59Z","snapshot_observed_at":"2026-08-09T19:55:36.973851Z","submitted_at":"2020-05-21T17:55:59Z","title":"Hierarchical Multi-Scale Attention for Semantic Segmentation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.10821","snapshot_observed_at":"2026-08-06T20:04:05.960210Z","title":"Hierarchi- cal multi-scale attention for semantic segmentation","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:05.960210Z"},"links":{"cited_paper":"/paper/2005.10821","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:5cfe9862b1977dd7bb86aa41f14eb985ae6fa1fda3be0bae90bf12ee314081e4","observation_id":"2ca392af-555c-4e01-912f-8f975c124b4b","resolution":{"observed_at":"2026-08-06T20:04:05.960210Z","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-06T20:04:09.277873Z","title":"Observed versus latent features for knowledge base and text inference","venue":null,"work_id":"4ec500c8-bda4-4d70-8a6d-515aab937cea","year":2015},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:06.082726Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:7ba62ebd318df195d37ee60f7414eab931975aaf0ff261483b07299218749e98","observation_id":"489fb351-5596-45e7-a5a3-4440b698ab0f","resolution":{"observed_at":"2026-08-06T20:04:09.425967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:09.044164Z","title":"Complex embeddings for simple link prediction","venue":null,"work_id":"2d843d0c-cacd-4ebd-9d1c-a3edbe1c484d","year":2016},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:06.203546Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:7b8dd5d23ee630294d68031f41a936f76b5eb7cea997fd52ce106a7ddd2c59fc","observation_id":"6b534a44-8ef5-4c48-b1b2-9e8a99bd3921","resolution":{"observed_at":"2026-08-06T20:04:09.156414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1111.4503","last_updated":"2011-11-18T21:46:32Z","snapshot_observed_at":"2026-08-08T06:37:46.213719Z","submitted_at":"2011-11-18T21:46:32Z","title":"The Anatomy of the Facebook Social Graph","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1111.4503","snapshot_observed_at":"2026-08-06T20:04:06.344499Z","title":"The anatomy of the facebook social graph","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:06.344499Z"},"links":{"cited_paper":"/paper/1111.4503","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:3c63a3f790469fe7cab3ccf32d0b9edb238b9422f13449a633a71137fff82e13","observation_id":"9813566c-3f9d-44e7-9906-6efdd372b05a","resolution":{"observed_at":"2026-08-06T20:04:06.344499Z","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-06T20:04:08.713180Z","title":"Attention is all you need","venue":null,"work_id":"47e9a2da-927e-4585-9faf-993ee26d6bb1","year":2017},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:06.457514Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:5421cfc593e67f753c42f421e6fffd0257ccb68a9ad281923d271de06df7308a","observation_id":"2c739930-c10c-491a-8c22-585216975a56","resolution":{"observed_at":"2026-08-06T20:04:08.884616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-06T20:04:06.574563Z","title":"Graph attention networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:06.574563Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:80c58a7b41bb923364885b99def5168d9527e55f16560b8a2912b810b4082062","observation_id":"3ae994fb-4ea4-4db8-8d63-30364fceda8b","resolution":{"observed_at":"2026-08-06T20:04:06.574563Z","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-06T20:04:08.488829Z","title":"A capsule network-based embedding model for knowl- edge graph completion and search personalization","venue":null,"work_id":"9767cfe3-ae95-47be-842c-d93b1c2fd343","year":2019},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:06.692595Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:df7cb51034c47c9ec58eb38fa659aef61d8b1716d7e0810c8c2a828331022926","observation_id":"6e76002d-445b-4d20-a32b-25ec6594d124","resolution":{"observed_at":"2026-08-06T20:04:08.618271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:08.255385Z","title":"Structural deep net- work embedding","venue":null,"work_id":"36ffc060-182b-4b2d-b371-b5e527c63fd1","year":2016},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:06.787983Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:0c457bef32daf99c6d89339d0b837b760c8d801127fa38c2c99a603a78b361ee","observation_id":"c4be68fe-abc6-432d-9902-8ab05d690c84","resolution":{"observed_at":"2026-08-06T20:04:08.367473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06T20:04:08.048450Z","title":"Xlnet: Generalized autoregressive pretraining for language understanding","venue":null,"work_id":"595f98d2-7244-4d8e-ac36-71cf89f310de","year":2019},"citing_paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T20:04:06.929115Z"},"links":{"citing_paper":"/paper/2507.03947"},"observation_digest":"sha256:62b6a08839660eb9c03bcab73a0c3a7e31b928eb3b62e667eb369b2cfdc462ad","observation_id":"a8fba5b7-620b-4eca-8860-d284239230d8","resolution":{"observed_at":"2026-08-06T20:04:08.098338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.03947","last_updated":"2025-07-30T12:47:25Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T01:24:53.712107Z","submitted_at":"2025-07-05T08:13:09Z","title":"Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":3,"verified_fuzzy":25},"total_outbound_references":44},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2507.03947."}