{"as_of":"2026-08-14T02:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3748ef4a9e5350a8ef1baa84840a37399f3456a7eb0f4af52c6e23089f7706a9","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-13T06:32:02.005865+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-12T11:40:45.405012Z","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-12T11:40:45.477599Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1703.00941","last_updated":"2017-03-02T20:25:04Z","snapshot_observed_at":"2026-07-06T05:32:10.485822Z","submitted_at":"2017-03-02T20:25:04Z","title":"On the Fine-grained Complexity of One-Dimensional Dynamic Programming","version":1},"cited_work":{"arxiv_id":"1703.00941","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.00941","snapshot_observed_at":"2026-08-12T11:40:45.477599Z","title":"On the Fine-grained Complexity of One-Dimensional Dynamic Programming","venue":"cs.CC","work_id":"fa956bb2-7f6e-48ce-b31a-94a754ff9946","year":2017},"citing_paper":{"arxiv_id":"2411.18137","last_updated":"2024-11-27T08:37:47Z","snapshot_observed_at":"2026-08-12T11:26:27.873173Z","submitted_at":"2024-11-27T08:37:47Z","title":"The Greedy Coin Change Problem","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T11:40:45.405012Z"},"links":{"cited_paper":"/paper/1703.00941","citing_paper":"/paper/2411.18137"},"observation_digest":"sha256:e8de1287fe8dad369650b2c509d7d83df3e9dea98a21f462518336be9c664524","observation_id":"35f43d17-a151-4113-9b3c-bbab99014e3e","resolution":{"observed_at":"2026-08-12T11:40:45.483873Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1703.00941/citation-record","integrity":"/paper/1703.00941/integrity","json":"/paper/1703.00941/citation-record.json","paper":"/paper/1703.00941"},"outbound":[],"paper":{"arxiv_id":"1703.00941","last_updated":"2017-03-02T20:25:04Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T05:32:10.485822Z","submitted_at":"2017-03-02T20:25:04Z","title":"On the Fine-grained Complexity of One-Dimensional Dynamic 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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1703.00941."}