{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IURPZSO4RYOLMWAPD7GU7NNKOG","short_pith_number":"pith:IURPZSO4","schema_version":"1.0","canonical_sha256":"4522fcc9dc8e1cb6580f1fcd4fb5aa719388f7f2327cebb484da5c3c4efe11ef","source":{"kind":"arxiv","id":"1309.7379","version":1},"attestation_state":"computed","paper":{"title":"Incomparable copies of a poset in the Boolean lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'aniel T. Nagy, Gyula O. H. Katona","submitted_at":"2013-09-27T22:03:08Z","abstract_excerpt":"Let $B_n$ be the poset generated by the subsets of $[n]$ with the inclusion as relation and let $P$ be a finite poset. We want to embed $P$ into $B_n$ as many times as possible such that the subsets in different copies are incomparable. The maximum number of such embeddings is asymptotically determined for all finite posets $P$ as $\\frac{{n \\choose \\lfloor n/2\\rfloor}}{M(P)}$, where $M(P)$ denotes the minimal size of the convex hull of a copy of $P$. We discuss both weak and strong (induced) embeddings."},"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":"1309.7379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-27T22:03:08Z","cross_cats_sorted":[],"title_canon_sha256":"a3ba7c7d63356d37379f9c8b1734d742c7224f136693f13e766f117e8de81701","abstract_canon_sha256":"2ea6b8c66d1ad93ff3fc6439da428142a27d54e0588de546bcd36de359e124e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:58.889677Z","signature_b64":"iYrrL2qw6dDZXP4uqwgAnBNTR2zDvMRB1ybRNMVvVShY0NyN8Re3tfnRu+VNcCc4wjzPTOTa+lbimmZrmUgtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4522fcc9dc8e1cb6580f1fcd4fb5aa719388f7f2327cebb484da5c3c4efe11ef","last_reissued_at":"2026-05-18T03:11:58.888955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:58.888955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incomparable copies of a poset in the Boolean lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'aniel T. Nagy, Gyula O. H. Katona","submitted_at":"2013-09-27T22:03:08Z","abstract_excerpt":"Let $B_n$ be the poset generated by the subsets of $[n]$ with the inclusion as relation and let $P$ be a finite poset. We want to embed $P$ into $B_n$ as many times as possible such that the subsets in different copies are incomparable. The maximum number of such embeddings is asymptotically determined for all finite posets $P$ as $\\frac{{n \\choose \\lfloor n/2\\rfloor}}{M(P)}$, where $M(P)$ denotes the minimal size of the convex hull of a copy of $P$. We discuss both weak and strong (induced) embeddings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7379","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":"1309.7379","created_at":"2026-05-18T03:11:58.889060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7379v1","created_at":"2026-05-18T03:11:58.889060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7379","created_at":"2026-05-18T03:11:58.889060+00:00"},{"alias_kind":"pith_short_12","alias_value":"IURPZSO4RYOL","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"IURPZSO4RYOLMWAP","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"IURPZSO4","created_at":"2026-05-18T12:27:49.015174+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/IURPZSO4RYOLMWAPD7GU7NNKOG","json":"https://pith.science/pith/IURPZSO4RYOLMWAPD7GU7NNKOG.json","graph_json":"https://pith.science/api/pith-number/IURPZSO4RYOLMWAPD7GU7NNKOG/graph.json","events_json":"https://pith.science/api/pith-number/IURPZSO4RYOLMWAPD7GU7NNKOG/events.json","paper":"https://pith.science/paper/IURPZSO4"},"agent_actions":{"view_html":"https://pith.science/pith/IURPZSO4RYOLMWAPD7GU7NNKOG","download_json":"https://pith.science/pith/IURPZSO4RYOLMWAPD7GU7NNKOG.json","view_paper":"https://pith.science/paper/IURPZSO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7379&json=true","fetch_graph":"https://pith.science/api/pith-number/IURPZSO4RYOLMWAPD7GU7NNKOG/graph.json","fetch_events":"https://pith.science/api/pith-number/IURPZSO4RYOLMWAPD7GU7NNKOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IURPZSO4RYOLMWAPD7GU7NNKOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IURPZSO4RYOLMWAPD7GU7NNKOG/action/storage_attestation","attest_author":"https://pith.science/pith/IURPZSO4RYOLMWAPD7GU7NNKOG/action/author_attestation","sign_citation":"https://pith.science/pith/IURPZSO4RYOLMWAPD7GU7NNKOG/action/citation_signature","submit_replication":"https://pith.science/pith/IURPZSO4RYOLMWAPD7GU7NNKOG/action/replication_record"}},"created_at":"2026-05-18T03:11:58.889060+00:00","updated_at":"2026-05-18T03:11:58.889060+00:00"}