{"as_of":"2026-08-17T13:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:010827d37c2d85db56fb0d6b26cf70fe9a975474a3ec1a9289395f639d19e4a0","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-17T06:30:58.91139+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-11T11:05:03.753800Z","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-10T23:12:21.970681Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.14535","last_updated":"2024-03-21T16:37:34Z","snapshot_observed_at":"2026-08-16T14:07:36.774772Z","submitted_at":"2024-03-21T16:37:34Z","title":"First-Order Methods for Linear Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.14535","snapshot_observed_at":"2026-08-11T11:05:03.753800Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.15977","last_updated":"2024-12-20T15:20:24Z","snapshot_observed_at":"2026-08-16T17:39:24.817042Z","submitted_at":"2024-12-20T15:20:24Z","title":"A quantum dual logarithmic barrier method for linear optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T11:05:03.753800Z"},"links":{"cited_paper":"/paper/2403.14535","citing_paper":"/paper/2412.15977"},"observation_digest":"sha256:4f8840b3c5408767ffcb02c0e12486dd9ba388b79ce23954e21da2c123448072","observation_id":"0dfdb1b5-7110-4d28-808f-500573d4360e","resolution":{"observed_at":"2026-08-11T11:05:03.753800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14535","last_updated":"2024-03-21T16:37:34Z","snapshot_observed_at":"2026-08-16T14:07:36.774772Z","submitted_at":"2024-03-21T16:37:34Z","title":"First-Order Methods for Linear Programming","version":1},"cited_work":{"arxiv_id":"2403.14535","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.14535","snapshot_observed_at":"2026-08-10T23:12:21.970681Z","title":"First-Order Methods for Linear Programming","venue":"math.OC","work_id":"b3e46211-f22a-468d-970b-b55eff566c3c","year":2024},"citing_paper":{"arxiv_id":"2412.21068","last_updated":"2024-12-30T16:35:47Z","snapshot_observed_at":"2026-08-15T17:24:11.178615Z","submitted_at":"2024-12-30T16:35:47Z","title":"Finite Horizon Optimization: Framework and Applications","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T23:12:21.480384Z"},"links":{"cited_paper":"/paper/2403.14535","citing_paper":"/paper/2412.21068"},"observation_digest":"sha256:4b977986bc52e76951b5465664685fa8eb1a6e88380f4fce00b662eae9e06fb9","observation_id":"bc086469-12c2-42e6-b366-88ed8a95cc56","resolution":{"observed_at":"2026-08-10T23:12:21.977352Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.14535/citation-record","integrity":"/paper/2403.14535/integrity","json":"/paper/2403.14535/citation-record.json","paper":"/paper/2403.14535"},"outbound":[],"paper":{"arxiv_id":"2403.14535","last_updated":"2024-03-21T16:37:34Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T14:07:36.774772Z","submitted_at":"2024-03-21T16:37:34Z","title":"First-Order Methods for Linear Programming"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2403.14535."}