{"as_of":"2026-08-08T00:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f9aa249c59f0ed4d3e90b99898b83c50d1248bd09e3f28ec701d46daa332310c","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:17:00.404245Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"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:17.355778Z","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":"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"}}],"links":{"evidence":"/evidence","html":"/paper/2506.03375/citation-record","integrity":"/paper/2506.03375/integrity","json":"/paper/2506.03375/citation-record.json","paper":"/paper/2506.03375"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:02.065668Z","title":"Ajtai, J","venue":null,"work_id":"0b87a858-9b66-454c-ad99-8b911e912df2","year":1982},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:58.376453Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:976ad74479f10c4af5c318a1c344a2abc7f444923e53d19a8aaac49c99858554","observation_id":"badbea24-b081-40ef-a8f0-02fb98fddff5","resolution":{"observed_at":"2026-08-07T11:17:02.068892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:02.056149Z","title":"Aldous and J","venue":null,"work_id":"6f863174-29bc-45f0-8d56-e6ee42696352","year":2002},"citing_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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:58.477492Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:5dce3023b28eb9816d4f0b4e0a5d7113fd5125e4280426e310f6d296cd358808","observation_id":"550a8f1b-4229-4848-8659-727242c7059c","resolution":{"observed_at":"2026-08-07T11:17:02.059110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:02.045194Z","title":"Beveridge, A","venue":null,"work_id":"cb89e131-c304-4eb3-87bc-3fb751f1b851","year":1998},"citing_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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:58.626667Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:d46903136d6e65469006d7185d37f5591b38fdb163d97387c27bf1fd383636c0","observation_id":"bd19e517-1f01-49b2-abb2-6bad380d09e0","resolution":{"observed_at":"2026-08-07T11:17:02.049569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:02.036321Z","title":"Bollob´ as, Complete matchings in random subgraphs of the cube","venue":null,"work_id":"cd466ac4-1979-46ab-ae7b-18c4391e4d9c","year":1990},"citing_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},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:58.746307Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:5ac229c87fb48a87e47ee22316b7e5acad44b0604abcc78c875ba729211d9368","observation_id":"ef589d1d-0638-4968-99a0-667029582aaa","resolution":{"observed_at":"2026-08-07T11:17:02.039780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:02.026876Z","title":null,"venue":null,"work_id":"0714e70c-89df-4f85-a872-e639b19502fd","year":1977},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:58.897217Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:b1a5aa2647e6b85341ce46203f591dd73b250463dbd97b4b977a7370bb197415","observation_id":"57add700-cd16-4b14-af7e-28b8dbb3d730","resolution":{"observed_at":"2026-08-07T11:17:02.029862Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:02.018383Z","title":"Cooper and A","venue":null,"work_id":"918406ba-95c3-457d-99b9-a9a980ce269c","year":2005},"citing_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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:58.993219Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:5bcdd0a112e53fcc10dcf87aa625a4d9be8c03d53dd72d19a49f9416ef98df06","observation_id":"664a1726-3ccd-4a7d-9230-532a9f1c5ef1","resolution":{"observed_at":"2026-08-07T11:17:02.021200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:02.008972Z","title":"Cooper and A","venue":null,"work_id":"b4870c85-eac0-4fdd-8898-a768a52f5119","year":2008},"citing_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},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:59.067871Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:2372e7052df650630bb06a93a566df71efc194cadebd2b0366b9f25d299f3ec2","observation_id":"e906aa3b-b096-471b-ba3d-ce098d4d6cc4","resolution":{"observed_at":"2026-08-07T11:17:02.012295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:01.999063Z","title":"Cooper and A","venue":null,"work_id":"fc9e6bc1-d197-48d0-858a-b785f3a57d46","year":2011},"citing_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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:59.157435Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:7dd3ffdf860b53bc24c64a66181912cbe2f071ef9694f76093f7cbc0c1ff8042","observation_id":"f06d3bd7-bda5-44f1-9968-9bb3e6d456c5","resolution":{"observed_at":"2026-08-07T11:17:02.002291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:01.990305Z","title":"Cooper, A","venue":null,"work_id":"07e2aff2-9ea7-4d76-8fd3-c8e5785de46d","year":2013},"citing_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},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:59.246415Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:bacdb9f3732c68a0b2b73f565d3bd536e13be4a499675c9ddd85f45fcd384ab5","observation_id":"1c30b1cc-e930-44f9-993c-3c1ab6e7179c","resolution":{"observed_at":"2026-08-07T11:17:01.993194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:01.981100Z","title":"Diaconis and M","venue":null,"work_id":"4ad3aa0f-db14-4d9f-86a8-9cb9d60fa6f5","year":1987},"citing_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},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:59.330847Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:d4dc75dd5ffc07692daa4c83f1283a51f9918c1b813714bb65a3b5d9f03068ee","observation_id":"0d2a1011-54f1-4afc-80dc-ffcb3ed87b5f","resolution":{"observed_at":"2026-08-07T11:17:01.984330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:01.972177Z","title":"Diaconis, R","venue":null,"work_id":"86a920d3-ada0-42ac-a16f-576dd1559e04","year":1990},"citing_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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:59.411828Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:f3f5175066e2eef2b1a30e10645d959bbf66e3d28c2f47e4b6c8d8f5bec3203f","observation_id":"7106233c-58e6-4dc0-b356-d3d9bd78b028","resolution":{"observed_at":"2026-08-07T11:17:01.975084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:01.963567Z","title":null,"venue":null,"work_id":"476f5c6d-56b6-45c0-9963-858db6a58f16","year":2024},"citing_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},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:59.531552Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:22a88b1acaca345b7516c4e0fbb63aaa5f8377c7068111c44b2ce6ab97c091dd","observation_id":"aa83904b-27b8-40a8-9e74-a455149ddacf","resolution":{"observed_at":"2026-08-07T11:17:01.966496Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:01.953751Z","title":"Feller, An Introduction to Probability Theory, Volume I","venue":null,"work_id":"4256ea7c-b7e9-44cc-a05e-e48f3fa62d43","year":1960},"citing_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},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:59.601115Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:5e160b54e2e11aa87477cd39a6a674c37c3387f8124eb8d3771046035fb30adb","observation_id":"91cabb99-451e-4dcc-ac9d-72e1118b1f42","resolution":{"observed_at":"2026-08-07T11:17:01.956895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:01.944351Z","title":null,"venue":null,"work_id":"1dba39c5-98f1-4942-bc6f-a1385b3e2f76","year":2015},"citing_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},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:59.646599Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:158b4dc315fbd54e87cada054c5cfe295f6d5a1fcddde6ef63235217daa0344b","observation_id":"2935320a-f35a-448b-9e16-355a801b3114","resolution":{"observed_at":"2026-08-07T11:17:01.947521Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:01.935515Z","title":null,"venue":null,"work_id":"da514d1f-6033-4a8c-884b-3b4a5185f1d4","year":2017},"citing_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},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:59.733236Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:284a834eac18a07f30e6043d1b201bf289b67ee7af667364da30c0bee96cd779","observation_id":"e28f2583-d07c-4be4-ba6c-bb41cab2e585","resolution":{"observed_at":"2026-08-07T11:17:01.938796Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:01.799609Z","title":null,"venue":null,"work_id":"bb2403dc-608c-46bb-a604-8c3752559376","year":1966},"citing_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},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:59.849006Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:ceb66254a7042462f83a3e607790d73596f589f2a1befc429f1ba76878b7acdd","observation_id":"46ca4324-e915-4811-9d14-70a2b8ca0af3","resolution":{"observed_at":"2026-08-07T11:17:01.921029Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:01.594309Z","title":"Jerrum and A","venue":null,"work_id":"46793a36-c369-42ff-9e17-0de533b88a2e","year":1996},"citing_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},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:59.921202Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:f23daf52a5764493b5e83c2b9d1c6fb46510d4a25882402ae66f6376f6465382","observation_id":"4c8fb182-7957-497d-85e9-c680ac4c6ea3","resolution":{"observed_at":"2026-08-07T11:17:01.680829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:01.432950Z","title":"Matthews","venue":null,"work_id":"c5657bb8-a344-46b9-b147-06e11b52f32f","year":1988},"citing_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},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:59.992992Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:1e6f927936aa0181714836190b3654e2c53f078197da425a4ce73f6a060b52a3","observation_id":"5e063f54-55bc-476b-813d-c27075d83e7b","resolution":{"observed_at":"2026-08-07T11:17:01.504131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:01.207071Z","title":"Matthews","venue":null,"work_id":"6f614db7-7d27-40e0-9701-19bf578c5751","year":1989},"citing_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},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:17:00.061280Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:eb5ae12e495f5967211e9dad983a6b869db86beb2c3b397dc18ebd6ca7aa97e0","observation_id":"0f707b33-acb2-4018-910b-3f5ca198f9bc","resolution":{"observed_at":"2026-08-07T11:17:01.317418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:01.041505Z","title":"Moreover, if dε = (i − 1 +θ) logd, where i is a fixed integer and θ ∈ (0, 1) constant, the minimum degree δ is i","venue":null,"work_id":"760fc47d-801f-4f8b-9b72-000778a1d49e","year":null},"citing_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},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:17:00.143839Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:5058deb63d55420f836b2490c54c0f9e3b4a7acfaec66489b4486474b5cafa3f","observation_id":"02c76eee-8ff2-40c7-b5b5-35233adbb1ca","resolution":{"observed_at":"2026-08-07T11:17:01.110619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:00.827428Z","title":null,"venue":null,"work_id":"698b8683-8a5c-41c1-bb0e-1c20c2793c45","year":null},"citing_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},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:17:00.231408Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:078de7d68d241dd712bf5c0e912280eea9460d3646e3ff57b0eb086020d8eb18","observation_id":"fce2d3b3-f67f-46af-a4c7-50c6b98ad105","resolution":{"observed_at":"2026-08-07T11:17:00.923552Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:00.621981Z","title":null,"venue":null,"work_id":"eb515efe-fe90-46cd-9767-429d8334c176","year":null},"citing_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},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:17:00.319058Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:a9ccd482b6b9e16a8e02694a2266aa5663b103f01134f4e2a78ea4cd0abf9d9d","observation_id":"b9b8c426-9cd4-4992-bbb0-d17a2c7b3dd6","resolution":{"observed_at":"2026-08-07T11:17:00.690704Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:17:00.545420Z","title":null,"venue":null,"work_id":"e148c5ea-b362-4586-a2bd-8371b3bffa1c","year":null},"citing_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},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:17:00.404245Z"},"links":{"citing_paper":"/paper/2506.03375"},"observation_digest":"sha256:f0d37fad0121073fd9d4e44f52db819dbed00bb0fcd49540bf8978fbcbfcb6d1","observation_id":"c3cf0f67-d9c3-4261-b45b-e1d825a94425","resolution":{"observed_at":"2026-08-07T11:17:00.614069Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.03375","last_updated":"2025-06-03T20:32:45Z","latest_version":1,"primary_category":"math.CO","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"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":15},"total_outbound_references":23},"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 23 of 23 outbound references and 1 inbound Pith citation observation for arXiv:2506.03375."}