{"as_of":"2026-08-08T20:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f91d0dec44ee5ba09262527b5283a5c306bf73667952a6e5dfee0072c2ba09f1","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-08T06:32:00.761636+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-08-06T19:25:28.163819Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T19:25:28.299171Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.13268","last_updated":"2025-07-10T02:43:15Z","snapshot_observed_at":"2026-07-06T17:47:26.534826Z","submitted_at":"2024-03-20T03:07:30Z","title":"Unifews: You Need Fewer Operations for Efficient Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2403.13268","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.13268","snapshot_observed_at":"2026-08-06T19:25:28.299171Z","title":"Unifews: You Need Fewer Operations for Efficient Graph Neural Networks","venue":"cs.LG","work_id":"b206d53b-3e2f-485a-8681-9f64da842b78","year":2024},"citing_paper":{"arxiv_id":"2507.05649","last_updated":"2025-07-14T14:12:59Z","snapshot_observed_at":"2026-08-07T17:45:18.696744Z","submitted_at":"2025-07-08T04:01:53Z","title":"DESIGN: Encrypted GNN Inference via Server-Side Input Graph Pruning","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T19:25:28.163819Z"},"links":{"cited_paper":"/paper/2403.13268","citing_paper":"/paper/2507.05649"},"observation_digest":"sha256:a8de2eb0f84958963a2b2393c973c04e3f2a3a3e2a0f2aff1212f2bd44624d4a","observation_id":"7b719268-be11-4f20-9b75-8fb840c068cb","resolution":{"observed_at":"2026-08-06T19:25:28.304137Z","resolver_source":"local_arxiv","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/2403.13268/citation-record","integrity":"/paper/2403.13268/integrity","json":"/paper/2403.13268/citation-record.json","paper":"/paper/2403.13268"},"outbound":[],"paper":{"arxiv_id":"2403.13268","last_updated":"2025-07-10T02:43:15Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T17:47:26.534826Z","submitted_at":"2024-03-20T03:07:30Z","title":"Unifews: You Need Fewer Operations for Efficient 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-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 1 inbound Pith citation observation for arXiv:2403.13268."}