{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3BE42OWHALOJW2KZMYT6G44XRU","short_pith_number":"pith:3BE42OWH","canonical_record":{"source":{"id":"1601.07149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-26T20:14:37Z","cross_cats_sorted":[],"title_canon_sha256":"95998bec59defe76601d00846e40d64a271da9beff8908175d863c1e278753da","abstract_canon_sha256":"f7c11f8c85467d98edd78301af83750c9be2652839982e871a26425aaa352819"},"schema_version":"1.0"},"canonical_sha256":"d849cd3ac702dc9b69596627e373978d208dc0acae348b5b0010c7dd7c4d0634","source":{"kind":"arxiv","id":"1601.07149","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07149","created_at":"2026-05-18T01:21:57Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07149v1","created_at":"2026-05-18T01:21:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07149","created_at":"2026-05-18T01:21:57Z"},{"alias_kind":"pith_short_12","alias_value":"3BE42OWHALOJ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3BE42OWHALOJW2KZ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3BE42OWH","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3BE42OWHALOJW2KZMYT6G44XRU","target":"record","payload":{"canonical_record":{"source":{"id":"1601.07149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-26T20:14:37Z","cross_cats_sorted":[],"title_canon_sha256":"95998bec59defe76601d00846e40d64a271da9beff8908175d863c1e278753da","abstract_canon_sha256":"f7c11f8c85467d98edd78301af83750c9be2652839982e871a26425aaa352819"},"schema_version":"1.0"},"canonical_sha256":"d849cd3ac702dc9b69596627e373978d208dc0acae348b5b0010c7dd7c4d0634","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:57.288930Z","signature_b64":"lCIt+Oj4+08Qa00DT3nunWmt94Kkbd+MG8EWmgseWzLwIP54652+OIIp6JQrceJ9uD6Q2hh2Abr8hV5zezw2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d849cd3ac702dc9b69596627e373978d208dc0acae348b5b0010c7dd7c4d0634","last_reissued_at":"2026-05-18T01:21:57.288296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:57.288296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.07149","source_version":1,"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-18T01:21:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3/o5ejpya+uTY231wtYpjOS5lHRoJO9lC+ENX1OrfcqzqvX2D0inpX5OftnmdLqif5G5njBRk3xtHKvXCeTvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:17:56.934589Z"},"content_sha256":"5dbc0925ae8941d461f1ad3640f00bccc889970d2c9ed2d69050f11de39575b8","schema_version":"1.0","event_id":"sha256:5dbc0925ae8941d461f1ad3640f00bccc889970d2c9ed2d69050f11de39575b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3BE42OWHALOJW2KZMYT6G44XRU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inducibility in binary trees and crossings in random tanglegrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Eva Czabarka, L\\'aszl\\'o A. Sz\\'ekely, Stephan Wagner","submitted_at":"2016-01-26T20:14:37Z","abstract_excerpt":"In analogy to other concepts of a similar nature, we define the inducibility of a rooted binary tree. Given a fixed rooted binary tree $B$ with $k$ leaves, we let $\\gamma(B,T)$ be the proportion of all subsets of $k$ leaves in $T$ that induce a tree isomorphic to $B$. The inducibility of $B$ is $\\limsup_{|T| \\to \\infty} \\gamma(B,T)$. We determine the inducibility in some special cases, show that every binary tree has positive inducibility and prove that caterpillars are the only binary trees with inducibility $1$. We also formulate some open problems and conjectures on the inducibility. Finall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07149","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"},"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-18T01:21:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B++MtyMFFM6NNGslmPSlxrWsnMLHjJrOKgY4qbNxH4583BrHXoGUoQnE4BAyiJmcUTaOX4FBP1TUqZ93To4WBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:17:56.934938Z"},"content_sha256":"4ba15f966ff9b457fefbb62f0451976b0a1c50304019165d10da992fc210ef3c","schema_version":"1.0","event_id":"sha256:4ba15f966ff9b457fefbb62f0451976b0a1c50304019165d10da992fc210ef3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BE42OWHALOJW2KZMYT6G44XRU/bundle.json","state_url":"https://pith.science/pith/3BE42OWHALOJW2KZMYT6G44XRU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BE42OWHALOJW2KZMYT6G44XRU/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-06-03T19:17:56Z","links":{"resolver":"https://pith.science/pith/3BE42OWHALOJW2KZMYT6G44XRU","bundle":"https://pith.science/pith/3BE42OWHALOJW2KZMYT6G44XRU/bundle.json","state":"https://pith.science/pith/3BE42OWHALOJW2KZMYT6G44XRU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BE42OWHALOJW2KZMYT6G44XRU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3BE42OWHALOJW2KZMYT6G44XRU","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":"f7c11f8c85467d98edd78301af83750c9be2652839982e871a26425aaa352819","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-26T20:14:37Z","title_canon_sha256":"95998bec59defe76601d00846e40d64a271da9beff8908175d863c1e278753da"},"schema_version":"1.0","source":{"id":"1601.07149","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07149","created_at":"2026-05-18T01:21:57Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07149v1","created_at":"2026-05-18T01:21:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07149","created_at":"2026-05-18T01:21:57Z"},{"alias_kind":"pith_short_12","alias_value":"3BE42OWHALOJ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3BE42OWHALOJW2KZ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3BE42OWH","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:4ba15f966ff9b457fefbb62f0451976b0a1c50304019165d10da992fc210ef3c","target":"graph","created_at":"2026-05-18T01:21:57Z","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 analogy to other concepts of a similar nature, we define the inducibility of a rooted binary tree. Given a fixed rooted binary tree $B$ with $k$ leaves, we let $\\gamma(B,T)$ be the proportion of all subsets of $k$ leaves in $T$ that induce a tree isomorphic to $B$. The inducibility of $B$ is $\\limsup_{|T| \\to \\infty} \\gamma(B,T)$. We determine the inducibility in some special cases, show that every binary tree has positive inducibility and prove that caterpillars are the only binary trees with inducibility $1$. We also formulate some open problems and conjectures on the inducibility. Finall","authors_text":"\\'Eva Czabarka, L\\'aszl\\'o A. Sz\\'ekely, Stephan Wagner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-26T20:14:37Z","title":"Inducibility in binary trees and crossings in random tanglegrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07149","kind":"arxiv","version":1},"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:5dbc0925ae8941d461f1ad3640f00bccc889970d2c9ed2d69050f11de39575b8","target":"record","created_at":"2026-05-18T01:21:57Z","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":"f7c11f8c85467d98edd78301af83750c9be2652839982e871a26425aaa352819","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-26T20:14:37Z","title_canon_sha256":"95998bec59defe76601d00846e40d64a271da9beff8908175d863c1e278753da"},"schema_version":"1.0","source":{"id":"1601.07149","kind":"arxiv","version":1}},"canonical_sha256":"d849cd3ac702dc9b69596627e373978d208dc0acae348b5b0010c7dd7c4d0634","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d849cd3ac702dc9b69596627e373978d208dc0acae348b5b0010c7dd7c4d0634","first_computed_at":"2026-05-18T01:21:57.288296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:57.288296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lCIt+Oj4+08Qa00DT3nunWmt94Kkbd+MG8EWmgseWzLwIP54652+OIIp6JQrceJ9uD6Q2hh2Abr8hV5zezw2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:57.288930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07149","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5dbc0925ae8941d461f1ad3640f00bccc889970d2c9ed2d69050f11de39575b8","sha256:4ba15f966ff9b457fefbb62f0451976b0a1c50304019165d10da992fc210ef3c"],"state_sha256":"f38f43c9cc0098e4c38319fb62fceb86de2c4970342083837725022a698dea8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MvvZED6tvUyt8Mvcta1//XfFsZhWB0eWDT2Iap+UMTnjkxmxZABYlJ+JD1IQKTfMvpmY4CsEqU9kPd9tYfZ9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:17:56.936927Z","bundle_sha256":"fcb5608aa39e7e4bacf3f8c25d31f0be03dbc8ce32e8953303eb38bbf7396af0"}}