{"as_of":"2026-08-23T19:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a8d330ef8b8640bd584944cc0f4a775409d49cca1de109c871c12bb4c2e4dd35","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-08-14T14:00:11.333689Z","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-14T14:00:11.579158Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1606.05917","last_updated":"2016-06-19T22:11:28Z","snapshot_observed_at":"2026-08-20T08:09:24.563813Z","submitted_at":"2016-06-19T22:11:28Z","title":"How to verify computation with a rational network","version":1},"cited_work":{"arxiv_id":"1606.05917","doi":null,"metadata_source":"pith","pith_arxiv_id":"1606.05917","snapshot_observed_at":"2026-08-14T14:00:11.579158Z","title":"How to verify computation with a rational network","venue":"cs.GT","work_id":"8358789f-aa5d-4965-b4db-f138ef2515c3","year":2016},"citing_paper":{"arxiv_id":"1908.04756","last_updated":"2019-08-12T04:02:10Z","snapshot_observed_at":"2026-08-21T22:46:27.133503Z","submitted_at":"2019-08-12T04:02:10Z","title":"A scalable verification solution for blockchains","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T14:00:11.333689Z"},"links":{"cited_paper":"/paper/1606.05917","citing_paper":"/paper/1908.04756"},"observation_digest":"sha256:ed9050987cb5cecaa1c1f8944d78bf5aeb66c4ed922b4e49994ceb80911df9ee","observation_id":"d3620b66-4c51-4e44-a7da-23dc77f3b857","resolution":{"observed_at":"2026-08-14T14:00:11.592647Z","resolver_source":"local_arxiv","status":"verified_exact"},"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/1606.05917/citation-record","integrity":"/paper/1606.05917/integrity","json":"/paper/1606.05917/citation-record.json","paper":"/paper/1606.05917"},"outbound":[],"paper":{"arxiv_id":"1606.05917","last_updated":"2016-06-19T22:11:28Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-20T08:09:24.563813Z","submitted_at":"2016-06-19T22:11:28Z","title":"How to verify computation with a rational network"},"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:1606.05917."}