{"as_of":"2026-08-09T12:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b8c653cf6534c0ea9bce10c89cb89e9e66051cce8a6a6b5a70b026fa7fd002b6","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:24:01.015582Z","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-15T18:50:17.086607Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.00064","last_updated":"2022-03-11T14:02:28Z","snapshot_observed_at":"2026-08-01T19:53:36.776939Z","submitted_at":"2021-10-29T19:55:12Z","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.00064","snapshot_observed_at":"2026-08-07T05:44:53.131783Z","title":"Node feature extraction by self-supervised multi-scale neighborhood prediction","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.07168","last_updated":"2025-06-08T14:34:29Z","snapshot_observed_at":"2026-08-07T22:51:47.659500Z","submitted_at":"2025-06-08T14:34:29Z","title":"Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:53.131783Z"},"links":{"cited_paper":"/paper/2111.00064","citing_paper":"/paper/2506.07168"},"observation_digest":"sha256:edb62433e63edf3041e5fdd98184b7a7a2b43aafccd151a586c484b73fedea90","observation_id":"8ae971d1-94b8-4585-aa81-8a213aab78f8","resolution":{"observed_at":"2026-08-07T05:44:53.131783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.00064","last_updated":"2022-03-11T14:02:28Z","snapshot_observed_at":"2026-08-01T19:53:36.776939Z","submitted_at":"2021-10-29T19:55:12Z","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.00064","snapshot_observed_at":"2026-08-07T13:24:01.015582Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10014","last_updated":"2025-05-28T04:48:43Z","snapshot_observed_at":"2026-08-09T05:18:08.910882Z","submitted_at":"2025-05-28T04:48:43Z","title":"NOCL: Node-Oriented Conceptualization LLM for Graph Tasks without Message Passing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:24:01.015582Z"},"links":{"cited_paper":"/paper/2111.00064","citing_paper":"/paper/2506.10014"},"observation_digest":"sha256:ab96405ac414ab21540fdf65429564d74290657d853d4b6f9b0d0e2d929df29c","observation_id":"4e62569a-4706-4251-88d5-7999d51cbd67","resolution":{"observed_at":"2026-08-07T13:24:01.015582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.00064","last_updated":"2022-03-11T14:02:28Z","snapshot_observed_at":"2026-08-01T19:53:36.776939Z","submitted_at":"2021-10-29T19:55:12Z","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.00064","snapshot_observed_at":"2026-08-07T04:33:14.787363Z","title":"Node feature extraction by self-supervised multi-scale neighborhood prediction.arXiv preprint arXiv:2111.00064, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10282","last_updated":"2025-06-12T01:44:46Z","snapshot_observed_at":"2026-08-08T23:11:40.162844Z","submitted_at":"2025-06-12T01:44:46Z","title":"Graph-MLLM: Harnessing Multimodal Large Language Models for Multimodal Graph Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:33:14.787363Z"},"links":{"cited_paper":"/paper/2111.00064","citing_paper":"/paper/2506.10282"},"observation_digest":"sha256:757157f4f554f0675ea4868d5208db26f3b315287aecfcdd0550efb17e922f8e","observation_id":"d6ae6f79-0a86-400c-9f21-b48cb1a84b9e","resolution":{"observed_at":"2026-08-07T04:33:14.787363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.00064","last_updated":"2022-03-11T14:02:28Z","snapshot_observed_at":"2026-08-01T19:53:36.776939Z","submitted_at":"2021-10-29T19:55:12Z","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.00064","snapshot_observed_at":"2026-08-05T14:36:36.362885Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.06975","last_updated":"2025-08-28T19:13:10Z","snapshot_observed_at":"2026-08-07T21:39:28.054869Z","submitted_at":"2025-08-28T19:13:10Z","title":"GSTBench: A Benchmark Study on the Transferability of Graph Self-Supervised Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:36.362885Z"},"links":{"cited_paper":"/paper/2111.00064","citing_paper":"/paper/2509.06975"},"observation_digest":"sha256:84619d0626fa33bdc3b4de5a8f7a3208ae21ae21c92b13bd5119eaf5454c6ba8","observation_id":"cc4b7467-4dff-4ae8-830e-b8bb1c7d0edd","resolution":{"observed_at":"2026-08-05T14:36:36.362885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.00064","last_updated":"2022-03-11T14:02:28Z","snapshot_observed_at":"2026-08-01T19:53:36.776939Z","submitted_at":"2021-10-29T19:55:12Z","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","version":3},"cited_work":{"arxiv_id":"2111.00064","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.00064","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2111.00064 , year=","venue":null,"work_id":"e3a66b75-6541-4ff4-a792-86fb3931e9a7","year":2021},"citing_paper":{"arxiv_id":"2603.01410","last_updated":"2026-04-15T12:49:26Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-03-02T03:25:40Z","title":"GraphScout: Empowering Large Language Models with Intrinsic Exploration Ability for Agentic Graph Reasoning","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-15T18:47:06.207176Z"},"links":{"cited_paper":"/paper/2111.00064","citing_paper":"/paper/2603.01410"},"observation_digest":"sha256:8311a9adb01f644674732a2915fd80ec18baf2ef456db2200b08698d64994f5d","observation_id":"eca12f02-1a25-41bd-ad82-8fd1a7a5374d","resolution":{"observed_at":"2026-05-15T18:50:17.090120Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.00064","last_updated":"2022-03-11T14:02:28Z","snapshot_observed_at":"2026-08-01T19:53:36.776939Z","submitted_at":"2021-10-29T19:55:12Z","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","version":3},"cited_work":{"arxiv_id":"2111.00064","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.00064","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2111.00064 , year=","venue":null,"work_id":"e3a66b75-6541-4ff4-a792-86fb3931e9a7","year":2021},"citing_paper":{"arxiv_id":"2604.17411","last_updated":"2026-04-19T12:36:18Z","snapshot_observed_at":"2026-07-06T23:04:32.734175Z","submitted_at":"2026-04-19T12:36:18Z","title":"DuConTE: Dual-Granularity Text Encoder with Topology-Constrained Attention for Text-attributed Graphs","version":1},"reference_index":120,"source":"arxiv_source","source_observed_at":"2026-05-10T05:49:52.864722Z"},"links":{"cited_paper":"/paper/2111.00064","citing_paper":"/paper/2604.17411"},"observation_digest":"sha256:bc4b10f8c50c0a5c76ef569e5f98b68d52135754c1eb641bc164118319e34548","observation_id":"7f21daf8-47f6-473c-bdcc-9221518f4c41","resolution":{"observed_at":"2026-05-10T05:51:09.915065Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.00064","last_updated":"2022-03-11T14:02:28Z","snapshot_observed_at":"2026-08-01T19:53:36.776939Z","submitted_at":"2021-10-29T19:55:12Z","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","version":3},"cited_work":{"arxiv_id":"2111.00064","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.00064","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2111.00064 , year=","venue":null,"work_id":"e3a66b75-6541-4ff4-a792-86fb3931e9a7","year":2021},"citing_paper":{"arxiv_id":"2605.12814","last_updated":"2026-05-12T23:14:37Z","snapshot_observed_at":"2026-08-02T06:21:17.894895Z","submitted_at":"2026-05-12T23:14:37Z","title":"Linking Extreme Discourse to Structural Polarization in Signed Interaction Networks","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-14T19:17:04.738168Z"},"links":{"cited_paper":"/paper/2111.00064","citing_paper":"/paper/2605.12814"},"observation_digest":"sha256:1eed5e32346a0f533ae8f8a27ecd598b9db5aa8a1a02895a9e74a390ae906b3e","observation_id":"6b4ce78e-ae57-4c95-b0b7-611a8fa998a6","resolution":{"observed_at":"2026-05-14T19:17:49.949336Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2111.00064/citation-record","integrity":"/paper/2111.00064/integrity","json":"/paper/2111.00064/citation-record.json","paper":"/paper/2111.00064"},"outbound":[],"paper":{"arxiv_id":"2111.00064","last_updated":"2022-03-11T14:02:28Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-01T19:53:36.776939Z","submitted_at":"2021-10-29T19:55:12Z","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2111.00064."}