{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:F4IOPQRFMIJ4YKVSDYNBDR3FHL","short_pith_number":"pith:F4IOPQRF","canonical_record":{"source":{"id":"1309.6360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-24T22:33:09Z","cross_cats_sorted":[],"title_canon_sha256":"930b1c6e46cd129cd5529b557b1f1fa49902084cf83df358d47413ccbd83c6ad","abstract_canon_sha256":"50bcc30ff245c143df5ff80987a55aea7223e5c9f6d7b7d0d7ccd1e9e1a8ffe8"},"schema_version":"1.0"},"canonical_sha256":"2f10e7c2256213cc2ab21e1a11c7653af44fcf8aed7b2be2082bd3ec408a47f7","source":{"kind":"arxiv","id":"1309.6360","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6360","created_at":"2026-05-18T03:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6360v1","created_at":"2026-05-18T03:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6360","created_at":"2026-05-18T03:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"F4IOPQRFMIJ4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F4IOPQRFMIJ4YKVS","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F4IOPQRF","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:F4IOPQRFMIJ4YKVSDYNBDR3FHL","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-24T22:33:09Z","cross_cats_sorted":[],"title_canon_sha256":"930b1c6e46cd129cd5529b557b1f1fa49902084cf83df358d47413ccbd83c6ad","abstract_canon_sha256":"50bcc30ff245c143df5ff80987a55aea7223e5c9f6d7b7d0d7ccd1e9e1a8ffe8"},"schema_version":"1.0"},"canonical_sha256":"2f10e7c2256213cc2ab21e1a11c7653af44fcf8aed7b2be2082bd3ec408a47f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:21.466241Z","signature_b64":"Y8kr2CG42Y0Lxg/1r4VzGvg26GQCePwmFReQOmneOEIXA7Z7lB1P9vFMtmVt8NeML+1gV+XMyG3GuwsPle/oCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f10e7c2256213cc2ab21e1a11c7653af44fcf8aed7b2be2082bd3ec408a47f7","last_reissued_at":"2026-05-18T03:12:21.465520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:21.465520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6360","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-18T03:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/A9oSPmWX734Vtz6bRX9jFnO5QUFquSPj1em6Fv9QvwYxHbcxacyPGJrOqOFshcmKV3JisV4EPNkBR0KOyfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:07:03.805828Z"},"content_sha256":"0585a130513bdcc2f9f7031dfd36ee00921e41adb69faf4ecc00aa55090adc3b","schema_version":"1.0","event_id":"sha256:0585a130513bdcc2f9f7031dfd36ee00921e41adb69faf4ecc00aa55090adc3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:F4IOPQRFMIJ4YKVSDYNBDR3FHL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The range of a random walk on a comb","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"G\\'abor Tardos, J\\'anos Pach","submitted_at":"2013-09-24T22:33:09Z","abstract_excerpt":"The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of the neighbors of v, each with probability 1/d(v), where d(v) denotes the degree of v. We answer a question of Cs\\'aki, Cs\\\"org\\\"o, F\\\"oldes, R\\'ev\\'esz, and Tusn\\'ady by showing that the expected number of vertices visited by a random walk on the comb after n steps is (1/(2\\sqrt{2\\pi})+o(1))\\sqrt n\\log n. This contradicts a claim of Weiss and Havlin."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6360","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-18T03:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tnOhjD5yGL9+nGk57OJjVL8Nq7YovtOEBQtT5irOL0R2gc5stxjAqNF79SgIeu5BAgBmrtTqo1a4O9ITvVIaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:07:03.806510Z"},"content_sha256":"fde093a8ab62a2ce4b9f9895ce1d900878bb42923ba12e2e76431e478c378681","schema_version":"1.0","event_id":"sha256:fde093a8ab62a2ce4b9f9895ce1d900878bb42923ba12e2e76431e478c378681"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4IOPQRFMIJ4YKVSDYNBDR3FHL/bundle.json","state_url":"https://pith.science/pith/F4IOPQRFMIJ4YKVSDYNBDR3FHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4IOPQRFMIJ4YKVSDYNBDR3FHL/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-06T19:07:03Z","links":{"resolver":"https://pith.science/pith/F4IOPQRFMIJ4YKVSDYNBDR3FHL","bundle":"https://pith.science/pith/F4IOPQRFMIJ4YKVSDYNBDR3FHL/bundle.json","state":"https://pith.science/pith/F4IOPQRFMIJ4YKVSDYNBDR3FHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4IOPQRFMIJ4YKVSDYNBDR3FHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:F4IOPQRFMIJ4YKVSDYNBDR3FHL","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":"50bcc30ff245c143df5ff80987a55aea7223e5c9f6d7b7d0d7ccd1e9e1a8ffe8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-24T22:33:09Z","title_canon_sha256":"930b1c6e46cd129cd5529b557b1f1fa49902084cf83df358d47413ccbd83c6ad"},"schema_version":"1.0","source":{"id":"1309.6360","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6360","created_at":"2026-05-18T03:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6360v1","created_at":"2026-05-18T03:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6360","created_at":"2026-05-18T03:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"F4IOPQRFMIJ4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F4IOPQRFMIJ4YKVS","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F4IOPQRF","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:fde093a8ab62a2ce4b9f9895ce1d900878bb42923ba12e2e76431e478c378681","target":"graph","created_at":"2026-05-18T03:12:21Z","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":"The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of the neighbors of v, each with probability 1/d(v), where d(v) denotes the degree of v. We answer a question of Cs\\'aki, Cs\\\"org\\\"o, F\\\"oldes, R\\'ev\\'esz, and Tusn\\'ady by showing that the expected number of vertices visited by a random walk on the comb after n steps is (1/(2\\sqrt{2\\pi})+o(1))\\sqrt n\\log n. This contradicts a claim of Weiss and Havlin.","authors_text":"G\\'abor Tardos, J\\'anos Pach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-24T22:33:09Z","title":"The range of a random walk on a comb"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6360","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:0585a130513bdcc2f9f7031dfd36ee00921e41adb69faf4ecc00aa55090adc3b","target":"record","created_at":"2026-05-18T03:12:21Z","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":"50bcc30ff245c143df5ff80987a55aea7223e5c9f6d7b7d0d7ccd1e9e1a8ffe8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-09-24T22:33:09Z","title_canon_sha256":"930b1c6e46cd129cd5529b557b1f1fa49902084cf83df358d47413ccbd83c6ad"},"schema_version":"1.0","source":{"id":"1309.6360","kind":"arxiv","version":1}},"canonical_sha256":"2f10e7c2256213cc2ab21e1a11c7653af44fcf8aed7b2be2082bd3ec408a47f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f10e7c2256213cc2ab21e1a11c7653af44fcf8aed7b2be2082bd3ec408a47f7","first_computed_at":"2026-05-18T03:12:21.465520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:21.465520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y8kr2CG42Y0Lxg/1r4VzGvg26GQCePwmFReQOmneOEIXA7Z7lB1P9vFMtmVt8NeML+1gV+XMyG3GuwsPle/oCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:21.466241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6360","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0585a130513bdcc2f9f7031dfd36ee00921e41adb69faf4ecc00aa55090adc3b","sha256:fde093a8ab62a2ce4b9f9895ce1d900878bb42923ba12e2e76431e478c378681"],"state_sha256":"4d4565d08fee2abc839f550fbf27534ea005eb2438406056e0d8dde42fc7e304"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQSqFkJW893btSUC8GSCpz2fDpMPQBVQXg9dk7Eh/CQdlpApHU2OF1Ru2FdeqJsKJhWsk2JcDSrIgEDrdj8VBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:07:03.810058Z","bundle_sha256":"31420f78fd07a9cd482dcb679ed940abc9a688ad09cce673cd49bb5d8a7ca31e"}}