{"as_of":"2026-08-08T03:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5f0c7b9aefa74e9dc1dda76dc1edb0666efe22966b67c4b76e5811556edeb042","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:17:02.034813Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:06:04.778779Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T14:06:07.340780Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"cited_work":{"arxiv_id":"2505.15746","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.15746","snapshot_observed_at":"2026-08-07T14:06:07.340780Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","venue":"cs.LG","work_id":"b4de59f7-4a5f-4175-8882-edc96f6a86b8","year":2025},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:04.778779Z"},"links":{"cited_paper":"/paper/2505.15746","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:7a32fe5a38e4e19db6bb2ab3b83ff39951091eb13f1df4598a157fd6a7906bae","observation_id":"65a3face-30c2-42fd-af20-fd491ee5bc93","resolution":{"observed_at":"2026-08-07T14:06:07.391508Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.15746/citation-record","integrity":"/paper/2505.15746/integrity","json":"/paper/2505.15746/citation-record.json","paper":"/paper/2505.15746"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:17:02.779064Z","title":"Theorem 3 (Theorem 3 in (Wang & Kleinberg, 2024))","venue":null,"work_id":"ff368e29-39c8-429e-bf5c-25dcb624878d","year":2024},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.848618Z"},"links":{"citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:7c4925e15a6d36c9509a81216b9590720aecdccb3b95da26257b7ec7a2a6b71f","observation_id":"b5ad0ea0-fa1f-404f-a7b0-a99f50bf23f1","resolution":{"observed_at":"2026-08-07T15:17:02.835527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T15:17:03.080415Z","title":"Nodes in e are divided between communities Ca and Cb, with ka nodes in Ca and kb nodes in Cb (ka + kb = k)","venue":null,"work_id":"06b70dbe-ae0c-42b0-a7de-245abe2dc28d","year":2015},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.776931Z"},"links":{"citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:e7891a82ddc02f73ac52d936ca99933ffdba646cb5f7f1d8142375a1a27fefd2","observation_id":"32226c2f-02c2-46bf-bc46-cb05f95756e1","resolution":{"observed_at":"2026-08-07T15:17:03.133395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T15:17:02.528998Z","title":"The colors represent node features","venue":null,"work_id":"f76235fe-a4d5-4fdb-8cb3-03a3256de4d4","year":2022},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:02.034813Z"},"links":{"citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:4be4e307001e8a24215f9c7606b7316757dfefa5c71febe7ec03e19494be9f8c","observation_id":"8ee69df5-85e6-49f9-83fc-f9c9ad6a2771","resolution":{"observed_at":"2026-08-07T15:17:02.567219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08519","last_updated":"2024-01-16T17:31:54Z","snapshot_observed_at":"2026-08-05T09:30:46.681048Z","submitted_at":"2024-01-16T17:31:54Z","title":"From Graphs to Hypergraphs: Hypergraph Projection and its Remediation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08519","snapshot_observed_at":"2026-08-07T15:17:01.510167Z","title":"and Kleinberg, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.510167Z"},"links":{"cited_paper":"/paper/2401.08519","citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:4562f72e0f291777dc2eb48a15cc9c493820e0bda6a2a1cbacb5124569fcd47d","observation_id":"749cb3f5-85bc-4a15-a781-f144d4029393","resolution":{"observed_at":"2026-08-07T15:17:01.510167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-07-06T07:05:24.565760Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-07T15:17:01.661279Z","title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.661279Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:e43d559fe15896ec926c06844510a1c10c205b6bc78bced8d8f3e517bd7f4b6b","observation_id":"3b0d7d0e-a3d3-4b84-bada-a88fd8945490","resolution":{"observed_at":"2026-08-07T15:17:01.661279Z","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-07T15:17:01.711097Z","title":"Zhang, X., Wang, Y ., Wang, X., and Zhang, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.711097Z"},"links":{"citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:d645ac6b86e81a97e92b3c3fea2183ac1cef1f79f6ded7a7326f0c103a5cddff","observation_id":"d1be9909-e754-4e2c-9ba7-a7138f884756","resolution":{"observed_at":"2026-08-07T15:17:01.711097Z","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-07T15:17:02.624542Z","title":null,"venue":null,"work_id":"1358a966-2962-49de-bd4c-ac26327878f6","year":2022},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.934689Z"},"links":{"citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:6c4e46e62a4b37e780562938bd75215104823b03571756eba0d2da8b6dd1e5b0","observation_id":"32a135cd-dcf4-41e0-9423-3d2db4bd50d5","resolution":{"observed_at":"2026-08-07T15:17:02.682581Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.04782","last_updated":"2024-03-02T16:21:45Z","snapshot_observed_at":"2026-07-06T17:41:10.677334Z","submitted_at":"2024-03-02T16:21:45Z","title":"A Survey on Temporal Knowledge Graph: Representation Learning and Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.04782","snapshot_observed_at":"2026-08-07T15:17:00.944048Z","title":"A survey on temporal knowledge graph: Rep- resentation learning and applications","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":1984,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:00.944048Z"},"links":{"cited_paper":"/paper/2403.04782","citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:a5d8e3d88e7985e41af756210d99d8f40c085042f6753aab20e5f1efc35742c2","observation_id":"68f07abd-dc58-4dd5-9e00-4cd10a8cab9d","resolution":{"observed_at":"2026-08-07T15:17:00.944048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.07944","last_updated":"2021-05-17T15:33:25Z","snapshot_observed_at":"2026-08-07T20:17:21.322116Z","submitted_at":"2021-05-17T15:33:25Z","title":"TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.07944","snapshot_observed_at":"2026-08-07T15:17:01.372525Z","title":"Tcl: Transformer- based dynamic graph modelling via contrastive learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.372525Z"},"links":{"cited_paper":"/paper/2105.07944","citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:eda4a69e6cca5a9206e312cddd5319ab13c625ab0115d7058ae0562bf6cba992","observation_id":"7220121d-195c-45b3-8136-27aa2f3cf7fe","resolution":{"observed_at":"2026-08-07T15:17:01.372525Z","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-07T15:17:03.192129Z","title":"Networks and cycles: a persistent homology approach to complex networks","venue":null,"work_id":"c603b763-b32e-4077-920b-a5880116e355","year":2012},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.197477Z"},"links":{"citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:7a14f59d3f0cc9b3db8e443b004a303667cf9920201d5c2d59c2b1fca063dc7c","observation_id":"8bfd0542-c29f-4db9-8a48-26a168783550","resolution":{"observed_at":"2026-08-07T15:17:03.237259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10426","last_updated":"2025-02-15T04:10:36Z","snapshot_observed_at":"2026-07-06T18:31:17.512404Z","submitted_at":"2024-06-14T22:07:11Z","title":"MiNT: Multi-Network Training for Transfer Learning on Temporal Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.10426","snapshot_observed_at":"2026-08-07T15:17:01.303832Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.303832Z"},"links":{"cited_paper":"/paper/2406.10426","citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:e80e929a463de63e938eec73169562da0def5739abbdb85c7e6b70f6521a4c9d","observation_id":"bf158235-2744-41ad-a505-53816a4e71f6","resolution":{"observed_at":"2026-08-07T15:17:01.303832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00890","last_updated":"2024-06-04T05:46:09Z","snapshot_observed_at":"2026-08-05T06:26:01.318904Z","submitted_at":"2023-02-02T05:45:09Z","title":"Neural Common Neighbor with Completion for Link Prediction","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00890","snapshot_observed_at":"2026-08-07T15:17:01.448114Z","title":"Neural common neigh- bor with completion for link prediction","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.448114Z"},"links":{"cited_paper":"/paper/2302.00890","citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:ed65b6b6b9cde5b43b1a3aba381ab57dd60ad62d3ad18be7be7f902f6b9d3bd0","observation_id":"506bd060-dcea-45c7-892d-5482249226ed","resolution":{"observed_at":"2026-08-07T15:17:01.448114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05974","last_updated":"2022-10-31T22:00:36Z","snapshot_observed_at":"2026-08-04T12:32:42.808936Z","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-07T15:17:01.594592Z","title":"Xu, D., Ruan, C., Korpeoglu, E., Kumar, S., and Achan, K","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.594592Z"},"links":{"cited_paper":"/paper/2101.05974","citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:c2ab019a011a04990d72191525967f313ca05038bc71a647d730afc2284596ac","observation_id":"4e0e442a-fe5e-437f-a877-c333cd841e1b","resolution":{"observed_at":"2026-08-07T15:17:01.594592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-07T15:17:01.108061Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.108061Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:b570e5314606b69a03ab827f12829325fd09ef4b5733aaf3e06c373b3b487f61","observation_id":"2a9067e1-ff1b-4e49-bf0b-618322c66591","resolution":{"observed_at":"2026-08-07T15:17:01.108061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.1078","last_updated":"2014-09-03T00:25:02Z","snapshot_observed_at":"2026-07-06T03:45:28.546418Z","submitted_at":"2014-06-03T17:47:08Z","title":"Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.1078","snapshot_observed_at":"2026-08-07T15:17:01.031580Z","title":"Learn- ing phrase representations using rnn encoder-decoder for statistical machine translation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.031580Z"},"links":{"cited_paper":"/paper/1406.1078","citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:fcb56667574a2371d01d3dacd9df51c221af5a0cf7e35594d88066dab291cdba","observation_id":"db85efa9-244a-4ba2-ac3f-8118962a3b83","resolution":{"observed_at":"2026-08-07T15:17:01.031580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":15},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 1 inbound Pith citation observation for arXiv:2505.15746."}