{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EGW6PZO4XJON4RKRTRF5DDQLDV","short_pith_number":"pith:EGW6PZO4","schema_version":"1.0","canonical_sha256":"21ade7e5dcba5cde45519c4bd18e0b1d49681014d0c86718bf811c46eaa6ff16","source":{"kind":"arxiv","id":"1605.00715","version":3},"attestation_state":"computed","paper":{"title":"Enumerations of vertices among all rooted ordered trees with levels and degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heesung Shin, Sen-Peng Eu, Seunghyun Seo","submitted_at":"2016-05-03T00:43:17Z","abstract_excerpt":"In this paper we enumerate and give bijections for the following four sets of vertices among rooted ordered trees of a fixed size: (i) first-children of degree $k$ at level $\\ell$, (ii) non-first-children of degree $k$ at level $\\ell-1$, (iii) leaves having $k-1$ elder siblings at level $\\ell$, and (iv) non-leaves of outdegree $k$ at level $\\ell-1$. Our results unite and generalize several previous works in the literature."},"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":"1605.00715","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-03T00:43:17Z","cross_cats_sorted":[],"title_canon_sha256":"99ca4118a84b91cae9f9a6940b322ed8f7da961d11a20b7d2c9d6553c30557d1","abstract_canon_sha256":"a451432fccc7c59162d7028283b6925ad05c4d30cb996a44545eaabda9aae71c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:38.884778Z","signature_b64":"tMxSuqAGEtN6UxPimMtMJLHxZH3Iucooq4pepmMfuWIiGYNO2VIhD9Gq7bTkcZuGxAwahXn5vWAaoWsHYAhuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21ade7e5dcba5cde45519c4bd18e0b1d49681014d0c86718bf811c46eaa6ff16","last_reissued_at":"2026-07-05T04:06:38.884430Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:38.884430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumerations of vertices among all rooted ordered trees with levels and degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heesung Shin, Sen-Peng Eu, Seunghyun Seo","submitted_at":"2016-05-03T00:43:17Z","abstract_excerpt":"In this paper we enumerate and give bijections for the following four sets of vertices among rooted ordered trees of a fixed size: (i) first-children of degree $k$ at level $\\ell$, (ii) non-first-children of degree $k$ at level $\\ell-1$, (iii) leaves having $k-1$ elder siblings at level $\\ell$, and (iv) non-leaves of outdegree $k$ at level $\\ell-1$. Our results unite and generalize several previous works in the literature."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00715","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1605.00715/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1605.00715","created_at":"2026-07-05T04:06:38.884486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00715v3","created_at":"2026-07-05T04:06:38.884486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00715","created_at":"2026-07-05T04:06:38.884486+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGW6PZO4XJON","created_at":"2026-07-05T04:06:38.884486+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGW6PZO4XJON4RKR","created_at":"2026-07-05T04:06:38.884486+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGW6PZO4","created_at":"2026-07-05T04:06:38.884486+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/EGW6PZO4XJON4RKRTRF5DDQLDV","json":"https://pith.science/pith/EGW6PZO4XJON4RKRTRF5DDQLDV.json","graph_json":"https://pith.science/api/pith-number/EGW6PZO4XJON4RKRTRF5DDQLDV/graph.json","events_json":"https://pith.science/api/pith-number/EGW6PZO4XJON4RKRTRF5DDQLDV/events.json","paper":"https://pith.science/paper/EGW6PZO4"},"agent_actions":{"view_html":"https://pith.science/pith/EGW6PZO4XJON4RKRTRF5DDQLDV","download_json":"https://pith.science/pith/EGW6PZO4XJON4RKRTRF5DDQLDV.json","view_paper":"https://pith.science/paper/EGW6PZO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00715&json=true","fetch_graph":"https://pith.science/api/pith-number/EGW6PZO4XJON4RKRTRF5DDQLDV/graph.json","fetch_events":"https://pith.science/api/pith-number/EGW6PZO4XJON4RKRTRF5DDQLDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGW6PZO4XJON4RKRTRF5DDQLDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGW6PZO4XJON4RKRTRF5DDQLDV/action/storage_attestation","attest_author":"https://pith.science/pith/EGW6PZO4XJON4RKRTRF5DDQLDV/action/author_attestation","sign_citation":"https://pith.science/pith/EGW6PZO4XJON4RKRTRF5DDQLDV/action/citation_signature","submit_replication":"https://pith.science/pith/EGW6PZO4XJON4RKRTRF5DDQLDV/action/replication_record"}},"created_at":"2026-07-05T04:06:38.884486+00:00","updated_at":"2026-07-05T04:06:38.884486+00:00"}