{"as_of":"2026-08-10T23:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:253002acf8f974dd9e85a7f4d4e024380bbaf005a49d32d7e86b1dd8ea15bb42","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T01:00:54.817011Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2602.11051/citation-record","integrity":"/paper/2602.11051/integrity","json":"/paper/2602.11051/citation-record.json","paper":"/paper/2602.11051"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:00:54.280436Z","title":"Benjamini, O","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.11051","last_updated":"2026-06-22T12:56:29Z","snapshot_observed_at":"2026-08-09T23:27:28.656468Z","submitted_at":"2026-02-11T17:19:58Z","title":"How fast does the range of simple random walk grow?","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T01:00:54.280436Z"},"links":{"citing_paper":"/paper/2602.11051"},"observation_digest":"sha256:b26b40b7303691a51b1dad44637025f7b23f92990f81327a90a4b1b46307c843","observation_id":"336fc1b6-33b6-43f4-a93b-5154889048fd","resolution":{"observed_at":"2026-08-03T01:00:54.280436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:00:54.407203Z","title":"Brightwell, and P","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2602.11051","last_updated":"2026-06-22T12:56:29Z","snapshot_observed_at":"2026-08-09T23:27:28.656468Z","submitted_at":"2026-02-11T17:19:58Z","title":"How fast does the range of simple random walk grow?","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T01:00:54.407203Z"},"links":{"citing_paper":"/paper/2602.11051"},"observation_digest":"sha256:3b8ef75155814bf9e1023130a27e24ca03120d0de1aa48c03141896019f376ef","observation_id":"bf4ef26e-56a7-4f1d-92be-3c125cadb9bc","resolution":{"observed_at":"2026-08-03T01:00:54.407203Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:00:54.532024Z","title":"Feige, A tight upper bound on the cover time for random walks on graphs.Random Structures & Algorithms6(1):51–54, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2602.11051","last_updated":"2026-06-22T12:56:29Z","snapshot_observed_at":"2026-08-09T23:27:28.656468Z","submitted_at":"2026-02-11T17:19:58Z","title":"How fast does the range of simple random walk grow?","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T01:00:54.532024Z"},"links":{"citing_paper":"/paper/2602.11051"},"observation_digest":"sha256:646fd3a74e9edd1727428d0252286fa07c7476d586be2acc956f9243cdfda9a3","observation_id":"9137c969-8c60-45da-a0e7-ee46dc9f3c46","resolution":{"observed_at":"2026-08-03T01:00:54.532024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:00:54.630562Z","title":"Jonasson, Lollipop graphs are extremal for commute times.Random Structures and Algorithms, 16(2):131–142, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.11051","last_updated":"2026-06-22T12:56:29Z","snapshot_observed_at":"2026-08-09T23:27:28.656468Z","submitted_at":"2026-02-11T17:19:58Z","title":"How fast does the range of simple random walk grow?","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T01:00:54.630562Z"},"links":{"citing_paper":"/paper/2602.11051"},"observation_digest":"sha256:0c2f06a154f78b96f1d527482f2beaee73c2005bc53bda784655ff4267228fb6","observation_id":"4d0d4341-cabd-44de-944f-c59bb18f3d1d","resolution":{"observed_at":"2026-08-03T01:00:54.630562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:00:54.746826Z","title":"Asymptotic enumeration of spanning trees.Combin","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.11051","last_updated":"2026-06-22T12:56:29Z","snapshot_observed_at":"2026-08-09T23:27:28.656468Z","submitted_at":"2026-02-11T17:19:58Z","title":"How fast does the range of simple random walk grow?","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T01:00:54.746826Z"},"links":{"citing_paper":"/paper/2602.11051"},"observation_digest":"sha256:35826edc06151768ed845fa7771c1c64a06a09b356134e4ab9e193826b0bcc3b","observation_id":"225d3371-f8b5-49a5-a4eb-479b995388bf","resolution":{"observed_at":"2026-08-03T01:00:54.746826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:00:54.817011Z","title":"Lyons and Y","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.11051","last_updated":"2026-06-22T12:56:29Z","snapshot_observed_at":"2026-08-09T23:27:28.656468Z","submitted_at":"2026-02-11T17:19:58Z","title":"How fast does the range of simple random walk grow?","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T01:00:54.817011Z"},"links":{"citing_paper":"/paper/2602.11051"},"observation_digest":"sha256:4d7b97dafb10724988c8978813c6814f3a275261ab32f6098aacb76089665c2b","observation_id":"57c41aef-3af8-4215-83dc-b62008210b7d","resolution":{"observed_at":"2026-08-03T01:00:54.817011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.11051","last_updated":"2026-06-22T12:56:29Z","latest_version":4,"primary_category":"math.PR","snapshot_observed_at":"2026-08-09T23:27:28.656468Z","submitted_at":"2026-02-11T17:19:58Z","title":"How fast does the range of simple random walk grow?"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":6},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 0 inbound Pith citation observations for arXiv:2602.11051."}