{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:454W3L2ZTW4SP523E7BEQKGFRY","short_pith_number":"pith:454W3L2Z","canonical_record":{"source":{"id":"1512.00083","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-30T23:06:05Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"77fcab883ef40291c9c8f1abc2a1b7c042529cc2bb467d33711ad43301466b8a","abstract_canon_sha256":"09d306f505387fe0623444bf8c9025a5d52c46090c375d8452110dd8b7bfabdd"},"schema_version":"1.0"},"canonical_sha256":"e7796daf599db927f75b27c24828c58e280be60cd680d2834d386cc615f3be3b","source":{"kind":"arxiv","id":"1512.00083","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00083","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00083v2","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00083","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"454W3L2ZTW4S","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"454W3L2ZTW4SP523","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"454W3L2Z","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:454W3L2ZTW4SP523E7BEQKGFRY","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00083","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-30T23:06:05Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"77fcab883ef40291c9c8f1abc2a1b7c042529cc2bb467d33711ad43301466b8a","abstract_canon_sha256":"09d306f505387fe0623444bf8c9025a5d52c46090c375d8452110dd8b7bfabdd"},"schema_version":"1.0"},"canonical_sha256":"e7796daf599db927f75b27c24828c58e280be60cd680d2834d386cc615f3be3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:11.490774Z","signature_b64":"tZ71zttk7+WAVl0s4ky27n0BQEhWzgqBao8sQXzGoA23ayZolhTxyecAaoksJO46JGeiNr72k/KPmKLAaBQrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7796daf599db927f75b27c24828c58e280be60cd680d2834d386cc615f3be3b","last_reissued_at":"2026-05-18T01:10:11.490382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:11.490382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00083","source_version":2,"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:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MAj62tDTPSQVoJiut2TtI7oIw2ZpprgiNrK8Qxd7twjRZ5e7e+aictd1f8mTSFU+8DDJsuHlP+I+UjyBeyO8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:21:48.709424Z"},"content_sha256":"41bd7a8296b7a1255c24efae675b081c73a892ba3c893d368a2ccd24684bc9bb","schema_version":"1.0","event_id":"sha256:41bd7a8296b7a1255c24efae675b081c73a892ba3c893d368a2ccd24684bc9bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:454W3L2ZTW4SP523E7BEQKGFRY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Conjectures for Union-Closed Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Annie Raymond, Dirk Theis, Jonad Pulaj","submitted_at":"2015-11-30T23:06:05Z","abstract_excerpt":"The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead prove that $2a$ is an upper bound to the number of sets in a union-closed family on a ground set of $n$ elements where each element is in at most $a$ sets for all $a,n\\in \\mathbb{N}^+$. Similarly, one could prove that the minimum number of sets containing the most frequent element in a (non-empty) union-closed family with $m$ sets and $n$ elements is at least $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00083","kind":"arxiv","version":2},"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:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u2FPIU1k/AZYITQONTUhZwC+JVRZ6bhIFyXix4taxT8bIRZcdefZm+kaioBwbXrtSSub9BjZijA6Ga6mn3aODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:21:48.710021Z"},"content_sha256":"0209d4c8fe6fe54f2bc8e18ae1a6f950c70fc3aa90ef5d88ef324e754e65bc42","schema_version":"1.0","event_id":"sha256:0209d4c8fe6fe54f2bc8e18ae1a6f950c70fc3aa90ef5d88ef324e754e65bc42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/454W3L2ZTW4SP523E7BEQKGFRY/bundle.json","state_url":"https://pith.science/pith/454W3L2ZTW4SP523E7BEQKGFRY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/454W3L2ZTW4SP523E7BEQKGFRY/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-01T19:21:48Z","links":{"resolver":"https://pith.science/pith/454W3L2ZTW4SP523E7BEQKGFRY","bundle":"https://pith.science/pith/454W3L2ZTW4SP523E7BEQKGFRY/bundle.json","state":"https://pith.science/pith/454W3L2ZTW4SP523E7BEQKGFRY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/454W3L2ZTW4SP523E7BEQKGFRY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:454W3L2ZTW4SP523E7BEQKGFRY","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":"09d306f505387fe0623444bf8c9025a5d52c46090c375d8452110dd8b7bfabdd","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-30T23:06:05Z","title_canon_sha256":"77fcab883ef40291c9c8f1abc2a1b7c042529cc2bb467d33711ad43301466b8a"},"schema_version":"1.0","source":{"id":"1512.00083","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00083","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00083v2","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00083","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"454W3L2ZTW4S","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"454W3L2ZTW4SP523","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"454W3L2Z","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:0209d4c8fe6fe54f2bc8e18ae1a6f950c70fc3aa90ef5d88ef324e754e65bc42","target":"graph","created_at":"2026-05-18T01:10:11Z","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":"The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead prove that $2a$ is an upper bound to the number of sets in a union-closed family on a ground set of $n$ elements where each element is in at most $a$ sets for all $a,n\\in \\mathbb{N}^+$. Similarly, one could prove that the minimum number of sets containing the most frequent element in a (non-empty) union-closed family with $m$ sets and $n$ elements is at least $\\","authors_text":"Annie Raymond, Dirk Theis, Jonad Pulaj","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-30T23:06:05Z","title":"New Conjectures for Union-Closed Families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00083","kind":"arxiv","version":2},"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:41bd7a8296b7a1255c24efae675b081c73a892ba3c893d368a2ccd24684bc9bb","target":"record","created_at":"2026-05-18T01:10:11Z","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":"09d306f505387fe0623444bf8c9025a5d52c46090c375d8452110dd8b7bfabdd","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-30T23:06:05Z","title_canon_sha256":"77fcab883ef40291c9c8f1abc2a1b7c042529cc2bb467d33711ad43301466b8a"},"schema_version":"1.0","source":{"id":"1512.00083","kind":"arxiv","version":2}},"canonical_sha256":"e7796daf599db927f75b27c24828c58e280be60cd680d2834d386cc615f3be3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7796daf599db927f75b27c24828c58e280be60cd680d2834d386cc615f3be3b","first_computed_at":"2026-05-18T01:10:11.490382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:11.490382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tZ71zttk7+WAVl0s4ky27n0BQEhWzgqBao8sQXzGoA23ayZolhTxyecAaoksJO46JGeiNr72k/KPmKLAaBQrDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:11.490774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00083","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41bd7a8296b7a1255c24efae675b081c73a892ba3c893d368a2ccd24684bc9bb","sha256:0209d4c8fe6fe54f2bc8e18ae1a6f950c70fc3aa90ef5d88ef324e754e65bc42"],"state_sha256":"f1c171a53f0b0250c6c08983ae40ad12188eab91ffcabf47cba8cd10c2fb54c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ec+5DlRtQylizUJd4nvcwVa+7HcJ2LAxh9ylur6nrrN3dp2UjfrPhSvpIoydaCOp7f2KyS4h3Ow4o/BdMarwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:21:48.712958Z","bundle_sha256":"b907b4709c892190d8d804506df88c20fd94e595c78badc92b96a3703e1b6974"}}