{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OY6GZGWHNSM73X4SXWZUYYJIUU","short_pith_number":"pith:OY6GZGWH","canonical_record":{"source":{"id":"1601.03659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T16:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"60ce4a0f35770eaf48e339e6f24f1a3adeaba10190c48f7c750157e759ce0771","abstract_canon_sha256":"d3b02224e270843b97d2e64df2c6a47b2d3825cfa962ad000eee716950861f08"},"schema_version":"1.0"},"canonical_sha256":"763c6c9ac76c99fddf92bdb34c6128a510e0c70063741ed5f9d67c9625ac36af","source":{"kind":"arxiv","id":"1601.03659","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03659","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03659v1","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03659","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"OY6GZGWHNSM7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OY6GZGWHNSM73X4S","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OY6GZGWH","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OY6GZGWHNSM73X4SXWZUYYJIUU","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T16:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"60ce4a0f35770eaf48e339e6f24f1a3adeaba10190c48f7c750157e759ce0771","abstract_canon_sha256":"d3b02224e270843b97d2e64df2c6a47b2d3825cfa962ad000eee716950861f08"},"schema_version":"1.0"},"canonical_sha256":"763c6c9ac76c99fddf92bdb34c6128a510e0c70063741ed5f9d67c9625ac36af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:52.911786Z","signature_b64":"YJVcUY2Z4MXJYAPhxevkhAW6/l+8Ss5XkD3noQGktAU9tzYL5cQVwD0T4IPGx8Wr5WItgli4PY2FwNziObRlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"763c6c9ac76c99fddf92bdb34c6128a510e0c70063741ed5f9d67c9625ac36af","last_reissued_at":"2026-05-18T01:22:52.911260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:52.911260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03659","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-18T01:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VE874SGv/kUTnzen2oiHG4jeO+Z3DEyveLFUeDCz4xWVniacbdxhJ6yDnllDPGqSVR059mHFnjA/v65K1d8CDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:20:08.291425Z"},"content_sha256":"1a5bf81ea47848ad176971786e993a78547393205040ca9455c90bd31f1e47b3","schema_version":"1.0","event_id":"sha256:1a5bf81ea47848ad176971786e993a78547393205040ca9455c90bd31f1e47b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OY6GZGWHNSM73X4SXWZUYYJIUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of union-free families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Zsolt Wagner, Jozsef Balogh","submitted_at":"2016-01-14T16:47:30Z","abstract_excerpt":"A family of sets is union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to the third set. Kleitman proved that every union-free family has size at most $(1+o(1))\\binom{n}{n/2}$. Later, Burosch--Demetrovics-Katona-Kleitman-Sapozhenko asked for the number $\\alpha(n)$ of such families, and they proved that $2^{\\binom{n}{n/2}}\\leq \\alpha(n) \\leq 2^{2\\sqrt{2}\\binom{n}{n/2}(1+o(1))}$. They conjectured that the constant $2\\sqrt{2}$ can be removed in the exponent of the right hand side. We prove their conjecture by formulating a new container-ty"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03659","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-18T01:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4WhDXx4yVPTxF3IvKiTr7gQ0kX7Teh9K1b+2u5rEvh5ma5ST8MeuR1pHHRiQsNU6QOVdspTRfp5DV9HZQLREDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:20:08.291763Z"},"content_sha256":"68ab9b2b772cead88c29bc42f72dde647a13e77454b537e7b4a6a2ad0fb4fc0a","schema_version":"1.0","event_id":"sha256:68ab9b2b772cead88c29bc42f72dde647a13e77454b537e7b4a6a2ad0fb4fc0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OY6GZGWHNSM73X4SXWZUYYJIUU/bundle.json","state_url":"https://pith.science/pith/OY6GZGWHNSM73X4SXWZUYYJIUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OY6GZGWHNSM73X4SXWZUYYJIUU/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-09T10:20:08Z","links":{"resolver":"https://pith.science/pith/OY6GZGWHNSM73X4SXWZUYYJIUU","bundle":"https://pith.science/pith/OY6GZGWHNSM73X4SXWZUYYJIUU/bundle.json","state":"https://pith.science/pith/OY6GZGWHNSM73X4SXWZUYYJIUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OY6GZGWHNSM73X4SXWZUYYJIUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OY6GZGWHNSM73X4SXWZUYYJIUU","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":"d3b02224e270843b97d2e64df2c6a47b2d3825cfa962ad000eee716950861f08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T16:47:30Z","title_canon_sha256":"60ce4a0f35770eaf48e339e6f24f1a3adeaba10190c48f7c750157e759ce0771"},"schema_version":"1.0","source":{"id":"1601.03659","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03659","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03659v1","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03659","created_at":"2026-05-18T01:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"OY6GZGWHNSM7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OY6GZGWHNSM73X4S","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OY6GZGWH","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:68ab9b2b772cead88c29bc42f72dde647a13e77454b537e7b4a6a2ad0fb4fc0a","target":"graph","created_at":"2026-05-18T01:22:52Z","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 of sets is union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to the third set. Kleitman proved that every union-free family has size at most $(1+o(1))\\binom{n}{n/2}$. Later, Burosch--Demetrovics-Katona-Kleitman-Sapozhenko asked for the number $\\alpha(n)$ of such families, and they proved that $2^{\\binom{n}{n/2}}\\leq \\alpha(n) \\leq 2^{2\\sqrt{2}\\binom{n}{n/2}(1+o(1))}$. They conjectured that the constant $2\\sqrt{2}$ can be removed in the exponent of the right hand side. We prove their conjecture by formulating a new container-ty","authors_text":"Adam Zsolt Wagner, Jozsef Balogh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T16:47:30Z","title":"On the number of union-free families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03659","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:1a5bf81ea47848ad176971786e993a78547393205040ca9455c90bd31f1e47b3","target":"record","created_at":"2026-05-18T01:22:52Z","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":"d3b02224e270843b97d2e64df2c6a47b2d3825cfa962ad000eee716950861f08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T16:47:30Z","title_canon_sha256":"60ce4a0f35770eaf48e339e6f24f1a3adeaba10190c48f7c750157e759ce0771"},"schema_version":"1.0","source":{"id":"1601.03659","kind":"arxiv","version":1}},"canonical_sha256":"763c6c9ac76c99fddf92bdb34c6128a510e0c70063741ed5f9d67c9625ac36af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"763c6c9ac76c99fddf92bdb34c6128a510e0c70063741ed5f9d67c9625ac36af","first_computed_at":"2026-05-18T01:22:52.911260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:52.911260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YJVcUY2Z4MXJYAPhxevkhAW6/l+8Ss5XkD3noQGktAU9tzYL5cQVwD0T4IPGx8Wr5WItgli4PY2FwNziObRlDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:52.911786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03659","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a5bf81ea47848ad176971786e993a78547393205040ca9455c90bd31f1e47b3","sha256:68ab9b2b772cead88c29bc42f72dde647a13e77454b537e7b4a6a2ad0fb4fc0a"],"state_sha256":"71be13ae4605f47d2a45fb32d53acfbab54cad69da57fe4639a15d515d3146c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XG4dIQfqNQwP2gUqDVR62cCM2Y64xMjYU0IsOuDXi9QB8HmQPx5G7fM7GKQkKsTD9Tzv1fI6NNEC6QnN3Vm7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:20:08.293630Z","bundle_sha256":"8d53fcac8fe3765d41fab85a2a8c7f3ec83cfe30b0febf9475e7e01bb6ef5557"}}