{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GEXI34UINB3IJVKKQLQJAC7LVA","short_pith_number":"pith:GEXI34UI","schema_version":"1.0","canonical_sha256":"312e8df288687684d54a82e0900beba812748879d159791b3543dc359f66adc7","source":{"kind":"arxiv","id":"1207.2923","version":1},"attestation_state":"computed","paper":{"title":"Families that remain $k$-Sperner even after omitting an element of their ground set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Balazs Patkos","submitted_at":"2012-07-12T11:12:21Z","abstract_excerpt":"A family $\\cF\\subseteq 2^{[n]}$ of sets is said to be $l$-trace $k$-Sperner if for any $l$-subset $L \\subset [n]$ the family $\\cF|_L=\\{F|_L:F \\in \\cF\\}=\\{F \\cap L: F \\in \\cF\\}$ is $k$-Sperner, i.e. does not contain any chain of length $k+1$. The maximum size that an $l$-trace $k$-Sperner family $\\cF \\subseteq 2^{[n]}$ can have is denoted by $f(n,k,l)$. For pairs of integers $l<k$, if in a family $\\cG$ every pair of sets satisfies $||G_1|-|G_2||<k-l$, then $\\cG$ possesses the $(n-l)$-trace $k$-Sperner property. Among such families, the largest one is $\\cF_0=\\{F\\in 2^{[n]}: \\lfloor \\frac{n-(k-l)"},"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":"1207.2923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-12T11:12:21Z","cross_cats_sorted":[],"title_canon_sha256":"9b29c646f0dd060420e555325eafe12243c53ae8f4e530e81574268d60951b00","abstract_canon_sha256":"04c9a406bdcdd9223541bc1482202aefc15f55df9088639b53c525d4ca0d75c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:13.472586Z","signature_b64":"brSfCWTmzajT/xxeJcl7wO9hpHjv/DnALgDq6dk1+sOPJ4vMex0cqfIK0dta55HvyAJHY/mr9Nd+NROHnLefDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"312e8df288687684d54a82e0900beba812748879d159791b3543dc359f66adc7","last_reissued_at":"2026-05-18T03:51:13.471956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:13.471956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Families that remain $k$-Sperner even after omitting an element of their ground set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Balazs Patkos","submitted_at":"2012-07-12T11:12:21Z","abstract_excerpt":"A family $\\cF\\subseteq 2^{[n]}$ of sets is said to be $l$-trace $k$-Sperner if for any $l$-subset $L \\subset [n]$ the family $\\cF|_L=\\{F|_L:F \\in \\cF\\}=\\{F \\cap L: F \\in \\cF\\}$ is $k$-Sperner, i.e. does not contain any chain of length $k+1$. The maximum size that an $l$-trace $k$-Sperner family $\\cF \\subseteq 2^{[n]}$ can have is denoted by $f(n,k,l)$. For pairs of integers $l<k$, if in a family $\\cG$ every pair of sets satisfies $||G_1|-|G_2||<k-l$, then $\\cG$ possesses the $(n-l)$-trace $k$-Sperner property. Among such families, the largest one is $\\cF_0=\\{F\\in 2^{[n]}: \\lfloor \\frac{n-(k-l)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2923","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":"1207.2923","created_at":"2026-05-18T03:51:13.472055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2923v1","created_at":"2026-05-18T03:51:13.472055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2923","created_at":"2026-05-18T03:51:13.472055+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEXI34UINB3I","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEXI34UINB3IJVKK","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEXI34UI","created_at":"2026-05-18T12:27:06.952714+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/GEXI34UINB3IJVKKQLQJAC7LVA","json":"https://pith.science/pith/GEXI34UINB3IJVKKQLQJAC7LVA.json","graph_json":"https://pith.science/api/pith-number/GEXI34UINB3IJVKKQLQJAC7LVA/graph.json","events_json":"https://pith.science/api/pith-number/GEXI34UINB3IJVKKQLQJAC7LVA/events.json","paper":"https://pith.science/paper/GEXI34UI"},"agent_actions":{"view_html":"https://pith.science/pith/GEXI34UINB3IJVKKQLQJAC7LVA","download_json":"https://pith.science/pith/GEXI34UINB3IJVKKQLQJAC7LVA.json","view_paper":"https://pith.science/paper/GEXI34UI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2923&json=true","fetch_graph":"https://pith.science/api/pith-number/GEXI34UINB3IJVKKQLQJAC7LVA/graph.json","fetch_events":"https://pith.science/api/pith-number/GEXI34UINB3IJVKKQLQJAC7LVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEXI34UINB3IJVKKQLQJAC7LVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEXI34UINB3IJVKKQLQJAC7LVA/action/storage_attestation","attest_author":"https://pith.science/pith/GEXI34UINB3IJVKKQLQJAC7LVA/action/author_attestation","sign_citation":"https://pith.science/pith/GEXI34UINB3IJVKKQLQJAC7LVA/action/citation_signature","submit_replication":"https://pith.science/pith/GEXI34UINB3IJVKKQLQJAC7LVA/action/replication_record"}},"created_at":"2026-05-18T03:51:13.472055+00:00","updated_at":"2026-05-18T03:51:13.472055+00:00"}