{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GWFNYNNSBOPLILP2R6T4PMUSNI","short_pith_number":"pith:GWFNYNNS","canonical_record":{"source":{"id":"1106.0369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-02T06:15:54Z","cross_cats_sorted":[],"title_canon_sha256":"62f7a013fce839bc79f4bd3575f245fc798c935f17f2b21d6c2d954c705be456","abstract_canon_sha256":"1ae64a813a2eedd058e8397f4d0aa19a94ae75881c4757154f56eae0e7bd60d1"},"schema_version":"1.0"},"canonical_sha256":"358adc35b20b9eb42dfa8fa7c7b2926a0223b35e71e9bd13952eab45cd19fe55","source":{"kind":"arxiv","id":"1106.0369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0369","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0369v1","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0369","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"GWFNYNNSBOPL","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GWFNYNNSBOPLILP2","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GWFNYNNS","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GWFNYNNSBOPLILP2R6T4PMUSNI","target":"record","payload":{"canonical_record":{"source":{"id":"1106.0369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-02T06:15:54Z","cross_cats_sorted":[],"title_canon_sha256":"62f7a013fce839bc79f4bd3575f245fc798c935f17f2b21d6c2d954c705be456","abstract_canon_sha256":"1ae64a813a2eedd058e8397f4d0aa19a94ae75881c4757154f56eae0e7bd60d1"},"schema_version":"1.0"},"canonical_sha256":"358adc35b20b9eb42dfa8fa7c7b2926a0223b35e71e9bd13952eab45cd19fe55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:50.560310Z","signature_b64":"1r7c7lygJEOGcUgp+DOaNkp04qGhE1KjgyFn2sg10M7AmxUd1sSyLUDuyoXjlxBnFVmZwdk4efSZmmFoQOTuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"358adc35b20b9eb42dfa8fa7c7b2926a0223b35e71e9bd13952eab45cd19fe55","last_reissued_at":"2026-05-18T04:20:50.559830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:50.559830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.0369","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-18T04:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZmC4/pymppy1Ck1WRDx84f5AstV+kDeu64E/1nO7ZNLcRuUmYW5LsB2SDOP18Y3WJU86kBJqSHjkq3b7azsUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:34:55.197109Z"},"content_sha256":"8634c2fac1d3d970e96331d16785c5437dda41db0b527438864569cee6dc679e","schema_version":"1.0","event_id":"sha256:8634c2fac1d3d970e96331d16785c5437dda41db0b527438864569cee6dc679e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GWFNYNNSBOPLILP2R6T4PMUSNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum density of union-closed families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Igor Balla","submitted_at":"2011-06-02T06:15:54Z","abstract_excerpt":"Let F be a finite union-closed family of sets whose largest set contains n elements. In \\cite{Wojcik92}, Wojcik defined the density of F to be the ratio of the average set size of F to n and conjectured that the minimum density over all union-closed families whose largest set contains n elements is (1 + o(1))\\log_2(n)/(2n) as n approaches infinity. We use a result of Reimer \\cite{Reimer03} to show that the density of F is always at least log_2(n)/(2n), verifying Wojcik's conjecture. As a corollary we show that for n \\geq 16, some element must appear in at least \\sqrt{(\\log_2(n))/n}(|F|/2) sets"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0369","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-18T04:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YbxwKzeJL4pF1LWAP1m3Jvsn60OOZNx97ONUc+S3hfeIG0vF8RXQ3yfJezYVdViWqGqmErRecSkKcZ6opP+dDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:34:55.197478Z"},"content_sha256":"eecbfe233fc37791a68ad820c7d74871b6f346609db8de5963da286a63952533","schema_version":"1.0","event_id":"sha256:eecbfe233fc37791a68ad820c7d74871b6f346609db8de5963da286a63952533"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWFNYNNSBOPLILP2R6T4PMUSNI/bundle.json","state_url":"https://pith.science/pith/GWFNYNNSBOPLILP2R6T4PMUSNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWFNYNNSBOPLILP2R6T4PMUSNI/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-01T07:34:55Z","links":{"resolver":"https://pith.science/pith/GWFNYNNSBOPLILP2R6T4PMUSNI","bundle":"https://pith.science/pith/GWFNYNNSBOPLILP2R6T4PMUSNI/bundle.json","state":"https://pith.science/pith/GWFNYNNSBOPLILP2R6T4PMUSNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWFNYNNSBOPLILP2R6T4PMUSNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GWFNYNNSBOPLILP2R6T4PMUSNI","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":"1ae64a813a2eedd058e8397f4d0aa19a94ae75881c4757154f56eae0e7bd60d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-02T06:15:54Z","title_canon_sha256":"62f7a013fce839bc79f4bd3575f245fc798c935f17f2b21d6c2d954c705be456"},"schema_version":"1.0","source":{"id":"1106.0369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0369","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0369v1","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0369","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"GWFNYNNSBOPL","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GWFNYNNSBOPLILP2","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GWFNYNNS","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:eecbfe233fc37791a68ad820c7d74871b6f346609db8de5963da286a63952533","target":"graph","created_at":"2026-05-18T04:20:50Z","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":"Let F be a finite union-closed family of sets whose largest set contains n elements. In \\cite{Wojcik92}, Wojcik defined the density of F to be the ratio of the average set size of F to n and conjectured that the minimum density over all union-closed families whose largest set contains n elements is (1 + o(1))\\log_2(n)/(2n) as n approaches infinity. We use a result of Reimer \\cite{Reimer03} to show that the density of F is always at least log_2(n)/(2n), verifying Wojcik's conjecture. As a corollary we show that for n \\geq 16, some element must appear in at least \\sqrt{(\\log_2(n))/n}(|F|/2) sets","authors_text":"Igor Balla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-02T06:15:54Z","title":"Minimum density of union-closed families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0369","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:8634c2fac1d3d970e96331d16785c5437dda41db0b527438864569cee6dc679e","target":"record","created_at":"2026-05-18T04:20:50Z","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":"1ae64a813a2eedd058e8397f4d0aa19a94ae75881c4757154f56eae0e7bd60d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-02T06:15:54Z","title_canon_sha256":"62f7a013fce839bc79f4bd3575f245fc798c935f17f2b21d6c2d954c705be456"},"schema_version":"1.0","source":{"id":"1106.0369","kind":"arxiv","version":1}},"canonical_sha256":"358adc35b20b9eb42dfa8fa7c7b2926a0223b35e71e9bd13952eab45cd19fe55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"358adc35b20b9eb42dfa8fa7c7b2926a0223b35e71e9bd13952eab45cd19fe55","first_computed_at":"2026-05-18T04:20:50.559830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:50.559830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1r7c7lygJEOGcUgp+DOaNkp04qGhE1KjgyFn2sg10M7AmxUd1sSyLUDuyoXjlxBnFVmZwdk4efSZmmFoQOTuBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:50.560310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8634c2fac1d3d970e96331d16785c5437dda41db0b527438864569cee6dc679e","sha256:eecbfe233fc37791a68ad820c7d74871b6f346609db8de5963da286a63952533"],"state_sha256":"7a73b69e5285790822d24022786eade851fa6ce77d0e0c3fc2d5d6d1ffd75ae0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2fKbZPmx2DYrbZ8gogHSzTTKv1XLnLdFFforFqgcKHfgnjAAxpq+pKz6rvmEQgmrYk9aE8Fw9oQ1M2HFnoyoAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:34:55.199530Z","bundle_sha256":"ff88abcad8f498fcb9931f28b04027213533e3ded146510d396651449e3d2387"}}