{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L7TE3XRY65ZLJFARKQBV3MBQ4Z","short_pith_number":"pith:L7TE3XRY","canonical_record":{"source":{"id":"1203.0795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-05T01:18:25Z","cross_cats_sorted":[],"title_canon_sha256":"60fb0a7d57b6843902d2841d088704fc802b69463bc442c6e678bad1f973ecc8","abstract_canon_sha256":"edca38c5715bc52988cdb7137b85a99ef374d5295738834460b56b1946069ce3"},"schema_version":"1.0"},"canonical_sha256":"5fe64dde38f772b4941154035db030e66fda2686297259f9b1c46dee30d00f22","source":{"kind":"arxiv","id":"1203.0795","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0795","created_at":"2026-05-18T03:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0795v2","created_at":"2026-05-18T03:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0795","created_at":"2026-05-18T03:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"L7TE3XRY65ZL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L7TE3XRY65ZLJFAR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L7TE3XRY","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L7TE3XRY65ZLJFARKQBV3MBQ4Z","target":"record","payload":{"canonical_record":{"source":{"id":"1203.0795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-05T01:18:25Z","cross_cats_sorted":[],"title_canon_sha256":"60fb0a7d57b6843902d2841d088704fc802b69463bc442c6e678bad1f973ecc8","abstract_canon_sha256":"edca38c5715bc52988cdb7137b85a99ef374d5295738834460b56b1946069ce3"},"schema_version":"1.0"},"canonical_sha256":"5fe64dde38f772b4941154035db030e66fda2686297259f9b1c46dee30d00f22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:06.725767Z","signature_b64":"np0dTfmbRFM3AcsbAHREBHC6LBu78Nwfa8d6Ku3zksHyHKgStukA+uVge4H9SjqQchCMgIJar3EdkB6ami9dDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fe64dde38f772b4941154035db030e66fda2686297259f9b1c46dee30d00f22","last_reissued_at":"2026-05-18T03:53:06.725058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:06.725058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.0795","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-18T03:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UJwiOOoOxext/IjXQVL4qkQv5/oVRTFrOHfhl8ZWA8cdhinhOZDXFvg3//kpHcjdeKNYyohYmjVde5rpJ9TXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:35:26.669440Z"},"content_sha256":"5a3cd5958d5aef97a920d8ee652f8f436422d9127e6b74262ebf3a9b3c4d9155","schema_version":"1.0","event_id":"sha256:5a3cd5958d5aef97a920d8ee652f8f436422d9127e6b74262ebf3a9b3c4d9155"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L7TE3XRY65ZLJFARKQBV3MBQ4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Contiguous Pattern Avoidance in Binary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Casey Wynn, Lara Pudwell, Michael Dairyko, Samantha Tyner","submitted_at":"2012-03-05T01:18:25Z","abstract_excerpt":"In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare these results to analogous work for contiguous tree patterns. Next, we give an explicit generating function that counts binary trees avoiding a single non-contiguous tree pattern according to number of leaves. In addition, we enumerate binary trees that simultaneously avoid more than one tree pattern. Finally, we explore connections between pattern-avoiding t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0795","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-18T03:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ulkdlo2Jke0S48HxJhfNmL4iObGKcYLp4sqtCc0XztV7sdCJxV1TCjnL71SnDdBdizX02KoXW5OzzJJpA1sxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:35:26.670074Z"},"content_sha256":"85bf8052c9a0a4399f9f203bfd00de31f6abade6fc1deb90b030909d7717d9bd","schema_version":"1.0","event_id":"sha256:85bf8052c9a0a4399f9f203bfd00de31f6abade6fc1deb90b030909d7717d9bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7TE3XRY65ZLJFARKQBV3MBQ4Z/bundle.json","state_url":"https://pith.science/pith/L7TE3XRY65ZLJFARKQBV3MBQ4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7TE3XRY65ZLJFARKQBV3MBQ4Z/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-30T21:35:26Z","links":{"resolver":"https://pith.science/pith/L7TE3XRY65ZLJFARKQBV3MBQ4Z","bundle":"https://pith.science/pith/L7TE3XRY65ZLJFARKQBV3MBQ4Z/bundle.json","state":"https://pith.science/pith/L7TE3XRY65ZLJFARKQBV3MBQ4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7TE3XRY65ZLJFARKQBV3MBQ4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L7TE3XRY65ZLJFARKQBV3MBQ4Z","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":"edca38c5715bc52988cdb7137b85a99ef374d5295738834460b56b1946069ce3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-05T01:18:25Z","title_canon_sha256":"60fb0a7d57b6843902d2841d088704fc802b69463bc442c6e678bad1f973ecc8"},"schema_version":"1.0","source":{"id":"1203.0795","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0795","created_at":"2026-05-18T03:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0795v2","created_at":"2026-05-18T03:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0795","created_at":"2026-05-18T03:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"L7TE3XRY65ZL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L7TE3XRY65ZLJFAR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L7TE3XRY","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:85bf8052c9a0a4399f9f203bfd00de31f6abade6fc1deb90b030909d7717d9bd","target":"graph","created_at":"2026-05-18T03:53:06Z","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":"In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare these results to analogous work for contiguous tree patterns. Next, we give an explicit generating function that counts binary trees avoiding a single non-contiguous tree pattern according to number of leaves. In addition, we enumerate binary trees that simultaneously avoid more than one tree pattern. Finally, we explore connections between pattern-avoiding t","authors_text":"Casey Wynn, Lara Pudwell, Michael Dairyko, Samantha Tyner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-05T01:18:25Z","title":"Non-Contiguous Pattern Avoidance in Binary Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0795","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:5a3cd5958d5aef97a920d8ee652f8f436422d9127e6b74262ebf3a9b3c4d9155","target":"record","created_at":"2026-05-18T03:53:06Z","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":"edca38c5715bc52988cdb7137b85a99ef374d5295738834460b56b1946069ce3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-05T01:18:25Z","title_canon_sha256":"60fb0a7d57b6843902d2841d088704fc802b69463bc442c6e678bad1f973ecc8"},"schema_version":"1.0","source":{"id":"1203.0795","kind":"arxiv","version":2}},"canonical_sha256":"5fe64dde38f772b4941154035db030e66fda2686297259f9b1c46dee30d00f22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fe64dde38f772b4941154035db030e66fda2686297259f9b1c46dee30d00f22","first_computed_at":"2026-05-18T03:53:06.725058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:06.725058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"np0dTfmbRFM3AcsbAHREBHC6LBu78Nwfa8d6Ku3zksHyHKgStukA+uVge4H9SjqQchCMgIJar3EdkB6ami9dDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:06.725767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0795","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a3cd5958d5aef97a920d8ee652f8f436422d9127e6b74262ebf3a9b3c4d9155","sha256:85bf8052c9a0a4399f9f203bfd00de31f6abade6fc1deb90b030909d7717d9bd"],"state_sha256":"7bc784a5deeb9e50272ca490364399e7f0f3687c694151038a8f3fc0cde9ba9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A9c/5dRzMyLYYEUYug1wttM5Qb2jqHBH/BEWOGcpBfeAuHJ45g7txi0UbDGQXSpV/UJPLi851cKwqzCyWlygAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:35:26.673211Z","bundle_sha256":"2f0800474b5b6917ea4b1714291bb7dcaa633c2f7c6c8c8349a732c4ef3f810e"}}