{"as_of":"2026-08-19T13:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee837c9fdd5b8300cad7d7a20ca35650b3a0cd727d1f47250dde0916aeea80f2","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-19T06:32:44.657259+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-12T14:08:11.655991Z","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-12T14:08:11.969035Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.01538","last_updated":"2024-06-05T14:18:59Z","snapshot_observed_at":"2026-08-16T14:38:02.652642Z","submitted_at":"2023-12-03T23:36:16Z","title":"Recurrent Distance Filtering for Graph Representation Learning","version":3},"cited_work":{"arxiv_id":"2312.01538","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.01538","snapshot_observed_at":"2026-08-12T14:08:11.969035Z","title":"Recurrent Distance Filtering for Graph Representation Learning","venue":"cs.LG","work_id":"a6aaafc0-995b-45cb-a8db-7723e2bc61e1","year":2023},"citing_paper":{"arxiv_id":"2411.15671","last_updated":"2024-11-23T23:24:42Z","snapshot_observed_at":"2026-08-15T18:58:05.595553Z","submitted_at":"2024-11-23T23:24:42Z","title":"Best of Both Worlds: Advantages of Hybrid Graph Sequence Models","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-12T14:08:11.655991Z"},"links":{"cited_paper":"/paper/2312.01538","citing_paper":"/paper/2411.15671"},"observation_digest":"sha256:803bc7a3024b23338f72984b530cd76b7e4725f61912fbbbb3ed3deed9e9b3e5","observation_id":"7f7084ef-770a-4f80-864c-609c4b172116","resolution":{"observed_at":"2026-08-12T14:08:11.972746Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.01538/citation-record","integrity":"/paper/2312.01538/integrity","json":"/paper/2312.01538/citation-record.json","paper":"/paper/2312.01538"},"outbound":[],"paper":{"arxiv_id":"2312.01538","last_updated":"2024-06-05T14:18:59Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:38:02.652642Z","submitted_at":"2023-12-03T23:36:16Z","title":"Recurrent Distance Filtering for Graph Representation Learning"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2312.01538."}