{"as_of":"2026-08-08T07:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:934dd5275dda1e8bb509ef69fb463aa5d18d2bb99e7a909ac6655f0d5cf0cdc9","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T10:59:25.867813Z","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-04T08:49:42.002884Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.02863","last_updated":"2021-04-07T18:50:16Z","snapshot_observed_at":"2026-07-06T10:02:02.340983Z","submitted_at":"2020-10-06T16:31:27Z","title":"Directional Graph Networks","version":4},"cited_work":{"arxiv_id":"2010.02863","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.02863","snapshot_observed_at":"2026-07-04T08:49:42.002884Z","title":"Directional graph networks","venue":null,"work_id":"45053ccc-5e12-4cef-aeea-522cf34fb5a0","year":2020},"citing_paper":{"arxiv_id":"2104.13478","last_updated":"2021-05-02T16:16:03Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-04-27T21:09:51Z","title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-13T02:39:29.411021Z"},"links":{"cited_paper":"/paper/2010.02863","citing_paper":"/paper/2104.13478"},"observation_digest":"sha256:d613097e49e10b8771878ff5f6e5c3adb6a09e0557587b95f08d62ddd42df4fe","observation_id":"a462cf1a-5268-4ee2-9bf9-add23076e726","resolution":{"observed_at":"2026-05-13T02:39:29.505818Z","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":"2010.02863","last_updated":"2021-04-07T18:50:16Z","snapshot_observed_at":"2026-07-06T10:02:02.340983Z","submitted_at":"2020-10-06T16:31:27Z","title":"Directional Graph Networks","version":4},"cited_work":{"arxiv_id":"2010.02863","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.02863","snapshot_observed_at":"2026-07-04T08:49:42.002884Z","title":"Directional graph networks","venue":null,"work_id":"45053ccc-5e12-4cef-aeea-522cf34fb5a0","year":2020},"citing_paper":{"arxiv_id":"2605.05689","last_updated":"2026-05-07T05:29:57Z","snapshot_observed_at":"2026-07-06T23:18:17.333660Z","submitted_at":"2026-05-07T05:29:57Z","title":"GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-08T11:46:42.010486Z"},"links":{"cited_paper":"/paper/2010.02863","citing_paper":"/paper/2605.05689"},"observation_digest":"sha256:7170c6ea7c9365872e8c6196ea08537b79fb111972c893bca4b705a49c09f754","observation_id":"a2133ca4-6367-436a-bc79-c91ea34c940a","resolution":{"observed_at":"2026-05-11T19:31:08.857399Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2010.02863","last_updated":"2021-04-07T18:50:16Z","snapshot_observed_at":"2026-07-06T10:02:02.340983Z","submitted_at":"2020-10-06T16:31:27Z","title":"Directional Graph Networks","version":4},"cited_work":{"arxiv_id":"2010.02863","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.02863","snapshot_observed_at":"2026-07-04T08:49:42.002884Z","title":"Directional graph networks","venue":null,"work_id":"45053ccc-5e12-4cef-aeea-522cf34fb5a0","year":2020},"citing_paper":{"arxiv_id":"2606.22429","last_updated":"2026-06-21T10:40:33Z","snapshot_observed_at":"2026-08-07T18:47:13.612767Z","submitted_at":"2026-06-21T10:40:33Z","title":"Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-06-26T10:59:25.867813Z"},"links":{"cited_paper":"/paper/2010.02863","citing_paper":"/paper/2606.22429"},"observation_digest":"sha256:f696e91c3896e0aee36384132bf3666e1c2255b7b84bcefba1ea52b43364308d","observation_id":"4e7495d0-1e90-4e21-b9d1-884c05901b08","resolution":{"observed_at":"2026-07-04T08:49:42.005090Z","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/2010.02863/citation-record","integrity":"/paper/2010.02863/integrity","json":"/paper/2010.02863/citation-record.json","paper":"/paper/2010.02863"},"outbound":[],"paper":{"arxiv_id":"2010.02863","last_updated":"2021-04-07T18:50:16Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T10:02:02.340983Z","submitted_at":"2020-10-06T16:31:27Z","title":"Directional Graph 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-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 3 inbound Pith citation observations for arXiv:2010.02863."}