{"as_of":"2026-08-11T08:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ac897591f09d2142b46c0c332d8eee460a418855402a91c189e0fac277583716","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-11T06:34:44.6726+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-10T04:53:37.684753Z","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-22T21:27:08.237848Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.12128","last_updated":"2022-05-23T15:25:19Z","snapshot_observed_at":"2026-07-06T12:11:31.206230Z","submitted_at":"2021-11-23T19:50:46Z","title":"On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Features","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.12128","snapshot_observed_at":"2026-08-10T04:53:37.684753Z","title":"I., Chamberlain, B","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.17081","last_updated":"2025-01-28T17:06:09Z","snapshot_observed_at":"2026-08-10T23:40:42.071664Z","submitted_at":"2025-01-28T17:06:09Z","title":"Graph Transformers for inverse physics: reconstructing flows around arbitrary 2D airfoils","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T04:53:37.684753Z"},"links":{"cited_paper":"/paper/2111.12128","citing_paper":"/paper/2501.17081"},"observation_digest":"sha256:907b416d9810b9667d9f56fa2b338374fe566c8fd7e726683f818ffac9794625","observation_id":"e05e19b2-ae32-4a7b-b968-aaa1575c9c09","resolution":{"observed_at":"2026-08-10T04:53:37.684753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.12128","last_updated":"2022-05-23T15:25:19Z","snapshot_observed_at":"2026-07-06T12:11:31.206230Z","submitted_at":"2021-11-23T19:50:46Z","title":"On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Features","version":3},"cited_work":{"arxiv_id":"2111.12128","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.12128","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"9 Rethinking Graph Structure Learning in the Era of LLMs Sen, P., Namata, G., Bilgic, M., Getoor, L., Galligher, B., and Eliassi-Rad, T","venue":null,"work_id":"43435918-4eb7-441a-b842-a1cddc591b59","year":null},"citing_paper":{"arxiv_id":"2504.02343","last_updated":"2026-05-11T09:16:48Z","snapshot_observed_at":"2026-08-02T20:27:51.058597Z","submitted_at":"2025-04-03T07:24:18Z","title":"Toward General and Robust LLM-enhanced Text-attributed Graph Learning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-22T21:26:35.707533Z"},"links":{"cited_paper":"/paper/2111.12128","citing_paper":"/paper/2504.02343"},"observation_digest":"sha256:9d39b80aea9902787563ad78afac908504e6b02480fa35e9a946c54bca419a60","observation_id":"4906e979-13df-47c9-a1cf-36772846e1ad","resolution":{"observed_at":"2026-05-22T21:27:08.242040Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2111.12128/citation-record","integrity":"/paper/2111.12128/integrity","json":"/paper/2111.12128/citation-record.json","paper":"/paper/2111.12128"},"outbound":[],"paper":{"arxiv_id":"2111.12128","last_updated":"2022-05-23T15:25:19Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:11:31.206230Z","submitted_at":"2021-11-23T19:50:46Z","title":"On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Features"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2111.12128."}