{"as_of":"2026-08-11T14:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:60a104aa89df83dae53a224b4fc5e8be16d0f4ec21e07309d3f3ff0f5a93be73","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-11T06:34:44.6726+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-11T13:00:03.466023Z","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-11T13:00:03.784981Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.10014","last_updated":"2022-10-18T17:32:18Z","snapshot_observed_at":"2026-08-11T01:13:42.318299Z","submitted_at":"2022-10-18T17:32:18Z","title":"On Classification Thresholds for Graph Attention with Edge Features","version":1},"cited_work":{"arxiv_id":"2210.10014","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.10014","snapshot_observed_at":"2026-08-11T13:00:03.784981Z","title":"On Classification Thresholds for Graph Attention with Edge Features","venue":"cs.LG","work_id":"7c6eb3de-50f9-4cc7-8ce1-1c0a6249f153","year":2022},"citing_paper":{"arxiv_id":"2412.13754","last_updated":"2024-12-18T11:44:19Z","snapshot_observed_at":"2026-08-11T12:47:31.577903Z","submitted_at":"2024-12-18T11:44:19Z","title":"Optimal Exact Recovery in Semi-Supervised Learning: A Study of Spectral Methods and Graph Convolutional Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T13:00:03.466023Z"},"links":{"cited_paper":"/paper/2210.10014","citing_paper":"/paper/2412.13754"},"observation_digest":"sha256:f6b82a3c1ca54c7cb141dc2a8c2d5f08067c01260af7fc19257861cce1961885","observation_id":"a09d7d6e-8b59-49aa-a17b-1db4d723ffe3","resolution":{"observed_at":"2026-08-11T13:00:03.788105Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2210.10014/citation-record","integrity":"/paper/2210.10014/integrity","json":"/paper/2210.10014/citation-record.json","paper":"/paper/2210.10014"},"outbound":[],"paper":{"arxiv_id":"2210.10014","last_updated":"2022-10-18T17:32:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T01:13:42.318299Z","submitted_at":"2022-10-18T17:32:18Z","title":"On Classification Thresholds for Graph Attention with Edge Features"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2210.10014."}