{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:B7NMBOVWYQYYOBJFXK67OTE47O","short_pith_number":"pith:B7NMBOVW","canonical_record":{"source":{"id":"math/0005121","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2000-05-12T00:33:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0283ea20e4b98a6b6469fd9404fe87c4e39b8dff0c6ecffc68e61276558de887","abstract_canon_sha256":"5efaae6e73b95f9d579a62ac70497cc1b73e231d08051856b57213324c5abdb1"},"schema_version":"1.0"},"canonical_sha256":"0fdac0bab6c431870525babdf74c9cfbbde8a2643e6909ed0b91acdbad694e6c","source":{"kind":"arxiv","id":"math/0005121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0005121","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"arxiv_version","alias_value":"math/0005121v1","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0005121","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"pith_short_12","alias_value":"B7NMBOVWYQYY","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"pith_short_16","alias_value":"B7NMBOVWYQYYOBJF","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"pith_short_8","alias_value":"B7NMBOVW","created_at":"2026-07-04T14:34:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:B7NMBOVWYQYYOBJFXK67OTE47O","target":"record","payload":{"canonical_record":{"source":{"id":"math/0005121","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2000-05-12T00:33:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0283ea20e4b98a6b6469fd9404fe87c4e39b8dff0c6ecffc68e61276558de887","abstract_canon_sha256":"5efaae6e73b95f9d579a62ac70497cc1b73e231d08051856b57213324c5abdb1"},"schema_version":"1.0"},"canonical_sha256":"0fdac0bab6c431870525babdf74c9cfbbde8a2643e6909ed0b91acdbad694e6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:34:30.249683Z","signature_b64":"Ii20CDt1wwb+ANtUFtoItqaa/BtfN38u1HlkjyH2/X2MX1vjFY83RoaA++VwbQVJZU9y/BgmxvvKuEYW673yBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fdac0bab6c431870525babdf74c9cfbbde8a2643e6909ed0b91acdbad694e6c","last_reissued_at":"2026-07-04T14:34:30.249275Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:34:30.249275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0005121","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-07-04T14:34:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2J7QlJ/O1Lqd/EhOs7J+hyQoFDbgL+Evp6NGPekSnDaRrEwEG4oKx7qON3S9QaPhZQ2NeMn09Pq8arxDJjaRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T11:33:25.649734Z"},"content_sha256":"f16c40f8ceba1035da621a26340e14c8540d7bdcef81acbeb50561ea1592f00c","schema_version":"1.0","event_id":"sha256:f16c40f8ceba1035da621a26340e14c8540d7bdcef81acbeb50561ea1592f00c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:B7NMBOVWYQYYOBJFXK67OTE47O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The cover time, the blanket time, and the Matthews bound","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"J. H. Kim, J. Kahn, L. Lovasz, V. H. Vu","submitted_at":"2000-05-12T00:33:33Z","abstract_excerpt":"The cover time C of a graph G is the expected time for a random walk starting from the worst vertex to cover all vertices in G. Similarly, the blanket time B is the expected time to visit all vertices within a constant factor of number of times suggested by the stationary distribution. (Our definition will be slightly stronger than this.) Obviously, all vertices are covered when the graph is blanketed, and hence C <= B. The blanket time is introduced by Winkler and Zuckerman motivated by applications in Markov estimation and distributed computing. They conjectured B =O(C) and proved B=O(C ln n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0005121","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0005121/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:34:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fVbeEkk67mzn/F4GD4NWB1YDL8aNVTPxMMOQy0r4zhC+zwEqW9VGdoW/8HUsthKbNoL3FFxPCxkNf8n9uPu0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T11:33:25.650249Z"},"content_sha256":"51cb1c762e8ee6c99b5a17c242c0e18a2ec88884e89030dc6946737aac62b619","schema_version":"1.0","event_id":"sha256:51cb1c762e8ee6c99b5a17c242c0e18a2ec88884e89030dc6946737aac62b619"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7NMBOVWYQYYOBJFXK67OTE47O/bundle.json","state_url":"https://pith.science/pith/B7NMBOVWYQYYOBJFXK67OTE47O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7NMBOVWYQYYOBJFXK67OTE47O/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-08-10T11:33:25Z","links":{"resolver":"https://pith.science/pith/B7NMBOVWYQYYOBJFXK67OTE47O","bundle":"https://pith.science/pith/B7NMBOVWYQYYOBJFXK67OTE47O/bundle.json","state":"https://pith.science/pith/B7NMBOVWYQYYOBJFXK67OTE47O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7NMBOVWYQYYOBJFXK67OTE47O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:B7NMBOVWYQYYOBJFXK67OTE47O","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":"5efaae6e73b95f9d579a62ac70497cc1b73e231d08051856b57213324c5abdb1","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2000-05-12T00:33:33Z","title_canon_sha256":"0283ea20e4b98a6b6469fd9404fe87c4e39b8dff0c6ecffc68e61276558de887"},"schema_version":"1.0","source":{"id":"math/0005121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0005121","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"arxiv_version","alias_value":"math/0005121v1","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0005121","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"pith_short_12","alias_value":"B7NMBOVWYQYY","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"pith_short_16","alias_value":"B7NMBOVWYQYYOBJF","created_at":"2026-07-04T14:34:30Z"},{"alias_kind":"pith_short_8","alias_value":"B7NMBOVW","created_at":"2026-07-04T14:34:30Z"}],"graph_snapshots":[{"event_id":"sha256:51cb1c762e8ee6c99b5a17c242c0e18a2ec88884e89030dc6946737aac62b619","target":"graph","created_at":"2026-07-04T14:34:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0005121/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The cover time C of a graph G is the expected time for a random walk starting from the worst vertex to cover all vertices in G. Similarly, the blanket time B is the expected time to visit all vertices within a constant factor of number of times suggested by the stationary distribution. (Our definition will be slightly stronger than this.) Obviously, all vertices are covered when the graph is blanketed, and hence C <= B. The blanket time is introduced by Winkler and Zuckerman motivated by applications in Markov estimation and distributed computing. They conjectured B =O(C) and proved B=O(C ln n","authors_text":"J. H. Kim, J. Kahn, L. Lovasz, V. H. Vu","cross_cats":["math.CO"],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2000-05-12T00:33:33Z","title":"The cover time, the blanket time, and the Matthews bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0005121","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:f16c40f8ceba1035da621a26340e14c8540d7bdcef81acbeb50561ea1592f00c","target":"record","created_at":"2026-07-04T14:34:30Z","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":"5efaae6e73b95f9d579a62ac70497cc1b73e231d08051856b57213324c5abdb1","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2000-05-12T00:33:33Z","title_canon_sha256":"0283ea20e4b98a6b6469fd9404fe87c4e39b8dff0c6ecffc68e61276558de887"},"schema_version":"1.0","source":{"id":"math/0005121","kind":"arxiv","version":1}},"canonical_sha256":"0fdac0bab6c431870525babdf74c9cfbbde8a2643e6909ed0b91acdbad694e6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fdac0bab6c431870525babdf74c9cfbbde8a2643e6909ed0b91acdbad694e6c","first_computed_at":"2026-07-04T14:34:30.249275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:34:30.249275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ii20CDt1wwb+ANtUFtoItqaa/BtfN38u1HlkjyH2/X2MX1vjFY83RoaA++VwbQVJZU9y/BgmxvvKuEYW673yBg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:34:30.249683Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0005121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f16c40f8ceba1035da621a26340e14c8540d7bdcef81acbeb50561ea1592f00c","sha256:51cb1c762e8ee6c99b5a17c242c0e18a2ec88884e89030dc6946737aac62b619"],"state_sha256":"c491c5b0edb8217c3b0763ea9dde97fca3f897b2a37256c324437b2e469533f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKSQdXbVFBwYM+bZWePoa3vGYDUt2NJioLokVA32BFFeBpMfAJ4Y8W0zkwYvPfAQrAHJO1op8a3kdu8b3jjnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T11:33:25.654497Z","bundle_sha256":"7d36901cbccdbc00d7d5602b113f4ca0902b5333a1c78688874b6cbc46934a03"}}