{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7QDH6L5NL4YSV5GXAY6ALRH37Q","short_pith_number":"pith:7QDH6L5N","schema_version":"1.0","canonical_sha256":"fc067f2fad5f312af4d7063c05c4fbfc2d4e624c98b6e5277fa3a943f1317797","source":{"kind":"arxiv","id":"1105.4453","version":1},"attestation_state":"computed","paper":{"title":"Saturating Sperner families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Bal\\'azs Patk\\'os, Cory Palmer, D\\'aniel Gerbner, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Nathan Lemons","submitted_at":"2011-05-23T10:00:13Z","abstract_excerpt":"A family $\\cF \\subseteq 2^{[n]}$ saturates the monotone decreasing property $\\cP$ if $\\cF$ satisfies $\\cP$ and one cannot add any set to $\\cF$ such that property $\\cP$ is still satisfied by the resulting family. We address the problem of finding the minimum size of a family saturating the $k$-Sperner property and the minimum size of a family that saturates the Sperner property and that consists only of $l$-sets and $(l+1)$-sets."},"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":"1105.4453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-23T10:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"199533c1d08669f3d9802a59dd9e773f15352cd5d62669a48f1174caadbd2678","abstract_canon_sha256":"5185381acddac55878584336e07c5ebb64097c0851faa04301a504e66639584f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:29.254830Z","signature_b64":"4KJ6JlsUjr+vTp3rwPhHMVRXEK33R+MYF6kKSI2FXAO05DEpAUWyLEOuoAPiAZwr+HbpAXb5pW1BDa2FCtqeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc067f2fad5f312af4d7063c05c4fbfc2d4e624c98b6e5277fa3a943f1317797","last_reissued_at":"2026-05-18T04:21:29.254469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:29.254469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Saturating Sperner families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Bal\\'azs Patk\\'os, Cory Palmer, D\\'aniel Gerbner, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Nathan Lemons","submitted_at":"2011-05-23T10:00:13Z","abstract_excerpt":"A family $\\cF \\subseteq 2^{[n]}$ saturates the monotone decreasing property $\\cP$ if $\\cF$ satisfies $\\cP$ and one cannot add any set to $\\cF$ such that property $\\cP$ is still satisfied by the resulting family. We address the problem of finding the minimum size of a family saturating the $k$-Sperner property and the minimum size of a family that saturates the Sperner property and that consists only of $l$-sets and $(l+1)$-sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4453","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":"1105.4453","created_at":"2026-05-18T04:21:29.254531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.4453v1","created_at":"2026-05-18T04:21:29.254531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4453","created_at":"2026-05-18T04:21:29.254531+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QDH6L5NL4YS","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QDH6L5NL4YSV5GX","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QDH6L5N","created_at":"2026-05-18T12:26:22.705136+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/7QDH6L5NL4YSV5GXAY6ALRH37Q","json":"https://pith.science/pith/7QDH6L5NL4YSV5GXAY6ALRH37Q.json","graph_json":"https://pith.science/api/pith-number/7QDH6L5NL4YSV5GXAY6ALRH37Q/graph.json","events_json":"https://pith.science/api/pith-number/7QDH6L5NL4YSV5GXAY6ALRH37Q/events.json","paper":"https://pith.science/paper/7QDH6L5N"},"agent_actions":{"view_html":"https://pith.science/pith/7QDH6L5NL4YSV5GXAY6ALRH37Q","download_json":"https://pith.science/pith/7QDH6L5NL4YSV5GXAY6ALRH37Q.json","view_paper":"https://pith.science/paper/7QDH6L5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.4453&json=true","fetch_graph":"https://pith.science/api/pith-number/7QDH6L5NL4YSV5GXAY6ALRH37Q/graph.json","fetch_events":"https://pith.science/api/pith-number/7QDH6L5NL4YSV5GXAY6ALRH37Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QDH6L5NL4YSV5GXAY6ALRH37Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QDH6L5NL4YSV5GXAY6ALRH37Q/action/storage_attestation","attest_author":"https://pith.science/pith/7QDH6L5NL4YSV5GXAY6ALRH37Q/action/author_attestation","sign_citation":"https://pith.science/pith/7QDH6L5NL4YSV5GXAY6ALRH37Q/action/citation_signature","submit_replication":"https://pith.science/pith/7QDH6L5NL4YSV5GXAY6ALRH37Q/action/replication_record"}},"created_at":"2026-05-18T04:21:29.254531+00:00","updated_at":"2026-05-18T04:21:29.254531+00:00"}