{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EWBGMIJASMTHGDYGKQIVGOTSMM","short_pith_number":"pith:EWBGMIJA","canonical_record":{"source":{"id":"1109.6619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-29T18:53:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"255d3457dc2df9eb09824740febea617636da1c0a5cb707eb0bb0497d372ef63","abstract_canon_sha256":"464637890e29d5791f87ba7b97ee85a3faf551b10f9e719cda57a18fe60f4215"},"schema_version":"1.0"},"canonical_sha256":"25826621209326730f065411533a7263215b539297bf596c46ae22f95a3eff45","source":{"kind":"arxiv","id":"1109.6619","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6619","created_at":"2026-05-17T23:53:19Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6619v1","created_at":"2026-05-17T23:53:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6619","created_at":"2026-05-17T23:53:19Z"},{"alias_kind":"pith_short_12","alias_value":"EWBGMIJASMTH","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EWBGMIJASMTHGDYG","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EWBGMIJA","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EWBGMIJASMTHGDYGKQIVGOTSMM","target":"record","payload":{"canonical_record":{"source":{"id":"1109.6619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-29T18:53:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"255d3457dc2df9eb09824740febea617636da1c0a5cb707eb0bb0497d372ef63","abstract_canon_sha256":"464637890e29d5791f87ba7b97ee85a3faf551b10f9e719cda57a18fe60f4215"},"schema_version":"1.0"},"canonical_sha256":"25826621209326730f065411533a7263215b539297bf596c46ae22f95a3eff45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:19.188824Z","signature_b64":"TL2Rsw+U8SJsTtd0zFBZGqzzolqsM5FHSyl4ZWk6+01r49r05QzmSaOx71yDK24JaSBkMdCmQdXSjF2g0Ke/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25826621209326730f065411533a7263215b539297bf596c46ae22f95a3eff45","last_reissued_at":"2026-05-17T23:53:19.188289Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:19.188289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.6619","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-17T23:53:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1RbeC36L1mQAXUCzobWF5MISNS7umV/cn+WefhEOKd6NjmHnV4K/3yd0MA18Jalv2vIgfAJpGHnyz5KU3gpjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:07:53.248023Z"},"content_sha256":"f448621b7c58989bb8c46aa4b2cb58404e38bfa6c66227c09336e44b5bfe29a5","schema_version":"1.0","event_id":"sha256:f448621b7c58989bb8c46aa4b2cb58404e38bfa6c66227c09336e44b5bfe29a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EWBGMIJASMTHGDYGKQIVGOTSMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Bounds for Edge-Cover by Random Walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Agelos Georgakopoulos, Peter Winkler","submitted_at":"2011-09-29T18:53:16Z","abstract_excerpt":"We show that the expected time for a random walk on a (multi-)graph $G$ to traverse all $m$ edges of $G$, and return to its starting point, is at most $2m^2$; if each edge must be traversed in both directions, the bound is $3m^2$. Both bounds are tight and may be applied to graphs with arbitrary edge lengths, with implications for Brownian motion on a finite or infinite network of total edge-length $m$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6619","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-17T23:53:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4rMI15iOxe2vwuW4N0qoH32CCrTUBAA9l+dQ+k8X9tiesgeTlsdI8WyKg3aNfdflC6tAX3OiIA6y0HQyFLvICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:07:53.248689Z"},"content_sha256":"c23a51adc5e186a35cc1a55a44c9db9a66ab75cd6a9d987ac1538c88ca5df0af","schema_version":"1.0","event_id":"sha256:c23a51adc5e186a35cc1a55a44c9db9a66ab75cd6a9d987ac1538c88ca5df0af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWBGMIJASMTHGDYGKQIVGOTSMM/bundle.json","state_url":"https://pith.science/pith/EWBGMIJASMTHGDYGKQIVGOTSMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWBGMIJASMTHGDYGKQIVGOTSMM/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-11T21:07:53Z","links":{"resolver":"https://pith.science/pith/EWBGMIJASMTHGDYGKQIVGOTSMM","bundle":"https://pith.science/pith/EWBGMIJASMTHGDYGKQIVGOTSMM/bundle.json","state":"https://pith.science/pith/EWBGMIJASMTHGDYGKQIVGOTSMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWBGMIJASMTHGDYGKQIVGOTSMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EWBGMIJASMTHGDYGKQIVGOTSMM","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":"464637890e29d5791f87ba7b97ee85a3faf551b10f9e719cda57a18fe60f4215","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-29T18:53:16Z","title_canon_sha256":"255d3457dc2df9eb09824740febea617636da1c0a5cb707eb0bb0497d372ef63"},"schema_version":"1.0","source":{"id":"1109.6619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6619","created_at":"2026-05-17T23:53:19Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6619v1","created_at":"2026-05-17T23:53:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6619","created_at":"2026-05-17T23:53:19Z"},{"alias_kind":"pith_short_12","alias_value":"EWBGMIJASMTH","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EWBGMIJASMTHGDYG","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EWBGMIJA","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:c23a51adc5e186a35cc1a55a44c9db9a66ab75cd6a9d987ac1538c88ca5df0af","target":"graph","created_at":"2026-05-17T23:53:19Z","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 show that the expected time for a random walk on a (multi-)graph $G$ to traverse all $m$ edges of $G$, and return to its starting point, is at most $2m^2$; if each edge must be traversed in both directions, the bound is $3m^2$. Both bounds are tight and may be applied to graphs with arbitrary edge lengths, with implications for Brownian motion on a finite or infinite network of total edge-length $m$.","authors_text":"Agelos Georgakopoulos, Peter Winkler","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-29T18:53:16Z","title":"New Bounds for Edge-Cover by Random Walk"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6619","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:f448621b7c58989bb8c46aa4b2cb58404e38bfa6c66227c09336e44b5bfe29a5","target":"record","created_at":"2026-05-17T23:53:19Z","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":"464637890e29d5791f87ba7b97ee85a3faf551b10f9e719cda57a18fe60f4215","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-29T18:53:16Z","title_canon_sha256":"255d3457dc2df9eb09824740febea617636da1c0a5cb707eb0bb0497d372ef63"},"schema_version":"1.0","source":{"id":"1109.6619","kind":"arxiv","version":1}},"canonical_sha256":"25826621209326730f065411533a7263215b539297bf596c46ae22f95a3eff45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25826621209326730f065411533a7263215b539297bf596c46ae22f95a3eff45","first_computed_at":"2026-05-17T23:53:19.188289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:19.188289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TL2Rsw+U8SJsTtd0zFBZGqzzolqsM5FHSyl4ZWk6+01r49r05QzmSaOx71yDK24JaSBkMdCmQdXSjF2g0Ke/BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:19.188824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f448621b7c58989bb8c46aa4b2cb58404e38bfa6c66227c09336e44b5bfe29a5","sha256:c23a51adc5e186a35cc1a55a44c9db9a66ab75cd6a9d987ac1538c88ca5df0af"],"state_sha256":"2a0dc0ed1d335084244befc1a92c89061e29b0ac7d895b75f126c53b37d53e7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1J/yxRjzj6slatS4lwaNfCV39+nzUT1gwqJ5t7vvrlQTtIqjLotL8aw8uj9LvIyOQmMMjyVnn5ho7UuCaPlvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:07:53.252258Z","bundle_sha256":"cea64149d3486a4f14bf7d1d4feabe2d7b93810b7c5cc9190c00c82158bb7854"}}