{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:2OP4HMVGBATPCZQNT4NFXYEASY","short_pith_number":"pith:2OP4HMVG","schema_version":"1.0","canonical_sha256":"d39fc3b2a60826f1660d9f1a5be08096368cd531123a026fc89928f5e74704c5","source":{"kind":"arxiv","id":"0809.0488","version":2},"attestation_state":"computed","paper":{"title":"Pattern avoidance in binary trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric S. Rowland","submitted_at":"2008-09-02T18:14:38Z","abstract_excerpt":"This paper considers the enumeration of trees avoiding a contiguous pattern.  We provide an algorithm for computing the generating function that counts n-leaf binary trees avoiding a given binary tree pattern t.  Equipped with this counting mechanism, we study the analogue of Wilf equivalence in which two tree patterns are equivalent if the respective n-leaf trees that avoid them are equinumerous.  We investigate the equivalence classes combinatorially.  Toward establishing bijective proofs of tree pattern equivalence, we develop a general method of restructuring trees that conjecturally succe"},"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":"0809.0488","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-09-02T18:14:38Z","cross_cats_sorted":[],"title_canon_sha256":"bb0a0299c2be6f760d0ba999c60cae11a5636c0e3513efa125e40c00894b8f0a","abstract_canon_sha256":"76d69d48fed54d696d747f3d6390bc29d4547169a67e11d58d45f5e80fa3f9a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:57.019594Z","signature_b64":"kbLmoO/mPEty5KUs+3RmqzqrnqaeYc6UbBqoE8mOz17OtmP450tKQEGIwGmbW06aL/BMQARsX4UKLFjvybncCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d39fc3b2a60826f1660d9f1a5be08096368cd531123a026fc89928f5e74704c5","last_reissued_at":"2026-05-18T02:24:57.018910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:57.018910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pattern avoidance in binary trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric S. Rowland","submitted_at":"2008-09-02T18:14:38Z","abstract_excerpt":"This paper considers the enumeration of trees avoiding a contiguous pattern.  We provide an algorithm for computing the generating function that counts n-leaf binary trees avoiding a given binary tree pattern t.  Equipped with this counting mechanism, we study the analogue of Wilf equivalence in which two tree patterns are equivalent if the respective n-leaf trees that avoid them are equinumerous.  We investigate the equivalence classes combinatorially.  Toward establishing bijective proofs of tree pattern equivalence, we develop a general method of restructuring trees that conjecturally succe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.0488","kind":"arxiv","version":2},"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":"0809.0488","created_at":"2026-05-18T02:24:57.019010+00:00"},{"alias_kind":"arxiv_version","alias_value":"0809.0488v2","created_at":"2026-05-18T02:24:57.019010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.0488","created_at":"2026-05-18T02:24:57.019010+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OP4HMVGBATP","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OP4HMVGBATPCZQN","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OP4HMVG","created_at":"2026-05-18T12:25:56.245647+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/2OP4HMVGBATPCZQNT4NFXYEASY","json":"https://pith.science/pith/2OP4HMVGBATPCZQNT4NFXYEASY.json","graph_json":"https://pith.science/api/pith-number/2OP4HMVGBATPCZQNT4NFXYEASY/graph.json","events_json":"https://pith.science/api/pith-number/2OP4HMVGBATPCZQNT4NFXYEASY/events.json","paper":"https://pith.science/paper/2OP4HMVG"},"agent_actions":{"view_html":"https://pith.science/pith/2OP4HMVGBATPCZQNT4NFXYEASY","download_json":"https://pith.science/pith/2OP4HMVGBATPCZQNT4NFXYEASY.json","view_paper":"https://pith.science/paper/2OP4HMVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0809.0488&json=true","fetch_graph":"https://pith.science/api/pith-number/2OP4HMVGBATPCZQNT4NFXYEASY/graph.json","fetch_events":"https://pith.science/api/pith-number/2OP4HMVGBATPCZQNT4NFXYEASY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OP4HMVGBATPCZQNT4NFXYEASY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OP4HMVGBATPCZQNT4NFXYEASY/action/storage_attestation","attest_author":"https://pith.science/pith/2OP4HMVGBATPCZQNT4NFXYEASY/action/author_attestation","sign_citation":"https://pith.science/pith/2OP4HMVGBATPCZQNT4NFXYEASY/action/citation_signature","submit_replication":"https://pith.science/pith/2OP4HMVGBATPCZQNT4NFXYEASY/action/replication_record"}},"created_at":"2026-05-18T02:24:57.019010+00:00","updated_at":"2026-05-18T02:24:57.019010+00:00"}