{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:X67M5AB37AZMO2RZFCGBJ47VTK","short_pith_number":"pith:X67M5AB3","canonical_record":{"source":{"id":"1810.04772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T23:06:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"29c6e4d31cecce99bf87ec809310e46c2f36a7351ee0aabb4fb34b7c40d2ad0a","abstract_canon_sha256":"4dc9e6c15945e89bd207b6789f6a30b28bd3c1fd6456fcef65feb54d9acbda29"},"schema_version":"1.0"},"canonical_sha256":"bfbece803bf832c76a39288c14f3f59a9d0801d06efda03ddab41dbfa1750f1f","source":{"kind":"arxiv","id":"1810.04772","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04772","created_at":"2026-05-17T23:44:58Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04772v2","created_at":"2026-05-17T23:44:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04772","created_at":"2026-05-17T23:44:58Z"},{"alias_kind":"pith_short_12","alias_value":"X67M5AB37AZM","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X67M5AB37AZMO2RZ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X67M5AB3","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:X67M5AB37AZMO2RZFCGBJ47VTK","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T23:06:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"29c6e4d31cecce99bf87ec809310e46c2f36a7351ee0aabb4fb34b7c40d2ad0a","abstract_canon_sha256":"4dc9e6c15945e89bd207b6789f6a30b28bd3c1fd6456fcef65feb54d9acbda29"},"schema_version":"1.0"},"canonical_sha256":"bfbece803bf832c76a39288c14f3f59a9d0801d06efda03ddab41dbfa1750f1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:58.869385Z","signature_b64":"DXB2kAmjCSqg0I9TkYgXKLy52qv1f7yd5KuErCp2IoKXLHKIc2bFZKZCPXmeWhTfFvfwD7wNtbOq4WX9FHbrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfbece803bf832c76a39288c14f3f59a9d0801d06efda03ddab41dbfa1750f1f","last_reissued_at":"2026-05-17T23:44:58.868757Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:58.868757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04772","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ullxKHAuQFjw0RRRXU5CNRTpGfVMVCsZDd8jl8QxDY8mGngLpoKk7uA3QTcsKY39pRdpM+XhXPL8KCFFlo1IDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T10:01:41.720190Z"},"content_sha256":"ef51a025ebccfbac7d091fddbdb9a14d969185c0fcae39d6fa2dda1e14157850","schema_version":"1.0","event_id":"sha256:ef51a025ebccfbac7d091fddbdb9a14d969185c0fcae39d6fa2dda1e14157850"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:X67M5AB37AZMO2RZFCGBJ47VTK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the cover time of dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alan Frieze, Colin Cooper, Wesley Pegden","submitted_at":"2018-10-10T23:06:39Z","abstract_excerpt":"We consider arbitrary graphs $G$ with $n$ vertices and minimum degree at least $\\delta n$ where $\\delta>0$ is constant. If the conductance of $G$ is sufficiently large then we obtain an asymptotic expression for the cover time $C_G$ of $G$ as the solution to an explicit transcendental equation. Failing this, if the mixing time of a random walk on $G$ is of a lesser magnitude than the cover time, then we can obtain an asymptotic deterministic estimate via a decomposition into a bounded number of dense sub-graphs with high conductance. Failing this we give a deterministic asymptotic (2+o(1))-app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04772","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cuWcihtMW7q48AD6k4DrruiYPkyT3oLdnF1bxE6udf9MogY8bdZrRWAl4pzc2nXPH7whuwVbFT/48srdR4NtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T10:01:41.720952Z"},"content_sha256":"bd6cf218c507484f82b252cfa8bc072390b3527b2941206221939df123903fec","schema_version":"1.0","event_id":"sha256:bd6cf218c507484f82b252cfa8bc072390b3527b2941206221939df123903fec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X67M5AB37AZMO2RZFCGBJ47VTK/bundle.json","state_url":"https://pith.science/pith/X67M5AB37AZMO2RZFCGBJ47VTK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X67M5AB37AZMO2RZFCGBJ47VTK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T10:01:41Z","links":{"resolver":"https://pith.science/pith/X67M5AB37AZMO2RZFCGBJ47VTK","bundle":"https://pith.science/pith/X67M5AB37AZMO2RZFCGBJ47VTK/bundle.json","state":"https://pith.science/pith/X67M5AB37AZMO2RZFCGBJ47VTK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X67M5AB37AZMO2RZFCGBJ47VTK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:X67M5AB37AZMO2RZFCGBJ47VTK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4dc9e6c15945e89bd207b6789f6a30b28bd3c1fd6456fcef65feb54d9acbda29","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T23:06:39Z","title_canon_sha256":"29c6e4d31cecce99bf87ec809310e46c2f36a7351ee0aabb4fb34b7c40d2ad0a"},"schema_version":"1.0","source":{"id":"1810.04772","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04772","created_at":"2026-05-17T23:44:58Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04772v2","created_at":"2026-05-17T23:44:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04772","created_at":"2026-05-17T23:44:58Z"},{"alias_kind":"pith_short_12","alias_value":"X67M5AB37AZM","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X67M5AB37AZMO2RZ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X67M5AB3","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:bd6cf218c507484f82b252cfa8bc072390b3527b2941206221939df123903fec","target":"graph","created_at":"2026-05-17T23:44:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider arbitrary graphs $G$ with $n$ vertices and minimum degree at least $\\delta n$ where $\\delta>0$ is constant. If the conductance of $G$ is sufficiently large then we obtain an asymptotic expression for the cover time $C_G$ of $G$ as the solution to an explicit transcendental equation. Failing this, if the mixing time of a random walk on $G$ is of a lesser magnitude than the cover time, then we can obtain an asymptotic deterministic estimate via a decomposition into a bounded number of dense sub-graphs with high conductance. Failing this we give a deterministic asymptotic (2+o(1))-app","authors_text":"Alan Frieze, Colin Cooper, Wesley Pegden","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T23:06:39Z","title":"On the cover time of dense graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04772","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ef51a025ebccfbac7d091fddbdb9a14d969185c0fcae39d6fa2dda1e14157850","target":"record","created_at":"2026-05-17T23:44:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4dc9e6c15945e89bd207b6789f6a30b28bd3c1fd6456fcef65feb54d9acbda29","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T23:06:39Z","title_canon_sha256":"29c6e4d31cecce99bf87ec809310e46c2f36a7351ee0aabb4fb34b7c40d2ad0a"},"schema_version":"1.0","source":{"id":"1810.04772","kind":"arxiv","version":2}},"canonical_sha256":"bfbece803bf832c76a39288c14f3f59a9d0801d06efda03ddab41dbfa1750f1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfbece803bf832c76a39288c14f3f59a9d0801d06efda03ddab41dbfa1750f1f","first_computed_at":"2026-05-17T23:44:58.868757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:58.868757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DXB2kAmjCSqg0I9TkYgXKLy52qv1f7yd5KuErCp2IoKXLHKIc2bFZKZCPXmeWhTfFvfwD7wNtbOq4WX9FHbrDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:58.869385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04772","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef51a025ebccfbac7d091fddbdb9a14d969185c0fcae39d6fa2dda1e14157850","sha256:bd6cf218c507484f82b252cfa8bc072390b3527b2941206221939df123903fec"],"state_sha256":"f5357a67808b1ee59b3b2ffdf9bf38b73ef3bf10616d2719c2021afb7d768af6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"73yff1zTNr5KgXJKjoIakjozGeQpieGPOFCySR/8R9PZlRZRoyceD8xWy+Cykg9lbDNE1FNHLY+lwGaHz3R2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T10:01:41.725936Z","bundle_sha256":"23343ffe8c809a810ffcae0c4be9acfdb998518ad469aeaeb967ab833268c167"}}