{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VCUT7PTHTIIQLAI4WN2YQVG2VO","short_pith_number":"pith:VCUT7PTH","canonical_record":{"source":{"id":"1701.03010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-11T15:24:00Z","cross_cats_sorted":[],"title_canon_sha256":"0c83946757b5d3c9ed1a472f6cfe10c11f70f3de111b5d72a8ccb544fab0279a","abstract_canon_sha256":"6f3c0aa1608278f60b0529facca7e6bbed6a0c2c3331d02379defb3bd63bef3e"},"schema_version":"1.0"},"canonical_sha256":"a8a93fbe679a1105811cb3758854daaba83be7cd27debb0030923af94a850020","source":{"kind":"arxiv","id":"1701.03010","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03010","created_at":"2026-05-18T00:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03010v2","created_at":"2026-05-18T00:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03010","created_at":"2026-05-18T00:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"VCUT7PTHTIIQ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VCUT7PTHTIIQLAI4","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VCUT7PTH","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VCUT7PTHTIIQLAI4WN2YQVG2VO","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-11T15:24:00Z","cross_cats_sorted":[],"title_canon_sha256":"0c83946757b5d3c9ed1a472f6cfe10c11f70f3de111b5d72a8ccb544fab0279a","abstract_canon_sha256":"6f3c0aa1608278f60b0529facca7e6bbed6a0c2c3331d02379defb3bd63bef3e"},"schema_version":"1.0"},"canonical_sha256":"a8a93fbe679a1105811cb3758854daaba83be7cd27debb0030923af94a850020","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:42.182115Z","signature_b64":"jRmHwcZvHDFeIr9JnVk9iR6kjZzWTx6vjcsLDhkf/vOitCLRIdAfpEcEfaZVgWhPnj9WxAGrgOy2s/Im3pt1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8a93fbe679a1105811cb3758854daaba83be7cd27debb0030923af94a850020","last_reissued_at":"2026-05-18T00:37:42.181300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:42.181300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03010","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-18T00:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fx11nEGobd7woJZoO15jv6W4Ix05YxyAZKf7QMns42qL/NZbkesMsWcv/tca2RSYO86D55EB6wNQdVwJjNxtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:03:34.565236Z"},"content_sha256":"0a1f51b8aaf79762d848b20704d1fba749b26a8ebcc1d3c75cb2cb2c19349f6a","schema_version":"1.0","event_id":"sha256:0a1f51b8aaf79762d848b20704d1fba749b26a8ebcc1d3c75cb2cb2c19349f6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VCUT7PTHTIIQLAI4WN2YQVG2VO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Saturation Number of Induced Subposets of the Boolean Lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Reiniger, Bill Kay, Eric Sullivan, Heather C. Smith, Lucas Kramer, Michael Ferrara, Ryan R. Martin","submitted_at":"2017-01-11T15:24:00Z","abstract_excerpt":"Given a poset $P$, a family $F$ of elements in the Boolean lattice is said to be $P$-saturated if (1) $F$ contains no copy of $P$ as a subposet and (2) every proper superset of $F$ contains a copy of $P$ as a subposet. The maximum size of a $P$-saturated family is denoted by $La(n,P)$, which has been studied for a number of choices of $P$. The minimum size of a $P$-saturated family, $sat(n,P)$, was introduced by Gerbner et al. (2013), and parallels the deep literature on the saturation function for graphs.\n  We introduce and study the concept of saturation for induced subposets. As opposed to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03010","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-18T00:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vPeAYfwG5LWPvXdE93Xy6sEaxWZ2bg0ZiIbQdAUrJ34L1FnCD9X2QR+5q22Y99xCp19yasY+/L6PoR4j+E0NBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:03:34.566092Z"},"content_sha256":"e3e4978ba6143c30a1cf30aa42160b60fcbfcf3f19ab2d9387493d08c6f17d7a","schema_version":"1.0","event_id":"sha256:e3e4978ba6143c30a1cf30aa42160b60fcbfcf3f19ab2d9387493d08c6f17d7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCUT7PTHTIIQLAI4WN2YQVG2VO/bundle.json","state_url":"https://pith.science/pith/VCUT7PTHTIIQLAI4WN2YQVG2VO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCUT7PTHTIIQLAI4WN2YQVG2VO/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-30T09:03:34Z","links":{"resolver":"https://pith.science/pith/VCUT7PTHTIIQLAI4WN2YQVG2VO","bundle":"https://pith.science/pith/VCUT7PTHTIIQLAI4WN2YQVG2VO/bundle.json","state":"https://pith.science/pith/VCUT7PTHTIIQLAI4WN2YQVG2VO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCUT7PTHTIIQLAI4WN2YQVG2VO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VCUT7PTHTIIQLAI4WN2YQVG2VO","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":"6f3c0aa1608278f60b0529facca7e6bbed6a0c2c3331d02379defb3bd63bef3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-11T15:24:00Z","title_canon_sha256":"0c83946757b5d3c9ed1a472f6cfe10c11f70f3de111b5d72a8ccb544fab0279a"},"schema_version":"1.0","source":{"id":"1701.03010","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03010","created_at":"2026-05-18T00:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03010v2","created_at":"2026-05-18T00:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03010","created_at":"2026-05-18T00:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"VCUT7PTHTIIQ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VCUT7PTHTIIQLAI4","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VCUT7PTH","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:e3e4978ba6143c30a1cf30aa42160b60fcbfcf3f19ab2d9387493d08c6f17d7a","target":"graph","created_at":"2026-05-18T00:37:42Z","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":"Given a poset $P$, a family $F$ of elements in the Boolean lattice is said to be $P$-saturated if (1) $F$ contains no copy of $P$ as a subposet and (2) every proper superset of $F$ contains a copy of $P$ as a subposet. The maximum size of a $P$-saturated family is denoted by $La(n,P)$, which has been studied for a number of choices of $P$. The minimum size of a $P$-saturated family, $sat(n,P)$, was introduced by Gerbner et al. (2013), and parallels the deep literature on the saturation function for graphs.\n  We introduce and study the concept of saturation for induced subposets. As opposed to ","authors_text":"Benjamin Reiniger, Bill Kay, Eric Sullivan, Heather C. Smith, Lucas Kramer, Michael Ferrara, Ryan R. Martin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-11T15:24:00Z","title":"The Saturation Number of Induced Subposets of the Boolean Lattice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03010","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:0a1f51b8aaf79762d848b20704d1fba749b26a8ebcc1d3c75cb2cb2c19349f6a","target":"record","created_at":"2026-05-18T00:37:42Z","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":"6f3c0aa1608278f60b0529facca7e6bbed6a0c2c3331d02379defb3bd63bef3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-11T15:24:00Z","title_canon_sha256":"0c83946757b5d3c9ed1a472f6cfe10c11f70f3de111b5d72a8ccb544fab0279a"},"schema_version":"1.0","source":{"id":"1701.03010","kind":"arxiv","version":2}},"canonical_sha256":"a8a93fbe679a1105811cb3758854daaba83be7cd27debb0030923af94a850020","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8a93fbe679a1105811cb3758854daaba83be7cd27debb0030923af94a850020","first_computed_at":"2026-05-18T00:37:42.181300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:42.181300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jRmHwcZvHDFeIr9JnVk9iR6kjZzWTx6vjcsLDhkf/vOitCLRIdAfpEcEfaZVgWhPnj9WxAGrgOy2s/Im3pt1Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:42.182115Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03010","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a1f51b8aaf79762d848b20704d1fba749b26a8ebcc1d3c75cb2cb2c19349f6a","sha256:e3e4978ba6143c30a1cf30aa42160b60fcbfcf3f19ab2d9387493d08c6f17d7a"],"state_sha256":"eba4b53aefd7d3b279060ca9c6c4d864509cc29ace9323369742d54af3187e7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iovfs2oMzevOJTRN8aPabJaL1q2oI5lUmL54EdZGt3XpKqmGP1FXlFPrr87O0uLqKMD9rWXvKoOF2AvnFlaJBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:03:34.569781Z","bundle_sha256":"8f07c50b1fcbd2e5d751b94fdf4eca9c65f181a11d80f89fb5f2722bf452d8f7"}}