{"as_of":"2026-08-14T17:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:14c9e30b55f9e044159ccdda30c4e68fdc667a12886d96bea2ea7b26ca878149","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T20:07:22.433787Z","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-02T06:06:41.488646Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1911.08795","last_updated":"2019-11-20T10:02:19Z","snapshot_observed_at":"2026-08-14T09:57:13.275104Z","submitted_at":"2019-11-20T10:02:19Z","title":"On Node Features for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08795","snapshot_observed_at":"2026-08-12T20:07:22.433787Z","title":"On node features for graph neural networks","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2411.09999","last_updated":"2024-11-15T07:12:46Z","snapshot_observed_at":"2026-08-14T08:18:53.847513Z","submitted_at":"2024-11-15T07:12:46Z","title":"Understanding Graph Databases: A Comprehensive Tutorial and Survey","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T20:07:22.433787Z"},"links":{"cited_paper":"/paper/1911.08795","citing_paper":"/paper/2411.09999"},"observation_digest":"sha256:daf8a01bcbfb86982ecf4e15665e4a6e3ee2612c727fed156611559a374c1542","observation_id":"f0466178-6a3a-49bf-837d-a01fdb81613b","resolution":{"observed_at":"2026-08-12T20:07:22.433787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08795","last_updated":"2019-11-20T10:02:19Z","snapshot_observed_at":"2026-08-14T09:57:13.275104Z","submitted_at":"2019-11-20T10:02:19Z","title":"On Node Features for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08795","snapshot_observed_at":"2026-08-11T14:32:37.274566Z","title":"On node features for graph neural networks","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2412.11888","last_updated":"2024-12-16T15:37:17Z","snapshot_observed_at":"2026-08-14T12:13:45.276038Z","submitted_at":"2024-12-16T15:37:17Z","title":"GNN Applied to Ego-nets for Friend Suggestions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T14:32:37.274566Z"},"links":{"cited_paper":"/paper/1911.08795","citing_paper":"/paper/2412.11888"},"observation_digest":"sha256:934e1dbeddc26b40fbb501172fd9e360af8ae5c2abe4f7a588ba54fe03f1cafc","observation_id":"4d0433cf-cbdf-4e34-a2fe-2f9e28c33a2e","resolution":{"observed_at":"2026-08-11T14:32:37.274566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08795","last_updated":"2019-11-20T10:02:19Z","snapshot_observed_at":"2026-08-14T09:57:13.275104Z","submitted_at":"2019-11-20T10:02:19Z","title":"On Node Features for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08795","snapshot_observed_at":"2026-08-06T05:49:00.394092Z","title":"On node features for graph neural networks,","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2508.01278","last_updated":"2025-08-02T09:15:52Z","snapshot_observed_at":"2026-08-13T05:24:09.797981Z","submitted_at":"2025-08-02T09:15:52Z","title":"A graph neural network based on feature network for identifying influential nodes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T05:49:00.394092Z"},"links":{"cited_paper":"/paper/1911.08795","citing_paper":"/paper/2508.01278"},"observation_digest":"sha256:5fcdbf18a48fbdb0cbf92f6a2402ffff54d65104fe5868b0edcd715543082e28","observation_id":"1c82bab7-2387-42d0-8801-4ad9cad1e7f1","resolution":{"observed_at":"2026-08-06T05:49:00.394092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08795","last_updated":"2019-11-20T10:02:19Z","snapshot_observed_at":"2026-08-14T09:57:13.275104Z","submitted_at":"2019-11-20T10:02:19Z","title":"On Node Features for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"1911.08795","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.08795","snapshot_observed_at":"2026-07-02T06:06:41.488646Z","title":"arXiv preprint arXiv:1911.08795 , year=","venue":null,"work_id":"42c5f917-78ae-4f63-a126-cc8dfb019c3a","year":1911},"citing_paper":{"arxiv_id":"2605.07788","last_updated":"2026-05-08T14:26:09Z","snapshot_observed_at":"2026-08-13T13:33:01.762213Z","submitted_at":"2026-05-08T14:26:09Z","title":"Bridging the Programming Language Gap: Constructing a Multilingual Shared Semantic Space through AST Unification and Graph Matching","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-11T03:16:51.912157Z"},"links":{"cited_paper":"/paper/1911.08795","citing_paper":"/paper/2605.07788"},"observation_digest":"sha256:fc893892785190b630b926ef737827a95f002804d1aea07a486989173638a2f6","observation_id":"d93c37c2-b7c1-49f6-8303-ddf3b128136b","resolution":{"observed_at":"2026-05-11T03:20:56.060880Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08795","last_updated":"2019-11-20T10:02:19Z","snapshot_observed_at":"2026-08-14T09:57:13.275104Z","submitted_at":"2019-11-20T10:02:19Z","title":"On Node Features for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"1911.08795","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1911.08795","snapshot_observed_at":"2026-07-02T06:06:41.488646Z","title":"arXiv preprint arXiv:1911.08795 , year=","venue":null,"work_id":"42c5f917-78ae-4f63-a126-cc8dfb019c3a","year":1911},"citing_paper":{"arxiv_id":"2606.05046","last_updated":"2026-06-03T16:07:24Z","snapshot_observed_at":"2026-07-06T23:45:02.342193Z","submitted_at":"2026-06-03T16:07:24Z","title":"Graph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning","version":1},"reference_index":154,"source":"arxiv_source","source_observed_at":"2026-06-28T07:37:20.073677Z"},"links":{"cited_paper":"/paper/1911.08795","citing_paper":"/paper/2606.05046"},"observation_digest":"sha256:bf9573b7f8b7ba0143272369117612703e6925affa2612e9f7e59999851d6a64","observation_id":"b696d054-f1d0-4ab7-ad27-322861cb2979","resolution":{"observed_at":"2026-07-02T06:06:41.490101Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1911.08795/citation-record","integrity":"/paper/1911.08795/integrity","json":"/paper/1911.08795/citation-record.json","paper":"/paper/1911.08795"},"outbound":[],"paper":{"arxiv_id":"1911.08795","last_updated":"2019-11-20T10:02:19Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T09:57:13.275104Z","submitted_at":"2019-11-20T10:02:19Z","title":"On Node Features for 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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1911.08795."}