{"as_of":"2026-08-08T09:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2db4eba34b0c749777236986d8ec8b649129d3a6564855a7ede394564e34bdb6","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:01:36.873581Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.08970/citation-record","integrity":"/paper/2506.08970/integrity","json":"/paper/2506.08970/citation-record.json","paper":"/paper/2506.08970"},"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-07T05:01:37.030711Z","title":"A, B, C, and D are university classmates","venue":null,"work_id":"4b6e05fb-6ac8-4587-9e67-c5f12dd36fd1","year":null},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.867993Z"},"links":{"citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:739ced35ec42f20c31e0ff480638984e604f2574c469ea2798be68838587b7b9","observation_id":"fce71b4f-2a0d-49c5-8758-61d1b62eaf9d","resolution":{"observed_at":"2026-08-07T05:01:37.033555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:01:37.021946Z","title":"Student A received scholar- ship D at school C in year B","venue":null,"work_id":"4ee22564-eb67-4ec1-a592-0bbf65c704d9","year":null},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.870715Z"},"links":{"citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:4a740a1205ec85f22401f26820bb06d15554ca61ff827f9fe0819d8e9e9aca9b","observation_id":"07bb55b2-4a09-4e2a-bbb0-55f39bc56036","resolution":{"observed_at":"2026-08-07T05:01:37.025172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:01:37.013303Z","title":"Einstein received the Nobel Prize in Physics in 1921 in Switzerland,","venue":null,"work_id":"126c224a-2f79-46fc-8802-9a03319524c7","year":2017},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.873581Z"},"links":{"citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:b71ef9fbaf5be95dd3a0faa4069b8b08483bbd0dfdcd5656dee62dc6878a71f7","observation_id":"f76b5462-bfe0-4a8f-91e8-13ff1368d0f9","resolution":{"observed_at":"2026-08-07T05:01:37.016360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:01:37.038885Z","title":"Yi Liu, Hongrui Xuan, Bohan Li, Meng Wang, Tong Chen, and Hongzhi Yin","venue":null,"work_id":"20c4ffc7-defb-4efd-89c3-086406d337fe","year":2023},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.847422Z"},"links":{"citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:9aceea2cfd58ac6abeb4ac600c8ad16e8a87657fb68bf51565df19f0ccd1a4d3","observation_id":"14cd8a09-3ad3-4215-8579-4f556d1c1121","resolution":{"observed_at":"2026-08-07T05:01:37.041917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.06588","last_updated":"2023-05-15T16:25:03Z","snapshot_observed_at":"2026-08-03T07:16:32.483418Z","submitted_at":"2023-05-11T05:59:31Z","title":"HAHE: Hierarchical Attention for Hyper-Relational Knowledge Graphs in Global and Local Level","version":2},"cited_work":{"arxiv_id":"2305.06588","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.06588","snapshot_observed_at":"2026-08-07T05:01:36.962541Z","title":"HAHE: Hierarchical Attention for Hyper-Relational Knowledge Graphs in Global and Local Level","venue":"cs.AI","work_id":"6431389d-f76b-4b88-b8bf-f9f25cba7ce7","year":2023},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.850412Z"},"links":{"cited_paper":"/paper/2305.06588","citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:dc8c56beafcb23111f262f79ee3d74a9e95e7ee783195160091743089a5360b4","observation_id":"37e14191-8d06-4b87-b3c1-08ddb2bbe9d6","resolution":{"observed_at":"2026-08-07T05:01:36.965714Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.09167","last_updated":"2024-04-14T07:15:59Z","snapshot_observed_at":"2026-08-08T06:20:07.561226Z","submitted_at":"2024-04-14T07:15:59Z","title":"Survey on Embedding Models for Knowledge Graph and its Applications","version":1},"cited_work":{"arxiv_id":"2404.09167","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.09167","snapshot_observed_at":"2026-08-07T05:01:36.951101Z","title":"Survey on Embedding Models for Knowledge Graph and its Applications","venue":"cs.SI","work_id":"281a564e-a278-4287-b7a9-2e2230f0a07d","year":2024},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.853757Z"},"links":{"cited_paper":"/paper/2404.09167","citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:5b258cd6c960517b9632f9656f0948399b98e6d9440f5b6d512d40cf99a5b6cc","observation_id":"81e7f460-8a67-445e-9ae9-93724c21882e","resolution":{"observed_at":"2026-08-07T05:01:36.954411Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.02199","last_updated":"2023-06-03T21:14:59Z","snapshot_observed_at":"2026-07-06T15:37:39.433980Z","submitted_at":"2023-06-03T21:14:59Z","title":"Shrinking Embeddings for Hyper-Relational Knowledge Graphs","version":1},"cited_work":{"arxiv_id":"2306.02199","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.02199","snapshot_observed_at":"2026-08-07T05:01:36.927099Z","title":"Shrinking Embeddings for Hyper-Relational Knowledge Graphs","venue":"cs.AI","work_id":"1c6034b2-2f90-4add-a5a0-d19f415cca61","year":2023},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.859732Z"},"links":{"cited_paper":"/paper/2306.02199","citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:53c85db8e824f5c64d3b7dbea33c0fa063b0cc4e0a7d8d8337ee84370e9db3cf","observation_id":"86515d5e-4fcb-4a32-b492-e93873270e56","resolution":{"observed_at":"2026-08-07T05:01:36.930772Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.09308","last_updated":"2022-06-07T13:14:52Z","snapshot_observed_at":"2026-07-06T12:49:07.094216Z","submitted_at":"2022-03-17T13:21:11Z","title":"Few-Shot Learning on Graphs","version":2},"cited_work":{"arxiv_id":"2203.09308","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.09308","snapshot_observed_at":"2026-08-07T05:01:36.900833Z","title":"Few-Shot Learning on Graphs","venue":"cs.LG","work_id":"58582382-1d5f-445c-91c3-a494a4ae2e9e","year":2022},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.865067Z"},"links":{"cited_paper":"/paper/2203.09308","citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:7e7175271589560261bbb8326db12f91bd4f6ffa4c6dfaf7892e42031310da9d","observation_id":"dc076c91-25e6-4059-9de3-38bcec8a8751","resolution":{"observed_at":"2026-08-07T05:01:36.904954Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.01709","last_updated":"2023-07-04T13:24:04Z","snapshot_observed_at":"2026-07-06T15:50:11.089900Z","submitted_at":"2023-07-04T13:24:04Z","title":"Dipping PLMs Sauce: Bridging Structure and Text for Effective Knowledge Graph Completion via Conditional Soft Prompting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.01709","snapshot_observed_at":"2026-08-07T05:01:36.834134Z","title":"Borui Cai, Yong Xiang, Longxiang Gao, He Zhang, Yun- feng Li, and Jianxin Li","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.834134Z"},"links":{"cited_paper":"/paper/2307.01709","citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:83945cf7b7c3389a064f1cd27d3300f41ce925dca6a6698d03cb105762d68e20","observation_id":"d08f62f1-52c9-4562-bd00-e1428f7b76ff","resolution":{"observed_at":"2026-08-07T05:01:36.834134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.08476","last_updated":"2021-05-18T12:40:35Z","snapshot_observed_at":"2026-08-07T03:32:43.184124Z","submitted_at":"2021-05-18T12:40:35Z","title":"Link Prediction on N-ary Relational Facts: A Graph-based Approach","version":1},"cited_work":{"arxiv_id":"2105.08476","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.08476","snapshot_observed_at":"2026-08-07T05:01:36.939447Z","title":"Link Prediction on N-ary Relational Facts: A Graph-based Approach","venue":"cs.AI","work_id":"f52d13a7-89a0-4806-bb1c-ef2f6ed8bf92","year":2021},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.856769Z"},"links":{"cited_paper":"/paper/2105.08476","citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:92b5087b09581f58c37db60df45504e3a4207be0d19b14fe4cde08266020223f","observation_id":"0abd50ca-6dbe-4291-b91a-adb0d8f16c6c","resolution":{"observed_at":"2026-08-07T05:01:36.942741Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:01:37.047783Z","title":null,"venue":null,"work_id":"50e0d828-a7ea-48a6-9479-76da045eb940","year":2008},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.830511Z"},"links":{"citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:e7debfb7dc5100ca8eb455956aa454f979f83a276bd61df52e6f948b09df6669","observation_id":"1c1af0a9-f17c-46ad-891a-7709ac53c5c5","resolution":{"observed_at":"2026-08-07T05:01:37.050510Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.10219","last_updated":"2024-10-03T21:43:43Z","snapshot_observed_at":"2026-08-05T23:02:04.977929Z","submitted_at":"2023-07-14T21:29:16Z","title":"Temporal Fact Reasoning over Hyper-Relational Knowledge Graphs","version":3},"cited_work":{"arxiv_id":"2307.10219","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.10219","snapshot_observed_at":"2026-08-07T05:01:36.996119Z","title":"Temporal Fact Reasoning over Hyper-Relational Knowledge Graphs","venue":"cs.AI","work_id":"30cc56c8-8eab-4d79-b833-e944327d05ec","year":2023},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.837427Z"},"links":{"cited_paper":"/paper/2307.10219","citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:119d88add948d29c2ff35f838fe2dd76c1f8d7ca44b0a67379e5e56f02cf62f4","observation_id":"52eae6e0-9b42-4a8a-912e-eb70d4a46e48","resolution":{"observed_at":"2026-08-07T05:01:36.998917Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04997","last_updated":"2023-12-08T12:13:40Z","snapshot_observed_at":"2026-07-06T16:58:47.790985Z","submitted_at":"2023-12-08T12:13:40Z","title":"Beyond Transduction: A Survey on Inductive, Few Shot, and Zero Shot Link Prediction in Knowledge Graphs","version":1},"cited_work":{"arxiv_id":"2312.04997","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.04997","snapshot_observed_at":"2026-08-07T05:01:36.985083Z","title":"Beyond Transduction: A Survey on Inductive, Few Shot, and Zero Shot Link Prediction in Knowledge Graphs","venue":"cs.AI","work_id":"72d5e519-7ea8-4c63-988b-2fb92d9f045f","year":2023},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.840670Z"},"links":{"cited_paper":"/paper/2312.04997","citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:83fa4dd88a53bc7467d294181e95d1a7fda9c15784b3701ca6d8dd27f5298b06","observation_id":"2bcb1383-c911-4175-89f8-7469050e78cc","resolution":{"observed_at":"2026-08-07T05:01:36.988132Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.02327","last_updated":"2024-07-12T11:11:26Z","snapshot_observed_at":"2026-08-08T01:32:32.208883Z","submitted_at":"2024-04-23T20:50:06Z","title":"CausalLP: Learning causal relations with weighted knowledge graph link prediction","version":2},"cited_work":{"arxiv_id":"2405.02327","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.02327","snapshot_observed_at":"2026-08-07T05:01:36.973949Z","title":"CausalLP: Learning causal relations with weighted knowledge graph link prediction","venue":"cs.AI","work_id":"b21fba58-1dd0-4ea7-a428-2cf652ad41b1","year":2024},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.843829Z"},"links":{"cited_paper":"/paper/2405.02327","citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:eb84dedbe282937ab4aca6578bef46f61d05e91ca50a6338c4fca6581264c6db","observation_id":"5e4cf5bc-cb21-4f98-a781-081260e9656d","resolution":{"observed_at":"2026-08-07T05:01:36.977368Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08167","last_updated":"2021-04-16T15:26:41Z","snapshot_observed_at":"2026-08-08T07:48:14.259012Z","submitted_at":"2021-04-16T15:26:41Z","title":"Improving Hyper-Relational Knowledge Graph Completion","version":1},"cited_work":{"arxiv_id":"2104.08167","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.08167","snapshot_observed_at":"2026-08-07T05:01:36.914221Z","title":"Improving Hyper-Relational Knowledge Graph Completion","venue":"cs.LG","work_id":"0af40946-d35b-4b6d-959f-f77264c301a7","year":2021},"citing_paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T05:01:36.862449Z"},"links":{"cited_paper":"/paper/2104.08167","citing_paper":"/paper/2506.08970"},"observation_digest":"sha256:0862fa9f80b185fa47ade51be5a0891efa045dd5ac38727094a81c59c05b1965","observation_id":"04e9d117-4027-4063-b783-4673f3c5adf5","resolution":{"observed_at":"2026-08-07T05:01:36.918359Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.08970","last_updated":"2025-06-10T16:44:27Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T04:55:31.886285Z","submitted_at":"2025-06-10T16:44:27Z","title":"A Survey of Link Prediction in N-ary Knowledge Graphs"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":2,"verified_exact":6,"verified_fuzzy":4},"total_outbound_references":15},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2506.08970."}