{"as_of":"2026-08-08T17:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4b864f1807ede49d0049c63ee42b3a4bccdf138a2a306e6a96a834823b5253d3","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:19:21.421814Z","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-01T09:45:40.676796Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1911.05954","last_updated":"2019-12-25T15:09:28Z","snapshot_observed_at":"2026-08-03T14:19:33.322839Z","submitted_at":"2019-11-14T05:55:17Z","title":"Hierarchical Graph Pooling with Structure Learning","version":3},"cited_work":{"arxiv_id":"1911.05954","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.05954","snapshot_observed_at":"2026-07-01T09:45:40.676796Z","title":"arXiv preprint arXiv:1911.05954 , year=","venue":null,"work_id":"dfeedea6-8664-4c64-a05e-a9a0843dcc23","year":1911},"citing_paper":{"arxiv_id":"2501.00773","last_updated":"2026-04-09T14:25:52Z","snapshot_observed_at":"2026-08-02T06:24:28.654744Z","submitted_at":"2025-01-01T08:48:53Z","title":"OpenGLT: A Comprehensive Benchmark of Graph Neural Networks for Graph-Level Tasks","version":3},"reference_index":107,"source":"pdf_text","source_observed_at":"2026-05-23T06:10:49.711018Z"},"links":{"cited_paper":"/paper/1911.05954","citing_paper":"/paper/2501.00773"},"observation_digest":"sha256:a8bb25edb038381a95a7e6a04ffa66038a73b6c7581d3f661577ce545e63a4a8","observation_id":"a70a52b9-1843-4f6a-9ed2-3030a9328c7b","resolution":{"observed_at":"2026-05-23T06:12:38.342023Z","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":"1911.05954","last_updated":"2019-12-25T15:09:28Z","snapshot_observed_at":"2026-08-03T14:19:33.322839Z","submitted_at":"2019-11-14T05:55:17Z","title":"Hierarchical Graph Pooling with Structure Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.05954","snapshot_observed_at":"2026-08-07T14:19:21.421814Z","title":"Hierarchical graph pooling with structure learning","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2505.19445","last_updated":"2025-05-26T03:07:58Z","snapshot_observed_at":"2026-08-07T14:11:46.126741Z","submitted_at":"2025-05-26T03:07:58Z","title":"MetaGMT: Improving Actionable Interpretability of Graph Multilinear Networks via Meta-Learning Filtration","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T14:19:21.421814Z"},"links":{"cited_paper":"/paper/1911.05954","citing_paper":"/paper/2505.19445"},"observation_digest":"sha256:3b8baffb329125dee2c68161d20b5969df761f0583a0a1c81d03905dc89cc8e9","observation_id":"411dee0f-bcaf-43e8-bea0-f51e7126b352","resolution":{"observed_at":"2026-08-07T14:19:21.421814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05954","last_updated":"2019-12-25T15:09:28Z","snapshot_observed_at":"2026-08-03T14:19:33.322839Z","submitted_at":"2019-11-14T05:55:17Z","title":"Hierarchical Graph Pooling with Structure Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.05954","snapshot_observed_at":"2026-08-07T12:50:02.044686Z","title":"Scarselli, F., Gori, M., Tsoi, A","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.23609","last_updated":"2025-05-29T16:18:01Z","snapshot_observed_at":"2026-08-07T12:39:54.452518Z","submitted_at":"2025-05-29T16:18:01Z","title":"The Generalized Skew Spectrum of Graphs","version":1},"reference_index":203,"source":"pdf_text","source_observed_at":"2026-08-07T12:50:02.044686Z"},"links":{"cited_paper":"/paper/1911.05954","citing_paper":"/paper/2505.23609"},"observation_digest":"sha256:1c8d83b3e975afe44ac735ebea6be867008f0ac2b818b28c821e3854602d9652","observation_id":"2d5969b8-edba-4ada-b1af-517205c2759b","resolution":{"observed_at":"2026-08-07T12:50:02.044686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05954","last_updated":"2019-12-25T15:09:28Z","snapshot_observed_at":"2026-08-03T14:19:33.322839Z","submitted_at":"2019-11-14T05:55:17Z","title":"Hierarchical Graph Pooling with Structure Learning","version":3},"cited_work":{"arxiv_id":"1911.05954","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.05954","snapshot_observed_at":"2026-07-01T09:45:40.676796Z","title":"arXiv preprint arXiv:1911.05954 , year=","venue":null,"work_id":"dfeedea6-8664-4c64-a05e-a9a0843dcc23","year":1911},"citing_paper":{"arxiv_id":"2606.32016","last_updated":"2026-06-30T17:47:39Z","snapshot_observed_at":"2026-07-07T00:05:37.068846Z","submitted_at":"2026-06-30T17:47:39Z","title":"FedLAB: Traceable Semantic Codebooks for Federated Multimodal Graph Foundation Learning","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-07-01T06:10:26.634933Z"},"links":{"cited_paper":"/paper/1911.05954","citing_paper":"/paper/2606.32016"},"observation_digest":"sha256:0ce4c5566347414d5db8ac4f9bad478de9023c1bc7d7957ce837f5fdee4740cc","observation_id":"0f28c391-16e1-4eac-accf-c793bdbbec20","resolution":{"observed_at":"2026-07-01T09:45:40.678221Z","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/1911.05954/citation-record","integrity":"/paper/1911.05954/integrity","json":"/paper/1911.05954/citation-record.json","paper":"/paper/1911.05954"},"outbound":[],"paper":{"arxiv_id":"1911.05954","last_updated":"2019-12-25T15:09:28Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T14:19:33.322839Z","submitted_at":"2019-11-14T05:55:17Z","title":"Hierarchical Graph Pooling with Structure Learning"},"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 4 inbound Pith citation observations for arXiv:1911.05954."}