{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HL5ZJQE3IZWBDWZNJLF37S2LWC","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":"65aa9fb30e58050a306bae6ddfa72688b480f273619d304244de769fab4e4d76","cross_cats_sorted":["math-ph","math.MP","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-06-21T15:15:11Z","title_canon_sha256":"664a067d605a537dd47423264b037ed4d22b4795216499b3102df714f2d5ec45"},"schema_version":"1.0","source":{"id":"1106.4227","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4227","created_at":"2026-05-18T04:14:44Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4227v4","created_at":"2026-05-18T04:14:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4227","created_at":"2026-05-18T04:14:44Z"},{"alias_kind":"pith_short_12","alias_value":"HL5ZJQE3IZWB","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HL5ZJQE3IZWBDWZN","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HL5ZJQE3","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:48c5b8958395eabda6285b434c4cf161fccfabac45b921765a0b8cf2b6ff77f4","target":"graph","created_at":"2026-05-18T04:14:44Z","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 investigate a conjecture on the cover times of planar graphs by means of large Monte Carlo simulations. The conjecture states that the cover time $\\tau(G_{N})$ of a planar graph $G_{N}$ of $N$ vertices and maximal degree $d$ is lower bounded by $\\tau(G_{N}) \\geq C_{d} N(\\ln N)^2$ with $C_{d} = (d/4\\pi) \\tan (\\pi/d)$, with equality holding for some geometries. We tested this conjecture on the regular honeycomb ($d=3$), regular square ($d=4$), regular elongated triangular ($d=5$), and regular triangular ($d=6$) lattices, as well as on the nonregular Union Jack lattice ($d_{\\rm min}=4$, $d_{\\r","authors_text":"J. Ricardo G. Mendon\\c{c}a","cross_cats":["math-ph","math.MP","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-06-21T15:15:11Z","title":"Numerical evidence against a conjecture on the cover time of planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4227","kind":"arxiv","version":4},"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:4269d5d7b39ae8a8cff623c10d165536b710fe558e916e6a225fa70d2099e6e8","target":"record","created_at":"2026-05-18T04:14:44Z","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":"65aa9fb30e58050a306bae6ddfa72688b480f273619d304244de769fab4e4d76","cross_cats_sorted":["math-ph","math.MP","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-06-21T15:15:11Z","title_canon_sha256":"664a067d605a537dd47423264b037ed4d22b4795216499b3102df714f2d5ec45"},"schema_version":"1.0","source":{"id":"1106.4227","kind":"arxiv","version":4}},"canonical_sha256":"3afb94c09b466c11db2d4acbbfcb4bb0bc6aabeabf47f546b08130ed27df682a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3afb94c09b466c11db2d4acbbfcb4bb0bc6aabeabf47f546b08130ed27df682a","first_computed_at":"2026-05-18T04:14:44.849976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:44.849976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b9QVTqpKdV/ufyzV6WUOUCuqMfVIxkSK/21hE2D6qHqdFYfzan0Rq5oJZs+YN9yhTQTBqEpEV2UMktxPGNGsCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:44.850519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.4227","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4269d5d7b39ae8a8cff623c10d165536b710fe558e916e6a225fa70d2099e6e8","sha256:48c5b8958395eabda6285b434c4cf161fccfabac45b921765a0b8cf2b6ff77f4"],"state_sha256":"aae01f9ada1c46d0aa5532f8f4d49facd0b8fca13d0c3ae7a75642b700f015f2"}