{"as_of":"2026-08-15T23:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:edb2ea78e30bc43831b5e162ea3a37f47127fc13bba38c3838367cf79d1749db","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-15T06:32:42.880941+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-11T17:18:33.293232Z","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-11T17:18:33.591148Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.07403","last_updated":"2024-07-24T02:27:51Z","snapshot_observed_at":"2026-08-13T10:40:01.656379Z","submitted_at":"2023-08-06T05:43:24Z","title":"A fast algorithm for All-Pairs-Shortest-Paths suitable for neural networks","version":2},"cited_work":{"arxiv_id":"2308.07403","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.07403","snapshot_observed_at":"2026-08-11T17:18:33.591148Z","title":"A fast algorithm for All-Pairs-Shortest-Paths suitable for neural networks","venue":"cs.DS","work_id":"f11509c1-4278-4a83-b69b-ed187da4eb88","year":2023},"citing_paper":{"arxiv_id":"2412.09200","last_updated":"2024-12-12T11:53:19Z","snapshot_observed_at":"2026-08-15T06:35:58.917408Z","submitted_at":"2024-12-12T11:53:19Z","title":"Accuracy Improvements for Convolutional and Differential Distance Function Approximations","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T17:18:33.293232Z"},"links":{"cited_paper":"/paper/2308.07403","citing_paper":"/paper/2412.09200"},"observation_digest":"sha256:5c7fa911852d87ddfd6afbac02e6472e4bf134fe7ebe7d21ee7f66239943800e","observation_id":"c170ed4c-e523-479b-ac58-f76638234ef0","resolution":{"observed_at":"2026-08-11T17:18:33.596506Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2308.07403/citation-record","integrity":"/paper/2308.07403/integrity","json":"/paper/2308.07403/citation-record.json","paper":"/paper/2308.07403"},"outbound":[],"paper":{"arxiv_id":"2308.07403","last_updated":"2024-07-24T02:27:51Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T10:40:01.656379Z","submitted_at":"2023-08-06T05:43:24Z","title":"A fast algorithm for All-Pairs-Shortest-Paths suitable for neural networks"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2308.07403."}