{"as_of":"2026-08-09T17:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6c26e4f03e9e7b5ac0f53f73a2709c5a8f001defe479973ccea686308d6c9f65","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T18:38:43.056220Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-13T18:48:07.825179Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.00765","last_updated":"2024-05-18T20:06:20Z","snapshot_observed_at":"2026-07-31T03:46:08.320507Z","submitted_at":"2024-03-31T18:36:27Z","title":"Convex Network Flows","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.00765","snapshot_observed_at":"2026-08-02T18:38:43.056220Z","title":"Convex network flows,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.08337","last_updated":"2026-07-17T05:36:34Z","snapshot_observed_at":"2026-08-05T14:35:01.505710Z","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T18:38:43.056220Z"},"links":{"cited_paper":"/paper/2404.00765","citing_paper":"/paper/2603.08337"},"observation_digest":"sha256:9cb584c71e40282f04963c3f0e94ed3b7e2949d1cbc7fcd9806523439ee05df7","observation_id":"23e0e95e-b7b1-4edc-99b2-419ac5d52df9","resolution":{"observed_at":"2026-08-02T18:38:43.056220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.00765","last_updated":"2024-05-18T20:06:20Z","snapshot_observed_at":"2026-07-31T03:46:08.320507Z","submitted_at":"2024-03-31T18:36:27Z","title":"Convex Network Flows","version":2},"cited_work":{"arxiv_id":"2404.00765","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.00765","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Diamandis, G","venue":null,"work_id":"fe239352-f099-4b36-ae8e-5ea5e4fce833","year":2024},"citing_paper":{"arxiv_id":"2604.02909","last_updated":"2026-04-03T09:26:41Z","snapshot_observed_at":"2026-08-04T15:52:19.814740Z","submitted_at":"2026-04-03T09:26:41Z","title":"Concave Continuation: Linking Routing to Arbitrage","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-13T18:47:38.898613Z"},"links":{"cited_paper":"/paper/2404.00765","citing_paper":"/paper/2604.02909"},"observation_digest":"sha256:7eb7427a30aae6fe5865465ec387831629700df41a0ac550bda15bfb3130a0f3","observation_id":"ea7ddcfe-b42b-4b4d-916f-9051a2d6e24a","resolution":{"observed_at":"2026-05-13T18:48:07.826454Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.00765/citation-record","integrity":"/paper/2404.00765/integrity","json":"/paper/2404.00765/citation-record.json","paper":"/paper/2404.00765"},"outbound":[],"paper":{"arxiv_id":"2404.00765","last_updated":"2024-05-18T20:06:20Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-31T03:46:08.320507Z","submitted_at":"2024-03-31T18:36:27Z","title":"Convex Network Flows"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2404.00765."}