{"as_of":"2026-08-08T19:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8057dddbb917ff6e0c87d5de7bbbea7b149bbbe6e122e70a219a85eb0d72ee71","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":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T05:10:55.553832Z","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-07T15:39:37.124800Z","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:31cc805ef6ed754e9364a909eb523b3a9d165b9c97d9f3a8f7da1f7854a2ad3e","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-07T15:39:37.124800Z","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-08T05:04:27.222792Z","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:1a44b8061de28353dbdb41950ee4a720293c223e4c4e1eaf8c1e4bca4733e59b","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-07T15:39:37.124800Z","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-07T23:05:06.971916Z","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:a2b282ef6679b4a6e56134f28f30f23fa9b362914eb70841887c07b0def0a99e","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-07T15:39:37.124800Z","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-07T15:21:44.537647Z","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:b45836290daf569359eda62c69c9aa4617f340f2789997c9b116a0b2a4ff4929","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-07T15:39:37.124800Z","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-07T13:28:24.091632Z","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:92b0bbb27669395f326dfbbb1f244b0f1f6b07afed444c980171e92591056d30","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-07T15:39:37.124800Z","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-07T12:45:32.756495Z","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:32e879f67b8bdd8ff1a6b1d42aeca80bf68c6f048a9ecc718c9c7ac6d5c9ae50","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-07T15:39:37.124800Z","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-06T18:50:33.528644Z","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:a9a9068ad0a4476b983a07223d710f3f9a7def8de9c7bb8ad694811f3e9d7bdd","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-07T15:39:37.124800Z","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-07-06T22:44:28.488131Z","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:4912012eb7b6371f85e43c95b404c8cff54caea930793eac70e0dc240c17703b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-07T15:39:37.124800Z","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-07-06T23:02:05.116649Z","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:9b124e2be2d9a0e5c2df79cecf6bccf554727854e18dc3475c553a73f3aca1d2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-07T15:39:37.124800Z","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-02T16:10:58.374407Z","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:2f73580c0e8c78e591c7c56a48b95dcd06cd3b876df370ac66d804cbdf0ea45a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-07T15:39:37.124800Z","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-02T16:10:58.374407Z","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:db483160b06a0a1d96e4184830e4b2cd6d0568f28ca4a1f0445f3c6b2421afc9","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-07T15:39:37.124800Z","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-07-06T23:30:53.900592Z","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:b9117bf52e7f75c05b1147fa7e4babf5694ef002f917b82e5d6b8ae809e2eade","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-07T15:39:37.124800Z","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:0f6481af72a3cd010a00222cde2884b9e259540fe1465bb2dc825adfd5d33cb2","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"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-07T15:39:37.124800Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:1908.01000."}