{"as_of":"2026-08-11T13:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f090e946b1e2bf09e9af32784511539c85cc7ed71a5ce385c138def3e900aaf3","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-11T06:34:44.6726+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-05-07T10:27:06.228815Z","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-12T09:36:26.231509Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1711.00284","last_updated":"2019-11-02T11:11:19Z","snapshot_observed_at":"2026-07-06T06:07:12.295602Z","submitted_at":"2017-11-01T10:55:17Z","title":"Improved Approximation Schemes for the Restricted Shortest Path Problem","version":2},"cited_work":{"arxiv_id":"1711.00284","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1711.00284","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Holzmüller","venue":null,"work_id":"6afd83c4-2bcb-494c-be3b-bdc147797f79","year":2019},"citing_paper":{"arxiv_id":"2604.26882","last_updated":"2026-04-29T16:52:35Z","snapshot_observed_at":"2026-08-04T23:12:27.909039Z","submitted_at":"2026-04-29T16:52:35Z","title":"Approximating the Network Design Problem for Potential-Based Flows","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-07T10:27:06.228815Z"},"links":{"cited_paper":"/paper/1711.00284","citing_paper":"/paper/2604.26882"},"observation_digest":"sha256:cc8033aaaa4fe75523d320fa0fba7aa6effbe6542e052913f373eb18e1377b73","observation_id":"68f75a01-a793-4f15-94db-b64baec7802a","resolution":{"observed_at":"2026-05-12T09:36:26.233658Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1711.00284/citation-record","integrity":"/paper/1711.00284/integrity","json":"/paper/1711.00284/citation-record.json","paper":"/paper/1711.00284"},"outbound":[],"paper":{"arxiv_id":"1711.00284","last_updated":"2019-11-02T11:11:19Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T06:07:12.295602Z","submitted_at":"2017-11-01T10:55:17Z","title":"Improved Approximation Schemes for the Restricted Shortest Path Problem"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1711.00284."}