{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TBPZQ7BVHLLVSBQI5MIGDGTX5M","short_pith_number":"pith:TBPZQ7BV","schema_version":"1.0","canonical_sha256":"985f987c353ad7590608eb10619a77eb3bf7ccea4420a09e3f4e334143728d1e","source":{"kind":"arxiv","id":"2411.03400","version":2},"attestation_state":"computed","paper":{"title":"On Dedekind's problem, a sparse version of Sperner's theorem, and antichains of a given size in the Boolean lattice","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandru Malekshahian, Jinyoung Park, Matthew Jenssen","submitted_at":"2024-11-05T18:34:37Z","abstract_excerpt":"Dedekind's problem, dating back to 1897, asks for the total number $\\psi(n)$ of antichains contained in the Boolean lattice $B_n$ on $n$ elements. We study Dedekind's problem using a recently developed method based on the cluster expansion from statistical physics and as a result, obtain several new results on the number and typical structure of antichains in $B_n$. We obtain detailed estimates for both $\\psi(n)$ and the number of antichains of size $\\beta \\binom{n}{\\lfloor n/2 \\rfloor}$ for any fixed $\\beta>0$. We also establish a sparse version of Sperner's theorem: we determine the sharp th"},"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":"2411.03400","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-05T18:34:37Z","cross_cats_sorted":[],"title_canon_sha256":"43db549d0fd8c3e26b5f3bb6d53c6429aef1af4907492f4f355f45e89180c4c7","abstract_canon_sha256":"454a3d97b4874295cb0c888c36d88257cec7f89dd420f466cac95345d723c350"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:09.921393Z","signature_b64":"Sbyio1gRcP+PWD1Xr65FHa0LadE4n0oEPD0wqs42MytSU4bP6B5wE8bOk/136Oq3SysKdGQp5hvTxoM39CJlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"985f987c353ad7590608eb10619a77eb3bf7ccea4420a09e3f4e334143728d1e","last_reissued_at":"2026-07-05T09:39:09.920955Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:09.920955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Dedekind's problem, a sparse version of Sperner's theorem, and antichains of a given size in the Boolean lattice","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandru Malekshahian, Jinyoung Park, Matthew Jenssen","submitted_at":"2024-11-05T18:34:37Z","abstract_excerpt":"Dedekind's problem, dating back to 1897, asks for the total number $\\psi(n)$ of antichains contained in the Boolean lattice $B_n$ on $n$ elements. We study Dedekind's problem using a recently developed method based on the cluster expansion from statistical physics and as a result, obtain several new results on the number and typical structure of antichains in $B_n$. We obtain detailed estimates for both $\\psi(n)$ and the number of antichains of size $\\beta \\binom{n}{\\lfloor n/2 \\rfloor}$ for any fixed $\\beta>0$. We also establish a sparse version of Sperner's theorem: we determine the sharp th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03400","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/2411.03400/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":"2411.03400","created_at":"2026-07-05T09:39:09.921009+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.03400v2","created_at":"2026-07-05T09:39:09.921009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03400","created_at":"2026-07-05T09:39:09.921009+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBPZQ7BVHLLV","created_at":"2026-07-05T09:39:09.921009+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBPZQ7BVHLLVSBQI","created_at":"2026-07-05T09:39:09.921009+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBPZQ7BV","created_at":"2026-07-05T09:39:09.921009+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09795","citing_title":"Finite-n Estimate of Dedekind Numbers by Layer-Ratio Monte Carlo","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2504.08715","citing_title":"Counting independent sets in percolated graphs via the Ising model","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03119","citing_title":"Range of random $\\mathbb Z$-homomorphisms on weak expanders","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TBPZQ7BVHLLVSBQI5MIGDGTX5M","json":"https://pith.science/pith/TBPZQ7BVHLLVSBQI5MIGDGTX5M.json","graph_json":"https://pith.science/api/pith-number/TBPZQ7BVHLLVSBQI5MIGDGTX5M/graph.json","events_json":"https://pith.science/api/pith-number/TBPZQ7BVHLLVSBQI5MIGDGTX5M/events.json","paper":"https://pith.science/paper/TBPZQ7BV"},"agent_actions":{"view_html":"https://pith.science/pith/TBPZQ7BVHLLVSBQI5MIGDGTX5M","download_json":"https://pith.science/pith/TBPZQ7BVHLLVSBQI5MIGDGTX5M.json","view_paper":"https://pith.science/paper/TBPZQ7BV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.03400&json=true","fetch_graph":"https://pith.science/api/pith-number/TBPZQ7BVHLLVSBQI5MIGDGTX5M/graph.json","fetch_events":"https://pith.science/api/pith-number/TBPZQ7BVHLLVSBQI5MIGDGTX5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBPZQ7BVHLLVSBQI5MIGDGTX5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBPZQ7BVHLLVSBQI5MIGDGTX5M/action/storage_attestation","attest_author":"https://pith.science/pith/TBPZQ7BVHLLVSBQI5MIGDGTX5M/action/author_attestation","sign_citation":"https://pith.science/pith/TBPZQ7BVHLLVSBQI5MIGDGTX5M/action/citation_signature","submit_replication":"https://pith.science/pith/TBPZQ7BVHLLVSBQI5MIGDGTX5M/action/replication_record"}},"created_at":"2026-07-05T09:39:09.921009+00:00","updated_at":"2026-07-05T09:39:09.921009+00:00"}