{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:U67XDP2M5FIDF5KVLI6MKPY77T","short_pith_number":"pith:U67XDP2M","schema_version":"1.0","canonical_sha256":"a7bf71bf4ce95032f5555a3cc53f1ffccff6651a4fd0b2ca972d3780c24ff4ff","source":{"kind":"arxiv","id":"1111.1471","version":1},"attestation_state":"computed","paper":{"title":"On protected nodes in Digital Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Helmut Prodinger, Rosena R. X. Du","submitted_at":"2011-11-07T02:10:48Z","abstract_excerpt":"Recently, 2-protected nodes were studied in the context of ordered trees and $k$-trees. These nodes have a distance of at least 2 to each leaf. Here, we study digital search trees, which are binary trees, but with a different probability distribution underlying. Our result says, that \\emph{grosso modo} some 31% of the nodes are 2-protected. Methods include exponential generating functions, contour integration, and some elements from $q$-analysis."},"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":"1111.1471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-07T02:10:48Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"dd13d7c7aa44be8bda5dc42cf9a8a4358b8dd62d629f51b7fc5453f83df2d3e4","abstract_canon_sha256":"2112350ec24057b9c3dfa0cf6895eb60dc6dc340c66df1ae74e4620031d4f6da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:26.063557Z","signature_b64":"q+Vyc6R2dd4zLpBWZOzVj/Yp5FBJlbGsuwXf9dVMNlsiKWEtAyatyhKhKIAMhuIYgqcaZhAdfp49fNJXppBJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7bf71bf4ce95032f5555a3cc53f1ffccff6651a4fd0b2ca972d3780c24ff4ff","last_reissued_at":"2026-05-18T04:09:26.062908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:26.062908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On protected nodes in Digital Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Helmut Prodinger, Rosena R. X. Du","submitted_at":"2011-11-07T02:10:48Z","abstract_excerpt":"Recently, 2-protected nodes were studied in the context of ordered trees and $k$-trees. These nodes have a distance of at least 2 to each leaf. Here, we study digital search trees, which are binary trees, but with a different probability distribution underlying. Our result says, that \\emph{grosso modo} some 31% of the nodes are 2-protected. Methods include exponential generating functions, contour integration, and some elements from $q$-analysis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1471","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":"1111.1471","created_at":"2026-05-18T04:09:26.063028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.1471v1","created_at":"2026-05-18T04:09:26.063028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1471","created_at":"2026-05-18T04:09:26.063028+00:00"},{"alias_kind":"pith_short_12","alias_value":"U67XDP2M5FID","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"U67XDP2M5FIDF5KV","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"U67XDP2M","created_at":"2026-05-18T12:26:42.757692+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/U67XDP2M5FIDF5KVLI6MKPY77T","json":"https://pith.science/pith/U67XDP2M5FIDF5KVLI6MKPY77T.json","graph_json":"https://pith.science/api/pith-number/U67XDP2M5FIDF5KVLI6MKPY77T/graph.json","events_json":"https://pith.science/api/pith-number/U67XDP2M5FIDF5KVLI6MKPY77T/events.json","paper":"https://pith.science/paper/U67XDP2M"},"agent_actions":{"view_html":"https://pith.science/pith/U67XDP2M5FIDF5KVLI6MKPY77T","download_json":"https://pith.science/pith/U67XDP2M5FIDF5KVLI6MKPY77T.json","view_paper":"https://pith.science/paper/U67XDP2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.1471&json=true","fetch_graph":"https://pith.science/api/pith-number/U67XDP2M5FIDF5KVLI6MKPY77T/graph.json","fetch_events":"https://pith.science/api/pith-number/U67XDP2M5FIDF5KVLI6MKPY77T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U67XDP2M5FIDF5KVLI6MKPY77T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U67XDP2M5FIDF5KVLI6MKPY77T/action/storage_attestation","attest_author":"https://pith.science/pith/U67XDP2M5FIDF5KVLI6MKPY77T/action/author_attestation","sign_citation":"https://pith.science/pith/U67XDP2M5FIDF5KVLI6MKPY77T/action/citation_signature","submit_replication":"https://pith.science/pith/U67XDP2M5FIDF5KVLI6MKPY77T/action/replication_record"}},"created_at":"2026-05-18T04:09:26.063028+00:00","updated_at":"2026-05-18T04:09:26.063028+00:00"}