{"as_of":"2026-08-08T05:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ec6a29928157a4318160de9df4db96ebbd852d01403570b5f27789cde84e9aab","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T12:31:18.479617Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2607.23791/citation-record","integrity":"/paper/2607.23791/integrity","json":"/paper/2607.23791/citation-record.json","paper":"/paper/2607.23791"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T12:31:16.484310Z","title":"Addario-Berry and B","venue":null,"work_id":null,"year":2009},"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":1,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:16.484310Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:920fec1bd2cbaf6de4c600198501a59fa395e37db82cb52cbc4e8f94e97f0330","observation_id":"c4b86acc-9272-4ffb-bf9f-16ab554cd1d7","resolution":{"observed_at":"2026-07-30T12:31:16.484310Z","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-07-30T12:31:16.496418Z","title":"A ¨ ıd´ ekon","venue":null,"work_id":null,"year":2013},"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":2,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:16.496418Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:7dd20e70a35881ee66bf8405836a78a3abf60e353ca5dbc867367d7a0587044a","observation_id":"f87d871d-a0fb-4968-bf1e-3aee48fd00de","resolution":{"observed_at":"2026-07-30T12:31:16.496418Z","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-07-30T12:31:16.506711Z","title":null,"venue":null,"work_id":null,"year":1983},"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":3,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:16.506711Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:651a95b22263b6003f25dddb64e1ee25979b5a5a08846d06ad6c3db8a341aac5","observation_id":"a87ecdce-4447-40ff-8438-1e72ef1a909b","resolution":{"observed_at":"2026-07-30T12:31:16.506711Z","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-07-30T12:31:16.558089Z","title":null,"venue":null,"work_id":null,"year":2011},"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":4,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:16.558089Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:3591553de66149df03dd50ce80f0d799b0e8c00845f8de867858858ed0c7d5b1","observation_id":"f08a0d31-f74c-4016-a198-cca60e3d3f58","resolution":{"observed_at":"2026-07-30T12:31:16.558089Z","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-07-30T12:31:16.644303Z","title":null,"venue":null,"work_id":null,"year":1972},"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":5,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:16.644303Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:768e6fd62756cfac574e3eccfc0905c98d7c1e3c847fb25611f9e2c09b593562","observation_id":"d32e3297-f43d-4078-a429-1647b99babaf","resolution":{"observed_at":"2026-07-30T12:31:16.644303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T12:31:16.835733Z","title":"Benjamini and G","venue":null,"work_id":null,"year":null},"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":7,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:16.835733Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:113c3f6e0cbd65071957c1d3703d4973c9e34a2227028a3275997cd775eb749f","observation_id":"ee6c5260-53d6-4f96-a274-3a56a63abd48","resolution":{"observed_at":"2026-07-30T12:31:16.835733Z","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-07-30T12:31:16.967348Z","title":"Blanchet, W","venue":null,"work_id":null,"year":2024},"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":8,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:16.967348Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:89ffb999a26051695b37230b33a0c096d734a618578fe71aa5c117576add86e7","observation_id":"fa63a237-2993-466f-b0cd-08c66d775bc1","resolution":{"observed_at":"2026-07-30T12:31:16.967348Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02635","last_updated":"2026-04-09T02:52:27Z","snapshot_observed_at":"2026-07-06T19:27:07.844117Z","submitted_at":"2024-10-03T16:19:10Z","title":"Tightness Analysis of First Passage Times of $d$-Dimensional Branching Random Walk","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02635","snapshot_observed_at":"2026-07-30T12:31:17.121600Z","title":"Blanchet and Z","venue":null,"work_id":null,"year":2024},"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":9,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:17.121600Z"},"links":{"cited_paper":"/paper/2410.02635","citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:9cc9b22f75ca5058ba9a0854a68f694d2ef8bbe449437c1c0424abcdc83c5f06","observation_id":"1b98ccca-ce6b-41a6-a323-b2573ada3f04","resolution":{"observed_at":"2026-07-30T12:31:17.121600Z","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-07-30T12:31:17.227069Z","title":"Blanchet and Z","venue":null,"work_id":null,"year":2026},"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":10,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:17.227069Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:b5e03f743b889c5e7ef7654aa5946be8b6bb3cb20ad9ec86882322ee8ca6d487","observation_id":"7b0fdadd-e36b-44f4-9cc1-b720fba24833","resolution":{"observed_at":"2026-07-30T12:31:17.227069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03375","last_updated":"2025-06-03T20:32:45Z","snapshot_observed_at":"2026-08-07T11:02:20.905265Z","submitted_at":"2025-06-03T20:32:45Z","title":"Cover time of random subgraphs of the hypercube","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03375","snapshot_observed_at":"2026-07-30T12:31:17.355778Z","title":"Cooper, A","venue":null,"work_id":null,"year":2025},"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":11,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:17.355778Z"},"links":{"cited_paper":"/paper/2506.03375","citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:c97cc9fe90ae26b9c9cd936bb89cf222db673c99a5f19f424743fc0478e37c41","observation_id":"7a090b7b-910b-4d28-be5b-b2ca2db8e154","resolution":{"observed_at":"2026-07-30T12:31:17.355778Z","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-07-30T12:31:17.455089Z","title":"Cooper, T","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":12,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:17.455089Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:ffe46759f09ec89cf70137a78f0504b67e87f9830ced6588e6cb46e7dcb13df2","observation_id":"f9306d22-9443-49eb-92ff-5a0a19ca5d90","resolution":{"observed_at":"2026-07-30T12:31:17.455089Z","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-07-30T12:31:17.554557Z","title":"Diaconis, R","venue":null,"work_id":null,"year":1990},"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":13,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:17.554557Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:4d9c70b9c09d2707a3466adfb81ce733ba33a092010026365740b4a1ef69f671","observation_id":"0f999883-dc9c-44ef-a3f4-d4e2e0aac662","resolution":{"observed_at":"2026-07-30T12:31:17.554557Z","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-07-30T12:31:17.747571Z","title":"Dutta, G","venue":null,"work_id":null,"year":2015},"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":14,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:17.747571Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:a954a154c5d9c19a3529a1de564b88be7c190c17a6e184d3e1e4094361df5e39","observation_id":"f881b608-e0f1-49f0-a3e7-f9ed13ba4cfe","resolution":{"observed_at":"2026-07-30T12:31:17.747571Z","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-07-30T12:31:17.841152Z","title":"Els¨ asser and T","venue":null,"work_id":null,"year":2011},"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":15,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:17.841152Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:fc9c771898f28ab3f598bdae66b4955d48b4f2ea3c2f6b495697d3299adef677","observation_id":"ea908c97-e878-4be5-aea7-062743c62c8b","resolution":{"observed_at":"2026-07-30T12:31:17.841152Z","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-07-30T12:31:17.910970Z","title":"Falgas-Ravry, J","venue":null,"work_id":null,"year":2020},"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":16,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:17.910970Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:cd7ba47daf7002238cc26cdd155f8cff6c3224f7b43da0067b58ec3dfe4e4e5c","observation_id":"dde73f3a-ec65-4fb9-9706-f9bb1ee91d44","resolution":{"observed_at":"2026-07-30T12:31:17.910970Z","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-07-30T12:31:17.966953Z","title":null,"venue":null,"work_id":null,"year":2017},"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":17,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:17.966953Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:2a4d761862b37a19a1443547173eeed2aacde35689d96ba4bde49ec89b8e52bf","observation_id":"6b53f2c7-dbce-421e-be5c-993ede2eb33c","resolution":{"observed_at":"2026-07-30T12:31:17.966953Z","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-07-30T12:31:18.002823Z","title":null,"venue":null,"work_id":null,"year":1997},"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":18,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:18.002823Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:07f79037e395297cb499e20cb8cd53299042b57d88145047c18c1ca60ffad53d","observation_id":"a4ba0b60-e091-4ff8-ab9b-61e5eb14a3a0","resolution":{"observed_at":"2026-07-30T12:31:18.002823Z","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-07-30T12:31:18.032691Z","title":null,"venue":null,"work_id":null,"year":2021},"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":19,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:18.032691Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:bacabbfca4201da1b8a1edb37c1a4c6371cbbb0dd9456ea182355fc7687bd40b","observation_id":"8f4ab303-8f59-459d-bab3-4c3c8a876af5","resolution":{"observed_at":"2026-07-30T12:31:18.032691Z","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-07-30T12:31:18.067392Z","title":"Last and M","venue":null,"work_id":null,"year":2017},"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":20,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:18.067392Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:e420b811510400de04b0bc82593e3be17db3fadc7a62e2798eb1f724ca260524","observation_id":"f13b14a1-a0a4-4024-a5b7-d9dc1fe58790","resolution":{"observed_at":"2026-07-30T12:31:18.067392Z","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-07-30T12:31:18.125819Z","title":"Lyons, R","venue":null,"work_id":null,"year":1995},"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":21,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:18.125819Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:981b9f116f2abd8edba7b840e9ac6031058bf721348ca9d7f65746815f927d77","observation_id":"d2184e61-132f-40f9-8068-29788d882742","resolution":{"observed_at":"2026-07-30T12:31:18.125819Z","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-07-30T12:31:18.178850Z","title":null,"venue":null,"work_id":null,"year":2015},"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":22,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:18.178850Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:d23fe6f0e74fdfd12745a088a44ba189453b743ef0f945b7bd16eaf6938fed74","observation_id":"f2dd3d35-628b-430e-8749-d09e5aae2cce","resolution":{"observed_at":"2026-07-30T12:31:18.178850Z","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-07-30T12:31:18.234380Z","title":"Matthews","venue":null,"work_id":null,"year":1989},"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":23,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:18.234380Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:a84c4226843c05ca4d466b1ec7c282f9dd8cd6a7dbb7c787709401d516a990ce","observation_id":"5d459758-717d-48c7-86fe-8ee1e5bb2abd","resolution":{"observed_at":"2026-07-30T12:31:18.234380Z","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-07-30T12:31:18.284925Z","title":"Mitzenmacher, R","venue":null,"work_id":null,"year":2018},"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":24,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:18.284925Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:749ef9e924e5855cd4b2d335d0b18259da6d27755003ce829075c0c688dd7c9a","observation_id":"c1a14ad3-4689-46e4-a1c1-ef1796be98f5","resolution":{"observed_at":"2026-07-30T12:31:18.284925Z","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-07-30T12:31:18.341021Z","title":"Mitzenmacher and E","venue":null,"work_id":null,"year":2017},"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":25,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:18.341021Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:95361bf88cba1f5831f4fbcac0df50e1cee63b4e2f2f65de8149e7a5bd897999","observation_id":"904dff51-42ab-4fac-b536-63ebbddad43c","resolution":{"observed_at":"2026-07-30T12:31:18.341021Z","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-07-30T12:31:18.376384Z","title":"Rivera, T","venue":null,"work_id":null,"year":2023},"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":26,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:18.376384Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:75ba925b08788285844f7d8065d474d1aaf2ccd0da195af87a6313354dea5f95","observation_id":"8c911d6f-7ec5-4dac-bafe-0317fb0572a3","resolution":{"observed_at":"2026-07-30T12:31:18.376384Z","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-07-30T12:31:18.415406Z","title":null,"venue":null,"work_id":null,"year":2022},"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":27,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:18.415406Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:5ea8ff837e7a0efa555f5bc4e1dc0be5a7ff355a43280942262b3f535bfdc161","observation_id":"68c83052-55d1-4c96-a60a-fad3cc80d48b","resolution":{"observed_at":"2026-07-30T12:31:18.415406Z","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-07-30T12:31:18.426477Z","title":"Zeitouni","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":28,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:18.426477Z"},"links":{"citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:f7e878a18a196715bd625392ba513da91ae52a5024fb7757c74a8cd83c74dbbd","observation_id":"dd609a60-6652-4b1c-a658-1ad66c62b897","resolution":{"observed_at":"2026-07-30T12:31:18.426477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.10858","last_updated":"2019-12-02T11:47:11Z","snapshot_observed_at":"2026-07-06T07:23:46.396438Z","submitted_at":"2018-12-28T01:19:42Z","title":"Branching interlacements and tree-indexed random walks in tori","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.10858","snapshot_observed_at":"2026-07-30T12:31:18.479617Z","title":"X z∈A q(X(s), z)Ez[JA(t−s)] # ds ≤ 2eλK λ Z t 0 eλsEx","venue":null,"work_id":null,"year":2018},"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":29,"source":"pdf_text","source_observed_at":"2026-07-30T12:31:18.479617Z"},"links":{"cited_paper":"/paper/1812.10858","citing_paper":"/paper/2607.23791"},"observation_digest":"sha256:ba7e4a16e7ba4ba19b979c09dd07fef844b49e9246fc0c7754c09ed8b5253e9e","observation_id":"a87f8e2b-00fa-4aef-86d4-9379b4a3ebc4","resolution":{"observed_at":"2026-07-30T12:31:18.479617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.23791","last_updated":"2026-07-26T18:27:51Z","latest_version":1,"primary_category":"math.PR","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"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":29},"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 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2607.23791."}