{"as_of":"2026-08-22T09:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8aa02b7ad5af3baacfa5d09bb8094586688fd23ba52b6796560b5b514c373146","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":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":22,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:31:39.494508Z","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-06-30T00:24:04.587048Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":"1908.01000","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-06-30T00:24:04.587048Z","title":"Infograph: Unsupervised and semi- supervised graph-level representation learning via mutual information maximization.arXiv preprint arXiv:1908.01000","venue":null,"work_id":"e922e5fb-22c7-4105-9375-f18e152e6f46","year":1908},"citing_paper":{"arxiv_id":"2408.13471","last_updated":"2026-05-07T12:57:54Z","snapshot_observed_at":"2026-08-02T21:34:49.925481Z","submitted_at":"2024-08-24T05:13:02Z","title":"Disentangled Generative Graph Representation Learning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-23T21:23:33.474134Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2408.13471"},"observation_digest":"sha256:069f2b5319a3ab08475cd089319a522aa608402bba843cf2523fca3aa62876ca","observation_id":"d86d7217-5f52-4ed8-8213-5b6b0ab966e9","resolution":{"observed_at":"2026-05-23T21:25:51.590423Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-12T13:37:37.525747Z","title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization.arXiv preprint arXiv:1908.01000, 2019","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2411.16127","last_updated":"2024-11-25T06:26:58Z","snapshot_observed_at":"2026-08-21T08:41:35.480885Z","submitted_at":"2024-11-25T06:26:58Z","title":"DF-GNN: Dynamic Fusion Framework for Attention Graph Neural Networks on GPUs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T13:37:37.525747Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2411.16127"},"observation_digest":"sha256:380b5e438a7c342a2b15a00d31e050bf4b123906cc5e98301a7b72d22e624a3d","observation_id":"a3088a84-760d-4c36-a10c-1a50f2bcfe51","resolution":{"observed_at":"2026-08-12T13:37:37.525747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-11T20:39:37.230567Z","title":"Infograph: Unsupervised and semi- supervised graph-level representation learning via mutual information maximization.arXiv preprint arXiv:1908.01000,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2412.05569","last_updated":"2025-06-08T14:14:26Z","snapshot_observed_at":"2026-08-16T08:23:57.206035Z","submitted_at":"2024-12-07T07:32:55Z","title":"SMI-Editor: Edit-based SMILES Language Model with Fragment-level Supervision","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-11T20:39:37.230567Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2412.05569"},"observation_digest":"sha256:2138325547ad58ebd927a9a0528b37af48335902179d74045b7aa229f4f8f7f8","observation_id":"4fac8878-26e7-410c-a2e5-077fbbef7045","resolution":{"observed_at":"2026-08-11T20:39:37.230567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-10T14:40:13.182350Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15142","last_updated":"2025-01-25T08:53:42Z","snapshot_observed_at":"2026-08-13T21:05:57.605772Z","submitted_at":"2025-01-25T08:53:42Z","title":"DAGPrompT: Pushing the Limits of Graph Prompting with a Distribution-aware Graph Prompt Tuning Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T14:40:13.182350Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2501.15142"},"observation_digest":"sha256:d03b4a7f15937262b5b4ea89a79de11838be835eacf541098df36ac6f258e1d6","observation_id":"8f491be6-b190-45cf-83e2-0510e34ac2c1","resolution":{"observed_at":"2026-08-10T14:40:13.182350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-08T20:29:47.161655Z","title":"Infograph: Unsupervised and semi- supervised graph-level representation learning via mutual information maximization,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-17T17:40:47.015933Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":254,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:47.161655Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:6804e6a5cccdaf31878fe8fafb550986af75c8c9475c86d40ec7d81949eff6f5","observation_id":"d858de98-05d8-4920-8cbf-ebdfeed12120","resolution":{"observed_at":"2026-08-08T20:29:47.161655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-08T05:10:55.553832Z","title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-19T23:35:12.653733Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.553832Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:68d3b1300f83acf45e5e66e6d33563e8d62d88a14d961306c4105b70b658941d","observation_id":"8fc05fb4-f853-4b35-b8c3-e0078bbc4243","resolution":{"observed_at":"2026-08-08T05:10:55.553832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-07T23:14:10.157899Z","title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization.arXiv preprint arXiv:1908.01000, 2019","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2502.08949","last_updated":"2025-05-19T17:23:05Z","snapshot_observed_at":"2026-08-17T16:16:26.851984Z","submitted_at":"2025-02-13T04:15:20Z","title":"DICE: Device-level Integrated Circuits Encoder with Graph Contrastive Pretraining","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T23:14:10.157899Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2502.08949"},"observation_digest":"sha256:52b544492c62e97361fb16d0bc4739e1547954f362174cb9ee43f5f9fb83c4e8","observation_id":"7decce05-1842-4ebe-9d79-104309348cb2","resolution":{"observed_at":"2026-08-07T23:14:10.157899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-16T12:31:39.494508Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.12715","last_updated":"2025-04-17T07:43:52Z","snapshot_observed_at":"2026-08-18T19:49:07.109937Z","submitted_at":"2025-04-17T07:43:52Z","title":"Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T12:31:39.494508Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2504.12715"},"observation_digest":"sha256:1323c2a4460713c1a72ff827abc95d5780f8bc59be9ccf62c686f1853c3280e0","observation_id":"0b06560d-5fa8-430f-b8d9-4ce58907033a","resolution":{"observed_at":"2026-08-16T12:31:39.494508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-15T23:23:46.379125Z","title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2505.04956","last_updated":"2025-05-08T05:38:19Z","snapshot_observed_at":"2026-08-20T23:08:49.209156Z","submitted_at":"2025-05-08T05:38:19Z","title":"Graffe: Graph Representation Learning via Diffusion Probabilistic Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:23:46.379125Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2505.04956"},"observation_digest":"sha256:2b03c650e833b38fec9596db65e5ed7e98b3049447a6a4de604f7c8b08fc4922","observation_id":"df181d8b-de57-45b7-abdd-90f84a0f42a9","resolution":{"observed_at":"2026-08-15T23:23:46.379125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-15T22:58:53.508289Z","title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2505.05877","last_updated":"2025-05-12T01:15:32Z","snapshot_observed_at":"2026-08-19T19:39:09.353224Z","submitted_at":"2025-05-09T08:37:29Z","title":"Multi-Modal Molecular Representation Learning via Structure Awareness","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T22:58:53.508289Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2505.05877"},"observation_digest":"sha256:34b76801a4f8d266b7902d3e893d2329c8bbafd8308cde384b663e82a2184807","observation_id":"a0b70a35-156d-455f-8619-f76bf1134102","resolution":{"observed_at":"2026-08-15T22:58:53.508289Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-15T20:15:58.739423Z","title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2505.13650","last_updated":"2025-05-19T18:45:54Z","snapshot_observed_at":"2026-08-19T19:20:09.040538Z","submitted_at":"2025-05-19T18:45:54Z","title":"Self-Reinforced Graph Contrastive Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T20:15:58.739423Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2505.13650"},"observation_digest":"sha256:8b91539b460882930d09a924df5eb502658997953606f3f216c4f1cb15015367","observation_id":"ed22ad1e-755b-4baf-b554-a1fcd030fecb","resolution":{"observed_at":"2026-08-15T20:15:58.739423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-07T15:29:49.631130Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.15103","last_updated":"2025-08-08T06:14:32Z","snapshot_observed_at":"2026-08-15T21:37:39.620167Z","submitted_at":"2025-05-21T04:54:18Z","title":"Khan-GCL: Kolmogorov-Arnold Network Based Graph Contrastive Learning with Hard Negatives","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.631130Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:f436a4c21fa9f94144008c1cc74cdea4937e5edb5e87d9d5a7e0e8bc75e4c7ea","observation_id":"b85d378c-e8e5-4556-a351-5a73115a847b","resolution":{"observed_at":"2026-08-07T15:29:49.631130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-07T13:43:16.547704Z","title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2505.21285","last_updated":"2026-06-05T08:55:58Z","snapshot_observed_at":"2026-08-15T06:32:03.435619Z","submitted_at":"2025-05-27T14:53:09Z","title":"Learnable Kernel Density Estimation for Graphs and Its Application to Graph-Level Anomaly Detection","version":5},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-07T13:43:16.547704Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2505.21285"},"observation_digest":"sha256:e8346f322f2daf4d2acc947d3077562b10fd4ae2181cce8aaf0e9e429faff027","observation_id":"0c3eb348-637f-4289-939c-ee1b56831953","resolution":{"observed_at":"2026-08-07T13:43:16.547704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-07T12:54:22.903932Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.23345","last_updated":"2025-06-15T04:04:46Z","snapshot_observed_at":"2026-08-13T21:05:05.474773Z","submitted_at":"2025-05-29T11:10:11Z","title":"Graph Positional Autoencoders as Self-supervised Learners","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T12:54:22.903932Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2505.23345"},"observation_digest":"sha256:b0e92c8068d3de56fa792ec500def6b20ff79408a11f9248dd8a5e0fc8beb32d","observation_id":"3dbbb4d3-ff7b-4ced-8b4b-d0d755bb082a","resolution":{"observed_at":"2026-08-07T12:54:22.903932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-15T18:40:58.603959Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19343","last_updated":"2025-08-14T08:05:43Z","snapshot_observed_at":"2026-08-18T22:53:01.139887Z","submitted_at":"2025-06-24T06:15:44Z","title":"Discrepancy-Aware Graph Mask Auto-Encoder","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T18:40:58.603959Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2506.19343"},"observation_digest":"sha256:882e0c203d03e4e9f6f580d2dfbef6ccff15ce24411212e1537bdc4f50a49fe3","observation_id":"16cd512c-e943-415e-a325-9b15e17b5396","resolution":{"observed_at":"2026-08-15T18:40:58.603959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-06T18:59:17.203104Z","title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-18T02:44:20.792740Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:17.203104Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:ec07b3b7db783a5cfe8a47d8e8d159c8551c8433a47f1842a0b1636db70c9d3c","observation_id":"3b37185d-ae5b-48dc-a2e7-f2776583cdae","resolution":{"observed_at":"2026-08-06T18:59:17.203104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":"1908.01000","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-06-30T00:24:04.587048Z","title":"Infograph: Unsupervised and semi- supervised graph-level representation learning via mutual information maximization.arXiv preprint arXiv:1908.01000","venue":null,"work_id":"e922e5fb-22c7-4105-9375-f18e152e6f46","year":1908},"citing_paper":{"arxiv_id":"2602.04244","last_updated":"2026-05-07T12:31:58Z","snapshot_observed_at":"2026-08-21T12:54:33.392358Z","submitted_at":"2026-02-04T06:06:28Z","title":"GraphVec: Cross-Domain Graph Vectorization for Graph-Level Representation Learning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-16T07:25:35.324582Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2602.04244"},"observation_digest":"sha256:8358d1addc33d2a431b37cd5eeb12a04ae6623aad4cb0b24e4644c3dccb8ccf6","observation_id":"1245c782-03fe-47d4-aa73-c651650f3def","resolution":{"observed_at":"2026-05-16T07:27:31.631775Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":"1908.01000","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-06-30T00:24:04.587048Z","title":"Infograph: Unsupervised and semi- supervised graph-level representation learning via mutual information maximization.arXiv preprint arXiv:1908.01000","venue":null,"work_id":"e922e5fb-22c7-4105-9375-f18e152e6f46","year":1908},"citing_paper":{"arxiv_id":"2604.14204","last_updated":"2026-04-03T14:47:26Z","snapshot_observed_at":"2026-08-13T04:40:44.292763Z","submitted_at":"2026-04-03T14:47:26Z","title":"Disentangled Dual-Branch Graph Learning for Conversational Emotion Recognition","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-13T19:08:46.950269Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2604.14204"},"observation_digest":"sha256:00bfd699011af05b8254475e34c2c726875c5041bb057d7a37fb6deecf708b84","observation_id":"66121b56-0af5-4a41-a5eb-70fc7530260f","resolution":{"observed_at":"2026-05-13T19:13:09.799911Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":"1908.01000","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-06-30T00:24:04.587048Z","title":"Infograph: Unsupervised and semi- supervised graph-level representation learning via mutual information maximization.arXiv preprint arXiv:1908.01000","venue":null,"work_id":"e922e5fb-22c7-4105-9375-f18e152e6f46","year":1908},"citing_paper":{"arxiv_id":"2604.15699","last_updated":"2026-07-19T02:35:09Z","snapshot_observed_at":"2026-08-10T21:04:14.066121Z","submitted_at":"2026-04-17T04:58:25Z","title":"Frequency-Corrupt Based Graph Self-Supervised Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-10T08:32:08.154085Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2604.15699"},"observation_digest":"sha256:4140ef6a6e4ddbbe26014537c5c1c3a8dbcb45e30af4224a708682ace43d6542","observation_id":"39daf8f5-98e0-43b5-b21d-04226cefecfd","resolution":{"observed_at":"2026-05-10T08:32:52.076770Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-02T16:10:59.779253Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2604.15699","last_updated":"2026-07-19T02:35:09Z","snapshot_observed_at":"2026-08-10T21:04:14.066121Z","submitted_at":"2026-04-17T04:58:25Z","title":"Frequency-Corrupt Based Graph Self-Supervised Learning","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-02T16:10:59.779253Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2604.15699"},"observation_digest":"sha256:8bd92d8724795da1680d60e06253da6736e2acc0e48baf1974149189b920c11e","observation_id":"8ae09b8e-28a9-4580-a6da-23aeab130f6a","resolution":{"observed_at":"2026-08-02T16:10:59.779253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":"1908.01000","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-06-30T00:24:04.587048Z","title":"Infograph: Unsupervised and semi- supervised graph-level representation learning via mutual information maximization.arXiv preprint arXiv:1908.01000","venue":null,"work_id":"e922e5fb-22c7-4105-9375-f18e152e6f46","year":1908},"citing_paper":{"arxiv_id":"2605.20248","last_updated":"2026-05-18T06:47:41Z","snapshot_observed_at":"2026-08-17T17:29:58.157822Z","submitted_at":"2026-05-18T06:47:41Z","title":"Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-21T08:32:32.410473Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2605.20248"},"observation_digest":"sha256:e11426c3720c4ee9a1a1772af088a0b3a9f0bc0c019801e5de842deedbc890a8","observation_id":"fbe9fcf3-6755-4a86-9920-c727f1620bbe","resolution":{"observed_at":"2026-05-21T08:34:05.386198Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":"1908.01000","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-06-30T00:24:04.587048Z","title":"Infograph: Unsupervised and semi- supervised graph-level representation learning via mutual information maximization.arXiv preprint arXiv:1908.01000","venue":null,"work_id":"e922e5fb-22c7-4105-9375-f18e152e6f46","year":1908},"citing_paper":{"arxiv_id":"2605.25690","last_updated":"2026-05-25T10:46:15Z","snapshot_observed_at":"2026-07-06T23:35:36.158984Z","submitted_at":"2026-05-25T10:46:15Z","title":"GCIB: Graph Contrastive Information Bottleneck for Multi-Behavior Recommendation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T20:26:32.599286Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2605.25690"},"observation_digest":"sha256:82c9ad778232e53d73aa423604aebc09af53a64f56f1c665cf05e536892d57c9","observation_id":"f8ee60cb-e955-4104-ba74-d1f718d17efb","resolution":{"observed_at":"2026-06-30T00:24:04.588701Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.01000/citation-record","integrity":"/paper/1908.01000/integrity","json":"/paper/1908.01000/citation-record.json","paper":"/paper/1908.01000"},"outbound":[],"paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T22:53:19.441314Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 22 inbound Pith citation observations for arXiv:1908.01000."}