{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2OE5JVXU4CIBDOE6MGK35R433F","short_pith_number":"pith:2OE5JVXU","schema_version":"1.0","canonical_sha256":"d389d4d6f4e09011b89e6195bec79bd97a746878cc8067ab1246b84a7355ea24","source":{"kind":"arxiv","id":"1702.06816","version":1},"attestation_state":"computed","paper":{"title":"Protection Number in Plane Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Clemens Heuberger, Helmut Prodinger","submitted_at":"2017-02-22T14:37:27Z","abstract_excerpt":"The protection number of a plane tree is the minimal distance of the root to a leaf; this definition carries over to an arbitrary node in a plane tree by considering the maximal subtree having this node as a root. We study the the protection number of a uniformly chosen random tree of size $n$ and also the protection number of a uniformly chosen node in a uniformly chosen random tree of size $n$. The method is to apply singularity analysis to appropriate generating functions. Additional results are provided as well."},"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":"1702.06816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-22T14:37:27Z","cross_cats_sorted":[],"title_canon_sha256":"ccc3ca3602a7e915ab6765b49691bee0ddfce9892de6cf5d55e89160bd5f5b18","abstract_canon_sha256":"f2487d239b60546627797773ea5921b23389cd3aa75e1587f8f12e03b25466ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:36.357581Z","signature_b64":"a2Kw1jHzlD6007Ptmnqn376RmAODdi/YngeMz+r1HhfMo0YWPpMkq+9dfpQmSbQSgMf0Upd2Gy0E6wB5z+x+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d389d4d6f4e09011b89e6195bec79bd97a746878cc8067ab1246b84a7355ea24","last_reissued_at":"2026-05-18T00:27:36.356888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:36.356888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Protection Number in Plane Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Clemens Heuberger, Helmut Prodinger","submitted_at":"2017-02-22T14:37:27Z","abstract_excerpt":"The protection number of a plane tree is the minimal distance of the root to a leaf; this definition carries over to an arbitrary node in a plane tree by considering the maximal subtree having this node as a root. We study the the protection number of a uniformly chosen random tree of size $n$ and also the protection number of a uniformly chosen node in a uniformly chosen random tree of size $n$. The method is to apply singularity analysis to appropriate generating functions. Additional results are provided as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06816","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":"1702.06816","created_at":"2026-05-18T00:27:36.356986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06816v1","created_at":"2026-05-18T00:27:36.356986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06816","created_at":"2026-05-18T00:27:36.356986+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OE5JVXU4CIB","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OE5JVXU4CIBDOE6","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OE5JVXU","created_at":"2026-05-18T12:30:55.937587+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/2OE5JVXU4CIBDOE6MGK35R433F","json":"https://pith.science/pith/2OE5JVXU4CIBDOE6MGK35R433F.json","graph_json":"https://pith.science/api/pith-number/2OE5JVXU4CIBDOE6MGK35R433F/graph.json","events_json":"https://pith.science/api/pith-number/2OE5JVXU4CIBDOE6MGK35R433F/events.json","paper":"https://pith.science/paper/2OE5JVXU"},"agent_actions":{"view_html":"https://pith.science/pith/2OE5JVXU4CIBDOE6MGK35R433F","download_json":"https://pith.science/pith/2OE5JVXU4CIBDOE6MGK35R433F.json","view_paper":"https://pith.science/paper/2OE5JVXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06816&json=true","fetch_graph":"https://pith.science/api/pith-number/2OE5JVXU4CIBDOE6MGK35R433F/graph.json","fetch_events":"https://pith.science/api/pith-number/2OE5JVXU4CIBDOE6MGK35R433F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OE5JVXU4CIBDOE6MGK35R433F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OE5JVXU4CIBDOE6MGK35R433F/action/storage_attestation","attest_author":"https://pith.science/pith/2OE5JVXU4CIBDOE6MGK35R433F/action/author_attestation","sign_citation":"https://pith.science/pith/2OE5JVXU4CIBDOE6MGK35R433F/action/citation_signature","submit_replication":"https://pith.science/pith/2OE5JVXU4CIBDOE6MGK35R433F/action/replication_record"}},"created_at":"2026-05-18T00:27:36.356986+00:00","updated_at":"2026-05-18T00:27:36.356986+00:00"}