{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:35GV6ROHFLWSF22Y5AMVYX273U","short_pith_number":"pith:35GV6ROH","canonical_record":{"source":{"id":"2211.13139","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-23T17:12:29Z","cross_cats_sorted":[],"title_canon_sha256":"98fb4c5b0071ceb1aef04f003589c38324bafed067b7e9b7c8839f64b367aa43","abstract_canon_sha256":"10f2d5f4b8572566ba5861202fda3a9bba2c77f7f0e7e54341a5ab785aa455fb"},"schema_version":"1.0"},"canonical_sha256":"df4d5f45c72aed22eb58e8195c5f5fdd085615894b423cca6bf1bcc767d9c548","source":{"kind":"arxiv","id":"2211.13139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.13139","created_at":"2026-07-05T05:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"2211.13139v1","created_at":"2026-07-05T05:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.13139","created_at":"2026-07-05T05:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"35GV6ROHFLWS","created_at":"2026-07-05T05:18:58Z"},{"alias_kind":"pith_short_16","alias_value":"35GV6ROHFLWSF22Y","created_at":"2026-07-05T05:18:58Z"},{"alias_kind":"pith_short_8","alias_value":"35GV6ROH","created_at":"2026-07-05T05:18:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:35GV6ROHFLWSF22Y5AMVYX273U","target":"record","payload":{"canonical_record":{"source":{"id":"2211.13139","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-23T17:12:29Z","cross_cats_sorted":[],"title_canon_sha256":"98fb4c5b0071ceb1aef04f003589c38324bafed067b7e9b7c8839f64b367aa43","abstract_canon_sha256":"10f2d5f4b8572566ba5861202fda3a9bba2c77f7f0e7e54341a5ab785aa455fb"},"schema_version":"1.0"},"canonical_sha256":"df4d5f45c72aed22eb58e8195c5f5fdd085615894b423cca6bf1bcc767d9c548","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:18:58.963955Z","signature_b64":"2WQMCNmw19TeSIZC+nXjjtHrfZXs4qurlOsyHt3N56LRw0TauDzIb7sjGJncRCNfTundCUtD4oyn440bP9O3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df4d5f45c72aed22eb58e8195c5f5fdd085615894b423cca6bf1bcc767d9c548","last_reissued_at":"2026-07-05T05:18:58.963592Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:18:58.963592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.13139","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-07-05T05:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/OBVvE3gViZKywpp2Hgj/ONtQowhghzlGM4Oba8X5iDLR+Yumtj4gQh4QoR4USqD30IKtd07HmlnQl2x1TADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:04:58.617060Z"},"content_sha256":"e9142759fcb7cc7c3d17c57d2d849b1a411e68d7c8dc56ed82751d4756086513","schema_version":"1.0","event_id":"sha256:e9142759fcb7cc7c3d17c57d2d849b1a411e68d7c8dc56ed82751d4756086513"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:35GV6ROHFLWSF22Y5AMVYX273U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extension of a Method of Gilmer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Pebody","submitted_at":"2022-11-23T17:12:29Z","abstract_excerpt":"It is a well-known conjecture, sometimes attributed to Frankl, that for any family of sets which is closed under the union operation, there is some element which is contained in at least half of the sets.\n  Gilmer was the first to prove a constant bound, showing that there is some element contained in at least 1\\% of the sets. They state in their paper that the best possible bound achievable by the same method is $\\frac{3-\\sqrt5}2\\approx 38.1\\%$.\n  This note achieves that bound by finding the optimum value, given a binary variable $X$ potentially depending on some other variable $S$ with a giv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.13139","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.13139/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-05T05:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aOu3z19vf0vG18GH5UwH7YyipmMsbi36RAmR8OZFPP71TQ7L8PE72wlaOIqkEAJ/WZ9cVufuW4Ie299R/ZyqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:04:58.617542Z"},"content_sha256":"bc4276689c8c4eb62e2bc532420d8b764efc7526e779781fdb0fce1394518390","schema_version":"1.0","event_id":"sha256:bc4276689c8c4eb62e2bc532420d8b764efc7526e779781fdb0fce1394518390"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35GV6ROHFLWSF22Y5AMVYX273U/bundle.json","state_url":"https://pith.science/pith/35GV6ROHFLWSF22Y5AMVYX273U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35GV6ROHFLWSF22Y5AMVYX273U/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-06T03:04:58Z","links":{"resolver":"https://pith.science/pith/35GV6ROHFLWSF22Y5AMVYX273U","bundle":"https://pith.science/pith/35GV6ROHFLWSF22Y5AMVYX273U/bundle.json","state":"https://pith.science/pith/35GV6ROHFLWSF22Y5AMVYX273U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35GV6ROHFLWSF22Y5AMVYX273U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:35GV6ROHFLWSF22Y5AMVYX273U","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":"10f2d5f4b8572566ba5861202fda3a9bba2c77f7f0e7e54341a5ab785aa455fb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-23T17:12:29Z","title_canon_sha256":"98fb4c5b0071ceb1aef04f003589c38324bafed067b7e9b7c8839f64b367aa43"},"schema_version":"1.0","source":{"id":"2211.13139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.13139","created_at":"2026-07-05T05:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"2211.13139v1","created_at":"2026-07-05T05:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.13139","created_at":"2026-07-05T05:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"35GV6ROHFLWS","created_at":"2026-07-05T05:18:58Z"},{"alias_kind":"pith_short_16","alias_value":"35GV6ROHFLWSF22Y","created_at":"2026-07-05T05:18:58Z"},{"alias_kind":"pith_short_8","alias_value":"35GV6ROH","created_at":"2026-07-05T05:18:58Z"}],"graph_snapshots":[{"event_id":"sha256:bc4276689c8c4eb62e2bc532420d8b764efc7526e779781fdb0fce1394518390","target":"graph","created_at":"2026-07-05T05:18:58Z","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/2211.13139/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"It is a well-known conjecture, sometimes attributed to Frankl, that for any family of sets which is closed under the union operation, there is some element which is contained in at least half of the sets.\n  Gilmer was the first to prove a constant bound, showing that there is some element contained in at least 1\\% of the sets. They state in their paper that the best possible bound achievable by the same method is $\\frac{3-\\sqrt5}2\\approx 38.1\\%$.\n  This note achieves that bound by finding the optimum value, given a binary variable $X$ potentially depending on some other variable $S$ with a giv","authors_text":"Luke Pebody","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-23T17:12:29Z","title":"Extension of a Method of Gilmer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.13139","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:e9142759fcb7cc7c3d17c57d2d849b1a411e68d7c8dc56ed82751d4756086513","target":"record","created_at":"2026-07-05T05:18:58Z","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":"10f2d5f4b8572566ba5861202fda3a9bba2c77f7f0e7e54341a5ab785aa455fb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-23T17:12:29Z","title_canon_sha256":"98fb4c5b0071ceb1aef04f003589c38324bafed067b7e9b7c8839f64b367aa43"},"schema_version":"1.0","source":{"id":"2211.13139","kind":"arxiv","version":1}},"canonical_sha256":"df4d5f45c72aed22eb58e8195c5f5fdd085615894b423cca6bf1bcc767d9c548","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df4d5f45c72aed22eb58e8195c5f5fdd085615894b423cca6bf1bcc767d9c548","first_computed_at":"2026-07-05T05:18:58.963592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:18:58.963592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2WQMCNmw19TeSIZC+nXjjtHrfZXs4qurlOsyHt3N56LRw0TauDzIb7sjGJncRCNfTundCUtD4oyn440bP9O3CA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:18:58.963955Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.13139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9142759fcb7cc7c3d17c57d2d849b1a411e68d7c8dc56ed82751d4756086513","sha256:bc4276689c8c4eb62e2bc532420d8b764efc7526e779781fdb0fce1394518390"],"state_sha256":"79b46bd5ed05592d03958c6a246c13d7ffd0b987343ee0857f5508147bd9da78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LjBJtoET8FiqLphpmHSlK2CUUHgLTTC8Bu7lKp0tioTCtjj/BEwwkSgbDQ9tKY7jI0+XosdowujfjO+dP8KiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T03:04:58.621612Z","bundle_sha256":"ce45f9c70c2e02219ff9d0d822b2f3c2f125cfacd54f04f61eb512991ba2505c"}}