{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KHO4I3IBOQNAR52HQHXDZAQQRE","short_pith_number":"pith:KHO4I3IB","schema_version":"1.0","canonical_sha256":"51ddc46d01741a08f74781ee3c8210892647169530d5fd85026b7a9902996ccd","source":{"kind":"arxiv","id":"1606.00083","version":3},"attestation_state":"computed","paper":{"title":"$k$-protected vertices in unlabeled rooted plane trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Keith Copenhaver","submitted_at":"2016-06-01T00:50:32Z","abstract_excerpt":"We find a simple, closed formula for the proportion of vertices which are $k$-protected in all unlabeled rooted plane trees on $n$ vertices. We also find that, as $n$ goes to infinity, the average rank of a random vertex in a tree of size $n$ approaches 0.727649, and the average rank of the root of a tree of size $n$ approaches 1.62297."},"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":"1606.00083","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-01T00:50:32Z","cross_cats_sorted":[],"title_canon_sha256":"3b06d9710e49511587fdeb84087fff7a32d2143898bbc45fb6144e9e411e0cce","abstract_canon_sha256":"ba4933513872011d587914afc7e0ef1dffc2ef7c4aab7ddd06dae9c16d743e14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:43.447812Z","signature_b64":"iazQ1ml2bCA1vRrBCS2PylIERIobWy6Qxoyow/H8YOuB7lmY9WWQMWWFll/9z9FMOcsVQmLe8YlOcIKsUbk0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51ddc46d01741a08f74781ee3c8210892647169530d5fd85026b7a9902996ccd","last_reissued_at":"2026-05-18T01:11:43.447481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:43.447481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$k$-protected vertices in unlabeled rooted plane trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Keith Copenhaver","submitted_at":"2016-06-01T00:50:32Z","abstract_excerpt":"We find a simple, closed formula for the proportion of vertices which are $k$-protected in all unlabeled rooted plane trees on $n$ vertices. We also find that, as $n$ goes to infinity, the average rank of a random vertex in a tree of size $n$ approaches 0.727649, and the average rank of the root of a tree of size $n$ approaches 1.62297."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00083","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":""},"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":"1606.00083","created_at":"2026-05-18T01:11:43.447535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00083v3","created_at":"2026-05-18T01:11:43.447535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00083","created_at":"2026-05-18T01:11:43.447535+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHO4I3IBOQNA","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHO4I3IBOQNAR52H","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHO4I3IB","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04329","citing_title":"Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KHO4I3IBOQNAR52HQHXDZAQQRE","json":"https://pith.science/pith/KHO4I3IBOQNAR52HQHXDZAQQRE.json","graph_json":"https://pith.science/api/pith-number/KHO4I3IBOQNAR52HQHXDZAQQRE/graph.json","events_json":"https://pith.science/api/pith-number/KHO4I3IBOQNAR52HQHXDZAQQRE/events.json","paper":"https://pith.science/paper/KHO4I3IB"},"agent_actions":{"view_html":"https://pith.science/pith/KHO4I3IBOQNAR52HQHXDZAQQRE","download_json":"https://pith.science/pith/KHO4I3IBOQNAR52HQHXDZAQQRE.json","view_paper":"https://pith.science/paper/KHO4I3IB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00083&json=true","fetch_graph":"https://pith.science/api/pith-number/KHO4I3IBOQNAR52HQHXDZAQQRE/graph.json","fetch_events":"https://pith.science/api/pith-number/KHO4I3IBOQNAR52HQHXDZAQQRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHO4I3IBOQNAR52HQHXDZAQQRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHO4I3IBOQNAR52HQHXDZAQQRE/action/storage_attestation","attest_author":"https://pith.science/pith/KHO4I3IBOQNAR52HQHXDZAQQRE/action/author_attestation","sign_citation":"https://pith.science/pith/KHO4I3IBOQNAR52HQHXDZAQQRE/action/citation_signature","submit_replication":"https://pith.science/pith/KHO4I3IBOQNAR52HQHXDZAQQRE/action/replication_record"}},"created_at":"2026-05-18T01:11:43.447535+00:00","updated_at":"2026-05-18T01:11:43.447535+00:00"}