{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VNSWIMOL6HWLDAM72YWNR5SZYJ","short_pith_number":"pith:VNSWIMOL","canonical_record":{"source":{"id":"1805.05780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-12T10:30:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"edaad8186dd0cd64c5aed526cbd881ace50237a3e85dad62994406e708458ef8","abstract_canon_sha256":"0269caa9fd0b7aaa03f153ce4ec0b5b4a22434dda545f93876c45375fc17e8d9"},"schema_version":"1.0"},"canonical_sha256":"ab656431cbf1ecb1819fd62cd8f659c24c03a80c0e15426df6c52d41f89cf9d6","source":{"kind":"arxiv","id":"1805.05780","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05780","created_at":"2026-05-18T00:15:53Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05780v1","created_at":"2026-05-18T00:15:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05780","created_at":"2026-05-18T00:15:53Z"},{"alias_kind":"pith_short_12","alias_value":"VNSWIMOL6HWL","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VNSWIMOL6HWLDAM7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VNSWIMOL","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VNSWIMOL6HWLDAM72YWNR5SZYJ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.05780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-12T10:30:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"edaad8186dd0cd64c5aed526cbd881ace50237a3e85dad62994406e708458ef8","abstract_canon_sha256":"0269caa9fd0b7aaa03f153ce4ec0b5b4a22434dda545f93876c45375fc17e8d9"},"schema_version":"1.0"},"canonical_sha256":"ab656431cbf1ecb1819fd62cd8f659c24c03a80c0e15426df6c52d41f89cf9d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:53.704139Z","signature_b64":"mH0TmfqaGtHew46/TMTbpipKQdkLD2i9DlpOnQ9ITwRdCfAhCXLN5AAh+8i2nUQc4CGZ8GXBNBDz711Tp2YYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab656431cbf1ecb1819fd62cd8f659c24c03a80c0e15426df6c52d41f89cf9d6","last_reissued_at":"2026-05-18T00:15:53.703503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:53.703503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.05780","source_version":1,"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-18T00:15:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DA+IybT9HLqcKRfJwFtApAuoBDNgt2OrhqacGiIX+HZ3SWnV4Uzd6e/EY1qKKCQoSszhh+mpq3J8qJoyXahKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:31:51.467476Z"},"content_sha256":"ae8f08f5f5d772096905386e82e05c6e64f706f3808713c9c6195f6a9bdc9126","schema_version":"1.0","event_id":"sha256:ae8f08f5f5d772096905386e82e05c6e64f706f3808713c9c6195f6a9bdc9126"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VNSWIMOL6HWLDAM72YWNR5SZYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The cover time of a biased random walk on a random regular graph of odd degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Tony Johansson","submitted_at":"2018-05-12T10:30:09Z","abstract_excerpt":"We consider a random walk process which prefers to visit previously unvisited edges, on the random $r$-regular graph $G_r$ for any odd $r\\geq 3$. We show that this random walk process has asymptotic vertex and edge cover times $\\frac{1}{r-2}n\\log n$ and $\\frac{r}{2(r-2)}n\\log n$, respectively, generalizing the result from Cooper, Frieze and Johansson from $r = 3$ to any larger odd $r$. This completes the study of the vertex cover time for fixed $r\\geq 3$, with Berenbrink, Cooper and Friedetzky having previously shown that $G_r$ has vertex cover time asymptotic to $\\frac{rn}{2}$ when $r\\geq 4$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05780","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"},"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-18T00:15:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"diPGsqy+aTefSRAEKXpo0RqirQpcChD3eUp4diHCHGubMcF4xs2nPUXn+uMIOOG4Iw8KMGW+BjaoRH+6TdqqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:31:51.467827Z"},"content_sha256":"abb2d04c6e516d98bc2b2253326204b8e799b9d5de537e9bf3ffe8ba4727458d","schema_version":"1.0","event_id":"sha256:abb2d04c6e516d98bc2b2253326204b8e799b9d5de537e9bf3ffe8ba4727458d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNSWIMOL6HWLDAM72YWNR5SZYJ/bundle.json","state_url":"https://pith.science/pith/VNSWIMOL6HWLDAM72YWNR5SZYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNSWIMOL6HWLDAM72YWNR5SZYJ/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-06-04T03:31:51Z","links":{"resolver":"https://pith.science/pith/VNSWIMOL6HWLDAM72YWNR5SZYJ","bundle":"https://pith.science/pith/VNSWIMOL6HWLDAM72YWNR5SZYJ/bundle.json","state":"https://pith.science/pith/VNSWIMOL6HWLDAM72YWNR5SZYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNSWIMOL6HWLDAM72YWNR5SZYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VNSWIMOL6HWLDAM72YWNR5SZYJ","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":"0269caa9fd0b7aaa03f153ce4ec0b5b4a22434dda545f93876c45375fc17e8d9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-12T10:30:09Z","title_canon_sha256":"edaad8186dd0cd64c5aed526cbd881ace50237a3e85dad62994406e708458ef8"},"schema_version":"1.0","source":{"id":"1805.05780","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05780","created_at":"2026-05-18T00:15:53Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05780v1","created_at":"2026-05-18T00:15:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05780","created_at":"2026-05-18T00:15:53Z"},{"alias_kind":"pith_short_12","alias_value":"VNSWIMOL6HWL","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VNSWIMOL6HWLDAM7","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VNSWIMOL","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:abb2d04c6e516d98bc2b2253326204b8e799b9d5de537e9bf3ffe8ba4727458d","target":"graph","created_at":"2026-05-18T00:15:53Z","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 a random walk process which prefers to visit previously unvisited edges, on the random $r$-regular graph $G_r$ for any odd $r\\geq 3$. We show that this random walk process has asymptotic vertex and edge cover times $\\frac{1}{r-2}n\\log n$ and $\\frac{r}{2(r-2)}n\\log n$, respectively, generalizing the result from Cooper, Frieze and Johansson from $r = 3$ to any larger odd $r$. This completes the study of the vertex cover time for fixed $r\\geq 3$, with Berenbrink, Cooper and Friedetzky having previously shown that $G_r$ has vertex cover time asymptotic to $\\frac{rn}{2}$ when $r\\geq 4$ ","authors_text":"Tony Johansson","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-12T10:30:09Z","title":"The cover time of a biased random walk on a random regular graph of odd degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05780","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:ae8f08f5f5d772096905386e82e05c6e64f706f3808713c9c6195f6a9bdc9126","target":"record","created_at":"2026-05-18T00:15:53Z","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":"0269caa9fd0b7aaa03f153ce4ec0b5b4a22434dda545f93876c45375fc17e8d9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-12T10:30:09Z","title_canon_sha256":"edaad8186dd0cd64c5aed526cbd881ace50237a3e85dad62994406e708458ef8"},"schema_version":"1.0","source":{"id":"1805.05780","kind":"arxiv","version":1}},"canonical_sha256":"ab656431cbf1ecb1819fd62cd8f659c24c03a80c0e15426df6c52d41f89cf9d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab656431cbf1ecb1819fd62cd8f659c24c03a80c0e15426df6c52d41f89cf9d6","first_computed_at":"2026-05-18T00:15:53.703503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:53.703503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mH0TmfqaGtHew46/TMTbpipKQdkLD2i9DlpOnQ9ITwRdCfAhCXLN5AAh+8i2nUQc4CGZ8GXBNBDz711Tp2YYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:53.704139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05780","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae8f08f5f5d772096905386e82e05c6e64f706f3808713c9c6195f6a9bdc9126","sha256:abb2d04c6e516d98bc2b2253326204b8e799b9d5de537e9bf3ffe8ba4727458d"],"state_sha256":"4ea33a5fbb608be7007c44aa164c2b7ce36859d3a7b081a4e13d25bbb85da7d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I4neSaNWlyt5kj7J/9r/znhaoftvkV963wuPZdiSYzCakzetlZnrBrfpRFUvpaoBh3RxtunvRb46afzgAG5uBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:31:51.470020Z","bundle_sha256":"62653d3cc55c75ebbb4e30fc177d8d26480608b99bdc6b6f8cf5f393de541a2a"}}