{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AIG5UELZDATXPYMVZVDLWNYM6Z","short_pith_number":"pith:AIG5UELZ","schema_version":"1.0","canonical_sha256":"020dda1179182777e195cd46bb370cf672388785881abc973fb559f8b3c61210","source":{"kind":"arxiv","id":"1206.6605","version":1},"attestation_state":"computed","paper":{"title":"A Tractable Variant of Cover Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Agelos Georgakopoulos","submitted_at":"2012-06-28T09:40:06Z","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."},"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":"1206.6605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-28T09:40:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"34205987509b352f916cbedd99b308d0e516c500c7dfa7a1f25d27067e71f813","abstract_canon_sha256":"77c4a2866abfdb2072732258ef618ede093e1a2ddc02630a05844eb030b1d48a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:25.510566Z","signature_b64":"dnxMOkwqId81HeiArOHTjxobsWC+fmM9Y/O7dofU9OYB+/bJbIJpnomyg8j9qlkaX2rpfgOFqCPhsEzg+HX/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"020dda1179182777e195cd46bb370cf672388785881abc973fb559f8b3c61210","last_reissued_at":"2026-05-18T03:52:25.509770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:25.509770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tractable Variant of Cover Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Agelos Georgakopoulos","submitted_at":"2012-06-28T09:40:06Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6605","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":"1206.6605","created_at":"2026-05-18T03:52:25.509890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6605v1","created_at":"2026-05-18T03:52:25.509890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6605","created_at":"2026-05-18T03:52:25.509890+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIG5UELZDATX","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIG5UELZDATXPYMV","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIG5UELZ","created_at":"2026-05-18T12:26:58.693483+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/AIG5UELZDATXPYMVZVDLWNYM6Z","json":"https://pith.science/pith/AIG5UELZDATXPYMVZVDLWNYM6Z.json","graph_json":"https://pith.science/api/pith-number/AIG5UELZDATXPYMVZVDLWNYM6Z/graph.json","events_json":"https://pith.science/api/pith-number/AIG5UELZDATXPYMVZVDLWNYM6Z/events.json","paper":"https://pith.science/paper/AIG5UELZ"},"agent_actions":{"view_html":"https://pith.science/pith/AIG5UELZDATXPYMVZVDLWNYM6Z","download_json":"https://pith.science/pith/AIG5UELZDATXPYMVZVDLWNYM6Z.json","view_paper":"https://pith.science/paper/AIG5UELZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6605&json=true","fetch_graph":"https://pith.science/api/pith-number/AIG5UELZDATXPYMVZVDLWNYM6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/AIG5UELZDATXPYMVZVDLWNYM6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIG5UELZDATXPYMVZVDLWNYM6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIG5UELZDATXPYMVZVDLWNYM6Z/action/storage_attestation","attest_author":"https://pith.science/pith/AIG5UELZDATXPYMVZVDLWNYM6Z/action/author_attestation","sign_citation":"https://pith.science/pith/AIG5UELZDATXPYMVZVDLWNYM6Z/action/citation_signature","submit_replication":"https://pith.science/pith/AIG5UELZDATXPYMVZVDLWNYM6Z/action/replication_record"}},"created_at":"2026-05-18T03:52:25.509890+00:00","updated_at":"2026-05-18T03:52:25.509890+00:00"}