{"as_of":"2026-08-08T09:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b03f868b1546c851d5e913ebea91749ebc600d0173d4ed595d1d18e29e1458c1","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:18:42.395182Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.19408/citation-record","integrity":"/paper/2505.19408/integrity","json":"/paper/2505.19408/citation-record.json","paper":"/paper/2505.19408"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.01179","last_updated":"2021-06-04T14:52:04Z","snapshot_observed_at":"2026-07-31T03:18:54.464120Z","submitted_at":"2020-10-02T19:53:05Z","title":"The Surprising Power of Graph Neural Networks with Random Node Initialization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.01179","snapshot_observed_at":"2026-08-07T14:18:36.259417Z","title":"The sur- prising power of graph neural networks with random node initialization.arXiv preprint arXiv:2010.01179, 2020","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:36.259417Z"},"links":{"cited_paper":"/paper/2010.01179","citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:0cdaca7ce2a02b2f07dc33c7de2ed321f2cefbc891a12351d61586044fe5925c","observation_id":"61feebdb-84ea-42d3-bfd8-c862258f6ccc","resolution":{"observed_at":"2026-08-07T14:18:36.259417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:50.455580Z","title":"Temporal graph neural networks for social recommendation","venue":null,"work_id":"d6f47792-6bfb-4b9f-875d-159ab5cee3fc","year":2020},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:36.437050Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:3528ff7948f110ee107867c923b78ad097c9f38f3290e3594900e3943c606cac","observation_id":"d64856af-77b1-4940-b849-2f6692b3fbf0","resolution":{"observed_at":"2026-08-07T14:18:50.621574Z","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":"2502.13660","last_updated":"2025-02-19T12:12:57Z","snapshot_observed_at":"2026-08-07T18:05:30.152233Z","submitted_at":"2025-02-19T12:12:57Z","title":"Towards Invariance to Node Identifiers in Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13660","snapshot_observed_at":"2026-08-07T14:18:36.573294Z","title":"Towards invariance to node identifiers in graph neural networks.arXiv preprint arXiv:2502.13660, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:36.573294Z"},"links":{"cited_paper":"/paper/2502.13660","citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:8b6e76c0f38596f5287568ce036cee1a4fbe5dc97434618465cad7935fb989bd","observation_id":"39082cb2-7242-457c-aef7-9d805df23ec5","resolution":{"observed_at":"2026-08-07T14:18:36.573294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:50.128983Z","title":"Hot: Higher-order dynamic graph representation learning with efficient transformers","venue":null,"work_id":"f5c7ba27-75bf-44f6-a9ca-efe8f13a2d4f","year":2024},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:36.745736Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:55bd91d47da273c45336850e959467887130a49d293791a9575ef95ebd216f27","observation_id":"8ed18f6f-7543-472e-8ff2-e82ef7382a3a","resolution":{"observed_at":"2026-08-07T14:18:50.294355Z","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":"1406.1078","last_updated":"2014-09-03T00:25:02Z","snapshot_observed_at":"2026-07-06T03:45:28.546418Z","submitted_at":"2014-06-03T17:47:08Z","title":"Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.1078","snapshot_observed_at":"2026-08-07T14:18:36.931839Z","title":"Learning phrase representations using rnn encoder- decoder for statistical machine translation.arXiv preprint arXiv:1406.1078, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:36.931839Z"},"links":{"cited_paper":"/paper/1406.1078","citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:ce5efbd53ed191d38375976df9a80d8dd6ad2607d20998e3a97fb54ede1cc3d9","observation_id":"3d58dad3-1044-4198-9c2b-2ea08799da09","resolution":{"observed_at":"2026-08-07T14:18:36.931839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:49.821234Z","title":null,"venue":null,"work_id":"299acbe9-d946-43ac-a5de-bf96ca65e789","year":2023},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:37.051349Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:6af87b4148099f0eb4a5f3eff0a8e867ac3e4cb8906fc5e2db0a88fb7f73469f","observation_id":"80450f18-c75e-4c76-aa0c-e26841beb98e","resolution":{"observed_at":"2026-08-07T14:18:49.948802Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:49.509977Z","title":"Applications of link prediction in social networks: A review.Journal of Network and Computer Applications, 166:102716, 2020","venue":null,"work_id":"5cfb3ac3-3345-4a85-922a-62f94b247ac2","year":2020},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:37.193075Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:8fcc2925262cb3d893fd81b110bec0d24020ef4a67113f3a83cea81af7241999","observation_id":"a52fb145-39e5-475d-bc41-0defc0978605","resolution":{"observed_at":"2026-08-07T14:18:49.687514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:49.249660Z","title":"Temporal link prediction: A survey.New Generation Computing, 38(1):213–258, 2020","venue":null,"work_id":"66d86d8d-b7a7-4e50-9a00-eba39bf12045","year":2020},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:37.334476Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:58e72d3c86514113ad505df2ab7a368397611d7ba88d8f5548e232d3c6e02529","observation_id":"cbeb7328-bb2b-4398-a420-3650bea232ae","resolution":{"observed_at":"2026-08-07T14:18:49.356605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:48.915352Z","title":"Machine learning on dynamic graphs: a survey on applications.2023 IEEE Ninth Multimedia Big Data (BigMM), pages 32–39, 2023","venue":null,"work_id":"e915f6e9-be1e-4652-a4f3-bc5a75922e84","year":2023},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:37.455618Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:545d963c699a8a3a71f21a4387b5a31f9b29f05fe89b63e3124e2e18cf00fb9f","observation_id":"6ea6176c-52ac-40ed-a107-c48e9ef31f3e","resolution":{"observed_at":"2026-08-07T14:18:49.059027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:48.611140Z","title":"A systemic analysis of link prediction in social network.Artificial Intelligence Review, 52:1961–1995, 2019","venue":null,"work_id":"8880ec98-f4c8-4f9d-9758-13393528ffc4","year":1961},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:37.617806Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:52b38742d2320d0f95a91fb6921a1f9e30deadf28b25dabd5d00f6734342e349","observation_id":"93f1d45d-f078-493a-ba28-e1adbe0abc1f","resolution":{"observed_at":"2026-08-07T14:18:48.738693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:48.353648Z","title":null,"venue":null,"work_id":"22eb2a04-3388-4c46-9e77-ab107fb47760","year":1971},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:37.739501Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:c7fa365c8da21c1b6596cd92b1c291e23c0e8c48365fcd1537417beb64d7c741","observation_id":"4ef4f8c5-47fb-4ed1-91ac-40459b0f773b","resolution":{"observed_at":"2026-08-07T14:18:48.485519Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:48.058274Z","title":"Tempo- ral graph benchmark for machine learning on temporal graphs.Advances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":"c7713a13-bb89-4a04-a950-4d0fdc340bcc","year":2024},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:37.896845Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:e6910888f1e8ed79cb19c99e0eb1a43bec5af2b08fa660ec89f27b3d7b830b59","observation_id":"16856320-491e-415f-b26d-9adc55b0f361","resolution":{"observed_at":"2026-08-07T14:18:48.158231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:38.065114Z","title":"Self-attentive sequential recommendation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:38.065114Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:507ec9b201d05b81f6e4cb7329f3b746c3128f6fc1ae1503265752086c596a09","observation_id":"8a8c8993-b515-41ee-bd29-c64699a55b46","resolution":{"observed_at":"2026-08-07T14:18:38.065114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:38.170311Z","title":"Representation learning for dynamic graphs: A survey.Journal of Machine Learning Research, 21(70):1–73, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:38.170311Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:7d01a7baecc900a7569360226380407703e76e293660686e72bc03144337fca1","observation_id":"e1fdf86f-66b1-4cb0-aa15-28719e014b01","resolution":{"observed_at":"2026-08-07T14:18:38.170311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:47.749158Z","title":"Learning temporal attention in dynamic graphs with bilinear interactions.Plos one, 16(3):e0247936, 2021","venue":null,"work_id":"03a643af-ae63-4340-8c7f-3fbaea4e80fb","year":2021},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:38.316908Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:5f58d2f209aa2c964c42ecfd535c0bf914d9b03e76e578faa750fcd42806968d","observation_id":"18f4b958-0f57-4370-b834-a0cbc0668e78","resolution":{"observed_at":"2026-08-07T14:18:47.879261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:38.447173Z","title":"Predicting dynamic embedding trajectory in temporal interaction networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:38.447173Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:4066c0cef39b70a6fbb13d4e007f857b7af6b8ec3e4770aeaa71bc950f3e0c3d","observation_id":"fb7521a0-37ed-46db-800f-b066f8ccc594","resolution":{"observed_at":"2026-08-07T14:18:38.447173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.08520","last_updated":"2024-11-04T06:32:35Z","snapshot_observed_at":"2026-07-06T17:01:21.970309Z","submitted_at":"2023-12-13T21:15:29Z","title":"Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)","version":2},"cited_work":{"arxiv_id":"2312.08520","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.08520","snapshot_observed_at":"2026-08-07T14:18:43.171320Z","title":"Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)","venue":"cs.AI","work_id":"5f37e49d-9619-412c-b9b3-dac18980f0c5","year":2023},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:38.569906Z"},"links":{"cited_paper":"/paper/2312.08520","citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:aa7ce990a608b50b47a5ed9776f74922003262f2dd2850a3bf7f629256c2fc28","observation_id":"51ba5196-d008-4311-a6b1-a48c0fa2aa29","resolution":{"observed_at":"2026-08-07T14:18:43.252097Z","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":"1907.03199","last_updated":"2020-01-28T13:24:15Z","snapshot_observed_at":"2026-07-06T08:05:33.053199Z","submitted_at":"2019-07-06T22:26:17Z","title":"What graph neural networks cannot learn: depth vs width","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.03199","snapshot_observed_at":"2026-08-07T14:18:38.716308Z","title":"What graph neural networks cannot learn: depth vs width.arXiv preprint arXiv:1907.03199, 2019","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:38.716308Z"},"links":{"cited_paper":"/paper/1907.03199","citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:7693918af18dac6b7a80ac92f73e4a81e82ea8e59e3d4a6aafade7bc9a4fc6ae","observation_id":"3f7f895e-d2f0-4647-a086-30823c06b47f","resolution":{"observed_at":"2026-08-07T14:18:38.716308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:47.491439Z","title":"Neighborhood-aware scalable temporal network representation learning","venue":null,"work_id":"2dbc5884-dc9b-4b5d-b5a8-8e55af522d9e","year":2022},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:38.861542Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:a56c739dcb1071fc64b07a163c348a8fdd0fe83e8086ea72c789bbbd24b61bc3","observation_id":"3060d87d-07c1-47a0-bab8-a7d0f9b2f2c5","resolution":{"observed_at":"2026-08-07T14:18:47.624297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:47.211404Z","title":"The neural hawkes process: A neurally self-modulating multivariate point process.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":"09a0e5a5-c997-47a9-8183-bb8fdbed4a69","year":2017},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:38.983824Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:b08c4bcc945087a62305912af31d6494e45324e664fec168461aec8f378113d7","observation_id":"54e2954f-c2c1-48a5-9175-d805a5fa9475","resolution":{"observed_at":"2026-08-07T14:18:47.349414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:46.883849Z","title":"de Rijke","venue":null,"work_id":"d73c7cae-ebeb-42ab-a43c-1efbac6bc585","year":2020},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:39.138254Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:1420cd1be698a6771ba1249e38e3cbefb58f5592ed1373ca1051121118648803","observation_id":"6362e3c1-9f25-4803-a5df-8fae95cc95eb","resolution":{"observed_at":"2026-08-07T14:18:47.060391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:46.618663Z","title":null,"venue":null,"work_id":"1d851932-1abe-4525-97ec-2f15e2862dea","year":2009},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:39.261524Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:df46461c101fc55fd13b2899949559c2d968c5527248dd59b35d88eeabbce744","observation_id":"3ef68453-b7ac-41b0-a534-0c6c07b093a4","resolution":{"observed_at":"2026-08-07T14:18:46.777450Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:46.328108Z","title":"Towards better evaluation for dynamic link prediction.Advances in Neural Information Processing Systems, 35:32928–32941, 2022","venue":null,"work_id":"4fd53d9e-872d-47c8-9759-d5a5344c06a5","year":2022},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:39.384406Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:b30b1dc1e139d403454a3e8df1ee97d21c7d4e101cd004e73c8a440d6ee3d497","observation_id":"b7d30cfb-2885-4f17-875e-3853ae3c5cb0","resolution":{"observed_at":"2026-08-07T14:18:46.472907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:46.071574Z","title":"Temporal graph learning for financial world: Algorithms, scalability, explainability & fairness","venue":null,"work_id":"dd0e7611-f2c9-4751-b71b-8cd2f77cea27","year":2022},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:39.535700Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:d2dff6c9868d0da79ded436d863a93d498e9dfae2e685eb654975fcf24c2f3e0","observation_id":"dc0842eb-d6ae-42e7-9c6b-130af9252398","resolution":{"observed_at":"2026-08-07T14:18:46.211790Z","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":"1205.2618","last_updated":"2012-05-09T18:25:09Z","snapshot_observed_at":"2026-07-06T02:47:58.266745Z","submitted_at":"2012-05-09T18:25:09Z","title":"BPR: Bayesian Personalized Ranking from Implicit Feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.2618","snapshot_observed_at":"2026-08-07T14:18:39.720960Z","title":"Bpr: Bayesian personalized ranking from implicit feedback.arXiv preprint arXiv:1205.2618, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:39.720960Z"},"links":{"cited_paper":"/paper/1205.2618","citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:81c070d2a13bbc03fb68d6d9003a8797601000ec49f0d6749b1b4c551b5a192c","observation_id":"cd2a629b-0fcd-4970-af8a-a4caa873520a","resolution":{"observed_at":"2026-08-07T14:18:39.720960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:45.815982Z","title":"Temporal graph networks for deep learning on dynamic graphs","venue":null,"work_id":"8284b427-dfff-4555-9346-e2249bdc623e","year":2020},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:39.862888Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:a15aa5b988382a7f620106d9e6c84e2355f1eceb335845a20e948ccc5046bc5f","observation_id":"36ef97a9-3938-41ed-9d9a-105acba1a267","resolution":{"observed_at":"2026-08-07T14:18:45.922340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:40.007248Z","title":"Methods and metrics for cold-start recommendations","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:40.007248Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:94011b6f4b9e1e14f3e23f42d33c73abe438cbe69dcf649cf810d352fa2c11fd","observation_id":"ba21ce28-fafd-4d7f-959b-a256eb4108b0","resolution":{"observed_at":"2026-08-07T14:18:40.007248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:45.539763Z","title":"Foundations and modeling of dynamic networks using dynamic graph neural networks: A survey.iEEE Access, 9:79143–79168, 2021","venue":null,"work_id":"1c0fc1e7-f20c-4517-bc7e-c17895a03cdb","year":2021},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:40.159349Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:20c73792a53487e77ca24a9c62b805b4598c0a83873ce8edffc209333bd2a74c","observation_id":"1a3616ae-3d40-4a63-8cb9-9d1fedb57b16","resolution":{"observed_at":"2026-08-07T14:18:45.682629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:45.271415Z","title":"Co-author rela- tionship prediction in heterogeneous bibliographic networks","venue":null,"work_id":"7feadc62-d4ef-4c9d-b878-29a21319127b","year":2011},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:40.295194Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:f147decd4fe033c2591523490e8cf83d07849d473f4e3ad5c4a72c65f55c9f96","observation_id":"f19a5c2e-b25d-492b-8b0c-ae2e7cc1ae94","resolution":{"observed_at":"2026-08-07T14:18:45.419336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:40.461567Z","title":"Mlp-mixer: An all-mlp architecture for vision.Advances in neural information processing systems, 34: 24261–24272, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:40.461567Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:4e44626490f3a2da2f51e7b6411ac1cd7744b4996f5a3b078eacf19eaa70c17e","observation_id":"b64ac4bc-0124-4dc0-8b2d-817d55060ecd","resolution":{"observed_at":"2026-08-07T14:18:40.461567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:44.952152Z","title":"Dyrep: Learn- ing representations over dynamic graphs","venue":null,"work_id":"70c237ac-bb7e-4979-acd5-e3f068f18826","year":2019},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:40.566477Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:e090d608b21456f87bb73ab69c0195007f53e9b8487aa1df9a44f43ba4c8d75f","observation_id":"7d4f746f-4933-4236-891c-17a805df200c","resolution":{"observed_at":"2026-08-07T14:18:45.086193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:40.710609Z","title":"Attention is all you need.Advances in Neural Information Processing Systems, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:40.710609Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:7deb6b4755755d3da835195da40bbd51735d557cded2b5ba4503475164e64529","observation_id":"81867d02-3006-44ac-9139-67c7ed1f4f5e","resolution":{"observed_at":"2026-08-07T14:18:40.710609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.07944","last_updated":"2021-05-17T15:33:25Z","snapshot_observed_at":"2026-08-07T20:17:21.322116Z","submitted_at":"2021-05-17T15:33:25Z","title":"TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.07944","snapshot_observed_at":"2026-08-07T14:18:40.876674Z","title":"Tcl: Transformer-based dynamic graph modelling via contrastive learning.arXiv preprint arXiv:2105.07944, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:40.876674Z"},"links":{"cited_paper":"/paper/2105.07944","citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:06da9e72d66c97b9945fb7da3116394e9cbbafeea8fb5b437337d5ec36cb7c50","observation_id":"c388405f-2670-41ec-900a-3b06788d562c","resolution":{"observed_at":"2026-08-07T14:18:40.876674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:44.746336Z","title":"Inductive representation learning in temporal networks via causal anonymous walks","venue":null,"work_id":"930b89f1-5092-4cc5-8f9f-b53fd66e810e","year":2021},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:41.006458Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:61993e6d519a65484be4a29e673ff6fdb67e93f142eeff8f2e2acc9ce5ecf21f","observation_id":"43c6eaa9-352c-4a9b-8691-e10ef4bb5f87","resolution":{"observed_at":"2026-08-07T14:18:44.852877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:44.479125Z","title":"Trend: Temporal event and node dynamics for graph representation learning","venue":null,"work_id":"17d2fcea-66e8-4910-a0cb-8b9cced2e400","year":2022},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:41.139974Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:07e8077a3b9cfc25493a5c8ba47d1d43afb0ea8acd299c1652748324cd8fa831","observation_id":"e3ce770e-b795-4a5a-9ce6-af685778ae83","resolution":{"observed_at":"2026-08-07T14:18:44.618638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:44.251826Z","title":"Recurrent recommender networks","venue":null,"work_id":"2e40d39b-732d-44e5-9590-3f53e1f63887","year":2017},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:41.292364Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:47f4a8dc7ddb4c14f1b9284c578d2c88583b650b6e716ab913e7fd4883ded8ee","observation_id":"8ae5f9b9-0a05-44f5-98c9-050f8745a1e5","resolution":{"observed_at":"2026-08-07T14:18:44.367437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:44.029837Z","title":"On the feasibility of simple transformer for dynamic graph modeling","venue":null,"work_id":"e867ddac-1ef6-47df-af92-a91381a5a8df","year":2024},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:41.472877Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:18ab4a6d6741d53dc65a50e2111d29b977a9b209f29846f6177cfcd4dd53a19c","observation_id":"376cac0e-2920-4197-b07a-9711ec7b2b72","resolution":{"observed_at":"2026-08-07T14:18:44.126495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:43.802022Z","title":"Inductive representation learning on temporal graphs","venue":null,"work_id":"c7624b03-9c0a-4337-9ddb-af5862931df8","year":2020},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:41.666200Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:fb1764b4ce376587d0f820c0ed56e8e23b07df88aeeff7c65dfd583eb3085cc7","observation_id":"d3edf47b-432e-4f9e-8955-58259871869c","resolution":{"observed_at":"2026-08-07T14:18:43.923534Z","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":"2412.20256","last_updated":"2024-12-28T20:02:29Z","snapshot_observed_at":"2026-07-06T20:14:08.237082Z","submitted_at":"2024-12-28T20:02:29Z","title":"Towards Ideal Temporal Graph Neural Networks: Evaluations and Conclusions after 10,000 GPU Hours","version":1},"cited_work":{"arxiv_id":"2412.20256","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.20256","snapshot_observed_at":"2026-08-07T14:18:42.876783Z","title":"Towards Ideal Temporal Graph Neural Networks: Evaluations and Conclusions after 10,000 GPU Hours","venue":"cs.LG","work_id":"ded6034c-d238-465f-84f0-393a96252612","year":2024},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:41.835629Z"},"links":{"cited_paper":"/paper/2412.20256","citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:c3c89e019b379c5470b4662d98d45dd1a3a045717a730afc561afedce3d5f395","observation_id":"66fd8a9b-53ea-49a8-8930-c4b7de6ce524","resolution":{"observed_at":"2026-08-07T14:18:42.977402Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:43.645842Z","title":"Tgb-seq benchmark: Challenging temporal gnns with complex sequential dynamics","venue":null,"work_id":"dfdce312-3e98-40bd-8987-ab43f6c6228b","year":null},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:41.986832Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:54c9046f0253509b15acf1b1b6bb8461f704bc1fe7fed7ef9a18a85d49339950","observation_id":"1a587110-2258-4436-a7e8-bb1623b04e92","resolution":{"observed_at":"2026-08-07T14:18:43.715961Z","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":"2307.12510","last_updated":"2023-10-15T09:18:23Z","snapshot_observed_at":"2026-08-08T03:51:02.752405Z","submitted_at":"2023-07-24T03:52:11Z","title":"An Empirical Evaluation of Temporal Graph Benchmark","version":5},"cited_work":{"arxiv_id":"2307.12510","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.12510","snapshot_observed_at":"2026-08-07T14:18:42.605532Z","title":"An Empirical Evaluation of Temporal Graph Benchmark","venue":"cs.LG","work_id":"ee646213-cdbc-4da0-a816-b08b46501053","year":2023},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:42.124827Z"},"links":{"cited_paper":"/paper/2307.12510","citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:38f7fd48880fe2f27b7df4cede14aacd5e54302e542e6785784eb09d302235b0","observation_id":"a695844f-5ba7-4343-b13f-441549782454","resolution":{"observed_at":"2026-08-07T14:18:42.710026Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:18:43.509693Z","title":"Towards better dynamic graph learning: New ar- chitecture and unified library","venue":null,"work_id":"af04ae1d-4548-4f26-887f-35c102614a4b","year":2023},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:42.244686Z"},"links":{"citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:614a630a3523a533f6c00f6425721660b429500a5850e8aa839050ffd59179d9","observation_id":"e4561d95-d4b5-40bb-9d3f-c95739ca272e","resolution":{"observed_at":"2026-08-07T14:18:43.546894Z","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":"2404.18211","last_updated":"2024-04-28T15:07:48Z","snapshot_observed_at":"2026-07-06T18:06:40.922189Z","submitted_at":"2024-04-28T15:07:48Z","title":"A survey of dynamic graph neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.18211","snapshot_observed_at":"2026-08-07T14:18:42.395182Z","title":"A survey of dynamic graph neural networks.arXiv preprint arXiv:2404.18211, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:18:42.395182Z"},"links":{"cited_paper":"/paper/2404.18211","citing_paper":"/paper/2505.19408"},"observation_digest":"sha256:ae00c6871f0d98053b449a26d2ab12d9a46ec4c86d488c51fc2d790aaf3a88b7","observation_id":"24304d45-1834-4771-95e3-a1c05f01d0d6","resolution":{"observed_at":"2026-08-07T14:18:42.395182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.19408","last_updated":"2025-05-26T01:53:27Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T06:33:14.220868Z","submitted_at":"2025-05-26T01:53:27Z","title":"Future Link Prediction Without Memory or Aggregation"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":3,"verified_fuzzy":24},"total_outbound_references":43},"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 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2505.19408."}