{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IURPZSO4RYOLMWAPD7GU7NNKOG","short_pith_number":"pith:IURPZSO4","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"},"canonical_sha256":"4522fcc9dc8e1cb6580f1fcd4fb5aa719388f7f2327cebb484da5c3c4efe11ef","source":{"kind":"arxiv","id":"1309.7379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7379","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7379v1","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7379","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"IURPZSO4RYOL","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IURPZSO4RYOLMWAP","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IURPZSO4","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IURPZSO4RYOLMWAPD7GU7NNKOG","target":"record","payload":{"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"},"canonical_sha256":"4522fcc9dc8e1cb6580f1fcd4fb5aa719388f7f2327cebb484da5c3c4efe11ef","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"},"source_kind":"arxiv","source_id":"1309.7379","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-18T03:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0b5w4oWxzMAycYsEow/H9LeTcyunpp/xYnSAd1aXG3BfjpUeC+NtlL3i6mcop5LKIhGdG366TQNOtD3eE5wUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:08:05.898405Z"},"content_sha256":"650a5ccae10032fdbfb5bd197f0296fd09845b4bdc9dc64626a0d4d5e84ee9a6","schema_version":"1.0","event_id":"sha256:650a5ccae10032fdbfb5bd197f0296fd09845b4bdc9dc64626a0d4d5e84ee9a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IURPZSO4RYOLMWAPD7GU7NNKOG","target":"graph","payload":{"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"},"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:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5XuiM8jvK8iQsWnH2zO+ahSOqbq3Lad0jkJiien7JiADS8SLJd+rH3l4L4hKSZ0gh0m3l6dZzd0RL/5txS3yAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:08:05.898745Z"},"content_sha256":"2462665ca32e2f0fce17e61dede8d650d353a078adca8d6d8fe1cd8cc14aaf7b","schema_version":"1.0","event_id":"sha256:2462665ca32e2f0fce17e61dede8d650d353a078adca8d6d8fe1cd8cc14aaf7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IURPZSO4RYOLMWAPD7GU7NNKOG/bundle.json","state_url":"https://pith.science/pith/IURPZSO4RYOLMWAPD7GU7NNKOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IURPZSO4RYOLMWAPD7GU7NNKOG/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-20T06:08:05Z","links":{"resolver":"https://pith.science/pith/IURPZSO4RYOLMWAPD7GU7NNKOG","bundle":"https://pith.science/pith/IURPZSO4RYOLMWAPD7GU7NNKOG/bundle.json","state":"https://pith.science/pith/IURPZSO4RYOLMWAPD7GU7NNKOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IURPZSO4RYOLMWAPD7GU7NNKOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IURPZSO4RYOLMWAPD7GU7NNKOG","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":"2ea6b8c66d1ad93ff3fc6439da428142a27d54e0588de546bcd36de359e124e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-27T22:03:08Z","title_canon_sha256":"a3ba7c7d63356d37379f9c8b1734d742c7224f136693f13e766f117e8de81701"},"schema_version":"1.0","source":{"id":"1309.7379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7379","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7379v1","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7379","created_at":"2026-05-18T03:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"IURPZSO4RYOL","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IURPZSO4RYOLMWAP","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IURPZSO4","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:2462665ca32e2f0fce17e61dede8d650d353a078adca8d6d8fe1cd8cc14aaf7b","target":"graph","created_at":"2026-05-18T03:11:58Z","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":"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.","authors_text":"D\\'aniel T. Nagy, Gyula O. H. Katona","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-27T22:03:08Z","title":"Incomparable copies of a poset in the Boolean lattice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7379","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:650a5ccae10032fdbfb5bd197f0296fd09845b4bdc9dc64626a0d4d5e84ee9a6","target":"record","created_at":"2026-05-18T03:11:58Z","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":"2ea6b8c66d1ad93ff3fc6439da428142a27d54e0588de546bcd36de359e124e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-27T22:03:08Z","title_canon_sha256":"a3ba7c7d63356d37379f9c8b1734d742c7224f136693f13e766f117e8de81701"},"schema_version":"1.0","source":{"id":"1309.7379","kind":"arxiv","version":1}},"canonical_sha256":"4522fcc9dc8e1cb6580f1fcd4fb5aa719388f7f2327cebb484da5c3c4efe11ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4522fcc9dc8e1cb6580f1fcd4fb5aa719388f7f2327cebb484da5c3c4efe11ef","first_computed_at":"2026-05-18T03:11:58.888955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:58.888955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iYrrL2qw6dDZXP4uqwgAnBNTR2zDvMRB1ybRNMVvVShY0NyN8Re3tfnRu+VNcCc4wjzPTOTa+lbimmZrmUgtAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:58.889677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.7379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:650a5ccae10032fdbfb5bd197f0296fd09845b4bdc9dc64626a0d4d5e84ee9a6","sha256:2462665ca32e2f0fce17e61dede8d650d353a078adca8d6d8fe1cd8cc14aaf7b"],"state_sha256":"1db58a5292faaf227cbad87d72c754bad8bdf470433307122f966e581240b1fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1p6sQqFU/qLVAYo9PZPEWKVz1rOw+aK/J0bZkZet8QGrCy/X/On7RjltoqYu7Lv4XKukawoMFOzjMqvETwh0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:08:05.900603Z","bundle_sha256":"500f58204c9d7cc2d0b0dfade3ac43fd8a18ae278af11b3243d08d84e67b1d20"}}