{"as_of":"2026-08-10T09:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b18616370b330e30e815d7e0a8cfe77ffa74c9893ccc5af377443f81999ad586","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T12:57:13.293481Z","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-06-30T15:34:48.779685Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.02126","last_updated":"2020-07-07T04:20:53Z","snapshot_observed_at":"2026-07-06T08:55:15.069233Z","submitted_at":"2020-02-06T06:53:42Z","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.02126","snapshot_observed_at":"2026-08-09T12:57:13.293481Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.02232","last_updated":"2025-02-04T11:19:47Z","snapshot_observed_at":"2026-08-10T08:06:42.749863Z","submitted_at":"2025-02-04T11:19:47Z","title":"Combinatorial Optimization Perspective based Framework for Multi-behavior Recommendation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T12:57:13.293481Z"},"links":{"cited_paper":"/paper/2002.02126","citing_paper":"/paper/2502.02232"},"observation_digest":"sha256:af73cf1b65b52d11056f6ed07d803e3fc8f2ae75c06ed99c7e5db2885df409bb","observation_id":"46d73d19-ce07-425f-874e-8d350cb04785","resolution":{"observed_at":"2026-08-09T12:57:13.293481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.02126","last_updated":"2020-07-07T04:20:53Z","snapshot_observed_at":"2026-07-06T08:55:15.069233Z","submitted_at":"2020-02-06T06:53:42Z","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.02126","snapshot_observed_at":"2026-08-07T15:43:12.939016Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.14033","last_updated":"2025-05-22T05:47:24Z","snapshot_observed_at":"2026-08-10T09:06:36.268365Z","submitted_at":"2025-05-20T07:30:45Z","title":"Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:43:12.939016Z"},"links":{"cited_paper":"/paper/2002.02126","citing_paper":"/paper/2505.14033"},"observation_digest":"sha256:d3c10543e593b36f3040ac0f7be01b7410e45ccd2e51803c799cb1d0941ff597","observation_id":"431b55d1-2ef7-4ed0-849f-27a0ecd359a6","resolution":{"observed_at":"2026-08-07T15:43:12.939016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.02126","last_updated":"2020-07-07T04:20:53Z","snapshot_observed_at":"2026-07-06T08:55:15.069233Z","submitted_at":"2020-02-06T06:53:42Z","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.02126","snapshot_observed_at":"2026-07-13T18:26:59.896976Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.25126","last_updated":"2026-07-06T11:52:29Z","snapshot_observed_at":"2026-08-10T00:45:20.278998Z","submitted_at":"2026-03-26T07:51:14Z","title":"MCLMR: A Model-Agnostic Causal Learning Framework for Multi-Behavior Recommendation","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-13T18:26:59.896976Z"},"links":{"cited_paper":"/paper/2002.02126","citing_paper":"/paper/2603.25126"},"observation_digest":"sha256:24973fe3da1b15699eeacfdb30f3ebccc7f61b71173a12128f4515120357c0ac","observation_id":"214c2705-7976-4eb5-bac0-653a2c1d2295","resolution":{"observed_at":"2026-07-13T18:26:59.896976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.02126","last_updated":"2020-07-07T04:20:53Z","snapshot_observed_at":"2026-07-06T08:55:15.069233Z","submitted_at":"2020-02-06T06:53:42Z","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","version":4},"cited_work":{"arxiv_id":"2002.02126","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.02126","snapshot_observed_at":"2026-06-30T15:34:48.779685Z","title":null,"venue":null,"work_id":"2c3fceeb-d039-4daf-aeda-0f183c2fcfbd","year":2020},"citing_paper":{"arxiv_id":"2605.27429","last_updated":"2026-05-22T04:04:44Z","snapshot_observed_at":"2026-07-06T23:37:08.167449Z","submitted_at":"2026-05-22T04:04:44Z","title":"Ocean4Rec: Offline LLM-Derived OCEAN Profiles for Request-Time VOD Reranking","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-30T15:15:52.806007Z"},"links":{"cited_paper":"/paper/2002.02126","citing_paper":"/paper/2605.27429"},"observation_digest":"sha256:76833860ffb448e56259d8f82cd7788bd569ebd1dd027cee31172b934a6a2ffd","observation_id":"feb6f4b6-d087-4bfc-9e7e-6c0b8f066ae6","resolution":{"observed_at":"2026-06-30T15:34:48.780971Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.02126","last_updated":"2020-07-07T04:20:53Z","snapshot_observed_at":"2026-07-06T08:55:15.069233Z","submitted_at":"2020-02-06T06:53:42Z","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.02126","snapshot_observed_at":"2026-08-01T06:31:48.035689Z","title":"doi:10.48550/ARXIV.2002.02126 , url=","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.21885","last_updated":"2026-07-24T01:29:28Z","snapshot_observed_at":"2026-08-08T16:18:42.539865Z","submitted_at":"2026-07-24T01:29:28Z","title":"Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement","version":1},"reference_index":211,"source":"arxiv_source","source_observed_at":"2026-08-01T06:31:48.035689Z"},"links":{"cited_paper":"/paper/2002.02126","citing_paper":"/paper/2607.21885"},"observation_digest":"sha256:a2b814d28917b6c59beec3838a9afb5d6861681fd0116c3f921c05d0fb8d0ba6","observation_id":"45140973-3e61-4267-9699-ea500ba5b4f4","resolution":{"observed_at":"2026-08-01T06:31:48.035689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.02126","last_updated":"2020-07-07T04:20:53Z","snapshot_observed_at":"2026-07-06T08:55:15.069233Z","submitted_at":"2020-02-06T06:53:42Z","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.02126","snapshot_observed_at":"2026-08-04T00:55:44.091103Z","title":"doi:10.48550/arXiv.2002.02126 , url =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.00669","last_updated":"2026-08-01T13:44:04Z","snapshot_observed_at":"2026-08-08T01:10:55.545078Z","submitted_at":"2026-08-01T13:44:04Z","title":"GARDRec: Decision-Level Graph Grounding for Large Language Model Recommendation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T00:55:44.091103Z"},"links":{"cited_paper":"/paper/2002.02126","citing_paper":"/paper/2608.00669"},"observation_digest":"sha256:46f3be0665f2a316b01167cd59c720a89999f03ca4114d4d0b4d56aa7669531e","observation_id":"43b7aaee-e205-46a0-a8ff-fa651ed00cdd","resolution":{"observed_at":"2026-08-04T00:55:44.091103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2002.02126/citation-record","integrity":"/paper/2002.02126/integrity","json":"/paper/2002.02126/citation-record.json","paper":"/paper/2002.02126"},"outbound":[],"paper":{"arxiv_id":"2002.02126","last_updated":"2020-07-07T04:20:53Z","latest_version":4,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-06T08:55:15.069233Z","submitted_at":"2020-02-06T06:53:42Z","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2002.02126."}