{"as_of":"2026-08-12T09:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2895094620498cb800e038972d6a68bba292735b7a8dbddbe9c3bc2949ad745","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-12T06:34:41.77262+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-11T16:16:02.606075Z","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-11T16:16:03.219999Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.10051","last_updated":"2024-03-15T06:46:00Z","snapshot_observed_at":"2026-08-03T23:44:51.525402Z","submitted_at":"2024-03-15T06:46:00Z","title":"Accelerating Regular Path Queries over Graph Database with Processing-in-Memory","version":1},"cited_work":{"arxiv_id":"2403.10051","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.10051","snapshot_observed_at":"2026-08-11T16:16:03.219999Z","title":"Accelerating Regular Path Queries over Graph Database with Processing-in-Memory","venue":"cs.DB","work_id":"775d49f3-ec91-432d-b0b9-2b8ab4c2d508","year":2024},"citing_paper":{"arxiv_id":"2412.10287","last_updated":"2025-06-16T17:29:32Z","snapshot_observed_at":"2026-08-11T15:57:15.520435Z","submitted_at":"2024-12-13T17:10:28Z","title":"Single-Source Regular Path Querying in Terms of Linear Algebra","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T16:16:02.606075Z"},"links":{"cited_paper":"/paper/2403.10051","citing_paper":"/paper/2412.10287"},"observation_digest":"sha256:ea2add56e9bd434dafa8aaf7cf72b0491ca72c2b229e5cfd59f1cec0652a33e6","observation_id":"d61295f7-0766-40f3-8aab-40898a21974a","resolution":{"observed_at":"2026-08-11T16:16:03.225486Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.10051/citation-record","integrity":"/paper/2403.10051/integrity","json":"/paper/2403.10051/citation-record.json","paper":"/paper/2403.10051"},"outbound":[],"paper":{"arxiv_id":"2403.10051","last_updated":"2024-03-15T06:46:00Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-03T23:44:51.525402Z","submitted_at":"2024-03-15T06:46:00Z","title":"Accelerating Regular Path Queries over Graph Database with Processing-in-Memory"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2403.10051."}