{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EZALKOTSYKYTERU6S7C2AG6KK5","short_pith_number":"pith:EZALKOTS","schema_version":"1.0","canonical_sha256":"2640b53a72c2b132469e97c5a01bca5777368905922be4ae4ddfb17147e5d275","source":{"kind":"arxiv","id":"2403.20185","version":1},"attestation_state":"computed","paper":{"title":"Random friend trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"C\\'eline Kerriou, G\\'abor Lugosi, Louigi Addario Berry, Luc Devroye, Serte Donderwinkel, Simon Briend","submitted_at":"2024-03-29T14:02:33Z","abstract_excerpt":"We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saram\\\"aki and Kaski. Vertices are attached in a sequential manner one by one by selecting an existing target vertex and connecting to one of its neighbours (or friends), chosen uniformly at random. This model has interesting emergent properties, such as a highly skewed degree sequence. In contrast to the preferential attachment model, these emergent phenomena stem from a local rather than a global attachment mechanism. The structure of the resulting tree is also strikingly dif"},"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.20185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-03-29T14:02:33Z","cross_cats_sorted":[],"title_canon_sha256":"28659bbe2522284e50f574e83f8764bd6c0096582ae54f46f0b3928369d1e724","abstract_canon_sha256":"4304d008478fbcb676021cf533d7f3149be0f5b8d84f9347fb24fd22c8d745cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:02:15.446416Z","signature_b64":"txlC3UBg3nFmL0DKZKDnxmQjCDyb0DGEIzTZRUT/6ByUWqKo2EVO4rsnFR8Xkek9V9T2glcpMfJ9eMjvAMnFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2640b53a72c2b132469e97c5a01bca5777368905922be4ae4ddfb17147e5d275","last_reissued_at":"2026-07-05T08:02:15.445951Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:02:15.445951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random friend trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"C\\'eline Kerriou, G\\'abor Lugosi, Louigi Addario Berry, Luc Devroye, Serte Donderwinkel, Simon Briend","submitted_at":"2024-03-29T14:02:33Z","abstract_excerpt":"We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saram\\\"aki and Kaski. Vertices are attached in a sequential manner one by one by selecting an existing target vertex and connecting to one of its neighbours (or friends), chosen uniformly at random. This model has interesting emergent properties, such as a highly skewed degree sequence. In contrast to the preferential attachment model, these emergent phenomena stem from a local rather than a global attachment mechanism. The structure of the resulting tree is also strikingly dif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.20185","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/2403.20185/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.20185","created_at":"2026-07-05T08:02:15.446003+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.20185v1","created_at":"2026-07-05T08:02:15.446003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.20185","created_at":"2026-07-05T08:02:15.446003+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZALKOTSYKYT","created_at":"2026-07-05T08:02:15.446003+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZALKOTSYKYTERU6","created_at":"2026-07-05T08:02:15.446003+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZALKOTS","created_at":"2026-07-05T08:02:15.446003+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/EZALKOTSYKYTERU6S7C2AG6KK5","json":"https://pith.science/pith/EZALKOTSYKYTERU6S7C2AG6KK5.json","graph_json":"https://pith.science/api/pith-number/EZALKOTSYKYTERU6S7C2AG6KK5/graph.json","events_json":"https://pith.science/api/pith-number/EZALKOTSYKYTERU6S7C2AG6KK5/events.json","paper":"https://pith.science/paper/EZALKOTS"},"agent_actions":{"view_html":"https://pith.science/pith/EZALKOTSYKYTERU6S7C2AG6KK5","download_json":"https://pith.science/pith/EZALKOTSYKYTERU6S7C2AG6KK5.json","view_paper":"https://pith.science/paper/EZALKOTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.20185&json=true","fetch_graph":"https://pith.science/api/pith-number/EZALKOTSYKYTERU6S7C2AG6KK5/graph.json","fetch_events":"https://pith.science/api/pith-number/EZALKOTSYKYTERU6S7C2AG6KK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZALKOTSYKYTERU6S7C2AG6KK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZALKOTSYKYTERU6S7C2AG6KK5/action/storage_attestation","attest_author":"https://pith.science/pith/EZALKOTSYKYTERU6S7C2AG6KK5/action/author_attestation","sign_citation":"https://pith.science/pith/EZALKOTSYKYTERU6S7C2AG6KK5/action/citation_signature","submit_replication":"https://pith.science/pith/EZALKOTSYKYTERU6S7C2AG6KK5/action/replication_record"}},"created_at":"2026-07-05T08:02:15.446003+00:00","updated_at":"2026-07-05T08:02:15.446003+00:00"}