{"as_of":"2026-08-23T07:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e9d8ab0974618212d524e4b35e4cb79fc898bce57b3f0032a156a4d9ce2012e9","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-23T06:30:58.430688+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-07-11T11:50:26.030339Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":192,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1604.01154","last_updated":"2016-04-05T07:05:21Z","snapshot_observed_at":"2026-08-14T22:03:04.038405Z","submitted_at":"2016-04-05T07:05:21Z","title":"On the complexity of computing prime tables on a Turing machine","version":1},"cited_work":{"arxiv_id":"1604.01154","doi":"10.1007/bf00289470","metadata_source":"pith","pith_arxiv_id":"1604.01154","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"On the complexity of computing prime tables on a Turing machine","venue":"cs.DS","work_id":"2394da2c-b277-4009-b293-4aa377297b55","year":2016},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/1604.01154","citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:fc1812d01db7e152528571824737f728948377101e8370db6e524c69353e92ae","observation_id":"d0fbb335-9ef3-4ad1-94c1-3756c41580d0","resolution":{"observed_at":"2026-06-26T07:39:08.382043Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1604.01154/citation-record","integrity":"/paper/1604.01154/integrity","json":"/paper/1604.01154/citation-record.json","paper":"/paper/1604.01154"},"outbound":[],"paper":{"arxiv_id":"1604.01154","last_updated":"2016-04-05T07:05:21Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T22:03:04.038405Z","submitted_at":"2016-04-05T07:05:21Z","title":"On the complexity of computing prime tables on a Turing machine"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1604.01154."}