{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GEXI34UINB3IJVKKQLQJAC7LVA","short_pith_number":"pith:GEXI34UI","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"},"canonical_sha256":"312e8df288687684d54a82e0900beba812748879d159791b3543dc359f66adc7","source":{"kind":"arxiv","id":"1207.2923","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2923","created_at":"2026-05-18T03:51:13Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2923v1","created_at":"2026-05-18T03:51:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2923","created_at":"2026-05-18T03:51:13Z"},{"alias_kind":"pith_short_12","alias_value":"GEXI34UINB3I","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GEXI34UINB3IJVKK","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GEXI34UI","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GEXI34UINB3IJVKKQLQJAC7LVA","target":"record","payload":{"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"},"canonical_sha256":"312e8df288687684d54a82e0900beba812748879d159791b3543dc359f66adc7","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"},"source_kind":"arxiv","source_id":"1207.2923","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:51:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWPPjtKhJLdmBKINST7l15wGGiC7JQgUlm3+npgH9LLswX1865ha2TrJIs0SykxqjkJUYpHCFenTFxTGY9tgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:25:50.547899Z"},"content_sha256":"68c6455192fa081775255d4181a4ec2062c8668dd220895707c8a2df922baa53","schema_version":"1.0","event_id":"sha256:68c6455192fa081775255d4181a4ec2062c8668dd220895707c8a2df922baa53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GEXI34UINB3IJVKKQLQJAC7LVA","target":"graph","payload":{"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"},"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:51:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4XMlHFESupIYm7pmsYZHdxGIe8rdhmXvmmYaPY5oyDg3/nnZmWLOa3p/MpHMW0aQWd8CJHY+VTPDhDXjCKhSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:25:50.548237Z"},"content_sha256":"763dfe188d2db1c2b1f8c4bc67a7ba83675ebafcc5129ba12b806df5c24c3b44","schema_version":"1.0","event_id":"sha256:763dfe188d2db1c2b1f8c4bc67a7ba83675ebafcc5129ba12b806df5c24c3b44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEXI34UINB3IJVKKQLQJAC7LVA/bundle.json","state_url":"https://pith.science/pith/GEXI34UINB3IJVKKQLQJAC7LVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEXI34UINB3IJVKKQLQJAC7LVA/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-01T03:25:50Z","links":{"resolver":"https://pith.science/pith/GEXI34UINB3IJVKKQLQJAC7LVA","bundle":"https://pith.science/pith/GEXI34UINB3IJVKKQLQJAC7LVA/bundle.json","state":"https://pith.science/pith/GEXI34UINB3IJVKKQLQJAC7LVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEXI34UINB3IJVKKQLQJAC7LVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GEXI34UINB3IJVKKQLQJAC7LVA","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":"04c9a406bdcdd9223541bc1482202aefc15f55df9088639b53c525d4ca0d75c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-12T11:12:21Z","title_canon_sha256":"9b29c646f0dd060420e555325eafe12243c53ae8f4e530e81574268d60951b00"},"schema_version":"1.0","source":{"id":"1207.2923","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2923","created_at":"2026-05-18T03:51:13Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2923v1","created_at":"2026-05-18T03:51:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2923","created_at":"2026-05-18T03:51:13Z"},{"alias_kind":"pith_short_12","alias_value":"GEXI34UINB3I","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GEXI34UINB3IJVKK","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GEXI34UI","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:763dfe188d2db1c2b1f8c4bc67a7ba83675ebafcc5129ba12b806df5c24c3b44","target":"graph","created_at":"2026-05-18T03:51:13Z","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":"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)","authors_text":"Balazs Patkos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-12T11:12:21Z","title":"Families that remain $k$-Sperner even after omitting an element of their ground set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2923","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:68c6455192fa081775255d4181a4ec2062c8668dd220895707c8a2df922baa53","target":"record","created_at":"2026-05-18T03:51:13Z","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":"04c9a406bdcdd9223541bc1482202aefc15f55df9088639b53c525d4ca0d75c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-12T11:12:21Z","title_canon_sha256":"9b29c646f0dd060420e555325eafe12243c53ae8f4e530e81574268d60951b00"},"schema_version":"1.0","source":{"id":"1207.2923","kind":"arxiv","version":1}},"canonical_sha256":"312e8df288687684d54a82e0900beba812748879d159791b3543dc359f66adc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"312e8df288687684d54a82e0900beba812748879d159791b3543dc359f66adc7","first_computed_at":"2026-05-18T03:51:13.471956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:13.471956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"brSfCWTmzajT/xxeJcl7wO9hpHjv/DnALgDq6dk1+sOPJ4vMex0cqfIK0dta55HvyAJHY/mr9Nd+NROHnLefDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:13.472586Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2923","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68c6455192fa081775255d4181a4ec2062c8668dd220895707c8a2df922baa53","sha256:763dfe188d2db1c2b1f8c4bc67a7ba83675ebafcc5129ba12b806df5c24c3b44"],"state_sha256":"2f6ec2e5da02c02c4e2bc2b614a463b097347d60e27663714aca26129684358e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H272qPNJyLLCCcq+0wxztTPeGah2wdH0CpKJEkwbYUB8YHXKMNVs/uEixQ8HZzszBQjtt05YrCgBUPC4YP7aDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:25:50.550183Z","bundle_sha256":"e45f83bcd8bb61f02cbd51c8116fa2ffb646b09ee95761bf6eda6c16e85b0d09"}}