{"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"}