{"as_of":"2026-08-05T16:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d4d900f590e2290524eb414765d6191dcba08f81f33bb93e4a82a36f98709ee3","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-07T06:27:36.438779Z","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-12T10:21:30.260446Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.20082","last_updated":"2024-03-20T18:22:16Z","snapshot_observed_at":"2026-07-06T16:40:51.343918Z","submitted_at":"2023-10-30T23:41:05Z","title":"Efficient Subgraph GNNs by Learning Effective Selection Policies","version":2},"cited_work":{"arxiv_id":"2310.20082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.20082","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient subgraph gnns by learning effec- tive selection policies.arXiv preprint arXiv:2310.20082","venue":null,"work_id":"089ba078-73f2-42fa-8144-70ddc6128a7e","year":null},"citing_paper":{"arxiv_id":"2604.27786","last_updated":"2026-05-04T09:48:40Z","snapshot_observed_at":"2026-07-06T23:13:11.623453Z","submitted_at":"2026-04-30T12:29:14Z","title":"On the Expressive Power of GNNs to Solve Linear SDPs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-07T06:27:36.438779Z"},"links":{"cited_paper":"/paper/2310.20082","citing_paper":"/paper/2604.27786"},"observation_digest":"sha256:d49841d5698c62c108d6a519f6cb0763e546ca918fd57720442d3fd4ba54cbf9","observation_id":"dcd1da1e-7b9d-4711-80cf-16117df09a01","resolution":{"observed_at":"2026-05-12T10:21:30.264380Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.20082/citation-record","integrity":"/paper/2310.20082/integrity","json":"/paper/2310.20082/citation-record.json","paper":"/paper/2310.20082"},"outbound":[],"paper":{"arxiv_id":"2310.20082","last_updated":"2024-03-20T18:22:16Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T16:40:51.343918Z","submitted_at":"2023-10-30T23:41:05Z","title":"Efficient Subgraph GNNs by Learning Effective Selection Policies"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2310.20082."}