{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:K7AFXW6ITJ63JHDU3TTCMU5C76","short_pith_number":"pith:K7AFXW6I","canonical_record":{"source":{"id":"1110.2225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-10T22:43:18Z","cross_cats_sorted":[],"title_canon_sha256":"e983d2d1246b89959bceec088931867441b2446d96181bc05af9c643bc782cbc","abstract_canon_sha256":"b508c73ae93f82ef1a6763498a966c7ae655a73efaeb1d4d26aabcd8198c9a02"},"schema_version":"1.0"},"canonical_sha256":"57c05bdbc89a7db49c74dce62653a2ff8c7ce8251dd17ea31b60659afdbeedf1","source":{"kind":"arxiv","id":"1110.2225","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2225","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2225v2","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2225","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"K7AFXW6ITJ63","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K7AFXW6ITJ63JHDU","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K7AFXW6I","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:K7AFXW6ITJ63JHDU3TTCMU5C76","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-10T22:43:18Z","cross_cats_sorted":[],"title_canon_sha256":"e983d2d1246b89959bceec088931867441b2446d96181bc05af9c643bc782cbc","abstract_canon_sha256":"b508c73ae93f82ef1a6763498a966c7ae655a73efaeb1d4d26aabcd8198c9a02"},"schema_version":"1.0"},"canonical_sha256":"57c05bdbc89a7db49c74dce62653a2ff8c7ce8251dd17ea31b60659afdbeedf1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:38.230285Z","signature_b64":"LjR5q1VQO5k8G2PbC0cTKX9YeEo046024XVk0uxiy4rk3g5+xkF1DZzpKK22m6JvoeJRSpHzxZkXK2+ft3JeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c05bdbc89a7db49c74dce62653a2ff8c7ce8251dd17ea31b60659afdbeedf1","last_reissued_at":"2026-05-18T04:05:38.229801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:38.229801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2225","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8gh0YtSPaXZCdvOGVqf65b930Vp9KeFs2V6uxwo5cj09ZuY8H79dCPht3TgdzMexluJ+82PbyGfTylpCHXO8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:11:46.685551Z"},"content_sha256":"71992a5e70ee6a2bfe861e68c6a145dd863aeeeb1c0f4ab2be9f5ea80476505c","schema_version":"1.0","event_id":"sha256:71992a5e70ee6a2bfe861e68c6a145dd863aeeeb1c0f4ab2be9f5ea80476505c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:K7AFXW6ITJ63JHDU3TTCMU5C76","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pattern Avoidance in Ternary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Katherine Peske, Lara Pudwell, Nathan Gabriel, Samuel Tay","submitted_at":"2011-10-10T22:43:18Z","abstract_excerpt":"This paper considers the enumeration of ternary trees (i.e. rooted ordered trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by finding recurrence relations for several simple tree patterns; then, for more complex trees, we compute generating functions by extending a known algorithm for pattern-avoiding binary trees. Next, we present an alternate one-dimensional notation for trees which we use to find bijections that explain why certain pairs of tree patterns yield the same avoidance generating function. Finally, we compare our bijections to k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2225","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iu+lWwNNiy101N0rOuPEHg9jU1+LrBJD85/4/BoXhQy0YhGARMh08xougOdMpcTgfOU6ngCV6Ydki0wLLfLNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:11:46.686216Z"},"content_sha256":"e4eb30b901e84884d87f49dd8bbd534046a560932b25ff2266cfa2059d0a54b8","schema_version":"1.0","event_id":"sha256:e4eb30b901e84884d87f49dd8bbd534046a560932b25ff2266cfa2059d0a54b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7AFXW6ITJ63JHDU3TTCMU5C76/bundle.json","state_url":"https://pith.science/pith/K7AFXW6ITJ63JHDU3TTCMU5C76/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7AFXW6ITJ63JHDU3TTCMU5C76/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T06:11:46Z","links":{"resolver":"https://pith.science/pith/K7AFXW6ITJ63JHDU3TTCMU5C76","bundle":"https://pith.science/pith/K7AFXW6ITJ63JHDU3TTCMU5C76/bundle.json","state":"https://pith.science/pith/K7AFXW6ITJ63JHDU3TTCMU5C76/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7AFXW6ITJ63JHDU3TTCMU5C76/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:K7AFXW6ITJ63JHDU3TTCMU5C76","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b508c73ae93f82ef1a6763498a966c7ae655a73efaeb1d4d26aabcd8198c9a02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-10T22:43:18Z","title_canon_sha256":"e983d2d1246b89959bceec088931867441b2446d96181bc05af9c643bc782cbc"},"schema_version":"1.0","source":{"id":"1110.2225","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2225","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2225v2","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2225","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"K7AFXW6ITJ63","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K7AFXW6ITJ63JHDU","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K7AFXW6I","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:e4eb30b901e84884d87f49dd8bbd534046a560932b25ff2266cfa2059d0a54b8","target":"graph","created_at":"2026-05-18T04:05:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper considers the enumeration of ternary trees (i.e. rooted ordered trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by finding recurrence relations for several simple tree patterns; then, for more complex trees, we compute generating functions by extending a known algorithm for pattern-avoiding binary trees. Next, we present an alternate one-dimensional notation for trees which we use to find bijections that explain why certain pairs of tree patterns yield the same avoidance generating function. Finally, we compare our bijections to k","authors_text":"Katherine Peske, Lara Pudwell, Nathan Gabriel, Samuel Tay","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-10T22:43:18Z","title":"Pattern Avoidance in Ternary Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2225","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:71992a5e70ee6a2bfe861e68c6a145dd863aeeeb1c0f4ab2be9f5ea80476505c","target":"record","created_at":"2026-05-18T04:05:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b508c73ae93f82ef1a6763498a966c7ae655a73efaeb1d4d26aabcd8198c9a02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-10T22:43:18Z","title_canon_sha256":"e983d2d1246b89959bceec088931867441b2446d96181bc05af9c643bc782cbc"},"schema_version":"1.0","source":{"id":"1110.2225","kind":"arxiv","version":2}},"canonical_sha256":"57c05bdbc89a7db49c74dce62653a2ff8c7ce8251dd17ea31b60659afdbeedf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57c05bdbc89a7db49c74dce62653a2ff8c7ce8251dd17ea31b60659afdbeedf1","first_computed_at":"2026-05-18T04:05:38.229801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:38.229801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LjR5q1VQO5k8G2PbC0cTKX9YeEo046024XVk0uxiy4rk3g5+xkF1DZzpKK22m6JvoeJRSpHzxZkXK2+ft3JeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:38.230285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2225","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71992a5e70ee6a2bfe861e68c6a145dd863aeeeb1c0f4ab2be9f5ea80476505c","sha256:e4eb30b901e84884d87f49dd8bbd534046a560932b25ff2266cfa2059d0a54b8"],"state_sha256":"ac5f2c1ec289af3f101788bbcaf1245fa8613363e429361c011a82c3c9a3b586"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9lnwa8BZRR/PSv+M9dwb9FCBrFcsObtN+HyfT9FH6oOSvBzUanZhOapqDWAxg+P8/YHbxbfZ6S0Y6oAHePiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:11:46.688981Z","bundle_sha256":"056acd9c8678e1f83abc294ff6a99c423a614edf17fba8ead339affb98c05b1e"}}