{"as_of":"2026-08-23T20:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:94cd492de69d0f1c856accd1c6da6db6e76a3e24e37fdc0815487498b6ff5150","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-23T06:30:58.430688+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-10T22:40:48.747068Z","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-10T22:40:49.161193Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.02464","last_updated":"2024-05-29T05:40:35Z","snapshot_observed_at":"2026-08-16T14:21:43.381852Z","submitted_at":"2024-02-04T12:29:40Z","title":"A Graph is Worth $K$ Words: Euclideanizing Graph using Pure Transformer","version":3},"cited_work":{"arxiv_id":"2402.02464","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.02464","snapshot_observed_at":"2026-08-10T22:40:49.161193Z","title":"A Graph is Worth $K$ Words: Euclideanizing Graph using Pure Transformer","venue":"cs.LG","work_id":"038a6df1-58bf-495a-82cb-2910dbe9fad5","year":2024},"citing_paper":{"arxiv_id":"2501.01073","last_updated":"2025-06-03T16:53:33Z","snapshot_observed_at":"2026-08-15T15:11:09.002273Z","submitted_at":"2025-01-02T05:44:11Z","title":"Graph Generative Pre-trained Transformer","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:40:48.747068Z"},"links":{"cited_paper":"/paper/2402.02464","citing_paper":"/paper/2501.01073"},"observation_digest":"sha256:d849c45b6f7ce83ce4a78546bf597dd8e9785d55c40f294fe33951ac0221b78b","observation_id":"4533980d-781c-4596-b441-e27057a2362c","resolution":{"observed_at":"2026-08-10T22:40:49.164567Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.02464/citation-record","integrity":"/paper/2402.02464/integrity","json":"/paper/2402.02464/citation-record.json","paper":"/paper/2402.02464"},"outbound":[],"paper":{"arxiv_id":"2402.02464","last_updated":"2024-05-29T05:40:35Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:21:43.381852Z","submitted_at":"2024-02-04T12:29:40Z","title":"A Graph is Worth $K$ Words: Euclideanizing Graph using Pure Transformer"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2402.02464."}