{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SILHALJCFTLP3W5BX5SM765RK2","short_pith_number":"pith:SILHALJC","schema_version":"1.0","canonical_sha256":"9216702d222cd6fddba1bf64cffbb1569e98f61309e860bb9e3a7b05fa7c94ea","source":{"kind":"arxiv","id":"2403.09755","version":3},"attestation_state":"computed","paper":{"title":"Estimating the history of a random recursive tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Christophe Giraud, D\\'eborah Sulem, G\\'abor Lugosi, Simon Briend","submitted_at":"2024-03-14T14:02:00Z","abstract_excerpt":"This paper studies the problem of estimating the order of arrival of the vertices in a random recursive tree. Specifically, we study two fundamental models: the uniform attachment model and the linear preferential attachment model. We propose an order estimator based on the Jordan centrality measure and define a family of risk measures to quantify the quality of the ordering procedure. Moreover, we establish a minimax lower bound for this problem, and prove that the proposed estimator is nearly optimal. Finally, we numerically demonstrate that the proposed estimator outperforms degree-based an"},"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":"2403.09755","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-03-14T14:02:00Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"ead228ee55749d233fc6b92b320aa96ab0a0a0de39e4b4effbaf2bf0fd192a9b","abstract_canon_sha256":"f7602ce2486e34621bb5785df08f79bc83d9d98d93df1cb03df5a49bd69e6f76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:49:41.745637Z","signature_b64":"s798bNfnN7OX5g8mIgZSBdRpga9YzU6lzGBn3SUjqUOG8upgsDeVWJ9lAnkU2QHfiitoLlPJS5S6r7JsjyQQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9216702d222cd6fddba1bf64cffbb1569e98f61309e860bb9e3a7b05fa7c94ea","last_reissued_at":"2026-07-05T09:49:41.745138Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:49:41.745138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating the history of a random recursive tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Christophe Giraud, D\\'eborah Sulem, G\\'abor Lugosi, Simon Briend","submitted_at":"2024-03-14T14:02:00Z","abstract_excerpt":"This paper studies the problem of estimating the order of arrival of the vertices in a random recursive tree. Specifically, we study two fundamental models: the uniform attachment model and the linear preferential attachment model. We propose an order estimator based on the Jordan centrality measure and define a family of risk measures to quantify the quality of the ordering procedure. Moreover, we establish a minimax lower bound for this problem, and prove that the proposed estimator is nearly optimal. Finally, we numerically demonstrate that the proposed estimator outperforms degree-based an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.09755","kind":"arxiv","version":3},"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/2403.09755/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":"2403.09755","created_at":"2026-07-05T09:49:41.745192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.09755v3","created_at":"2026-07-05T09:49:41.745192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.09755","created_at":"2026-07-05T09:49:41.745192+00:00"},{"alias_kind":"pith_short_12","alias_value":"SILHALJCFTLP","created_at":"2026-07-05T09:49:41.745192+00:00"},{"alias_kind":"pith_short_16","alias_value":"SILHALJCFTLP3W5B","created_at":"2026-07-05T09:49:41.745192+00:00"},{"alias_kind":"pith_short_8","alias_value":"SILHALJC","created_at":"2026-07-05T09:49:41.745192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SILHALJCFTLP3W5BX5SM765RK2","json":"https://pith.science/pith/SILHALJCFTLP3W5BX5SM765RK2.json","graph_json":"https://pith.science/api/pith-number/SILHALJCFTLP3W5BX5SM765RK2/graph.json","events_json":"https://pith.science/api/pith-number/SILHALJCFTLP3W5BX5SM765RK2/events.json","paper":"https://pith.science/paper/SILHALJC"},"agent_actions":{"view_html":"https://pith.science/pith/SILHALJCFTLP3W5BX5SM765RK2","download_json":"https://pith.science/pith/SILHALJCFTLP3W5BX5SM765RK2.json","view_paper":"https://pith.science/paper/SILHALJC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.09755&json=true","fetch_graph":"https://pith.science/api/pith-number/SILHALJCFTLP3W5BX5SM765RK2/graph.json","fetch_events":"https://pith.science/api/pith-number/SILHALJCFTLP3W5BX5SM765RK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SILHALJCFTLP3W5BX5SM765RK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SILHALJCFTLP3W5BX5SM765RK2/action/storage_attestation","attest_author":"https://pith.science/pith/SILHALJCFTLP3W5BX5SM765RK2/action/author_attestation","sign_citation":"https://pith.science/pith/SILHALJCFTLP3W5BX5SM765RK2/action/citation_signature","submit_replication":"https://pith.science/pith/SILHALJCFTLP3W5BX5SM765RK2/action/replication_record"}},"created_at":"2026-07-05T09:49:41.745192+00:00","updated_at":"2026-07-05T09:49:41.745192+00:00"}