{"as_of":"2026-08-19T14:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ff80e069c07bbb23be9bec74099c7e40d0de84dcdfc88fadccbafa26a464a6d2","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-19T06:32:44.657259+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-10T22:02:05.398595Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-09T16:39:10.739550Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.03174","last_updated":"2021-10-11T03:36:32Z","snapshot_observed_at":"2026-08-19T10:06:54.060819Z","submitted_at":"2020-12-06T03:42:54Z","title":"Counting Substructures with Higher-Order Graph Neural Networks: Possibility and Impossibility Results","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.03174","snapshot_observed_at":"2026-08-10T22:02:05.398595Z","title":"Counting substructures with higher-order graph neural networks: Possibility and impossibility results","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.03113","last_updated":"2025-07-07T23:34:36Z","snapshot_observed_at":"2026-08-18T17:41:48.756461Z","submitted_at":"2025-01-06T16:20:54Z","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-10T22:02:05.398595Z"},"links":{"cited_paper":"/paper/2012.03174","citing_paper":"/paper/2501.03113"},"observation_digest":"sha256:153f8ea08418c19bf516969c225b6f33b298acb15243f62ba06053136fce2852","observation_id":"2c7ae1e5-c705-4eb7-a63b-792e8b8e1f2c","resolution":{"observed_at":"2026-08-10T22:02:05.398595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.03174","last_updated":"2021-10-11T03:36:32Z","snapshot_observed_at":"2026-08-19T10:06:54.060819Z","submitted_at":"2020-12-06T03:42:54Z","title":"Counting Substructures with Higher-Order Graph Neural Networks: Possibility and Impossibility Results","version":2},"cited_work":{"arxiv_id":"2012.03174","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.03174","snapshot_observed_at":"2026-08-09T16:39:10.739550Z","title":"Counting Substructures with Higher-Order Graph Neural Networks: Possibility and Impossibility Results","venue":"cs.LG","work_id":"ab3c2055-ab34-4607-831c-af0dcc71eb27","year":2020},"citing_paper":{"arxiv_id":"2502.01122","last_updated":"2025-02-03T07:28:53Z","snapshot_observed_at":"2026-08-17T11:36:34.385147Z","submitted_at":"2025-02-03T07:28:53Z","title":"Learning Efficient Positional Encodings with Graph Neural Networks","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-09T16:39:10.656446Z"},"links":{"cited_paper":"/paper/2012.03174","citing_paper":"/paper/2502.01122"},"observation_digest":"sha256:774d87d4a25224d515cc4d087a177e95f80fedbcd29caffe4cc6a32579a74b66","observation_id":"9ac3c8a8-4078-402f-b062-5527ed38fae2","resolution":{"observed_at":"2026-08-09T16:39:10.745430Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2012.03174/citation-record","integrity":"/paper/2012.03174/integrity","json":"/paper/2012.03174/citation-record.json","paper":"/paper/2012.03174"},"outbound":[],"paper":{"arxiv_id":"2012.03174","last_updated":"2021-10-11T03:36:32Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T10:06:54.060819Z","submitted_at":"2020-12-06T03:42:54Z","title":"Counting Substructures with Higher-Order Graph Neural Networks: Possibility and Impossibility Results"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2012.03174."}