{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MGYFWXUTACHKNWB5JRFUPL2NQY","short_pith_number":"pith:MGYFWXUT","schema_version":"1.0","canonical_sha256":"61b05b5e93008ea6d83d4c4b47af4d86081f5c79af0bf9500537e893a24103da","source":{"kind":"arxiv","id":"1304.6105","version":1},"attestation_state":"computed","paper":{"title":"$k$-protected vertices in binary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Miklos Bona","submitted_at":"2013-04-22T20:48:29Z","abstract_excerpt":"We show that for every $k$, the probability that a randomly selected vertex of a random binary search tree on $n$ nodes is at distance $k-1$ from the closest leaf converges to a rational constant $c_k$ as $n$ goes to infinity."},"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":"1304.6105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-22T20:48:29Z","cross_cats_sorted":[],"title_canon_sha256":"99b4392d8c71c4c07c3147d3f700b99de8557ddfd64c5a65b239905ea21bacae","abstract_canon_sha256":"dc2448f49aa082438c8299c640bbffc7fc8538766e81a1f2707183d031a08acc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:22.376966Z","signature_b64":"ndgVvbIY2iaksL/uqsyw+JWAQnsiHstkvX7dUU8wgBz8UuYg60OyB/FMtKh72Zgev2WUfsULAvDKvyVkIA/LAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61b05b5e93008ea6d83d4c4b47af4d86081f5c79af0bf9500537e893a24103da","last_reissued_at":"2026-05-18T03:27:22.376295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:22.376295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$k$-protected vertices in binary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Miklos Bona","submitted_at":"2013-04-22T20:48:29Z","abstract_excerpt":"We show that for every $k$, the probability that a randomly selected vertex of a random binary search tree on $n$ nodes is at distance $k-1$ from the closest leaf converges to a rational constant $c_k$ as $n$ goes to infinity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6105","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":"1304.6105","created_at":"2026-05-18T03:27:22.376434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6105v1","created_at":"2026-05-18T03:27:22.376434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6105","created_at":"2026-05-18T03:27:22.376434+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGYFWXUTACHK","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGYFWXUTACHKNWB5","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGYFWXUT","created_at":"2026-05-18T12:27:52.871228+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/MGYFWXUTACHKNWB5JRFUPL2NQY","json":"https://pith.science/pith/MGYFWXUTACHKNWB5JRFUPL2NQY.json","graph_json":"https://pith.science/api/pith-number/MGYFWXUTACHKNWB5JRFUPL2NQY/graph.json","events_json":"https://pith.science/api/pith-number/MGYFWXUTACHKNWB5JRFUPL2NQY/events.json","paper":"https://pith.science/paper/MGYFWXUT"},"agent_actions":{"view_html":"https://pith.science/pith/MGYFWXUTACHKNWB5JRFUPL2NQY","download_json":"https://pith.science/pith/MGYFWXUTACHKNWB5JRFUPL2NQY.json","view_paper":"https://pith.science/paper/MGYFWXUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6105&json=true","fetch_graph":"https://pith.science/api/pith-number/MGYFWXUTACHKNWB5JRFUPL2NQY/graph.json","fetch_events":"https://pith.science/api/pith-number/MGYFWXUTACHKNWB5JRFUPL2NQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGYFWXUTACHKNWB5JRFUPL2NQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGYFWXUTACHKNWB5JRFUPL2NQY/action/storage_attestation","attest_author":"https://pith.science/pith/MGYFWXUTACHKNWB5JRFUPL2NQY/action/author_attestation","sign_citation":"https://pith.science/pith/MGYFWXUTACHKNWB5JRFUPL2NQY/action/citation_signature","submit_replication":"https://pith.science/pith/MGYFWXUTACHKNWB5JRFUPL2NQY/action/replication_record"}},"created_at":"2026-05-18T03:27:22.376434+00:00","updated_at":"2026-05-18T03:27:22.376434+00:00"}