{"as_of":"2026-08-08T04:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:20a33214d8f515da70e12b069e59356ff9201975833cbed85a243fa1358a4324","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-07T06:34:17.273281+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-30T12:31:16.739715Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1607.00927","last_updated":"2016-07-04T15:22:43Z","snapshot_observed_at":"2026-08-04T09:55:52.073282Z","submitted_at":"2016-07-04T15:22:43Z","title":"Branching Random Walks on Binary Strings for Evolutionary Processes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.00927","snapshot_observed_at":"2026-07-30T12:31:16.739715Z","title":"Balelli, V","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.23791","last_updated":"2026-07-26T18:27:51Z","snapshot_observed_at":"2026-08-03T07:49:53.506480Z","submitted_at":"2026-07-26T18:27:51Z","title":"Precise cover times for branching random walks on Hamming graphs: (iterated) logarithmic corrections","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:16.739715Z"},"links":{"cited_paper":"/paper/1607.00927","citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:94625ec239bd41938bcf15d714ceeae53f759e9e5d5def25223b67a674924efb","observation_id":"57415164-f71b-4642-953f-1107459a8ca3","resolution":{"observed_at":"2026-07-30T12:31:16.739715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1607.00927/citation-record","integrity":"/paper/1607.00927/integrity","json":"/paper/1607.00927/citation-record.json","paper":"/paper/1607.00927"},"outbound":[],"paper":{"arxiv_id":"1607.00927","last_updated":"2016-07-04T15:22:43Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-04T09:55:52.073282Z","submitted_at":"2016-07-04T15:22:43Z","title":"Branching Random Walks on Binary Strings for Evolutionary Processes"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1607.00927."}