{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2I3VFHCI2MKKDIZVV6LZCR53HS","short_pith_number":"pith:2I3VFHCI","schema_version":"1.0","canonical_sha256":"d237529c48d314a1a335af979147bb3c97c1c0fe6dd855a6bd97ee9bc5d7c45b","source":{"kind":"arxiv","id":"1403.5573","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic distribution of two-protected nodes in ternary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Cecilia Holmgren, Svante Janson","submitted_at":"2014-03-21T21:02:18Z","abstract_excerpt":"We study protected nodes in $m$-ary search trees, by putting them in context of generalised P\\'olya urns. We show that the number of two-protected nodes (the nodes that are neither leaves nor parents of leaves) in a random ternary search tree is asymptotically normal. The methods apply in principle to $m $-ary search trees with larger $m$ as well, although the size of the matrices used in the calculations grow rapidly with $ m $; we conjecture that the method yields an asymptotically normal distribution for all $m\\leq 26$.\n  The one-protected nodes, and their complement, i.e., the leaves, are "},"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":"1403.5573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-03-21T21:02:18Z","cross_cats_sorted":[],"title_canon_sha256":"c32d440870c4a2ef4eba7f969251d928c5f082eec2a51f41f044c185d0577aa9","abstract_canon_sha256":"7773a9bf7f0513f4e26b5583417d1b3932a86c507c165a649f3666179b68ec85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:49.463930Z","signature_b64":"lB/XYMweqoId86N85T95trqJtFjtnajYzk4W61qcKjXo8BQS8c2hZUFkDRJf1CU8zQYZ3Ac1WStDN6b0EC4gAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d237529c48d314a1a335af979147bb3c97c1c0fe6dd855a6bd97ee9bc5d7c45b","last_reissued_at":"2026-05-18T02:55:49.463263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:49.463263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic distribution of two-protected nodes in ternary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Cecilia Holmgren, Svante Janson","submitted_at":"2014-03-21T21:02:18Z","abstract_excerpt":"We study protected nodes in $m$-ary search trees, by putting them in context of generalised P\\'olya urns. We show that the number of two-protected nodes (the nodes that are neither leaves nor parents of leaves) in a random ternary search tree is asymptotically normal. The methods apply in principle to $m $-ary search trees with larger $m$ as well, although the size of the matrices used in the calculations grow rapidly with $ m $; we conjecture that the method yields an asymptotically normal distribution for all $m\\leq 26$.\n  The one-protected nodes, and their complement, i.e., the leaves, are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5573","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.5573","created_at":"2026-05-18T02:55:49.463386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5573v1","created_at":"2026-05-18T02:55:49.463386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5573","created_at":"2026-05-18T02:55:49.463386+00:00"},{"alias_kind":"pith_short_12","alias_value":"2I3VFHCI2MKK","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2I3VFHCI2MKKDIZV","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2I3VFHCI","created_at":"2026-05-18T12:28:11.866339+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/2I3VFHCI2MKKDIZVV6LZCR53HS","json":"https://pith.science/pith/2I3VFHCI2MKKDIZVV6LZCR53HS.json","graph_json":"https://pith.science/api/pith-number/2I3VFHCI2MKKDIZVV6LZCR53HS/graph.json","events_json":"https://pith.science/api/pith-number/2I3VFHCI2MKKDIZVV6LZCR53HS/events.json","paper":"https://pith.science/paper/2I3VFHCI"},"agent_actions":{"view_html":"https://pith.science/pith/2I3VFHCI2MKKDIZVV6LZCR53HS","download_json":"https://pith.science/pith/2I3VFHCI2MKKDIZVV6LZCR53HS.json","view_paper":"https://pith.science/paper/2I3VFHCI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5573&json=true","fetch_graph":"https://pith.science/api/pith-number/2I3VFHCI2MKKDIZVV6LZCR53HS/graph.json","fetch_events":"https://pith.science/api/pith-number/2I3VFHCI2MKKDIZVV6LZCR53HS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2I3VFHCI2MKKDIZVV6LZCR53HS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2I3VFHCI2MKKDIZVV6LZCR53HS/action/storage_attestation","attest_author":"https://pith.science/pith/2I3VFHCI2MKKDIZVV6LZCR53HS/action/author_attestation","sign_citation":"https://pith.science/pith/2I3VFHCI2MKKDIZVV6LZCR53HS/action/citation_signature","submit_replication":"https://pith.science/pith/2I3VFHCI2MKKDIZVV6LZCR53HS/action/replication_record"}},"created_at":"2026-05-18T02:55:49.463386+00:00","updated_at":"2026-05-18T02:55:49.463386+00:00"}