{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CRRIHP2JHZOEPNGOACEFITG5SP","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":"d691d6f1e3f243754ceaa3576ccd3c5dcc5a0d74bc12a3e9b2079141accf0bf0","cross_cats_sorted":["cs.SI","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T18:57:40Z","title_canon_sha256":"994a887142297285cf16c861d0f895e4a184f85e812f870fc46f9261904601e7"},"schema_version":"1.0","source":{"id":"2411.18614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.18614","created_at":"2026-07-05T09:41:24Z"},{"alias_kind":"arxiv_version","alias_value":"2411.18614v1","created_at":"2026-07-05T09:41:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18614","created_at":"2026-07-05T09:41:24Z"},{"alias_kind":"pith_short_12","alias_value":"CRRIHP2JHZOE","created_at":"2026-07-05T09:41:24Z"},{"alias_kind":"pith_short_16","alias_value":"CRRIHP2JHZOEPNGO","created_at":"2026-07-05T09:41:24Z"},{"alias_kind":"pith_short_8","alias_value":"CRRIHP2J","created_at":"2026-07-05T09:41:24Z"}],"graph_snapshots":[{"event_id":"sha256:ff6365b67fb91e58834307717a3bf9a0fa7168e850a596e50e75efebd73681aa","target":"graph","created_at":"2026-07-05T09:41:24Z","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/2411.18614/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider root-finding algorithms for random rooted trees grown by uniform attachment. Given an unlabeled copy of the tree and a target accuracy $\\varepsilon > 0$, such an algorithm outputs a set of nodes that contains the root with probability at least $1 - \\varepsilon$. We prove that, for the optimal algorithm, an output set of size $\\exp(O(\\log^{1/2}(1/\\varepsilon)))$ suffices; this bound is sharp and answers a question of Bubeck, Devroye and Lugosi (2017). We prove similar bounds for random regular trees that grow by uniform attachment, strengthening a result of Khim and Loh (2017).","authors_text":"Catherine Fontaine, Louigi Addario-Berry, Louis-Roy Langevin, Robin Khanfir, Simone T\\^etu","cross_cats":["cs.SI","math.PR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T18:57:40Z","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18614","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:97a72cd1e5e9417b181dbae102242a5027cd6a6fa54ad7d3f8dfd3dd03c57ea3","target":"record","created_at":"2026-07-05T09:41:24Z","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":"d691d6f1e3f243754ceaa3576ccd3c5dcc5a0d74bc12a3e9b2079141accf0bf0","cross_cats_sorted":["cs.SI","math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T18:57:40Z","title_canon_sha256":"994a887142297285cf16c861d0f895e4a184f85e812f870fc46f9261904601e7"},"schema_version":"1.0","source":{"id":"2411.18614","kind":"arxiv","version":1}},"canonical_sha256":"146283bf493e5c47b4ce0088544cdd93da182ebb5dbfe06eb610809d60781c0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"146283bf493e5c47b4ce0088544cdd93da182ebb5dbfe06eb610809d60781c0f","first_computed_at":"2026-07-05T09:41:24.105527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:24.105527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/UExxI4oO3cWmXcPl7O8nB9ez+m4ueygy0pFbUVduYDFeMxNDYyfWnEZ1J7YPYD0/rM+x60r5BizpVJxfmqoAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:24.106015Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.18614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97a72cd1e5e9417b181dbae102242a5027cd6a6fa54ad7d3f8dfd3dd03c57ea3","sha256:ff6365b67fb91e58834307717a3bf9a0fa7168e850a596e50e75efebd73681aa"],"state_sha256":"fd78c7ecbc3ce0c6906a277a4320e4608290019d8b7cae763a5031ef19e7bf33"}