{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NDUVXQPQUVNA2A4HLOQWL7FFMT","short_pith_number":"pith:NDUVXQPQ","canonical_record":{"source":{"id":"2412.03862","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-05T04:19:05Z","cross_cats_sorted":[],"title_canon_sha256":"3671a56a3c80e47c60344c12f011f8d372b4f3283036c184a586174d99a9a00f","abstract_canon_sha256":"9ed9f935b029159de7fe19f0c0775cc18a9fd73902d81f450d110ab25ef2352f"},"schema_version":"1.0"},"canonical_sha256":"68e95bc1f0a55a0d03875ba165fca564f148e4453951998ff0a7e309bacc71af","source":{"kind":"arxiv","id":"2412.03862","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.03862","created_at":"2026-07-05T11:35:52Z"},{"alias_kind":"arxiv_version","alias_value":"2412.03862v3","created_at":"2026-07-05T11:35:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03862","created_at":"2026-07-05T11:35:52Z"},{"alias_kind":"pith_short_12","alias_value":"NDUVXQPQUVNA","created_at":"2026-07-05T11:35:52Z"},{"alias_kind":"pith_short_16","alias_value":"NDUVXQPQUVNA2A4H","created_at":"2026-07-05T11:35:52Z"},{"alias_kind":"pith_short_8","alias_value":"NDUVXQPQ","created_at":"2026-07-05T11:35:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NDUVXQPQUVNA2A4HLOQWL7FFMT","target":"record","payload":{"canonical_record":{"source":{"id":"2412.03862","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-05T04:19:05Z","cross_cats_sorted":[],"title_canon_sha256":"3671a56a3c80e47c60344c12f011f8d372b4f3283036c184a586174d99a9a00f","abstract_canon_sha256":"9ed9f935b029159de7fe19f0c0775cc18a9fd73902d81f450d110ab25ef2352f"},"schema_version":"1.0"},"canonical_sha256":"68e95bc1f0a55a0d03875ba165fca564f148e4453951998ff0a7e309bacc71af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:52.473578Z","signature_b64":"6UsQ/0pNELgJ0kIEak37vV3MSDxsvM8tB63NNf/GIbp0T6S+JC7HH1iC7tBoOsAiU/+tKPATbLbs/yxeODZiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68e95bc1f0a55a0d03875ba165fca564f148e4453951998ff0a7e309bacc71af","last_reissued_at":"2026-07-05T11:35:52.473105Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:52.473105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.03862","source_version":3,"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-07-05T11:35:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0RF27N2YOWJC7/BTxIpHySoX09fEPFsHEQDwabtQJSm48kYKZRG53qG0a3DnSIT68zFRpHM3PU9hvt4p1+kfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:42:40.132823Z"},"content_sha256":"4df6aa00c1f5d9339da8cbb2a77979ce041171accf5a2fa7374b9836d93d21cf","schema_version":"1.0","event_id":"sha256:4df6aa00c1f5d9339da8cbb2a77979ce041171accf5a2fa7374b9836d93d21cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NDUVXQPQUVNA2A4HLOQWL7FFMT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Frequent elements in union-closed set families","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Saintan Wu, Shagnik Das","submitted_at":"2024-12-05T04:19:05Z","abstract_excerpt":"The Union-Closed Sets Conjecture asks whether every union-closed set family $\\mathcal{F}$ has an element contained in half of its sets. In 2022, Nagel posed a generalisation of this problem, suggesting that the $k$th-most popular element in a union-closed set family must be contained in at least $\\frac{1}{2^{k-1} + 1} |\\mathcal{F}|$ sets.\n  We combine the entropic method of Gilmer with the combinatorial arguments of Knill to show that this is indeed the case for all $k \\ge 2$, and characterise the families that achieve equality. Furthermore, we show that when $|\\mathcal{F}| \\to \\infty$, the $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03862","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.03862/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:35:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7mD5B9FvgpchRaPE6rYgSjH3Xdj8TaC+F7hCvCl9+a3gxQkXRB75efTsC5k38+tK7wbdcj6Imlm1JAEN0ZsiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:42:40.133783Z"},"content_sha256":"9c4db8bcdfafa70698f07aaf2b955c93ec0404189daa4c79fd6c1a89d262ae0a","schema_version":"1.0","event_id":"sha256:9c4db8bcdfafa70698f07aaf2b955c93ec0404189daa4c79fd6c1a89d262ae0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDUVXQPQUVNA2A4HLOQWL7FFMT/bundle.json","state_url":"https://pith.science/pith/NDUVXQPQUVNA2A4HLOQWL7FFMT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDUVXQPQUVNA2A4HLOQWL7FFMT/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-08-20T07:42:40Z","links":{"resolver":"https://pith.science/pith/NDUVXQPQUVNA2A4HLOQWL7FFMT","bundle":"https://pith.science/pith/NDUVXQPQUVNA2A4HLOQWL7FFMT/bundle.json","state":"https://pith.science/pith/NDUVXQPQUVNA2A4HLOQWL7FFMT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDUVXQPQUVNA2A4HLOQWL7FFMT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NDUVXQPQUVNA2A4HLOQWL7FFMT","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":"9ed9f935b029159de7fe19f0c0775cc18a9fd73902d81f450d110ab25ef2352f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-05T04:19:05Z","title_canon_sha256":"3671a56a3c80e47c60344c12f011f8d372b4f3283036c184a586174d99a9a00f"},"schema_version":"1.0","source":{"id":"2412.03862","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.03862","created_at":"2026-07-05T11:35:52Z"},{"alias_kind":"arxiv_version","alias_value":"2412.03862v3","created_at":"2026-07-05T11:35:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03862","created_at":"2026-07-05T11:35:52Z"},{"alias_kind":"pith_short_12","alias_value":"NDUVXQPQUVNA","created_at":"2026-07-05T11:35:52Z"},{"alias_kind":"pith_short_16","alias_value":"NDUVXQPQUVNA2A4H","created_at":"2026-07-05T11:35:52Z"},{"alias_kind":"pith_short_8","alias_value":"NDUVXQPQ","created_at":"2026-07-05T11:35:52Z"}],"graph_snapshots":[{"event_id":"sha256:9c4db8bcdfafa70698f07aaf2b955c93ec0404189daa4c79fd6c1a89d262ae0a","target":"graph","created_at":"2026-07-05T11:35: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.03862/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Union-Closed Sets Conjecture asks whether every union-closed set family $\\mathcal{F}$ has an element contained in half of its sets. In 2022, Nagel posed a generalisation of this problem, suggesting that the $k$th-most popular element in a union-closed set family must be contained in at least $\\frac{1}{2^{k-1} + 1} |\\mathcal{F}|$ sets.\n  We combine the entropic method of Gilmer with the combinatorial arguments of Knill to show that this is indeed the case for all $k \\ge 2$, and characterise the families that achieve equality. Furthermore, we show that when $|\\mathcal{F}| \\to \\infty$, the $k","authors_text":"Saintan Wu, Shagnik Das","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-05T04:19:05Z","title":"Frequent elements in union-closed set families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03862","kind":"arxiv","version":3},"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:4df6aa00c1f5d9339da8cbb2a77979ce041171accf5a2fa7374b9836d93d21cf","target":"record","created_at":"2026-07-05T11:35: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":"9ed9f935b029159de7fe19f0c0775cc18a9fd73902d81f450d110ab25ef2352f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-05T04:19:05Z","title_canon_sha256":"3671a56a3c80e47c60344c12f011f8d372b4f3283036c184a586174d99a9a00f"},"schema_version":"1.0","source":{"id":"2412.03862","kind":"arxiv","version":3}},"canonical_sha256":"68e95bc1f0a55a0d03875ba165fca564f148e4453951998ff0a7e309bacc71af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68e95bc1f0a55a0d03875ba165fca564f148e4453951998ff0a7e309bacc71af","first_computed_at":"2026-07-05T11:35:52.473105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:35:52.473105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6UsQ/0pNELgJ0kIEak37vV3MSDxsvM8tB63NNf/GIbp0T6S+JC7HH1iC7tBoOsAiU/+tKPATbLbs/yxeODZiAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:35:52.473578Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.03862","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4df6aa00c1f5d9339da8cbb2a77979ce041171accf5a2fa7374b9836d93d21cf","sha256:9c4db8bcdfafa70698f07aaf2b955c93ec0404189daa4c79fd6c1a89d262ae0a"],"state_sha256":"29d99f9b86ee7224283e64c963f0de8347bde443c01324dee2556a64be44da6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bZf8zcvs9BAIQgcSJHyTXO5sKznqSWaanXcOt2du6ODzWefAWnQ61vTX7gG9FHZtoTaWZ3IWT3Ocg/iVtfz1CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T07:42:40.140651Z","bundle_sha256":"a2bc3b5c7600bffe19725d800ded2264bbe16e026ba18f8940079e98bd2ac3c0"}}