{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FAU3P55RZCFPEZ4BKLAFFAXNYW","short_pith_number":"pith:FAU3P55R","canonical_record":{"source":{"id":"1702.03189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-10T14:38:33Z","cross_cats_sorted":[],"title_canon_sha256":"809c2feab2cf2a561932c05d2eab06b1d4b63225a85bb217ba5109813c71bf01","abstract_canon_sha256":"dc52ad97eac55ca9cc2e7f572439f7a874a6b5e387f998d22f6709cbda375216"},"schema_version":"1.0"},"canonical_sha256":"2829b7f7b1c88af2678152c05282edc595c6ecfe2a997904c93e13e90d1d17eb","source":{"kind":"arxiv","id":"1702.03189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03189","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03189v1","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03189","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"FAU3P55RZCFP","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FAU3P55RZCFPEZ4B","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FAU3P55R","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FAU3P55RZCFPEZ4BKLAFFAXNYW","target":"record","payload":{"canonical_record":{"source":{"id":"1702.03189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-10T14:38:33Z","cross_cats_sorted":[],"title_canon_sha256":"809c2feab2cf2a561932c05d2eab06b1d4b63225a85bb217ba5109813c71bf01","abstract_canon_sha256":"dc52ad97eac55ca9cc2e7f572439f7a874a6b5e387f998d22f6709cbda375216"},"schema_version":"1.0"},"canonical_sha256":"2829b7f7b1c88af2678152c05282edc595c6ecfe2a997904c93e13e90d1d17eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:58.504957Z","signature_b64":"KNaVhgkgpHJYhI+Z465JIX8e+VxxrYAThuHIQLk/keFdvnZTnWm2X6mSFuC2YR/Syez1PExTXAenhza7p6jFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2829b7f7b1c88af2678152c05282edc595c6ecfe2a997904c93e13e90d1d17eb","last_reissued_at":"2026-05-18T00:50:58.504405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:58.504405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.03189","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:50:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zY5D3+RkkMCJz0hhJHqFbyGdYGQmb9tX1iDQDep+i660MjLkmpiLavI++1qckm/DwikcPodh0Ks8gZ2OOpwcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:31:33.929849Z"},"content_sha256":"8b7b1c4a4b38017c87e61cae2dc497a9fc8674927847a09698916464828ef2d1","schema_version":"1.0","event_id":"sha256:8b7b1c4a4b38017c87e61cae2dc497a9fc8674927847a09698916464828ef2d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FAU3P55RZCFPEZ4BKLAFFAXNYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Barrier estimates for a critical Galton--Watson process and the cover time of the binary tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David Belius, Jay Rosen, Ofer Zeitouni","submitted_at":"2017-02-10T14:38:33Z","abstract_excerpt":"For the critical Galton--Watson process with geometric offspring distributions we provide sharp barrier estimates for barriers which are (small) perturbations of linear barriers. These are useful in analyzing the cover time of finite graphs in the critical regime by random walk, and the Brownian cover times of compact two dimensional manifolds. As an application of the barrier estimates, we prove that if $C_L$ denotes the cover time of the binary tree of depth $L$ by simple walk, then $\\sqrt{C_L/2^{L+1}} -\\sqrt{2\\log 2} L+\\log L/\\sqrt{2\\log 2}$ is tight. The latter improves results of Aldous ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03189","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:50:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"potftUQ47EiGziyijLqhXlsLOtaIgp/ujSFLzuVJfZYM+f5LoIejer9egVLRYEejnwWtRGA45wzymyZREhdKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:31:33.930184Z"},"content_sha256":"3eca73d09a6ec88d8700ed0a89d67ad0b769e0f600bc7f6417a287ed0ac5b81c","schema_version":"1.0","event_id":"sha256:3eca73d09a6ec88d8700ed0a89d67ad0b769e0f600bc7f6417a287ed0ac5b81c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FAU3P55RZCFPEZ4BKLAFFAXNYW/bundle.json","state_url":"https://pith.science/pith/FAU3P55RZCFPEZ4BKLAFFAXNYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FAU3P55RZCFPEZ4BKLAFFAXNYW/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-27T03:31:33Z","links":{"resolver":"https://pith.science/pith/FAU3P55RZCFPEZ4BKLAFFAXNYW","bundle":"https://pith.science/pith/FAU3P55RZCFPEZ4BKLAFFAXNYW/bundle.json","state":"https://pith.science/pith/FAU3P55RZCFPEZ4BKLAFFAXNYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FAU3P55RZCFPEZ4BKLAFFAXNYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FAU3P55RZCFPEZ4BKLAFFAXNYW","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":"dc52ad97eac55ca9cc2e7f572439f7a874a6b5e387f998d22f6709cbda375216","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-10T14:38:33Z","title_canon_sha256":"809c2feab2cf2a561932c05d2eab06b1d4b63225a85bb217ba5109813c71bf01"},"schema_version":"1.0","source":{"id":"1702.03189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03189","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03189v1","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03189","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"FAU3P55RZCFP","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FAU3P55RZCFPEZ4B","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FAU3P55R","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:3eca73d09a6ec88d8700ed0a89d67ad0b769e0f600bc7f6417a287ed0ac5b81c","target":"graph","created_at":"2026-05-18T00:50:58Z","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":"For the critical Galton--Watson process with geometric offspring distributions we provide sharp barrier estimates for barriers which are (small) perturbations of linear barriers. These are useful in analyzing the cover time of finite graphs in the critical regime by random walk, and the Brownian cover times of compact two dimensional manifolds. As an application of the barrier estimates, we prove that if $C_L$ denotes the cover time of the binary tree of depth $L$ by simple walk, then $\\sqrt{C_L/2^{L+1}} -\\sqrt{2\\log 2} L+\\log L/\\sqrt{2\\log 2}$ is tight. The latter improves results of Aldous (","authors_text":"David Belius, Jay Rosen, Ofer Zeitouni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-10T14:38:33Z","title":"Barrier estimates for a critical Galton--Watson process and the cover time of the binary tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03189","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:8b7b1c4a4b38017c87e61cae2dc497a9fc8674927847a09698916464828ef2d1","target":"record","created_at":"2026-05-18T00:50:58Z","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":"dc52ad97eac55ca9cc2e7f572439f7a874a6b5e387f998d22f6709cbda375216","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-10T14:38:33Z","title_canon_sha256":"809c2feab2cf2a561932c05d2eab06b1d4b63225a85bb217ba5109813c71bf01"},"schema_version":"1.0","source":{"id":"1702.03189","kind":"arxiv","version":1}},"canonical_sha256":"2829b7f7b1c88af2678152c05282edc595c6ecfe2a997904c93e13e90d1d17eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2829b7f7b1c88af2678152c05282edc595c6ecfe2a997904c93e13e90d1d17eb","first_computed_at":"2026-05-18T00:50:58.504405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:58.504405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KNaVhgkgpHJYhI+Z465JIX8e+VxxrYAThuHIQLk/keFdvnZTnWm2X6mSFuC2YR/Syez1PExTXAenhza7p6jFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:58.504957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b7b1c4a4b38017c87e61cae2dc497a9fc8674927847a09698916464828ef2d1","sha256:3eca73d09a6ec88d8700ed0a89d67ad0b769e0f600bc7f6417a287ed0ac5b81c"],"state_sha256":"996df1140cc93fe2a54e87f13a7b21b3316e8994a3e1369fdf86b2107894570c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tgv0NJkWCvC4GqD9HSo+Cp5TZKS4AbomFLUDxqRSfX7JyyX4OBI7+ajl7Geoc799juMxCI4+HEiXDWXah7oqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:31:33.932059Z","bundle_sha256":"d4b2456941cf30c176613d89720388037472d742b387ac31420c4b675bb1e07e"}}