{"as_of":"2026-08-17T03:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d677b2605579a4bc97eb3a2d0819446d159b714b9f5af84f520b90b6034bc47c","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-16T06:30:59.297886+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-10T19:16:12.118736Z","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-10T19:16:12.243687Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.03908","last_updated":"2024-05-06T23:52:20Z","snapshot_observed_at":"2026-08-16T13:54:52.452168Z","submitted_at":"2024-05-06T23:52:20Z","title":"Deterministic Expander Routing: Faster and More Versatile","version":1},"cited_work":{"arxiv_id":"2405.03908","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.03908","snapshot_observed_at":"2026-08-10T19:16:12.243687Z","title":"Deterministic Expander Routing: Faster and More Versatile","venue":"cs.DC","work_id":"69e649a8-a64d-4e66-ae9d-254f1512e935","year":2024},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T23:44:46.209891Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.118736Z"},"links":{"cited_paper":"/paper/2405.03908","citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:4e2c44b53be677b51819c432392ea0af542375dabfa7ea7505543472ac30d3f5","observation_id":"f8f77105-74fa-402f-9df3-87bf4a6108ce","resolution":{"observed_at":"2026-08-10T19:16:12.250332Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.03908/citation-record","integrity":"/paper/2405.03908/integrity","json":"/paper/2405.03908/citation-record.json","paper":"/paper/2405.03908"},"outbound":[],"paper":{"arxiv_id":"2405.03908","last_updated":"2024-05-06T23:52:20Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-16T13:54:52.452168Z","submitted_at":"2024-05-06T23:52:20Z","title":"Deterministic Expander Routing: Faster and More Versatile"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2405.03908."}