{"as_of":"2026-08-15T13:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9f928b9ea8bde4cce3d577c607d0927dca16280d366b95770689dbeb39747b79","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:32:21.600088Z","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-11T11:32:22.185452Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.03880","last_updated":"2024-11-08T12:26:43Z","snapshot_observed_at":"2026-08-13T04:02:04.597569Z","submitted_at":"2024-03-06T17:40:26Z","title":"Almost Surely Asymptotically Constant Graph Neural Networks","version":3},"cited_work":{"arxiv_id":"2403.03880","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.03880","snapshot_observed_at":"2026-08-11T11:32:22.185452Z","title":"Almost Surely Asymptotically Constant Graph Neural Networks","venue":"cs.LG","work_id":"7f2d0e8e-52fb-49ec-83b1-002c67fcd591","year":2024},"citing_paper":{"arxiv_id":"2412.15496","last_updated":"2025-05-13T07:37:55Z","snapshot_observed_at":"2026-08-11T11:20:46.297652Z","submitted_at":"2024-12-20T02:22:38Z","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T11:32:21.600088Z"},"links":{"cited_paper":"/paper/2403.03880","citing_paper":"/paper/2412.15496"},"observation_digest":"sha256:15fcf581303705cfca816a0c1c51c465daf9998169dc1178c36549625bc5fb9e","observation_id":"c0a40dcc-ea75-49a3-b7b0-c61863cd9c48","resolution":{"observed_at":"2026-08-11T11:32:22.193564Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.03880/citation-record","integrity":"/paper/2403.03880/integrity","json":"/paper/2403.03880/citation-record.json","paper":"/paper/2403.03880"},"outbound":[],"paper":{"arxiv_id":"2403.03880","last_updated":"2024-11-08T12:26:43Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T04:02:04.597569Z","submitted_at":"2024-03-06T17:40:26Z","title":"Almost Surely Asymptotically Constant Graph Neural 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2403.03880."}