{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:FNFPLCD3F7UF7XMGOIKE5XD2WL","short_pith_number":"pith:FNFPLCD3","schema_version":"1.0","canonical_sha256":"2b4af5887b2fe85fdd8672144edc7ab2e091f034a45421bc79bf9551b74bac81","source":{"kind":"arxiv","id":"1001.0609","version":2},"attestation_state":"computed","paper":{"title":"The evolution of the cover time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Asaf Nachmias, Jian Ding, Martin T. Barlow, Yuval Peres","submitted_at":"2010-01-05T01:01:31Z","abstract_excerpt":"The cover time of a graph is a celebrated example of a parameter that is easy to approximate using a randomized algorithm, but for which no constant factor deterministic polynomial time approximation is known. A breakthrough due to Kahn, Kim, Lovasz and Vu yielded a (log log n)^2 polynomial time approximation. We refine this upper bound, and show that the resulting bound is sharp and explicitly computable in random graphs. Cooper and Frieze showed that the cover time of the largest component of the Erdos-Renyi random graph G(n,c/n) in the supercritical regime with c>1 fixed, is asymptotic to f"},"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":"1001.0609","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-01-05T01:01:31Z","cross_cats_sorted":[],"title_canon_sha256":"9cf60fa73f36aeaa8d6f0a7405e76f362652fb892530b5eaee4bde1d67ad3e86","abstract_canon_sha256":"e011afb2794c6baf18b676a02959da4cced4cdeeda04342f2777791e34ff5ad1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:03.918062Z","signature_b64":"qd8r1AfTJqjjcBTi/41XCKWGe3BE0gS4BZQitrD2yAXFGTTc1PjJdP7F16bJHXrNrUpvEwosg8txiWczrOkbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b4af5887b2fe85fdd8672144edc7ab2e091f034a45421bc79bf9551b74bac81","last_reissued_at":"2026-05-18T04:42:03.917676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:03.917676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The evolution of the cover time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Asaf Nachmias, Jian Ding, Martin T. Barlow, Yuval Peres","submitted_at":"2010-01-05T01:01:31Z","abstract_excerpt":"The cover time of a graph is a celebrated example of a parameter that is easy to approximate using a randomized algorithm, but for which no constant factor deterministic polynomial time approximation is known. A breakthrough due to Kahn, Kim, Lovasz and Vu yielded a (log log n)^2 polynomial time approximation. We refine this upper bound, and show that the resulting bound is sharp and explicitly computable in random graphs. Cooper and Frieze showed that the cover time of the largest component of the Erdos-Renyi random graph G(n,c/n) in the supercritical regime with c>1 fixed, is asymptotic to f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.0609","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1001.0609","created_at":"2026-05-18T04:42:03.917732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.0609v2","created_at":"2026-05-18T04:42:03.917732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.0609","created_at":"2026-05-18T04:42:03.917732+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNFPLCD3F7UF","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNFPLCD3F7UF7XMG","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNFPLCD3","created_at":"2026-05-18T12:26:07.630475+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/FNFPLCD3F7UF7XMGOIKE5XD2WL","json":"https://pith.science/pith/FNFPLCD3F7UF7XMGOIKE5XD2WL.json","graph_json":"https://pith.science/api/pith-number/FNFPLCD3F7UF7XMGOIKE5XD2WL/graph.json","events_json":"https://pith.science/api/pith-number/FNFPLCD3F7UF7XMGOIKE5XD2WL/events.json","paper":"https://pith.science/paper/FNFPLCD3"},"agent_actions":{"view_html":"https://pith.science/pith/FNFPLCD3F7UF7XMGOIKE5XD2WL","download_json":"https://pith.science/pith/FNFPLCD3F7UF7XMGOIKE5XD2WL.json","view_paper":"https://pith.science/paper/FNFPLCD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.0609&json=true","fetch_graph":"https://pith.science/api/pith-number/FNFPLCD3F7UF7XMGOIKE5XD2WL/graph.json","fetch_events":"https://pith.science/api/pith-number/FNFPLCD3F7UF7XMGOIKE5XD2WL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNFPLCD3F7UF7XMGOIKE5XD2WL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNFPLCD3F7UF7XMGOIKE5XD2WL/action/storage_attestation","attest_author":"https://pith.science/pith/FNFPLCD3F7UF7XMGOIKE5XD2WL/action/author_attestation","sign_citation":"https://pith.science/pith/FNFPLCD3F7UF7XMGOIKE5XD2WL/action/citation_signature","submit_replication":"https://pith.science/pith/FNFPLCD3F7UF7XMGOIKE5XD2WL/action/replication_record"}},"created_at":"2026-05-18T04:42:03.917732+00:00","updated_at":"2026-05-18T04:42:03.917732+00:00"}