{"as_of":"2026-08-21T17:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7b676c697014663442f2f06f0871f551ae7e114773e9f53cc630575faf3f0e2e","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:04:33.560024Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:48:53.636239Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T22:48:54.529852Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"cited_work":{"arxiv_id":"2504.16537","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.16537","snapshot_observed_at":"2026-08-10T22:48:54.529852Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","venue":"cs.CL","work_id":"20633a15-e249-45f5-9581-1793324bc09f","year":2025},"citing_paper":{"arxiv_id":"2501.00759","last_updated":"2025-07-10T07:45:30Z","snapshot_observed_at":"2026-08-14T13:08:58.878185Z","submitted_at":"2025-01-01T07:05:32Z","title":"Enhancing Transformers for Generalizable First-Order Logical Entailment","version":3},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-10T22:48:53.636239Z"},"links":{"cited_paper":"/paper/2504.16537","citing_paper":"/paper/2501.00759"},"observation_digest":"sha256:d9cb5f97163e947618bc9fd01e40a148209debf16711b12566a11c4bc7de7785","observation_id":"c3581dd2-5807-4936-a213-f5a1c7146149","resolution":{"observed_at":"2026-08-10T22:48:54.536477Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.16537/citation-record","integrity":"/paper/2504.16537/integrity","json":"/paper/2504.16537/citation-record.json","paper":"/paper/2504.16537"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.06267","last_updated":"2020-10-29T09:48:19Z","snapshot_observed_at":"2026-08-18T19:42:15.895461Z","submitted_at":"2020-07-13T09:40:49Z","title":"BoxE: A Box Embedding Model for Knowledge Base Completion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.06267","snapshot_observed_at":"2026-08-16T11:04:33.360154Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.360154Z"},"links":{"cited_paper":"/paper/2007.06267","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:624a3bb4a86f55722751ef6e1f1b1b03c43f65070eba440f4ac21d14c1cf7540","observation_id":"09f27603-c60b-4029-b0e3-b74110542f15","resolution":{"observed_at":"2026-08-16T11:04:33.360154Z","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-16T11:04:33.365144Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.365144Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:5b4a15f697903f8f278df98e94c98dddb8c5c6ca747e7bce0ada054a6782b79b","observation_id":"0f9a2c95-0af1-4554-909d-ac4df8f05903","resolution":{"observed_at":"2026-08-16T11:04:33.365144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.08166","last_updated":"2022-09-06T08:34:18Z","snapshot_observed_at":"2026-08-20T10:15:12.624553Z","submitted_at":"2021-06-15T14:08:50Z","title":"Query Embedding on Hyper-relational Knowledge Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.08166","snapshot_observed_at":"2026-08-16T11:04:33.369285Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.369285Z"},"links":{"cited_paper":"/paper/2106.08166","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:44c45763be69b20df1c724f7ce95b2565c64286dd2cbd2b3c3785c8449280fc5","observation_id":"9c055415-4936-49e5-b9fa-71226aaa1132","resolution":{"observed_at":"2026-08-16T11:04:33.369285Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.14464","last_updated":"2022-09-28T23:10:09Z","snapshot_observed_at":"2026-08-18T19:42:49.954040Z","submitted_at":"2022-09-28T23:10:09Z","title":"Neural Methods for Logical Reasoning Over Knowledge Graphs","version":1},"cited_work":{"arxiv_id":"2209.14464","doi":"10.48550/arxiv.2209.14464","metadata_source":"pith","pith_arxiv_id":"2209.14464","snapshot_observed_at":"2026-08-16T12:16:17.039197Z","title":"Neural Methods for Logical Reasoning Over Knowledge Graphs","venue":"cs.AI","work_id":"e2577c97-0c28-46e7-a27f-7b94a75d4912","year":2022},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.373382Z"},"links":{"cited_paper":"/paper/2209.14464","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:4d11d622302f23d7511e49b03292e38196c17fe5dfdf95a8f2cf7070a2875e5f","observation_id":"99ab42af-8783-4f36-955b-15b7f149d439","resolution":{"observed_at":"2026-08-16T11:04:34.161413Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.03459","last_updated":"2021-03-18T09:42:49Z","snapshot_observed_at":"2026-08-16T19:07:39.061482Z","submitted_at":"2020-11-06T16:20:49Z","title":"Complex Query Answering with Neural Link Predictors","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.03459","snapshot_observed_at":"2026-08-16T11:04:33.377703Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.377703Z"},"links":{"cited_paper":"/paper/2011.03459","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:6c9cfafe608a02f551860e94d2e27a2ecb563155898aef9f2284797ef8a3aa43","observation_id":"b5d5044f-deda-4148-a12c-1cd9a1ad196e","resolution":{"observed_at":"2026-08-16T11:04:33.377703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.13866","last_updated":"2024-06-14T07:47:47Z","snapshot_observed_at":"2026-08-21T07:55:40.518400Z","submitted_at":"2023-12-21T14:03:30Z","title":"Understanding Inter-Session Intentions via Complex Logical Reasoning","version":2},"cited_work":{"arxiv_id":"2312.13866","doi":"10.48550/arxiv.2312.13866","metadata_source":"pith","pith_arxiv_id":"2312.13866","snapshot_observed_at":"2026-08-16T12:16:17.039197Z","title":"Understanding Inter-Session Intentions via Complex Logical Reasoning","venue":"cs.AI","work_id":"1cfe27d8-77fc-45c8-9d53-e6a6b087ea4f","year":2023},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.382030Z"},"links":{"cited_paper":"/paper/2312.13866","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:5630b5fe96b9e054e6a2c094084b9aa90d3f80ea94681fc17b6d269090286320","observation_id":"04890031-2038-4391-9a74-c051e7897335","resolution":{"observed_at":"2026-08-16T11:04:34.132839Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13114","last_updated":"2023-06-25T21:38:42Z","snapshot_observed_at":"2026-08-19T22:08:43.657782Z","submitted_at":"2023-02-25T16:33:53Z","title":"Sequential Query Encoding For Complex Query Answering on Knowledge Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13114","snapshot_observed_at":"2026-08-16T11:04:33.386512Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.386512Z"},"links":{"cited_paper":"/paper/2302.13114","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:1357fe85ea3702fc73c7ce57ac1b58506a09051fab753f39391b8eb7646ddb1e","observation_id":"1603bbad-c31a-42a3-b6fd-7bcf3375fd3c","resolution":{"observed_at":"2026-08-16T11:04:33.386512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.09567","last_updated":"2023-06-07T06:57:09Z","snapshot_observed_at":"2026-08-16T16:07:38.621022Z","submitted_at":"2022-12-19T15:59:00Z","title":"Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.09567","snapshot_observed_at":"2026-08-16T11:04:33.390684Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.390684Z"},"links":{"cited_paper":"/paper/2212.09567","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:8ead0b26fb166a09aa7650ee5e03c26c5c2edee75b8faa38a173af010c422277","observation_id":"12a13f38-73f0-4918-8e6e-71fe271078bf","resolution":{"observed_at":"2026-08-16T11:04:33.390684Z","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-16T11:04:34.491896Z","title":null,"venue":null,"work_id":"b6c775e2-7f77-4be6-9460-14e6c0c6285d","year":2013},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.394588Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:e4133a2cb657617a6527e444ce0436d297100638a91cda14221fe408652af9d2","observation_id":"767067f6-5b69-4add-9f71-752bd9f8b8bb","resolution":{"observed_at":"2026-08-16T11:04:34.495717Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.02390","last_updated":"2022-06-16T06:30:13Z","snapshot_observed_at":"2026-08-19T15:32:39.981805Z","submitted_at":"2021-08-05T05:54:00Z","title":"Fuzzy Logic Based Logical Query Answering on Knowledge Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.02390","snapshot_observed_at":"2026-08-16T11:04:33.398180Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.398180Z"},"links":{"cited_paper":"/paper/2108.02390","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:7debfe1d15c71fb37db9ddc4971fbdfa303df61d86478a279ada2499eaad9005","observation_id":"9bd9553e-dddc-4d17-961b-749e0916d971","resolution":{"observed_at":"2026-08-16T11:04:33.398180Z","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-14T20:49:30.127080Z","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-16T11:04:33.403201Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.403201Z"},"links":{"cited_paper":"/paper/1707.01476","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:56dcda63c83f9ef3df400fceba150d2b0ffca21f41b2dfd2d306a46775d7f7fa","observation_id":"fb8faada-9acc-496e-86cb-63396035a48a","resolution":{"observed_at":"2026-08-16T11:04:33.403201Z","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":"10.24963/ijcai.2020/303","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:04:34.070935Z","title":null,"venue":null,"work_id":"f5cb32bd-47c2-4dd3-b4fb-118a216c8c03","year":2020},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.407100Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:d1d65ddec7f8ce5fa958608f984ac521a723f6da6ed95be6db8c3b9b09187c84","observation_id":"e20dc66b-e7ce-4f2b-aced-7027974fe90d","resolution":{"observed_at":"2026-08-16T11:04:34.074755Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.09557","last_updated":"2021-02-18T18:57:44Z","snapshot_observed_at":"2026-08-16T18:44:35.928385Z","submitted_at":"2021-02-18T18:57:44Z","title":"Knowledge Hypergraph Embedding Meets Relational Algebra","version":1},"cited_work":{"arxiv_id":"2102.09557","doi":"10.48550/arxiv.2102.09557","metadata_source":"pith","pith_arxiv_id":"2102.09557","snapshot_observed_at":"2026-08-16T12:16:17.039197Z","title":"Knowledge Hypergraph Embedding Meets Relational Algebra","venue":"cs.LG","work_id":"b4e15bef-d05b-4350-800c-86320e875473","year":2021},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.410905Z"},"links":{"cited_paper":"/paper/2102.09557","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:ea7b6f43af0b11463aab04d25657269a5be9df2c2ffcb23ba87a768906693b1b","observation_id":"fd455419-cbc5-49e3-ada4-5e097edc4ee7","resolution":{"observed_at":"2026-08-16T11:04:34.063725Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:04:33.414964Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.414964Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:965895802fe295ce3653024306825c703205da758e88576a4a9c86c62062d973","observation_id":"a1a10562-af17-4b70-962e-54e3f2ed4834","resolution":{"observed_at":"2026-08-16T11:04:33.414964Z","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":"10.18653/v1/2020.acl-main.546","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:04:34.039240Z","title":null,"venue":null,"work_id":"48739c12-4cc8-4bdc-9676-f9692c8bc914","year":2020},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.418706Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:c8b638c7b4d0684df66d4123521c9e9ad7d98db43da40e842a65bd12a4587200","observation_id":"5dee1a60-ea74-4173-8845-da5710f32ba7","resolution":{"observed_at":"2026-08-16T11:04:34.042946Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.01445","last_updated":"2019-10-29T15:18:35Z","snapshot_observed_at":"2026-08-14T19:07:32.539394Z","submitted_at":"2018-06-05T00:36:13Z","title":"Embedding Logical Queries on Knowledge Graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.01445","snapshot_observed_at":"2026-08-16T11:04:33.422429Z","title":"Hamilton, Payal Bajaj, Marinka Zitnik, Dan Jurafsky, and Jure Leskovec","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.422429Z"},"links":{"cited_paper":"/paper/1806.01445","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:654428eebeafbc6a6c18b97d554653a4ca692b5def436f4cd16ea5b69efeda54","observation_id":"d1807f5c-1418-4f1d-8bc9-0a24f5f967b0","resolution":{"observed_at":"2026-08-16T11:04:33.422429Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04062","last_updated":"2025-06-09T10:08:14Z","snapshot_observed_at":"2026-08-16T14:20:59.056995Z","submitted_at":"2024-02-06T15:05:40Z","title":"Link Prediction with Relational Hypergraphs","version":3},"cited_work":{"arxiv_id":"2402.04062","doi":"10.48550/arxiv.2402.04062","metadata_source":"pith","pith_arxiv_id":"2402.04062","snapshot_observed_at":"2026-08-16T12:16:17.039197Z","title":"Link Prediction with Relational Hypergraphs","venue":"cs.LG","work_id":"99a0416c-4983-4d19-8673-17bdb007d704","year":2024},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.426635Z"},"links":{"cited_paper":"/paper/2402.04062","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:5c9bc54b558aea05966800d68c207b6db9fd4901dd1cb7ab49f9eb7f0cc46aab","observation_id":"d9e5d530-fd64-4a76-b089-0bee339d7f16","resolution":{"observed_at":"2026-08-16T11:04:34.020208Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:04:33.430815Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.430815Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:c3add0e1919140400a3ef8fed63a370a0261f3d81fdad67f17258770cc8d727a","observation_id":"f3106a25-ab20-4141-beb9-ba808fcf097a","resolution":{"observed_at":"2026-08-16T11:04:33.430815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12865","last_updated":"2024-12-17T18:27:01Z","snapshot_observed_at":"2026-08-16T13:17:07.802917Z","submitted_at":"2024-09-19T16:08:10Z","title":"KnowFormer: Revisiting Transformers for Knowledge Graph Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12865","snapshot_observed_at":"2026-08-16T11:04:33.434888Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.434888Z"},"links":{"cited_paper":"/paper/2409.12865","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:a9a5e9b33bbbba98980d9aaf8f3bd37bea2bba45077c876a6e3e6bc3447cbe83","observation_id":"0faa1251-2d73-4408-924d-ad9083241a27","resolution":{"observed_at":"2026-08-16T11:04:33.434888Z","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-16T11:04:33.438911Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.438911Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:855bb5429cacf54cdb0750045ae9f810d538fe200cb94be62174acd02ceb20d3","observation_id":"dfa15d0e-4f49-450c-a6ea-c8642fb444c9","resolution":{"observed_at":"2026-08-16T11:04:33.438911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.06191","last_updated":"2024-11-09T14:16:41Z","snapshot_observed_at":"2026-08-16T13:01:32.366956Z","submitted_at":"2024-11-09T14:16:41Z","title":"Generalizing Hyperedge Expansion for Hyper-relational Knowledge Graph Modeling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.06191","snapshot_observed_at":"2026-08-16T11:04:33.443012Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.443012Z"},"links":{"cited_paper":"/paper/2411.06191","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:a010389639ff100a41cb67b976c4c5e8c71261aac82f71ef2fa964b927e512a8","observation_id":"d25a47f1-85b0-4692-90d4-707ec8ff1535","resolution":{"observed_at":"2026-08-16T11:04:33.443012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.03988","last_updated":"2020-07-08T09:49:38Z","snapshot_observed_at":"2026-07-06T09:36:24.838522Z","submitted_at":"2020-07-08T09:49:38Z","title":"Generalizing Tensor Decomposition for N-ary Relational Knowledge Bases","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.03988","snapshot_observed_at":"2026-08-16T11:04:33.447466Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.447466Z"},"links":{"cited_paper":"/paper/2007.03988","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:acb03994ec2ee7fa606b124003718c98d89fc8d78dea4d665cf7866af10a3cfb","observation_id":"91fae165-f7b9-4044-b16a-4a5eb183285b","resolution":{"observed_at":"2026-08-16T11:04:33.447466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.13469","last_updated":"2023-03-31T21:54:52Z","snapshot_observed_at":"2026-08-16T19:03:20.705503Z","submitted_at":"2022-11-24T08:26:18Z","title":"NQE: N-ary Query Embedding for Complex Query Answering over Hyper-Relational Knowledge Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.13469","snapshot_observed_at":"2026-08-16T11:04:33.451689Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.451689Z"},"links":{"cited_paper":"/paper/2211.13469","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:6c9ed63737c6e687ccfcb58e89535b9e9742f3df74000b965b77dc44daf19b66","observation_id":"774ec52a-8d79-47c3-9daa-f9aac391b88b","resolution":{"observed_at":"2026-08-16T11:04:33.451689Z","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-16T11:04:34.479798Z","title":null,"venue":null,"work_id":"7c4f97d4-5d0a-4b59-a097-6cf8f102b5a3","year":2011},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.455698Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:a1db91512abfdbdd59825da187eaa25e1ce7b1b797b66fd269c2139f6367c326","observation_id":"1de1acc7-8b14-4381-8eed-22ac67330794","resolution":{"observed_at":"2026-08-16T11:04:34.484093Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.14617","last_updated":"2023-03-26T04:03:37Z","snapshot_observed_at":"2026-08-16T15:45:20.115934Z","submitted_at":"2023-03-26T04:03:37Z","title":"Neural Graph Reasoning: Complex Logical Query Answering Meets Graph Databases","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.14617","snapshot_observed_at":"2026-08-16T11:04:33.459259Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.459259Z"},"links":{"cited_paper":"/paper/2303.14617","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:c5f400574c7758e03b8935b10c47825ae04a43c3a3a0edfe0d50362cd4b78c60","observation_id":"e40e42f0-6bfc-4e15-803a-d75e8bf7ca4c","resolution":{"observed_at":"2026-08-16T11:04:33.459259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.05969","last_updated":"2020-02-29T03:59:06Z","snapshot_observed_at":"2026-08-13T17:30:03.547401Z","submitted_at":"2020-02-14T11:20:10Z","title":"Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.05969","snapshot_observed_at":"2026-08-16T11:04:33.463365Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.463365Z"},"links":{"cited_paper":"/paper/2002.05969","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:856696e55efe2ebb741067ff6145c6ccadd27e888ed7261af8ea586e93be8197","observation_id":"d95a080e-2dbc-409f-8ec3-23f51dd79248","resolution":{"observed_at":"2026-08-16T11:04:33.463365Z","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-16T11:04:34.467436Z","title":null,"venue":null,"work_id":"c511d4f1-0da8-4f4a-b220-d089c023c3ca","year":2020},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.467842Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:251c2d5358b27df43b9372b6ed9f2250dd8e771c1a72f18fe91196ce032135f6","observation_id":"fe1eefd5-dcee-4ad9-9e9c-a7c29c55b424","resolution":{"observed_at":"2026-08-16T11:04:34.471876Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.02155","last_updated":"2018-04-12T18:51:33Z","snapshot_observed_at":"2026-08-14T19:39:03.889880Z","submitted_at":"2018-03-06T13:13:11Z","title":"Self-Attention with Relative Position Representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.02155","snapshot_observed_at":"2026-08-16T11:04:33.471648Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.471648Z"},"links":{"cited_paper":"/paper/1803.02155","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:61c21fb6e4595000b8de95fc272afb985f3210e6ae38b7667596a31133e2defe","observation_id":"256e4e04-1076-43eb-aa3e-46eac0b865cb","resolution":{"observed_at":"2026-08-16T11:04:33.471648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.09864","last_updated":"2023-11-08T13:36:32Z","snapshot_observed_at":"2026-08-17T06:56:20.644738Z","submitted_at":"2021-04-20T09:54:06Z","title":"RoFormer: Enhanced Transformer with Rotary Position Embedding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.09864","snapshot_observed_at":"2026-08-16T11:04:33.475785Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.475785Z"},"links":{"cited_paper":"/paper/2104.09864","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:ebd47c5635b0c9914dbf7435fef4f2ba3bfbd2b6c07ef520c1dc33e099961e90","observation_id":"88d79ff5-ed49-4fc4-9ffb-6681a1431c17","resolution":{"observed_at":"2026-08-16T11:04:33.475785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.10197","last_updated":"2019-02-26T20:15:09Z","snapshot_observed_at":"2026-08-18T06:15:13.456287Z","submitted_at":"2019-02-26T20:15:09Z","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.10197","snapshot_observed_at":"2026-08-16T11:04:33.479955Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.479955Z"},"links":{"cited_paper":"/paper/1902.10197","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:c1d56dde4ce7e57f57e19fbdb9e8727ed453c19c9cf83ec543dc0fe73c8a707e","observation_id":"642e8c57-2822-4c8b-b730-6e0e537b76c7","resolution":{"observed_at":"2026-08-16T11:04:33.479955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1503.00075","last_updated":"2015-05-30T06:51:20Z","snapshot_observed_at":"2026-08-16T16:31:47.013439Z","submitted_at":"2015-02-28T06:31:50Z","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.00075","snapshot_observed_at":"2026-08-16T11:04:33.484133Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.484133Z"},"links":{"cited_paper":"/paper/1503.00075","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:b74ea159806c2222fac249f27bb19f2ce493222d211e6b1b627a34efe7fa4ddc","observation_id":"fff9079d-e705-4a0a-a8a8-7c0e7017cf84","resolution":{"observed_at":"2026-08-16T11:04:33.484133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.06357","last_updated":"2016-06-20T22:52:48Z","snapshot_observed_at":"2026-08-16T09:30:26.415650Z","submitted_at":"2016-06-20T22:52:48Z","title":"Complex Embeddings for Simple Link Prediction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.06357","snapshot_observed_at":"2026-08-16T11:04:33.488034Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.488034Z"},"links":{"cited_paper":"/paper/1606.06357","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:eecc8d7cba0250fcef4b95b3c1624c5784bb7059fc060fb8cead825994cf4fe1","observation_id":"d692610e-6d56-4103-86a3-882ccbe3806f","resolution":{"observed_at":"2026-08-16T11:04:33.488034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.03762","last_updated":"2023-08-02T00:41:18Z","snapshot_observed_at":"2026-08-19T04:42:40.974785Z","submitted_at":"2017-06-12T17:57:34Z","title":"Attention Is All You Need","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.03762","snapshot_observed_at":"2026-08-16T11:04:33.492122Z","title":"Gomez, Lukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.492122Z"},"links":{"cited_paper":"/paper/1706.03762","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:6694ddafc85417e79bf02d857b744b09589ee24b7a9039167f9ffe83ac0afa9a","observation_id":"377672c0-5c8a-4985-9e50-d24c0fc03c02","resolution":{"observed_at":"2026-08-16T11:04:33.492122Z","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":"10.18653/v1/2021.findings-acl.35","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:04:33.775132Z","title":null,"venue":null,"work_id":"47403612-b971-484f-9e10-898c9fd1938c","year":2021},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.496004Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:25bb09c5e2861474f3d5f1254442a24a9d8f6793aa4b01d18284e57bec93ce92","observation_id":"d2aa2256-b736-4c2d-b10f-5adc19d5a5b7","resolution":{"observed_at":"2026-08-16T11:04:33.779664Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.07293","last_updated":"2021-01-20T06:23:37Z","snapshot_observed_at":"2026-08-14T17:00:55.080339Z","submitted_at":"2019-03-18T08:19:40Z","title":"Heterogeneous Graph Attention Network","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.07293","snapshot_observed_at":"2026-08-16T11:04:33.499740Z","title":"Yu, and Yanfang Ye","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.499740Z"},"links":{"cited_paper":"/paper/1903.07293","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:499b27e085e78d8f53cb8dd1524f2a6583e1ed311e6c7c1efe7df99fada8d22d","observation_id":"50309013-1b3d-4e47-bf5c-56d2e1aa6fa8","resolution":{"observed_at":"2026-08-16T11:04:33.499740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.08859","last_updated":"2023-08-26T07:45:41Z","snapshot_observed_at":"2026-08-16T16:01:02.309425Z","submitted_at":"2023-01-21T02:34:06Z","title":"Logical Message Passing Networks with One-hop Inference on Atomic Formulas","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.08859","snapshot_observed_at":"2026-08-16T11:04:33.503684Z","title":"Wong, and Simon See","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.503684Z"},"links":{"cited_paper":"/paper/2301.08859","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:72c7f4d3b71fd69768217d21d2078b00c00873bc713a756bf6fcd58392c56a84","observation_id":"6c69c15b-fca5-42aa-b078-6fcdebfd388c","resolution":{"observed_at":"2026-08-16T11:04:33.503684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.08925","last_updated":"2021-11-05T02:39:31Z","snapshot_observed_at":"2026-08-19T22:03:15.048132Z","submitted_at":"2021-09-18T12:58:55Z","title":"Benchmarking the Combinatorial Generalizability of Complex Query Answering on Knowledge Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.08925","snapshot_observed_at":"2026-08-16T11:04:33.508113Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.508113Z"},"links":{"cited_paper":"/paper/2109.08925","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:4cfd2ccd0e99ba1f867e8fd015c599518391f6a2c56cdfa7a796824fcc0e9e22","observation_id":"937f50ff-e265-41e3-879c-db5a4a7fd760","resolution":{"observed_at":"2026-08-16T11:04:33.508113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.08642","last_updated":"2016-04-28T22:42:38Z","snapshot_observed_at":"2026-08-14T21:59:36.694163Z","submitted_at":"2016-04-28T22:42:38Z","title":"On the representation and embedding of knowledge bases beyond binary relations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.08642","snapshot_observed_at":"2026-08-16T11:04:33.512939Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.512939Z"},"links":{"cited_paper":"/paper/1604.08642","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:6d0131cd6344ac8342308d297314d31682c4f0c14118a3a2fb9941569881a094","observation_id":"19cde9ca-2289-4378-9964-0ea3381dfff2","resolution":{"observed_at":"2026-08-16T11:04:33.512939Z","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":"10.48550/arxiv.2310.11246","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:04:33.713934Z","title":null,"venue":null,"work_id":"1a8b9d78-614b-4ed0-94d1-bffd441c5966","year":2023},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.517501Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:b4af12ed6ad0db85bd1bcce97ea48084f4690a047d9cbc8cbc20f55d1c888c4b","observation_id":"ab2b00be-dbdb-4983-8d22-a49752e88342","resolution":{"observed_at":"2026-08-16T11:04:33.719344Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.08779","last_updated":"2022-09-19T06:07:10Z","snapshot_observed_at":"2026-08-16T16:31:36.864954Z","submitted_at":"2022-09-19T06:07:10Z","title":"Neural-Symbolic Entangled Framework for Complex Query Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.08779","snapshot_observed_at":"2026-08-16T11:04:33.521932Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.521932Z"},"links":{"cited_paper":"/paper/2209.08779","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:1d77d64040129aaeb1ab0ecc586ebcab95eb1542a9b81b85007e035b859744c9","observation_id":"d7c12d90-cb0e-4304-8269-07914d9f19ef","resolution":{"observed_at":"2026-08-16T11:04:33.521932Z","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-16T11:04:34.455922Z","title":null,"venue":null,"work_id":"b08f4c66-33ac-47da-8fe6-414a9d3b4149","year":2020},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.526685Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:5f419df7f8b51c7e409034fdb9a173e3ffaeba6a72135bdbd2e459b6e4ecd334","observation_id":"05971a46-a3a3-4b13-a589-5ce46b080871","resolution":{"observed_at":"2026-08-16T11:04:34.459568Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.02589","last_updated":"2019-05-22T13:48:41Z","snapshot_observed_at":"2026-08-19T11:04:28.860819Z","submitted_at":"2018-09-07T17:27:25Z","title":"HyperGCN: A New Method of Training Graph Convolutional Networks on Hypergraphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.02589","snapshot_observed_at":"2026-08-16T11:04:33.531038Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.531038Z"},"links":{"cited_paper":"/paper/1809.02589","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:9df210bb7523b4a2c491be2c64d2f31d459085cbb5eb166e7adf2a6cca14a73b","observation_id":"30e9c627-f769-486c-9f30-73015a1724c2","resolution":{"observed_at":"2026-08-16T11:04:33.531038Z","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-16T11:04:33.535614Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.535614Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:91c24345e2da57c18ab5ffa4e5f5f4a322f5f7deca480a355d9f72a29b3fb559","observation_id":"7ea68c06-28f4-4d17-9932-f8da521cf96f","resolution":{"observed_at":"2026-08-16T11:04:33.535614Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14880","last_updated":"2024-06-21T06:02:58Z","snapshot_observed_at":"2026-08-16T13:40:51.768436Z","submitted_at":"2024-06-21T06:02:58Z","title":"Pathformer: Recursive Path Query Encoding for Complex Logical Query Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14880","snapshot_observed_at":"2026-08-16T11:04:33.539895Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.539895Z"},"links":{"cited_paper":"/paper/2406.14880","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:09b3a065bbe88a7d24ba7425f0ffd278abcc1130c51cd0d7cb9d9ef97c27c459","observation_id":"820d0040-602f-4038-9b5e-5e87ad45ca76","resolution":{"observed_at":"2026-08-16T11:04:33.539895Z","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-16T11:04:33.544276Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.544276Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:4eb3795190e48c25f6a5948f351313d125bea186b38f04938b76bb38d7523483","observation_id":"5b9dcb76-2296-49f2-b980-ccebc1ed54e5","resolution":{"observed_at":"2026-08-16T11:04:33.544276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.13715","last_updated":"2021-12-22T08:05:31Z","snapshot_observed_at":"2026-08-18T13:12:33.008462Z","submitted_at":"2021-10-26T14:04:02Z","title":"ConE: Cone Embeddings for Multi-Hop Reasoning over Knowledge Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.13715","snapshot_observed_at":"2026-08-16T11:04:33.547948Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.547948Z"},"links":{"cited_paper":"/paper/2110.13715","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:c6312a7b6960892d7efdaf1a6e097bf6c6691a402fb3e9d9adb7c16504f53fd4","observation_id":"69e82331-5779-4b7c-9309-e78150e04cba","resolution":{"observed_at":"2026-08-16T11:04:33.547948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.00759","last_updated":"2025-07-10T07:45:30Z","snapshot_observed_at":"2026-08-14T13:08:58.878185Z","submitted_at":"2025-01-01T07:05:32Z","title":"Enhancing Transformers for Generalizable First-Order Logical Entailment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.00759","snapshot_observed_at":"2026-08-16T11:04:33.552034Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.552034Z"},"links":{"cited_paper":"/paper/2501.00759","citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:8c64117c6f348fe7b6c718e0c565ae6806acf461bb4c5eca3fafeccb8aa81a34","observation_id":"164d4861-6e5c-4a69-aee8-f16cb6b52e93","resolution":{"observed_at":"2026-08-16T11:04:33.552034Z","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-16T11:04:33.555991Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.555991Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:e033afb006a411f2d5c0b9d632bcf49ad2723d0ee93b5b5c586cd879ac80a235","observation_id":"f5b1af1b-bfa0-4ea4-bc13-23baeab197b2","resolution":{"observed_at":"2026-08-16T11:04:33.555991Z","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-16T11:04:33.560024Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T11:04:33.560024Z"},"links":{"citing_paper":"/paper/2504.16537"},"observation_digest":"sha256:0f6a45b2b008a0b270405b39beffd025e00ebeebf49ad31456d8e7b233403aa0","observation_id":"b9f59ed8-e022-4c6a-8664-6a30d8a09af6","resolution":{"observed_at":"2026-08-16T11:04:33.560024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.16537","last_updated":"2025-04-23T09:07:21Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-18T19:42:48.871092Z","submitted_at":"2025-04-23T09:07:21Z","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":40,"verified_exact":7,"verified_fuzzy":0},"total_outbound_references":49},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 1 inbound Pith citation observation for arXiv:2504.16537."}