{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CRRIHP2JHZOEPNGOACEFITG5SP","short_pith_number":"pith:CRRIHP2J","schema_version":"1.0","canonical_sha256":"146283bf493e5c47b4ce0088544cdd93da182ebb5dbfe06eb610809d60781c0f","source":{"kind":"arxiv","id":"2411.18614","version":1},"attestation_state":"computed","paper":{"title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.PR","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Catherine Fontaine, Louigi Addario-Berry, Louis-Roy Langevin, Robin Khanfir, Simone T\\^etu","submitted_at":"2024-11-27T18:57:40Z","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)."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.18614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T18:57:40Z","cross_cats_sorted":["cs.SI","math.PR","math.ST","stat.TH"],"title_canon_sha256":"994a887142297285cf16c861d0f895e4a184f85e812f870fc46f9261904601e7","abstract_canon_sha256":"d691d6f1e3f243754ceaa3576ccd3c5dcc5a0d74bc12a3e9b2079141accf0bf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:24.106015Z","signature_b64":"/UExxI4oO3cWmXcPl7O8nB9ez+m4ueygy0pFbUVduYDFeMxNDYyfWnEZ1J7YPYD0/rM+x60r5BizpVJxfmqoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"146283bf493e5c47b4ce0088544cdd93da182ebb5dbfe06eb610809d60781c0f","last_reissued_at":"2026-07-05T09:41:24.105527Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:24.105527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.PR","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Catherine Fontaine, Louigi Addario-Berry, Louis-Roy Langevin, Robin Khanfir, Simone T\\^etu","submitted_at":"2024-11-27T18:57:40Z","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)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18614","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.18614/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.18614","created_at":"2026-07-05T09:41:24.105587+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.18614v1","created_at":"2026-07-05T09:41:24.105587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18614","created_at":"2026-07-05T09:41:24.105587+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRRIHP2JHZOE","created_at":"2026-07-05T09:41:24.105587+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRRIHP2JHZOEPNGO","created_at":"2026-07-05T09:41:24.105587+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRRIHP2J","created_at":"2026-07-05T09:41:24.105587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.24465","citing_title":"History estimation in random recursive trees: Pointwise approach via iterated Jordan centralities","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2606.02472","citing_title":"Correlated uniform attachment trees","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CRRIHP2JHZOEPNGOACEFITG5SP","json":"https://pith.science/pith/CRRIHP2JHZOEPNGOACEFITG5SP.json","graph_json":"https://pith.science/api/pith-number/CRRIHP2JHZOEPNGOACEFITG5SP/graph.json","events_json":"https://pith.science/api/pith-number/CRRIHP2JHZOEPNGOACEFITG5SP/events.json","paper":"https://pith.science/paper/CRRIHP2J"},"agent_actions":{"view_html":"https://pith.science/pith/CRRIHP2JHZOEPNGOACEFITG5SP","download_json":"https://pith.science/pith/CRRIHP2JHZOEPNGOACEFITG5SP.json","view_paper":"https://pith.science/paper/CRRIHP2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.18614&json=true","fetch_graph":"https://pith.science/api/pith-number/CRRIHP2JHZOEPNGOACEFITG5SP/graph.json","fetch_events":"https://pith.science/api/pith-number/CRRIHP2JHZOEPNGOACEFITG5SP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRRIHP2JHZOEPNGOACEFITG5SP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRRIHP2JHZOEPNGOACEFITG5SP/action/storage_attestation","attest_author":"https://pith.science/pith/CRRIHP2JHZOEPNGOACEFITG5SP/action/author_attestation","sign_citation":"https://pith.science/pith/CRRIHP2JHZOEPNGOACEFITG5SP/action/citation_signature","submit_replication":"https://pith.science/pith/CRRIHP2JHZOEPNGOACEFITG5SP/action/replication_record"}},"created_at":"2026-07-05T09:41:24.105587+00:00","updated_at":"2026-07-05T09:41:24.105587+00:00"}