{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EWQYM25YC55WI2BNTKJFILFOAW","short_pith_number":"pith:EWQYM25Y","schema_version":"1.0","canonical_sha256":"25a1866bb8177b64682d9a92542cae0589999ddb3734b4343eef0e758073a628","source":{"kind":"arxiv","id":"1202.5569","version":1},"attestation_state":"computed","paper":{"title":"The Cover Time of Random Walks on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.PR","authors_text":"Mohammed Abdullah","submitted_at":"2012-02-24T21:44:30Z","abstract_excerpt":"A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex. Central to this thesis is the cover time of the walk, that is, the expectation of the number of steps required to visit every vertex, maximised over all starting vertices. In our first contribution, we establish a relation between the cover times of a pair of graphs, and the cover time of their Cartesian product. This extends previous work on special cases of the"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1202.5569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-24T21:44:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9561c1e52e59341c0d0c05941d439f820444cbaa5b27aa25a60e4dbec3039233","abstract_canon_sha256":"d2e81d21ea40ba1839a6e8329de96e5bd90fe08440d34dda30bdd811f76ac41f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:25.382656Z","signature_b64":"juJu1Oy62CYQOO91S1jOQBS6YH2hjBmTdjALoSRmicrVFXo/u/G8bBFiUk9QBRA/euS/I9iHfrLM3LJLiu4QBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25a1866bb8177b64682d9a92542cae0589999ddb3734b4343eef0e758073a628","last_reissued_at":"2026-05-18T04:01:25.382055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:25.382055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Cover Time of Random Walks on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.PR","authors_text":"Mohammed Abdullah","submitted_at":"2012-02-24T21:44:30Z","abstract_excerpt":"A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex. Central to this thesis is the cover time of the walk, that is, the expectation of the number of steps required to visit every vertex, maximised over all starting vertices. In our first contribution, we establish a relation between the cover times of a pair of graphs, and the cover time of their Cartesian product. This extends previous work on special cases of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5569","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.5569","created_at":"2026-05-18T04:01:25.382137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5569v1","created_at":"2026-05-18T04:01:25.382137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5569","created_at":"2026-05-18T04:01:25.382137+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWQYM25YC55W","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWQYM25YC55WI2BN","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWQYM25Y","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EWQYM25YC55WI2BNTKJFILFOAW","json":"https://pith.science/pith/EWQYM25YC55WI2BNTKJFILFOAW.json","graph_json":"https://pith.science/api/pith-number/EWQYM25YC55WI2BNTKJFILFOAW/graph.json","events_json":"https://pith.science/api/pith-number/EWQYM25YC55WI2BNTKJFILFOAW/events.json","paper":"https://pith.science/paper/EWQYM25Y"},"agent_actions":{"view_html":"https://pith.science/pith/EWQYM25YC55WI2BNTKJFILFOAW","download_json":"https://pith.science/pith/EWQYM25YC55WI2BNTKJFILFOAW.json","view_paper":"https://pith.science/paper/EWQYM25Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5569&json=true","fetch_graph":"https://pith.science/api/pith-number/EWQYM25YC55WI2BNTKJFILFOAW/graph.json","fetch_events":"https://pith.science/api/pith-number/EWQYM25YC55WI2BNTKJFILFOAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWQYM25YC55WI2BNTKJFILFOAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWQYM25YC55WI2BNTKJFILFOAW/action/storage_attestation","attest_author":"https://pith.science/pith/EWQYM25YC55WI2BNTKJFILFOAW/action/author_attestation","sign_citation":"https://pith.science/pith/EWQYM25YC55WI2BNTKJFILFOAW/action/citation_signature","submit_replication":"https://pith.science/pith/EWQYM25YC55WI2BNTKJFILFOAW/action/replication_record"}},"created_at":"2026-05-18T04:01:25.382137+00:00","updated_at":"2026-05-18T04:01:25.382137+00:00"}