{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FY7CCH7VLAHGPS2AGIZMRABQ2F","short_pith_number":"pith:FY7CCH7V","canonical_record":{"source":{"id":"1905.07652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-05-18T22:10:14Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"ca7ff41e77089ace629cc234d85321dfac2718cf64c633705d734ea92d39483a","abstract_canon_sha256":"106983856a848442270fadec1fc83c0de350b203b3f67f15faba4b9631d6a0cb"},"schema_version":"1.0"},"canonical_sha256":"2e3e211ff5580e67cb403232c88030d1648b2bf3d2fb78a28dc363f635ff22fa","source":{"kind":"arxiv","id":"1905.07652","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07652","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07652v1","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07652","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"FY7CCH7VLAHG","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"FY7CCH7VLAHGPS2A","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"FY7CCH7V","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FY7CCH7VLAHGPS2AGIZMRABQ2F","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-05-18T22:10:14Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"ca7ff41e77089ace629cc234d85321dfac2718cf64c633705d734ea92d39483a","abstract_canon_sha256":"106983856a848442270fadec1fc83c0de350b203b3f67f15faba4b9631d6a0cb"},"schema_version":"1.0"},"canonical_sha256":"2e3e211ff5580e67cb403232c88030d1648b2bf3d2fb78a28dc363f635ff22fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:48.946606Z","signature_b64":"EIEMUD73F0OP0wX3dOFdyvmBooQXphU42hlnbcW6WePanV3UnuYI9JTsOzepAxcscRgxY4o3kQEwjvOuIypaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e3e211ff5580e67cb403232c88030d1648b2bf3d2fb78a28dc363f635ff22fa","last_reissued_at":"2026-05-17T23:45:48.945936Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:48.945936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07652","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:45:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZKk2J+iuBfzQZ08ItNvnp9NvJFGPW8YAd1m5+yLRcHnQu8quFbM0/nv3uHNOObHo62GxMQVxFYrPnhvejY67AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:01:55.919184Z"},"content_sha256":"46981c3fe150068afd6023704234208f8f9e8bea891ca5ee2b5d134a86160648","schema_version":"1.0","event_id":"sha256:46981c3fe150068afd6023704234208f8f9e8bea891ca5ee2b5d134a86160648"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FY7CCH7VLAHGPS2AGIZMRABQ2F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a Tail Bound for Root-Finding in Randomly Growing Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"N. D. Shyamalkumar, Sam Justice","submitted_at":"2019-05-18T22:10:14Z","abstract_excerpt":"We re-examine a lower-tail upper bound for the random variable $$X=\\prod_{i=1}^{\\infty}\\min\\left\\{\\sum_{k=1}^iE_k,1\\right\\},$$ where $E_1,E_2,\\ldots\\stackrel{iid}\\sim\\text{Exp}(1)$. This bound has found use in root-finding and seed-finding algorithms for randomly growing trees, and was initially proved as a lemma in the context of the uniform attachment tree model. We first show that $X$ has a useful representation as a compound product of uniform random variables that allows us to determine its moments and refine the existing nonasymptotic bound. Next we demonstrate that the lower-tail probab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07652","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:45:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQ0TLiMKf1EvGlsJeqJOQ5PKrvXUIwPgdw+FJgc2Oty/UjyPeQW+ETxl292X3W4YsrmjfRWPUbMHpMaPt+0pBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:01:55.919867Z"},"content_sha256":"6549fd5c36c1adf8cce12fd4797dc0c946c970917942dfb4e65adc772e37f2ea","schema_version":"1.0","event_id":"sha256:6549fd5c36c1adf8cce12fd4797dc0c946c970917942dfb4e65adc772e37f2ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FY7CCH7VLAHGPS2AGIZMRABQ2F/bundle.json","state_url":"https://pith.science/pith/FY7CCH7VLAHGPS2AGIZMRABQ2F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FY7CCH7VLAHGPS2AGIZMRABQ2F/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-11T18:01:55Z","links":{"resolver":"https://pith.science/pith/FY7CCH7VLAHGPS2AGIZMRABQ2F","bundle":"https://pith.science/pith/FY7CCH7VLAHGPS2AGIZMRABQ2F/bundle.json","state":"https://pith.science/pith/FY7CCH7VLAHGPS2AGIZMRABQ2F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FY7CCH7VLAHGPS2AGIZMRABQ2F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FY7CCH7VLAHGPS2AGIZMRABQ2F","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":"106983856a848442270fadec1fc83c0de350b203b3f67f15faba4b9631d6a0cb","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-05-18T22:10:14Z","title_canon_sha256":"ca7ff41e77089ace629cc234d85321dfac2718cf64c633705d734ea92d39483a"},"schema_version":"1.0","source":{"id":"1905.07652","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07652","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07652v1","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07652","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"FY7CCH7VLAHG","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"FY7CCH7VLAHGPS2A","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"FY7CCH7V","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:6549fd5c36c1adf8cce12fd4797dc0c946c970917942dfb4e65adc772e37f2ea","target":"graph","created_at":"2026-05-17T23:45:48Z","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 re-examine a lower-tail upper bound for the random variable $$X=\\prod_{i=1}^{\\infty}\\min\\left\\{\\sum_{k=1}^iE_k,1\\right\\},$$ where $E_1,E_2,\\ldots\\stackrel{iid}\\sim\\text{Exp}(1)$. This bound has found use in root-finding and seed-finding algorithms for randomly growing trees, and was initially proved as a lemma in the context of the uniform attachment tree model. We first show that $X$ has a useful representation as a compound product of uniform random variables that allows us to determine its moments and refine the existing nonasymptotic bound. Next we demonstrate that the lower-tail probab","authors_text":"N. D. Shyamalkumar, Sam Justice","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-05-18T22:10:14Z","title":"On a Tail Bound for Root-Finding in Randomly Growing Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07652","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:46981c3fe150068afd6023704234208f8f9e8bea891ca5ee2b5d134a86160648","target":"record","created_at":"2026-05-17T23:45:48Z","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":"106983856a848442270fadec1fc83c0de350b203b3f67f15faba4b9631d6a0cb","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-05-18T22:10:14Z","title_canon_sha256":"ca7ff41e77089ace629cc234d85321dfac2718cf64c633705d734ea92d39483a"},"schema_version":"1.0","source":{"id":"1905.07652","kind":"arxiv","version":1}},"canonical_sha256":"2e3e211ff5580e67cb403232c88030d1648b2bf3d2fb78a28dc363f635ff22fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e3e211ff5580e67cb403232c88030d1648b2bf3d2fb78a28dc363f635ff22fa","first_computed_at":"2026-05-17T23:45:48.945936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:48.945936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EIEMUD73F0OP0wX3dOFdyvmBooQXphU42hlnbcW6WePanV3UnuYI9JTsOzepAxcscRgxY4o3kQEwjvOuIypaCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:48.946606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07652","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46981c3fe150068afd6023704234208f8f9e8bea891ca5ee2b5d134a86160648","sha256:6549fd5c36c1adf8cce12fd4797dc0c946c970917942dfb4e65adc772e37f2ea"],"state_sha256":"2926e5a194d2e2dca01cc83ff94039907e08f59478347c5ea1eba40c31e1e1f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1VesVbPM8/b0jam2vrgiIQkLLW4scTzmXnNG5HP/6rJHYMb/aif7v+90lLiaH1S3CpumwwPpbCf2luhxCdQkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T18:01:55.923033Z","bundle_sha256":"a900cf7c156cf53bdc20c6f64a99c099c931b3f7dc8d6f9d62dc72a8c33ef037"}}