{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EQ4W4ZC6OLFV423ZY4CTO5MSWF","short_pith_number":"pith:EQ4W4ZC6","schema_version":"1.0","canonical_sha256":"24396e645e72cb5e6b79c705377592b174f08252826c498a94f53b052e19fdd9","source":{"kind":"arxiv","id":"1611.07793","version":1},"attestation_state":"computed","paper":{"title":"Patterns in treeshelves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki","submitted_at":"2016-11-23T13:49:04Z","abstract_excerpt":"We study the distribution and the popularity of left children on sets of treeshelves avoiding a pattern of size three. (Treeshelves are ordered binary increasing trees where every child is connected to its parent by a left or a right link.) The considered patterns are sub-treeshelves, and for each such a pattern we provide exponential generating function for the corresponding distribution and popularity. Finally, we present constructive bijections between treeshelves avoiding a pattern of size three and some classes of simpler combinatorial objects."},"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":"1611.07793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-23T13:49:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"57379ff34f8518a63f193b1e742e718c61e191abf0f70dea9cc3963a520676b3","abstract_canon_sha256":"fe592a73253d573084ec7d30464c14ec1c19aa1cc34769291fa09c5e725f9f20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:59.805982Z","signature_b64":"59YHc1+CGbs0mft/OsQYv7afLXfpLAgJJ6sfb8nK8qSfOhxhd7lPk4xZfy5jtOimV1ou8Mo5HBVVSrsjUcsoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24396e645e72cb5e6b79c705377592b174f08252826c498a94f53b052e19fdd9","last_reissued_at":"2026-05-18T00:56:59.805482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:59.805482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Patterns in treeshelves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki","submitted_at":"2016-11-23T13:49:04Z","abstract_excerpt":"We study the distribution and the popularity of left children on sets of treeshelves avoiding a pattern of size three. (Treeshelves are ordered binary increasing trees where every child is connected to its parent by a left or a right link.) The considered patterns are sub-treeshelves, and for each such a pattern we provide exponential generating function for the corresponding distribution and popularity. Finally, we present constructive bijections between treeshelves avoiding a pattern of size three and some classes of simpler combinatorial objects."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07793","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":"1611.07793","created_at":"2026-05-18T00:56:59.805573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07793v1","created_at":"2026-05-18T00:56:59.805573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07793","created_at":"2026-05-18T00:56:59.805573+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQ4W4ZC6OLFV","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQ4W4ZC6OLFV423Z","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQ4W4ZC6","created_at":"2026-05-18T12:30:12.583610+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/EQ4W4ZC6OLFV423ZY4CTO5MSWF","json":"https://pith.science/pith/EQ4W4ZC6OLFV423ZY4CTO5MSWF.json","graph_json":"https://pith.science/api/pith-number/EQ4W4ZC6OLFV423ZY4CTO5MSWF/graph.json","events_json":"https://pith.science/api/pith-number/EQ4W4ZC6OLFV423ZY4CTO5MSWF/events.json","paper":"https://pith.science/paper/EQ4W4ZC6"},"agent_actions":{"view_html":"https://pith.science/pith/EQ4W4ZC6OLFV423ZY4CTO5MSWF","download_json":"https://pith.science/pith/EQ4W4ZC6OLFV423ZY4CTO5MSWF.json","view_paper":"https://pith.science/paper/EQ4W4ZC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07793&json=true","fetch_graph":"https://pith.science/api/pith-number/EQ4W4ZC6OLFV423ZY4CTO5MSWF/graph.json","fetch_events":"https://pith.science/api/pith-number/EQ4W4ZC6OLFV423ZY4CTO5MSWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQ4W4ZC6OLFV423ZY4CTO5MSWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQ4W4ZC6OLFV423ZY4CTO5MSWF/action/storage_attestation","attest_author":"https://pith.science/pith/EQ4W4ZC6OLFV423ZY4CTO5MSWF/action/author_attestation","sign_citation":"https://pith.science/pith/EQ4W4ZC6OLFV423ZY4CTO5MSWF/action/citation_signature","submit_replication":"https://pith.science/pith/EQ4W4ZC6OLFV423ZY4CTO5MSWF/action/replication_record"}},"created_at":"2026-05-18T00:56:59.805573+00:00","updated_at":"2026-05-18T00:56:59.805573+00:00"}