{"as_of":"2026-08-10T06:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:929d7689b2b9ed5b19e5feb8c6d7afe653abae573e6c7ba5314d24a49441aa56","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-09T06:31:02.800959+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-01T13:29:56.261064Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.09612","last_updated":"2023-06-16T04:05:58Z","snapshot_observed_at":"2026-07-06T15:43:19.498986Z","submitted_at":"2023-06-16T04:05:58Z","title":"GraphSHA: Synthesizing Harder Samples for Class-Imbalanced Node Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.09612","snapshot_observed_at":"2026-08-01T13:29:56.261064Z","title":"Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:56.261064Z"},"links":{"cited_paper":"/paper/2306.09612","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:b8f3cecba813ded0d2f38e480234ae8e86cf543f9acf3a7c651240208af0bfb5","observation_id":"7e81dd84-e729-4566-9e66-c6e4110bf7fa","resolution":{"observed_at":"2026-08-01T13:29:56.261064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2306.09612/citation-record","integrity":"/paper/2306.09612/integrity","json":"/paper/2306.09612/citation-record.json","paper":"/paper/2306.09612"},"outbound":[],"paper":{"arxiv_id":"2306.09612","last_updated":"2023-06-16T04:05:58Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:43:19.498986Z","submitted_at":"2023-06-16T04:05:58Z","title":"GraphSHA: Synthesizing Harder Samples for Class-Imbalanced Node Classification"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2306.09612."}