{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:N3BO4UXPHLTJ3NQ5NGGAQRDYKO","short_pith_number":"pith:N3BO4UXP","schema_version":"1.0","canonical_sha256":"6ec2ee52ef3ae69db61d698c084478539be4ec8b1327e062fde0304a8d67f357","source":{"kind":"arxiv","id":"1106.2315","version":1},"attestation_state":"computed","paper":{"title":"Set families with a forbidden induced subposet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Edward Boehnlein, Tao Jiang","submitted_at":"2011-06-12T14:48:37Z","abstract_excerpt":"For each poset $H$ whose Hasse diagram is a tree of height $k$, we show that the largest size of a family $\\cF$ of subsets of $[n]=\\{1,..., n\\}$ not containing $H$ as an induced subposet is asymptotic to $(k-1){n\\choose \\fl{n/2}}$. This extends the result of Bukh \\cite{bukh}, which in turn generalizes several known results including Sperner's theorem."},"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":"1106.2315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-12T14:48:37Z","cross_cats_sorted":[],"title_canon_sha256":"715df648c3f121da19f64bfb16abb8c42c39d693c162db106f376129f4c46892","abstract_canon_sha256":"23b1b36000da94b42d5cecef52b8d2590bb86fd5f8efdae1335fc0afb33a686f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:06.024254Z","signature_b64":"M1eh+HpH00aZ1FG5Qc6Po/Ll5S9inC37/k8G5QncS/81sS/RmQo7A8rI6X9GxWmOHR4eJwxUQ8gpKW5Xk/k2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ec2ee52ef3ae69db61d698c084478539be4ec8b1327e062fde0304a8d67f357","last_reissued_at":"2026-05-18T04:20:06.023750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:06.023750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set families with a forbidden induced subposet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Edward Boehnlein, Tao Jiang","submitted_at":"2011-06-12T14:48:37Z","abstract_excerpt":"For each poset $H$ whose Hasse diagram is a tree of height $k$, we show that the largest size of a family $\\cF$ of subsets of $[n]=\\{1,..., n\\}$ not containing $H$ as an induced subposet is asymptotic to $(k-1){n\\choose \\fl{n/2}}$. This extends the result of Bukh \\cite{bukh}, which in turn generalizes several known results including Sperner's theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2315","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":"1106.2315","created_at":"2026-05-18T04:20:06.023822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.2315v1","created_at":"2026-05-18T04:20:06.023822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2315","created_at":"2026-05-18T04:20:06.023822+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3BO4UXPHLTJ","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3BO4UXPHLTJ3NQ5","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3BO4UXP","created_at":"2026-05-18T12:26:37.096874+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/N3BO4UXPHLTJ3NQ5NGGAQRDYKO","json":"https://pith.science/pith/N3BO4UXPHLTJ3NQ5NGGAQRDYKO.json","graph_json":"https://pith.science/api/pith-number/N3BO4UXPHLTJ3NQ5NGGAQRDYKO/graph.json","events_json":"https://pith.science/api/pith-number/N3BO4UXPHLTJ3NQ5NGGAQRDYKO/events.json","paper":"https://pith.science/paper/N3BO4UXP"},"agent_actions":{"view_html":"https://pith.science/pith/N3BO4UXPHLTJ3NQ5NGGAQRDYKO","download_json":"https://pith.science/pith/N3BO4UXPHLTJ3NQ5NGGAQRDYKO.json","view_paper":"https://pith.science/paper/N3BO4UXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.2315&json=true","fetch_graph":"https://pith.science/api/pith-number/N3BO4UXPHLTJ3NQ5NGGAQRDYKO/graph.json","fetch_events":"https://pith.science/api/pith-number/N3BO4UXPHLTJ3NQ5NGGAQRDYKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3BO4UXPHLTJ3NQ5NGGAQRDYKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3BO4UXPHLTJ3NQ5NGGAQRDYKO/action/storage_attestation","attest_author":"https://pith.science/pith/N3BO4UXPHLTJ3NQ5NGGAQRDYKO/action/author_attestation","sign_citation":"https://pith.science/pith/N3BO4UXPHLTJ3NQ5NGGAQRDYKO/action/citation_signature","submit_replication":"https://pith.science/pith/N3BO4UXPHLTJ3NQ5NGGAQRDYKO/action/replication_record"}},"created_at":"2026-05-18T04:20:06.023822+00:00","updated_at":"2026-05-18T04:20:06.023822+00:00"}