{"as_of":"2026-08-10T15:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fa28ca4fd7993e2c1bba9ab040c1779379796d73f002dc2c0b653e6f9444841f","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T21:14:05.170571Z","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-07-04T08:49:41.950780Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.09643","last_updated":"2021-03-08T10:48:14Z","snapshot_observed_at":"2026-08-07T03:05:15.469673Z","submitted_at":"2020-11-19T04:18:01Z","title":"Node Similarity Preserving Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.09643","snapshot_observed_at":"2026-08-09T21:14:05.170571Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.19137","last_updated":"2025-01-31T13:46:42Z","snapshot_observed_at":"2026-08-09T21:08:37.400556Z","submitted_at":"2025-01-31T13:46:42Z","title":"A Metric for the Balance of Information in Graph Learning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T21:14:05.170571Z"},"links":{"cited_paper":"/paper/2011.09643","citing_paper":"/paper/2501.19137"},"observation_digest":"sha256:bdd0a2a31ceb40dd332bdfd2bca1e89518fd8b11d92a9fc383c70fd1ed47111d","observation_id":"1b66683e-b5c8-43e8-a19c-9ec94daf4403","resolution":{"observed_at":"2026-08-09T21:14:05.170571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.09643","last_updated":"2021-03-08T10:48:14Z","snapshot_observed_at":"2026-08-07T03:05:15.469673Z","submitted_at":"2020-11-19T04:18:01Z","title":"Node Similarity Preserving Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":"2011.09643","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.09643","snapshot_observed_at":"2026-07-04T08:49:41.950780Z","title":null,"venue":null,"work_id":"ab1624db-6e49-4c88-940b-fe3cfea2077f","year":2011},"citing_paper":{"arxiv_id":"2606.22429","last_updated":"2026-06-21T10:40:33Z","snapshot_observed_at":"2026-08-07T18:47:13.612767Z","submitted_at":"2026-06-21T10:40:33Z","title":"Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation","version":1},"reference_index":195,"source":"arxiv_source","source_observed_at":"2026-06-26T10:59:25.867813Z"},"links":{"cited_paper":"/paper/2011.09643","citing_paper":"/paper/2606.22429"},"observation_digest":"sha256:824b4b4bed2b09e5fd3aca7df69d7b621a8478a3e5a95cf49e0eb9e12fcfb732","observation_id":"d547b413-b122-4afe-a6ae-70d147b62a51","resolution":{"observed_at":"2026-07-04T08:49:41.952154Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2011.09643/citation-record","integrity":"/paper/2011.09643/integrity","json":"/paper/2011.09643/citation-record.json","paper":"/paper/2011.09643"},"outbound":[],"paper":{"arxiv_id":"2011.09643","last_updated":"2021-03-08T10:48:14Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T03:05:15.469673Z","submitted_at":"2020-11-19T04:18:01Z","title":"Node Similarity Preserving Graph Convolutional Networks"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2011.09643."}