{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AIG5UELZDATXPYMVZVDLWNYM6Z","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":"77c4a2866abfdb2072732258ef618ede093e1a2ddc02630a05844eb030b1d48a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-28T09:40:06Z","title_canon_sha256":"34205987509b352f916cbedd99b308d0e516c500c7dfa7a1f25d27067e71f813"},"schema_version":"1.0","source":{"id":"1206.6605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6605","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6605v1","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6605","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"AIG5UELZDATX","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AIG5UELZDATXPYMV","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AIG5UELZ","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:b7a050d624af2fc5025a2e57c105000554b8d1472922e2e30eb5ecfc305e2fb3","target":"graph","created_at":"2026-05-18T03:52:25Z","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 introduce a variant of the cover time of a graph, called cover cost, in which the cost of a step is proportional to the number of yet uncovered vertices. It turns out that cover cost is more tractable than cover time; we provide an $O(n^4)$ algorithm for its computation, as well as some explicit formulae. The two values are not very far from each other, and so cover cost might be a useful tool in the study of cover time.","authors_text":"Agelos Georgakopoulos","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-28T09:40:06Z","title":"A Tractable Variant of Cover Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6605","kind":"arxiv","version":1},"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:471630f59cf8575032a256682a174510154eb5537645d1954cdd8cc80b3bad9d","target":"record","created_at":"2026-05-18T03:52:25Z","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":"77c4a2866abfdb2072732258ef618ede093e1a2ddc02630a05844eb030b1d48a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-28T09:40:06Z","title_canon_sha256":"34205987509b352f916cbedd99b308d0e516c500c7dfa7a1f25d27067e71f813"},"schema_version":"1.0","source":{"id":"1206.6605","kind":"arxiv","version":1}},"canonical_sha256":"020dda1179182777e195cd46bb370cf672388785881abc973fb559f8b3c61210","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"020dda1179182777e195cd46bb370cf672388785881abc973fb559f8b3c61210","first_computed_at":"2026-05-18T03:52:25.509770Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:25.509770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dnxMOkwqId81HeiArOHTjxobsWC+fmM9Y/O7dofU9OYB+/bJbIJpnomyg8j9qlkaX2rpfgOFqCPhsEzg+HX/Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:25.510566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:471630f59cf8575032a256682a174510154eb5537645d1954cdd8cc80b3bad9d","sha256:b7a050d624af2fc5025a2e57c105000554b8d1472922e2e30eb5ecfc305e2fb3"],"state_sha256":"4b9ae8862a8557640a5857c74578f6d8df2d479d40eafb8e43c326c0c4fc605d"}