{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BGXKLCWFUFND5EI4WDYNAAEWTE","short_pith_number":"pith:BGXKLCWF","schema_version":"1.0","canonical_sha256":"09aea58ac5a15a3e911cb0f0d00096993bac84745871994502a46c423774311c","source":{"kind":"arxiv","id":"2212.12500","version":2},"attestation_state":"computed","paper":{"title":"Better bounds for the union-closed sets conjecture using the entropy approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Stijn Cambie","submitted_at":"2022-12-23T17:48:48Z","abstract_excerpt":"We improve the best known constant $\\frac{3-\\sqrt 5}{2}$ for which the union-closed conjecture is known to be true, by using dependent samples as suggested by Sawin and the entropy approach on this problem initiated by Gilmer. Meanwhile, we focus on the intuition behind this entropy approach and its boundaries."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2212.12500","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-23T17:48:48Z","cross_cats_sorted":[],"title_canon_sha256":"4f873dc5332993e61b1dbc9eeeaa58c858087f2123aaa21fdb0fe0faa35fefd5","abstract_canon_sha256":"ebe6a43d1cc34cbd2b9d3195b8a83e30ebf31c1107c39d8b946b0492104c6ec1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:34.886973Z","signature_b64":"iPmZJ8y9gzkezci++7yJU1zIwyaBBB4t2o10DavEamJ3ZoO0RYPlP+un3uL8RSr6Ss3tuQFDXVCprrB0e6mVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09aea58ac5a15a3e911cb0f0d00096993bac84745871994502a46c423774311c","last_reissued_at":"2026-07-05T10:14:34.886497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:34.886497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better bounds for the union-closed sets conjecture using the entropy approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Stijn Cambie","submitted_at":"2022-12-23T17:48:48Z","abstract_excerpt":"We improve the best known constant $\\frac{3-\\sqrt 5}{2}$ for which the union-closed conjecture is known to be true, by using dependent samples as suggested by Sawin and the entropy approach on this problem initiated by Gilmer. Meanwhile, we focus on the intuition behind this entropy approach and its boundaries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.12500","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.12500/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2212.12500","created_at":"2026-07-05T10:14:34.886558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.12500v2","created_at":"2026-07-05T10:14:34.886558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.12500","created_at":"2026-07-05T10:14:34.886558+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGXKLCWFUFND","created_at":"2026-07-05T10:14:34.886558+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGXKLCWFUFND5EI4","created_at":"2026-07-05T10:14:34.886558+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGXKLCWF","created_at":"2026-07-05T10:14:34.886558+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.03451","citing_title":"Redundancy Is All You Need (for CSP Sparsification)","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BGXKLCWFUFND5EI4WDYNAAEWTE","json":"https://pith.science/pith/BGXKLCWFUFND5EI4WDYNAAEWTE.json","graph_json":"https://pith.science/api/pith-number/BGXKLCWFUFND5EI4WDYNAAEWTE/graph.json","events_json":"https://pith.science/api/pith-number/BGXKLCWFUFND5EI4WDYNAAEWTE/events.json","paper":"https://pith.science/paper/BGXKLCWF"},"agent_actions":{"view_html":"https://pith.science/pith/BGXKLCWFUFND5EI4WDYNAAEWTE","download_json":"https://pith.science/pith/BGXKLCWFUFND5EI4WDYNAAEWTE.json","view_paper":"https://pith.science/paper/BGXKLCWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.12500&json=true","fetch_graph":"https://pith.science/api/pith-number/BGXKLCWFUFND5EI4WDYNAAEWTE/graph.json","fetch_events":"https://pith.science/api/pith-number/BGXKLCWFUFND5EI4WDYNAAEWTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGXKLCWFUFND5EI4WDYNAAEWTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGXKLCWFUFND5EI4WDYNAAEWTE/action/storage_attestation","attest_author":"https://pith.science/pith/BGXKLCWFUFND5EI4WDYNAAEWTE/action/author_attestation","sign_citation":"https://pith.science/pith/BGXKLCWFUFND5EI4WDYNAAEWTE/action/citation_signature","submit_replication":"https://pith.science/pith/BGXKLCWFUFND5EI4WDYNAAEWTE/action/replication_record"}},"created_at":"2026-07-05T10:14:34.886558+00:00","updated_at":"2026-07-05T10:14:34.886558+00:00"}