{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:P4ZGAK35OREJSOWTBQQPL6BZXW","short_pith_number":"pith:P4ZGAK35","canonical_record":{"source":{"id":"1012.3127","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T18:44:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0df06412d67732494a4c91a77fdc5e69e9dc4ae43f20f82aee99eae5c1a0ed5e","abstract_canon_sha256":"f9444867454bc57b9dba7dc1b42e762cc8770566ff5b201b699a9fdc6128d442"},"schema_version":"1.0"},"canonical_sha256":"7f32602b7d7448993ad30c20f5f839bd8a1187df7f3cd32c94ea5badd899d11f","source":{"kind":"arxiv","id":"1012.3127","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3127","created_at":"2026-05-18T04:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3127v6","created_at":"2026-05-18T04:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3127","created_at":"2026-05-18T04:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"P4ZGAK35OREJ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"P4ZGAK35OREJSOWT","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"P4ZGAK35","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:P4ZGAK35OREJSOWTBQQPL6BZXW","target":"record","payload":{"canonical_record":{"source":{"id":"1012.3127","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T18:44:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0df06412d67732494a4c91a77fdc5e69e9dc4ae43f20f82aee99eae5c1a0ed5e","abstract_canon_sha256":"f9444867454bc57b9dba7dc1b42e762cc8770566ff5b201b699a9fdc6128d442"},"schema_version":"1.0"},"canonical_sha256":"7f32602b7d7448993ad30c20f5f839bd8a1187df7f3cd32c94ea5badd899d11f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:45.253689Z","signature_b64":"Ger4Cd0TiJXIdFqZh2Ax9wRZFMJejJXAvYbqrZ5NxrHo3S1gUnxAW32jG480Y0lc5ppnd0ZwaPHYcaIocSmiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f32602b7d7448993ad30c20f5f839bd8a1187df7f3cd32c94ea5badd899d11f","last_reissued_at":"2026-05-18T04:26:45.252685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:45.252685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.3127","source_version":6,"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:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIQLd0r9hX7ITPs8mT6N10VNv5EDjbPjb30x3g224mJlBvN+xBMkFEcPCVGRz7VcIAya0SeYI3HFrO+UFpNkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:09:39.713263Z"},"content_sha256":"8b73df244d9a78fbbb24fbed896b939b0a0df6b3d452ec9fa47bf4431b2da2b0","schema_version":"1.0","event_id":"sha256:8b73df244d9a78fbbb24fbed896b939b0a0df6b3d452ec9fa47bf4431b2da2b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:P4ZGAK35OREJSOWTBQQPL6BZXW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum union-free subfamilies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Choongbum Lee, Jacob Fox","submitted_at":"2010-12-14T18:44:06Z","abstract_excerpt":"An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called 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. We show that every family of m sets contains a union-free subfamily of size at least \\lfloor \\sqrt{4m+1}\\rfloor - 1 and that this bound is tight. This solves Moser's problem and proves a conjecture of Erd\\H{o}s and Shelah from 1972. More generally, a family of sets is a-union-free if there are no a+1 distinct sets in the family such that one of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3127","kind":"arxiv","version":6},"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:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kEA4JfICupHbbhzQI4e3enEdhiMTi1O5k0Z9JJKPGkFj0Di1+sMsYffFpv+s6NN+j/3Z6vnMOt6YKzDzPLX1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:09:39.713643Z"},"content_sha256":"fea8d571c0eaba42b4d278f81f92ee0c058e0a5465a9841dad5ba9e64435b077","schema_version":"1.0","event_id":"sha256:fea8d571c0eaba42b4d278f81f92ee0c058e0a5465a9841dad5ba9e64435b077"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4ZGAK35OREJSOWTBQQPL6BZXW/bundle.json","state_url":"https://pith.science/pith/P4ZGAK35OREJSOWTBQQPL6BZXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4ZGAK35OREJSOWTBQQPL6BZXW/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-05-30T07:09:39Z","links":{"resolver":"https://pith.science/pith/P4ZGAK35OREJSOWTBQQPL6BZXW","bundle":"https://pith.science/pith/P4ZGAK35OREJSOWTBQQPL6BZXW/bundle.json","state":"https://pith.science/pith/P4ZGAK35OREJSOWTBQQPL6BZXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4ZGAK35OREJSOWTBQQPL6BZXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:P4ZGAK35OREJSOWTBQQPL6BZXW","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":"f9444867454bc57b9dba7dc1b42e762cc8770566ff5b201b699a9fdc6128d442","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T18:44:06Z","title_canon_sha256":"0df06412d67732494a4c91a77fdc5e69e9dc4ae43f20f82aee99eae5c1a0ed5e"},"schema_version":"1.0","source":{"id":"1012.3127","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3127","created_at":"2026-05-18T04:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3127v6","created_at":"2026-05-18T04:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3127","created_at":"2026-05-18T04:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"P4ZGAK35OREJ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"P4ZGAK35OREJSOWT","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"P4ZGAK35","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:fea8d571c0eaba42b4d278f81f92ee0c058e0a5465a9841dad5ba9e64435b077","target":"graph","created_at":"2026-05-18T04:26:45Z","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":"An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called 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. We show that every family of m sets contains a union-free subfamily of size at least \\lfloor \\sqrt{4m+1}\\rfloor - 1 and that this bound is tight. This solves Moser's problem and proves a conjecture of Erd\\H{o}s and Shelah from 1972. More generally, a family of sets is a-union-free if there are no a+1 distinct sets in the family such that one of","authors_text":"Benny Sudakov, Choongbum Lee, Jacob Fox","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T18:44:06Z","title":"Maximum union-free subfamilies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3127","kind":"arxiv","version":6},"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:8b73df244d9a78fbbb24fbed896b939b0a0df6b3d452ec9fa47bf4431b2da2b0","target":"record","created_at":"2026-05-18T04:26:45Z","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":"f9444867454bc57b9dba7dc1b42e762cc8770566ff5b201b699a9fdc6128d442","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T18:44:06Z","title_canon_sha256":"0df06412d67732494a4c91a77fdc5e69e9dc4ae43f20f82aee99eae5c1a0ed5e"},"schema_version":"1.0","source":{"id":"1012.3127","kind":"arxiv","version":6}},"canonical_sha256":"7f32602b7d7448993ad30c20f5f839bd8a1187df7f3cd32c94ea5badd899d11f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f32602b7d7448993ad30c20f5f839bd8a1187df7f3cd32c94ea5badd899d11f","first_computed_at":"2026-05-18T04:26:45.252685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:45.252685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ger4Cd0TiJXIdFqZh2Ax9wRZFMJejJXAvYbqrZ5NxrHo3S1gUnxAW32jG480Y0lc5ppnd0ZwaPHYcaIocSmiDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:45.253689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.3127","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b73df244d9a78fbbb24fbed896b939b0a0df6b3d452ec9fa47bf4431b2da2b0","sha256:fea8d571c0eaba42b4d278f81f92ee0c058e0a5465a9841dad5ba9e64435b077"],"state_sha256":"a98c77f472144c9374e5ea613addd8ebf7117f05f935ca274751a4cee933bbd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FemVtiRufY39Bl2lTf600keSzgb52WZC23J2Bk/YThpVyM4OCLsn+ZT/rqh4idE+WWYdOnxFBPKjdFGxHu5/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:09:39.715863Z","bundle_sha256":"3344a3f671c99a13585cad0a126a59850cd7ae6c9065f54c990d51372f1b7a74"}}