{"as_of":"2026-08-12T13:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:88cc757526ed0723060837efea257943bf2c57d696a3886a950485ab66e5c3d0","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:16:50.823969Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T17:45:46.222684Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"2101.05974","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.05974","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Inductive representation learning in temporal networks via causal anonymous walks","venue":null,"work_id":"094e62bb-63da-424e-978c-d95884013e2d","year":2021},"citing_paper":{"arxiv_id":"2411.11259","last_updated":"2026-04-13T03:59:44Z","snapshot_observed_at":"2026-07-06T19:51:41.646058Z","submitted_at":"2024-11-18T03:28:11Z","title":"Graph Retention Networks for Dynamic Graphs","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-23T17:44:20.434591Z"},"links":{"cited_paper":"/paper/2101.05974","citing_paper":"/paper/2411.11259"},"observation_digest":"sha256:44a0a6b92bcc905021551cd6aaa59fcc33382bcdfd7a1d8c81c72c186d244fae","observation_id":"589ed745-c555-4755-88e8-84564a66b2df","resolution":{"observed_at":"2026-05-23T17:45:46.226438Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T12:16:50.823969Z","title":"Inductive representation learning in temporal networks via causal anonymous walks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.14451","last_updated":"2024-12-19T01:59:24Z","snapshot_observed_at":"2026-08-12T00:26:53.278678Z","submitted_at":"2024-12-19T01:59:24Z","title":"CLDG: Contrastive Learning on Dynamic Graphs","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T12:16:50.823969Z"},"links":{"cited_paper":"/paper/2101.05974","citing_paper":"/paper/2412.14451"},"observation_digest":"sha256:41e82b44df8b64d233e145bd3b846669d714fa607d5d4813080fb51b5ea51e6e","observation_id":"7122086d-487c-414d-819b-d7a909c3258e","resolution":{"observed_at":"2026-08-11T12:16:50.823969Z","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-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-10T23:21:33.900634Z","title":"Inductive representation learning in temporal networks via causal anonymous walks, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.21046","last_updated":"2024-12-30T16:07:41Z","snapshot_observed_at":"2026-08-12T00:13:44.807677Z","submitted_at":"2024-12-30T16:07:41Z","title":"Mind the truncation gap: challenges of learning on dynamic graphs with recurrent architectures","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T23:21:33.900634Z"},"links":{"cited_paper":"/paper/2101.05974","citing_paper":"/paper/2412.21046"},"observation_digest":"sha256:87d145f32f8739c69d1a8a19455fb9cb07e294d92b07fbbd2673205f6c0b0892","observation_id":"8ee860b8-66a1-4ce8-93eb-61ec3b9ca713","resolution":{"observed_at":"2026-08-10T23:21:33.900634Z","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-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-10T13:54:34.812500Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.16002","last_updated":"2025-01-30T11:40:01Z","snapshot_observed_at":"2026-08-12T00:26:35.813522Z","submitted_at":"2025-01-27T12:39:16Z","title":"ScaDyG:A New Paradigm for Large-scale Dynamic Graph Learning","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T13:54:34.812500Z"},"links":{"cited_paper":"/paper/2101.05974","citing_paper":"/paper/2501.16002"},"observation_digest":"sha256:d71beeca144390d7ce955e2c713902243671ce69cbb517346ddea45b8b4430bc","observation_id":"1f0eecda-a8d8-484d-8d87-b4e3fef3b155","resolution":{"observed_at":"2026-08-10T13:54:34.812500Z","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-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-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-09T20:08:14.310011Z","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:0308494829f3d6872e201c1fa9400b5ae31ec160a032631bd59253b8bcc446a0","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":"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-10T13:23:01.595905Z","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:4bac889009f631ea8871aee088cd11f75daaf6d441bc083f10ff23c7577ade6a","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":{"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-02T20:30:52.308606Z","title":"Inductive representation learn- ing in temporal networks via causal anonymous walks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.23135","last_updated":"2026-06-27T09:53:28Z","snapshot_observed_at":"2026-08-10T13:22:30.529459Z","submitted_at":"2026-02-26T15:51:51Z","title":"DyGnROLE: Asymmetric Pretraining for Edge Classification on Dynamic Graphs","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-02T20:30:52.308606Z"},"links":{"cited_paper":"/paper/2101.05974","citing_paper":"/paper/2602.23135"},"observation_digest":"sha256:64f4b3230a67295ee7e88c90877b46d21a99f09087539d3ff95a58e617f1f646","observation_id":"30861bbc-9f26-4d42-b1c9-29251b479073","resolution":{"observed_at":"2026-08-02T20:30:52.308606Z","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-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":"2101.05974","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.05974","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Inductive representation learning in temporal networks via causal anonymous walks","venue":null,"work_id":"094e62bb-63da-424e-978c-d95884013e2d","year":2021},"citing_paper":{"arxiv_id":"2605.21916","last_updated":"2026-07-26T17:26:27Z","snapshot_observed_at":"2026-08-02T13:29:59.875463Z","submitted_at":"2026-05-21T02:38:29Z","title":"A2QTGN: Adaptive Amplitude Quantum-Integrated Temporal Graph Network for Dynamic Link Prediction","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-22T06:33:41.569991Z"},"links":{"cited_paper":"/paper/2101.05974","citing_paper":"/paper/2605.21916"},"observation_digest":"sha256:8cb22e82d57d63c91dae48425bc52a2f629c369725e17f5dc85397348e5034ea","observation_id":"f90560dc-701b-4e07-b07c-58277523b0d3","resolution":{"observed_at":"2026-05-22T06:34:40.744538Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-02T13:30:05.630203Z","title":"Inductive representation learning in temporal networks via causal anonymous walks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.21916","last_updated":"2026-07-26T17:26:27Z","snapshot_observed_at":"2026-08-02T13:29:59.875463Z","submitted_at":"2026-05-21T02:38:29Z","title":"A2QTGN: Adaptive Amplitude Quantum-Integrated Temporal Graph Network for Dynamic Link Prediction","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T13:30:05.630203Z"},"links":{"cited_paper":"/paper/2101.05974","citing_paper":"/paper/2605.21916"},"observation_digest":"sha256:23d5c56a51d26633277e37e22a2770466340c4bc0c0fd2db13a23bd0983047d6","observation_id":"0a386a5e-00bc-4171-aaa4-08e2603ffa24","resolution":{"observed_at":"2026-08-02T13:30:05.630203Z","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-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-01T15:32:34.608347Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18412","last_updated":"2026-07-20T18:02:04Z","snapshot_observed_at":"2026-08-06T07:48:58.447411Z","submitted_at":"2026-07-20T18:02:04Z","title":"Scalable and Efficient Joint Spiking Embedding Predictive Architecture for Large-Scale Dynamic Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T15:32:34.608347Z"},"links":{"cited_paper":"/paper/2101.05974","citing_paper":"/paper/2607.18412"},"observation_digest":"sha256:f90b2c8df30b7d73803497ed20d606c2faafc64686893b3090e8289dd2010964","observation_id":"ca6c845a-469f-45d6-9c65-dfe94a1a61ce","resolution":{"observed_at":"2026-08-01T15:32:34.608347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2101.05974/citation-record","integrity":"/paper/2101.05974/integrity","json":"/paper/2101.05974/citation-record.json","paper":"/paper/2101.05974"},"outbound":[],"paper":{"arxiv_id":"2101.05974","last_updated":"2022-10-31T22:00:36Z","latest_version":5,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2101.05974."}