{"as_of":"2026-08-15T14:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:38462b7e5afd4bc8d960c3ca484a300cff71b36960fa6e4a5582dc81038bb4c2","coverage":[{"denominator":74,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":74,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:23:04.942419Z","state":"measured"},{"denominator":74,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":74,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.13825/citation-record","integrity":"/paper/2507.13825/integrity","json":"/paper/2507.13825/citation-record.json","paper":"/paper/2507.13825"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:22:58.203721Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:58.203721Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:ecdc0d6f5ac3a82e71acd238c915bfeba0aae57cd7bb05574bc07a94e812766f","observation_id":"828d2d70-9faa-499a-a3a3-b918ac9cfdf3","resolution":{"observed_at":"2026-08-06T16:22:58.203721Z","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":"6218.36362","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:23:05.679989Z","title":null,"venue":null,"work_id":"21dc8da6-7a36-4d6c-94ba-21434578afe1","year":2023},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:58.398803Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:2bda73ad9be112c08041571b753ae7ea1de6555cca53628ea7a8322e0e18217a","observation_id":"709d91d9-5a74-45e9-9983-801da4c228f8","resolution":{"observed_at":"2026-08-06T16:23:05.806730Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:22:58.490252Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:58.490252Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:e5ebd022bf967e7359f5ce77921c7941a0ad7b7957d1673fcb796a12c3de4ded","observation_id":"9ba91566-5c3e-491d-ae7a-f713871f5217","resolution":{"observed_at":"2026-08-06T16:22:58.490252Z","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-06T16:23:06.760427Z","title":null,"venue":null,"work_id":"1e62fada-d0ae-44b3-bcc5-6bd128e55ce4","year":2018},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:58.575030Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:033de1d2b3de54192dd5cdd8a614101f565097b332090c364b16f8eef3828cb1","observation_id":"27be1a78-e309-45b8-b8e5-414a2fa3d896","resolution":{"observed_at":"2026-08-06T16:23:06.764295Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.747478Z","title":null,"venue":null,"work_id":"b48baeb0-6414-4329-832c-179eedbc2589","year":null},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:58.672454Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:51db91b88ab24f69f75cf89e27a0dc317aa3337091e5de19e088cd086a76764a","observation_id":"c23c0665-54b3-4be1-b5f9-7baefee5a793","resolution":{"observed_at":"2026-08-06T16:23:06.751393Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.718348Z","title":null,"venue":null,"work_id":"b527720e-adae-4cf7-9100-e1b721008f69","year":2023},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:58.809288Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:4e428e9ce96e440222100d4c95da181ef413931f6a81e4d847fa924872b3bdb3","observation_id":"f797564f-f876-43d0-92a8-6cd50b166ee9","resolution":{"observed_at":"2026-08-06T16:23:06.722414Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.702742Z","title":null,"venue":null,"work_id":"c1aec691-0ae5-4ab2-b5e0-f2400103a100","year":2021},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:58.856139Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:4ad36803b951728067009a11ca3352d3154d0c4dc0321ae4476059bdc6cf5f45","observation_id":"37ff6520-bdbf-4925-b4be-e3f01eaadb98","resolution":{"observed_at":"2026-08-06T16:23:06.706616Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.689211Z","title":null,"venue":null,"work_id":"d3f59a1b-d5f8-4436-ad54-0eb4437b2b75","year":2022},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:58.938342Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:288b89d366bfaab595e20ca165d34e8af0c1014410b5d1894103a0690c05a834","observation_id":"30565f6b-5e8b-4730-8e72-94f4d8899ad7","resolution":{"observed_at":"2026-08-06T16:23:06.693389Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.676049Z","title":null,"venue":null,"work_id":"0d54edc3-0905-4a82-b11b-9e34f5047497","year":2023},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:59.010111Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:f4a4ccf82d1d35995c044f3df6bcb2086c5e370764c9de23daf72ee16fa46873","observation_id":"7d3c4cb5-3c35-4de2-86ca-424530f4ae09","resolution":{"observed_at":"2026-08-06T16:23:06.679957Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.662605Z","title":null,"venue":null,"work_id":"f717080f-5e3a-46b9-a1bc-f88ef1a55e08","year":2024},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:59.050963Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:b50085d80791b7ea801878157ef050bd5e8ad803fa45acf27b297eccc056eebe","observation_id":"697bf55d-cc2a-47ff-a1fa-7d0a2a092182","resolution":{"observed_at":"2026-08-06T16:23:06.666902Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:22:59.115041Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:59.115041Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:69b444da58efd9dfa289311f6e6181d1593ac5edc402727562502699c5a9758d","observation_id":"26a1532c-28fb-45a1-b6cd-07429d2cde8b","resolution":{"observed_at":"2026-08-06T16:22:59.115041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-06T16:22:59.307341Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:59.307341Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:6026d6bb1bad867860de1abe15987d7ae52beacc03b4fde39a89bbb34b2310d1","observation_id":"f483cdbc-f97e-4143-9f78-173b0ac1cf8b","resolution":{"observed_at":"2026-08-06T16:22:59.307341Z","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-06T16:23:06.629898Z","title":null,"venue":null,"work_id":"6f397f62-fadf-4b8a-94ef-0e62aa2d009d","year":2024},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:59.431586Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:ea5258fb4f1643723eac03d1efb1353631b93aec2b5d7c0038d007c667a875f2","observation_id":"07b04480-066e-468e-a2af-75e2c594bdfd","resolution":{"observed_at":"2026-08-06T16:23:06.633953Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:22:59.138690Z","title":"Proceedings of the ACM on Management of Data 2, 3 (2024), 1–25","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:59.138690Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:a7949e2cffb6889d9602f19c50044e52f56417259c0802e2223c045f54ad173b","observation_id":"c92263db-c6c4-4c91-ab62-d393777e7b82","resolution":{"observed_at":"2026-08-06T16:22:59.138690Z","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-06T16:23:06.601386Z","title":null,"venue":null,"work_id":"55102e8e-7cc1-4fca-9de0-ab0a40ced92e","year":2012},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:59.653011Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:10eddcdaf78c099537f83885c4c11096c6c5de634d598bd22c26955b0493f2b4","observation_id":"87d05144-92f7-4f2e-88c0-4be6fe56e14f","resolution":{"observed_at":"2026-08-06T16:23:06.605881Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.586585Z","title":null,"venue":null,"work_id":"3cc1497f-7cdb-4315-8336-2da4ce9434df","year":2016},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:59.792155Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:9d5093456c29337954e3efdc5c5c9ea2c762040582cb0c9f0bb5c2ae76b31a31","observation_id":"e687c8fa-81be-4ea4-b2a8-69156156a40a","resolution":{"observed_at":"2026-08-06T16:23:06.591133Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.615688Z","title":null,"venue":null,"work_id":"7129027e-cea6-4cea-af1b-afd3ca3d4bad","year":2016},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:59.536846Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:9dde598261782c289725405eb6c97e272a309303f19e1b0ff0777330f52a20d4","observation_id":"8046da06-d148-469c-bf00-98b50760a4b5","resolution":{"observed_at":"2026-08-06T16:23:06.619825Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05477","last_updated":"2024-09-18T09:15:10Z","snapshot_observed_at":"2026-08-15T11:52:32.034648Z","submitted_at":"2024-09-09T10:11:25Z","title":"Retrofitting Temporal Graph Neural Networks with Transformer","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.05477","snapshot_observed_at":"2026-08-06T16:23:00.090421Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:00.090421Z"},"links":{"cited_paper":"/paper/2409.05477","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:fde110615bce6c1b41ae55dd90e8998b1c35b689bb3830b172c2806c7fd5e307","observation_id":"90b14a50-104f-446f-ae3c-78ae28f641ed","resolution":{"observed_at":"2026-08-06T16:23:00.090421Z","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-06T16:23:06.559214Z","title":null,"venue":null,"work_id":"04a54639-cfed-443d-b4fa-5a5139559759","year":2024},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:00.249512Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:5a83f566c46b1b78c408b4d6d401ec5570740371c36cd0e04b3291a44fbf3ed8","observation_id":"47c16038-3f2c-4087-bfd6-9066a3d2f459","resolution":{"observed_at":"2026-08-06T16:23:06.563644Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.573012Z","title":null,"venue":null,"work_id":"2b4368b2-2bfa-4f23-a2ec-3cc7e3249b06","year":2024},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:59.943661Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:7ac00a13695b608b0e2a3a8664c4bdb1346870aba30441c07275436f31598273","observation_id":"f5c18f74-2324-4e13-9f25-186f80ba00a1","resolution":{"observed_at":"2026-08-06T16:23:06.577460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.532529Z","title":null,"venue":null,"work_id":"69617e38-7f28-4b47-ad46-98a38e2393ef","year":2010},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:00.551314Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:fdb01ec57be12daa964549ac27163445763361dc100f8e1a9d82ed6acb649b47","observation_id":"9e5f99d5-d02e-41e0-8e6a-2c1e48a4e6c5","resolution":{"observed_at":"2026-08-06T16:23:06.536428Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:00.621324Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:00.621324Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:abeb9a20cf924fd0420f15afd574c63a95591fb39c8d8dd614b24f773ddf427d","observation_id":"de5decec-4720-4bbf-af13-c61ac2aadf49","resolution":{"observed_at":"2026-08-06T16:23:00.621324Z","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-06T16:23:06.545616Z","title":null,"venue":null,"work_id":"8fd07f94-f62a-4146-bd43-fa65cd8663e8","year":2019},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:00.402999Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:b58ada757bcc60d9439793573cf8326047d2bb6bc7e83c0bb046d978d3de328d","observation_id":"d4177685-66ad-4d7e-9c12-9b9fa91639e1","resolution":{"observed_at":"2026-08-06T16:23:06.549385Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.500646Z","title":null,"venue":null,"work_id":"5267371c-ae94-4149-aac0-ceff698f9f46","year":2023},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:00.758685Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:1524deb7bfad7f0065d16096652027d690b93703bcbc110d2bf2748fd6fc118a","observation_id":"a08ae249-e176-4c76-a69b-05e36e860254","resolution":{"observed_at":"2026-08-06T16:23:06.504661Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.487499Z","title":null,"venue":null,"work_id":"bc80b36c-59f9-4889-8478-ebb5ef8f5da0","year":2023},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:00.839622Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:28ed4dfb61eedc7ebdd1aefd8263c88b73283cff2acba520b2a560bbf59b9f56","observation_id":"d2626711-0f67-4176-b2e3-ee4249c84480","resolution":{"observed_at":"2026-08-06T16:23:06.491480Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:00.690363Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:00.690363Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:ef4cce6c2a01e3e3103a53548bedbeca889c055a55ab00ff9ea5853b0c36e035","observation_id":"24e11677-4fc8-4b19-a861-ae25e33b6e11","resolution":{"observed_at":"2026-08-06T16:23:00.690363Z","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-06T16:23:06.460853Z","title":null,"venue":null,"work_id":"09e100e9-9e28-489e-a728-c72fc59c45fc","year":2020},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:01.112088Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:2a14c35a82ba9353afa44d72f38f70233bd88eb7b6442f3a2d632e791a9447d2","observation_id":"62b5bbfc-0a75-430d-839f-74273e6c9ee4","resolution":{"observed_at":"2026-08-06T16:23:06.465260Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.447363Z","title":null,"venue":null,"work_id":"638e4829-7f4b-42fb-9077-f30a721a0615","year":2021},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:01.177601Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:6b9292d6cf0328315183bfb111b2e0e8b493b46251701db0f732f2db5befbf52","observation_id":"d3125921-f1fe-4977-8409-660e229d3583","resolution":{"observed_at":"2026-08-06T16:23:06.451314Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.474314Z","title":null,"venue":null,"work_id":"cb559903-a7e8-46e7-a782-d94959affd74","year":2024},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:00.984136Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:1e9d4a5dfb279f4880784ce6583d5edb17909f931097b87e7e800baa732c2bbc","observation_id":"ccc8505b-05bf-44c1-95a0-976e55a82ed5","resolution":{"observed_at":"2026-08-06T16:23:06.478457Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.01018","last_updated":"2023-07-08T12:43:42Z","snapshot_observed_at":"2026-08-13T12:52:52.141915Z","submitted_at":"2023-02-02T11:12:51Z","title":"Graph Neural Networks for temporal graphs: State of the art, open challenges, and opportunities","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01018","snapshot_observed_at":"2026-08-06T16:23:01.315459Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:01.315459Z"},"links":{"cited_paper":"/paper/2302.01018","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:8712580f097e97acf7c402dd0d8e6b85b801cc2488013b55aea9f62159536a60","observation_id":"fa571feb-aae5-4e06-b880-3923de47f78d","resolution":{"observed_at":"2026-08-06T16:23:01.315459Z","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-06T16:23:06.432828Z","title":null,"venue":null,"work_id":"7a9a8790-49fb-49c9-8404-20a039522e4e","year":2023},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:01.378931Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:1efab2099a0c43911b12f8f6065cde0974bdf41e94c7ead0539b9543f1d2f1cc","observation_id":"605f5749-87a2-46c9-bfb7-b7b8dbe7a0fe","resolution":{"observed_at":"2026-08-06T16:23:06.437132Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.00019","last_updated":"2015-10-17T05:06:11Z","snapshot_observed_at":"2026-08-14T22:46:30.846767Z","submitted_at":"2015-05-29T20:16:51Z","title":"A Critical Review of Recurrent Neural Networks for Sequence Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.00019","snapshot_observed_at":"2026-08-06T16:23:01.240953Z","title":"Lipton, John Berkowitz, and Charles Elkan","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:01.240953Z"},"links":{"cited_paper":"/paper/1506.00019","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:41078b068dd636269fc5d3939cfad7c40ad37d150aa4ebf3328d24611958b6a5","observation_id":"27049627-5dd4-44ba-9826-28b26074d8eb","resolution":{"observed_at":"2026-08-06T16:23:01.240953Z","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-06T16:23:06.404478Z","title":null,"venue":null,"work_id":"add6afde-ed10-4e18-85b7-0f43467a937f","year":2015},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:01.476915Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:9ed322e1ac042a1dda730fb33b8f3866eea2ea60132265caadf44d773c496387","observation_id":"666cf369-152b-4f05-916c-8456adcc9ac9","resolution":{"observed_at":"2026-08-06T16:23:06.408445Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.390380Z","title":null,"venue":null,"work_id":"9b93c99f-bf3b-4245-8855-7c1f92c7482e","year":2024},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:01.581511Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:9e958e665985f74246d0b6ace219fbf354aebb9ee8fe5b912dfe79aba3b70773","observation_id":"000b4976-5903-4695-8f0d-13cd65295d0f","resolution":{"observed_at":"2026-08-06T16:23:06.394719Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.417563Z","title":null,"venue":null,"work_id":"b1f7d4e4-4345-4a97-9bfa-f54e8a5d3b87","year":2019},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:01.414456Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:d75fc2b97884183ac0c8b5b4582ba5a73255a2f4a37fa97dbd0657c8afc48a8b","observation_id":"c80d17b5-3afd-468c-a20b-7c175ae32230","resolution":{"observed_at":"2026-08-06T16:23:06.421543Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.363101Z","title":null,"venue":null,"work_id":"42d82826-18c3-4bcb-9bff-903e8722a91a","year":2018},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:01.779841Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:13cd9a91fc06abc6ba54d652b29843c2c484a0371317ed650c33803fbcae2f07","observation_id":"dc5539db-4469-427a-9c1c-6e4e9d0a562c","resolution":{"observed_at":"2026-08-06T16:23:06.367270Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:01.825416Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:01.825416Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:82789f6616609b74eef0627095a734348990ac3212373901848028a22e5372e5","observation_id":"e2beacb5-9ed9-4929-8b64-2564fd963d7f","resolution":{"observed_at":"2026-08-06T16:23:01.825416Z","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-06T16:23:06.376589Z","title":null,"venue":null,"work_id":"f22f32c7-0613-4e95-a8c2-2bcebcd58d2b","year":2022},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:01.637306Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:7d809beeafca37fe1eccf6a4ec602145f0ad5758a0c20b65be40cd19c2d7d478","observation_id":"1899876f-1ced-429f-b892-de912fb57f6a","resolution":{"observed_at":"2026-08-06T16:23:06.380673Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:02.057697Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:02.057697Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:f2d273aaa4b121697dd1b58fe034ee8d9e9b195e7ec4beb29adc8f3aa4521b45","observation_id":"ec1351d3-497b-46ee-92e4-5f6cf5767bc6","resolution":{"observed_at":"2026-08-06T16:23:02.057697Z","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-06T16:23:02.128379Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:02.128379Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:8174f45e6f973b0b18ae99e31318d9f204c9132727ac8ebd04ec27f48b8e4c3a","observation_id":"25d2207b-0f71-4932-8895-79f3d6497681","resolution":{"observed_at":"2026-08-06T16:23:02.128379Z","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-06T16:23:06.338740Z","title":null,"venue":null,"work_id":"c3b411fa-515d-4939-ac7e-7d6178002555","year":2020},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:01.938339Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:a9df09afd2556caacecd50ca83d996237aa6a84920eb4d9b70fb4882ad9af5a5","observation_id":"13b0a2a5-c942-4795-9c3f-2e11bd31d420","resolution":{"observed_at":"2026-08-06T16:23:06.343075Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.10637","last_updated":"2020-10-09T11:39:32Z","snapshot_observed_at":"2026-08-07T10:11:23.671536Z","submitted_at":"2020-06-18T16:06:18Z","title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.10637","snapshot_observed_at":"2026-08-06T16:23:02.461871Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:02.461871Z"},"links":{"cited_paper":"/paper/2006.10637","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:cd5c81683676ed721d6d6cea6dbb1a21cbfce277266509d11be8f2b48a414405","observation_id":"ea74a08c-64e1-4a2b-a72b-92a3fe251d1d","resolution":{"observed_at":"2026-08-06T16:23:02.461871Z","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-06T16:23:06.265645Z","title":null,"venue":null,"work_id":"3c985c53-2b87-41cd-8391-a6dd2b2fa358","year":2022},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:02.539353Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:0fb2a5b9e9ea272047d06fa6e21a9d06c9818a7a56ecb30c5011199c7f385d84","observation_id":"e423eef0-e506-4bf0-928b-281814d33dc2","resolution":{"observed_at":"2026-08-06T16:23:06.269385Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.252619Z","title":null,"venue":null,"work_id":"56f50f81-bb9c-4fd8-b672-3f15694e716b","year":2016},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:02.668912Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:87166eb8d261f1d0729f2885a87ffb7524b5ae070435c813d044e4c56967c20d","observation_id":"8eb7ebae-299e-4186-a106-ae5bf9be1c34","resolution":{"observed_at":"2026-08-06T16:23:06.256593Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.292595Z","title":null,"venue":null,"work_id":"9d2ac950-ef56-48b9-9aed-b8fd652f2158","year":null},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:02.322980Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:98d7f3660cea03b54fbfbb7ce2842418d567e2962df9c91b0a9a6851b6175771","observation_id":"9ba0e902-e636-46a7-984f-ed34fb148cd1","resolution":{"observed_at":"2026-08-06T16:23:06.296507Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.278918Z","title":"Proceedings of the VLDB Endowment (2022)","venue":null,"work_id":"1e33d451-655e-4013-83e5-2f2af502b3af","year":2022},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:02.363285Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:c3dad157a272f67a4422c5acda401a72023b2f54d3c67c8f8fe12ca52b0e8ee0","observation_id":"0d9c1424-a8b1-4395-99da-c16c0b20f749","resolution":{"observed_at":"2026-08-06T16:23:06.283308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.216136Z","title":null,"venue":null,"work_id":"5f1dcfe0-5cd9-4aa7-8820-e2b9071e1447","year":null},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:03.058566Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:8b5fb7c919ab145ecf6bb2394a0ca9ad6155b2be970e7b05e996f78275bf1b31","observation_id":"c87d1fcd-b753-4fe6-8e13-a4d5431ef41f","resolution":{"observed_at":"2026-08-06T16:23:06.220506Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:03.303146Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:03.303146Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:66ed458b87bc7fee66a96e79ef302b85fc97cdc1984adb32f6debf0d62459965","observation_id":"e9dea5d3-6511-4a58-96fb-c44782abdf72","resolution":{"observed_at":"2026-08-06T16:23:03.303146Z","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-07-06T02:11:23.670680Z","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-06T16:23:03.353633Z","title":"Gomez, Lukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:03.353633Z"},"links":{"cited_paper":"/paper/1706.03762","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:4af6a467bd95ec213df40996f33c486a16b4d8363ea69435ae5753a97dcebc73","observation_id":"289dd609-9ae0-414d-baa3-ffa177c8e26c","resolution":{"observed_at":"2026-08-06T16:23:03.353633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-14T17:59:20.424546Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-06T16:23:02.759959Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:02.759959Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:a94ad747afcdae51d8336632986f9de95d0e96ea67f2986f937d854bd1ba9567","observation_id":"bccd6fc5-1228-47c4-a8af-18e349469f1d","resolution":{"observed_at":"2026-08-06T16:23:02.759959Z","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-06T16:23:02.874939Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:02.874939Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:484a347646278c1d7d89954ec4256b27440e99a29406fdb05dedbba41b3f6bff","observation_id":"627372a6-81a8-442d-a524-8393319f58d4","resolution":{"observed_at":"2026-08-06T16:23:02.874939Z","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-06T16:23:06.178414Z","title":null,"venue":null,"work_id":"4837b064-a375-4e5b-8cd1-871b11974093","year":2021},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:03.613852Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:c66ed16b5323a292440d55ee54ede5b08a7c0f2d0260b69fcf28995ad14ef8c6","observation_id":"0ddf355d-926d-408c-9601-6dc5beadd1f3","resolution":{"observed_at":"2026-08-06T16:23:06.182974Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05974","last_updated":"2022-10-31T22:00:36Z","snapshot_observed_at":"2026-08-12T00:26:26.217574Z","submitted_at":"2021-01-15T05:47:26Z","title":"Inductive Representation Learning in Temporal Networks via Causal Anonymous Walks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05974","snapshot_observed_at":"2026-08-06T16:23:03.709732Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:03.709732Z"},"links":{"cited_paper":"/paper/2101.05974","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:b8fce38e210de45f752ebfd0ea934b753b57e32df7102fe809bdf6301d8be26a","observation_id":"df4d5903-d6a9-48b9-a0cc-56ab8dc8c0da","resolution":{"observed_at":"2026-08-06T16:23:03.709732Z","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-06T16:23:06.164522Z","title":null,"venue":null,"work_id":"36b50a6e-0040-47c0-b785-123649a94790","year":2020},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:03.798510Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:cd2705f33386491fd7dd856e4b3c18cb4109c85c718bb20ce36bc049108e2a40","observation_id":"74e36c40-9e02-4eca-8372-953321401b18","resolution":{"observed_at":"2026-08-06T16:23:06.168516Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:03.910665Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:03.910665Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:7a6ecaf70f5c90f249d4af5a0cc629928355d01a1d697a8d0314c48fa4e7650e","observation_id":"366ed57a-1026-456a-884f-fcc49481bee5","resolution":{"observed_at":"2026-08-06T16:23:03.910665Z","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-06T16:23:06.142488Z","title":null,"venue":null,"work_id":"37213253-4e8e-47ba-8ed1-0738e4e6704b","year":2018},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:04.107244Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:5b76e31ecbcde8d8c4c958f5fbaf9460640db04b3dce041188ae2d14aa31cb71","observation_id":"f3c9a0b8-eac0-4f9f-90b7-043acbe2a4e5","resolution":{"observed_at":"2026-08-06T16:23:06.146389Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.07944","last_updated":"2021-05-17T15:33:25Z","snapshot_observed_at":"2026-08-13T19:21:48.941695Z","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-06T16:23:03.429894Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:03.429894Z"},"links":{"cited_paper":"/paper/2105.07944","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:b6dc4fbf65d8a813c3ca0ca216d407a6aee356c4e139653209fbbcd58a5c1107","observation_id":"6000605f-774a-4ebe-aa44-bd91d1557518","resolution":{"observed_at":"2026-08-06T16:23:03.429894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.5118","last_updated":"2014-12-08T10:01:28Z","snapshot_observed_at":"2026-08-14T23:11:05.266492Z","submitted_at":"2014-11-19T05:51:22Z","title":"Link Prediction in Social Networks: the State-of-the-Art","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.5118","snapshot_observed_at":"2026-08-06T16:23:03.522108Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:03.522108Z"},"links":{"cited_paper":"/paper/1411.5118","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:df5ccbebfddfc0e5ea81b2b1bc7eb99ec2e6590726bfc73057fcc89e9f2f5ba8","observation_id":"1eea8c26-1468-4d92-b1cb-2f2ded68ce95","resolution":{"observed_at":"2026-08-06T16:23:03.522108Z","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-06T16:23:06.098121Z","title":null,"venue":null,"work_id":"f562030a-2728-493c-a5ae-475366b50bf5","year":2023},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:04.349272Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:97d4beb6c47931852ce302d3e00f3e690ce845ffad082845fafb4184b2499451","observation_id":"cfc3820f-8886-4cb1-b9d4-254b745b1ad7","resolution":{"observed_at":"2026-08-06T16:23:06.102533Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.084046Z","title":null,"venue":null,"work_id":"48939001-f6b8-4d70-8701-0b63625257f0","year":2024},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:04.424845Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:87eecfb12467e27f59ebce9388cd7c8c0e2cecf36ef2f63a2420f5e3a0369027","observation_id":"60bec937-da55-42dd-8bd1-e06ba2ce4e44","resolution":{"observed_at":"2026-08-06T16:23:06.088564Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.069545Z","title":null,"venue":null,"work_id":"6946809f-e02c-4698-bbc3-58d73a421797","year":2024},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:04.531229Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:4b6858c3e6e4a5f9e3b8e31c249cabf3f233962fe3c261c4fde4e62f5e37edb1","observation_id":"51ac7fa8-d393-48e1-8830-46158d10954b","resolution":{"observed_at":"2026-08-06T16:23:06.073815Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.055317Z","title":null,"venue":null,"work_id":"a4fbf1e3-f592-4767-8444-c82bdfcea5e8","year":2024},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:04.599177Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:db8f73caa95cbd31c4801cc3feefef798d290623936f2152a11d5aaaa6633ace","observation_id":"575cc408-5e72-41e6-b746-0e0d36fe2ad6","resolution":{"observed_at":"2026-08-06T16:23:06.059853Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8581.35985","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:23:05.161381Z","title":null,"venue":null,"work_id":"26ba7bd5-0ce8-492c-bdec-d896e7a8bfdf","year":2023},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:04.693040Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:ca6af6efe49a592e648f58644a6533091aac1818112ae587b69fc1abee5b58b6","observation_id":"c4a432a8-4218-415d-ad0e-72a1515a3293","resolution":{"observed_at":"2026-08-06T16:23:05.337633Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.040634Z","title":null,"venue":null,"work_id":"abe757ae-f651-4b3a-be4e-54f7cade6a06","year":2025},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:04.758087Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:ee2353949a65d2249eafbc512cfa5495877feb403bed924a9a948bf2ce29b4d3","observation_id":"f9537d7a-e7b2-400b-8596-00dca6a4bc92","resolution":{"observed_at":"2026-08-06T16:23:06.044785Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.128462Z","title":null,"venue":null,"work_id":"45bb2a5e-43fb-4502-9761-6fda0588557a","year":2016},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:04.154926Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:4b2f6e4cf45f7f9856e5f37ec3b3378e249ad4f94c26cbd356021d8245c66939","observation_id":"9a592ede-6598-435e-b07b-bc186cbad1a7","resolution":{"observed_at":"2026-08-06T16:23:06.132902Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.111623Z","title":null,"venue":null,"work_id":"1a483a53-9c96-4018-83c7-c65782ce361d","year":2025},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:04.308292Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:f8be5e730cda46f5865f287e80e938ff7d20a029f464abfe2394dd648797c9d9","observation_id":"e5b4fca5-4ba3-46b7-88ab-7a68b6b9747c","resolution":{"observed_at":"2026-08-06T16:23:06.119128Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.14883","last_updated":"2022-06-30T18:35:43Z","snapshot_observed_at":"2026-08-14T01:39:50.247254Z","submitted_at":"2022-03-28T16:41:18Z","title":"TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.14883","snapshot_observed_at":"2026-08-06T16:23:04.865492Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:04.865492Z"},"links":{"cited_paper":"/paper/2203.14883","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:f3bb81cd821ad73d557a9fde53e946ead65bad318a6eef9d6a5b7d43ef630637","observation_id":"370bb151-6a38-44fc-b083-edd852beffe4","resolution":{"observed_at":"2026-08-06T16:23:04.865492Z","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-06T16:23:05.921106Z","title":null,"venue":null,"work_id":"3b084604-676f-4d76-94aa-779d0cad93c9","year":2018},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:04.942419Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:034701587c91c36e4a550bbe1b869aa82d52b1daa2b668a9dae1163b67bdc0b5","observation_id":"52d09b45-4a11-4f42-b50f-9bcbb2d96a5f","resolution":{"observed_at":"2026-08-06T16:23:06.030009Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.773218Z","title":"In Ismir, Vol","venue":null,"work_id":"ac216f87-7a8b-4965-aefb-f716e29f4ca4","year":null},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:58.310247Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:ce7b96ae8d9fec6ef5e626eea53991b605ee35a447df36f50348a054294b582e","observation_id":"874810f7-eaf5-4bbe-9488-7d3410f4ccaa","resolution":{"observed_at":"2026-08-06T16:23:06.777617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.229898Z","title":"In Proceedings of the 24th international conference on world wide web","venue":null,"work_id":"194607d4-80ef-42f8-a8b9-d061349f4c29","year":null},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:02.954133Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:064b86d2849ac048f229cc5503ea2a3313a5bf777e81e519f1a72530d74b2f16","observation_id":"30ccd896-1e17-4084-82e9-89b22bc82195","resolution":{"observed_at":"2026-08-06T16:23:06.234227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.201206Z","title":"In International conference on learning representations","venue":null,"work_id":"e5c2d543-6a38-4059-8eb9-44a70c5af011","year":null},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:03.195365Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:5e373f448c8e5ad28dfe1b91728afa8b122f9be754b318af5c68f3cba83cf21e","observation_id":"ae4eaed0-0452-401d-a378-34c95d6eff6a","resolution":{"observed_at":"2026-08-06T16:23:06.206306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.07962","last_updated":"2020-02-19T02:05:37Z","snapshot_observed_at":"2026-08-14T00:06:34.076018Z","submitted_at":"2020-02-19T02:05:37Z","title":"Inductive Representation Learning on Temporal Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.07962","snapshot_observed_at":"2026-08-06T16:23:03.973832Z","title":"arXiv preprint arXiv:2002.07962 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:03.973832Z"},"links":{"cited_paper":"/paper/2002.07962","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:0d0c44091fec586372bfb2dfb9415331762496a1e5911ae4d3789b27dc02fb91","observation_id":"fb61754c-e3c2-466d-b79e-397ab4d6e3fe","resolution":{"observed_at":"2026-08-06T16:23:03.973832Z","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-06T16:23:06.305557Z","title":null,"venue":null,"work_id":"93143bad-82ac-466f-839d-ff3a961aa363","year":2022},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:02.209077Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:a27df1844f20e10e4b79c991dd3509095bf2f3d9a0b3bdfab5029a88dccee994","observation_id":"f01dbc92-ef95-43f1-93a2-733af653684e","resolution":{"observed_at":"2026-08-06T16:23:06.309436Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T16:23:06.732747Z","title":"Proceedings of the VLDB Endowment 17, 6 (2024), 1324–1336","venue":null,"work_id":"b35916b7-f85c-4537-b4eb-60dd0eceec81","year":2024},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:58.710303Z"},"links":{"citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:4b90b4fe701c6da7e48e7963ca8e82aa1db84d55a116e6ecca9fbcce4ac918bd","observation_id":"07bdee45-8043-4bbd-9a9f-d9fec170ad23","resolution":{"observed_at":"2026-08-06T16:23:06.737119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction"},"reference_resolution":{"displayed":74,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":67,"verified_exact":0,"verified_fuzzy":5},"total_outbound_references":74},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 74 of 74 outbound references and 0 inbound Pith citation observations for arXiv:2507.13825."}