{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MNENXHRBRSB65SLDFE25STXMGU","short_pith_number":"pith:MNENXHRB","schema_version":"1.0","canonical_sha256":"6348db9e218c83eec9632935d94eec353e1745cb8d455ddfbe92a1893cc6aca7","source":{"kind":"arxiv","id":"1503.00631","version":2},"attestation_state":"computed","paper":{"title":"An improved bound on the diamond-free poset problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucas Kramer, Ryan R. Martin","submitted_at":"2015-03-02T17:37:58Z","abstract_excerpt":"In the theory of partially-ordered sets, the two-dimensional Boolean lattice is known as the diamond. In this paper, we show that, if $\\mathcal{F}$ is a family in the $n$-dimensional Boolean lattice that has no diamond as a subposet, then $|\\mathcal{F}|\\leq 2.206653{n\\choose \\lfloor n/2\\rfloor}$, improving a bound by the authors and Michael Young."},"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":"1503.00631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-02T17:37:58Z","cross_cats_sorted":[],"title_canon_sha256":"e1bc853fb2ff0f325b78a58967b265befb39b58460ff01014a5c417d4f6e9a00","abstract_canon_sha256":"877cee418811e38c26d0822f4a9965b94b6ea3d39e889ce69e7bdba84f20c43a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:28.136828Z","signature_b64":"tfLntOVv0E3P8csxD0ugFk1iAzg98pElWG8mjzBVHCiNx+qPJzKG6Or7PxQh/Rdyo9SrpWmU97jbI34743ZOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6348db9e218c83eec9632935d94eec353e1745cb8d455ddfbe92a1893cc6aca7","last_reissued_at":"2026-05-18T02:24:28.136056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:28.136056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved bound on the diamond-free poset problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucas Kramer, Ryan R. Martin","submitted_at":"2015-03-02T17:37:58Z","abstract_excerpt":"In the theory of partially-ordered sets, the two-dimensional Boolean lattice is known as the diamond. In this paper, we show that, if $\\mathcal{F}$ is a family in the $n$-dimensional Boolean lattice that has no diamond as a subposet, then $|\\mathcal{F}|\\leq 2.206653{n\\choose \\lfloor n/2\\rfloor}$, improving a bound by the authors and Michael Young."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00631","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.00631","created_at":"2026-05-18T02:24:28.136177+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00631v2","created_at":"2026-05-18T02:24:28.136177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00631","created_at":"2026-05-18T02:24:28.136177+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNENXHRBRSB6","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNENXHRBRSB65SLD","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNENXHRB","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MNENXHRBRSB65SLDFE25STXMGU","json":"https://pith.science/pith/MNENXHRBRSB65SLDFE25STXMGU.json","graph_json":"https://pith.science/api/pith-number/MNENXHRBRSB65SLDFE25STXMGU/graph.json","events_json":"https://pith.science/api/pith-number/MNENXHRBRSB65SLDFE25STXMGU/events.json","paper":"https://pith.science/paper/MNENXHRB"},"agent_actions":{"view_html":"https://pith.science/pith/MNENXHRBRSB65SLDFE25STXMGU","download_json":"https://pith.science/pith/MNENXHRBRSB65SLDFE25STXMGU.json","view_paper":"https://pith.science/paper/MNENXHRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00631&json=true","fetch_graph":"https://pith.science/api/pith-number/MNENXHRBRSB65SLDFE25STXMGU/graph.json","fetch_events":"https://pith.science/api/pith-number/MNENXHRBRSB65SLDFE25STXMGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNENXHRBRSB65SLDFE25STXMGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNENXHRBRSB65SLDFE25STXMGU/action/storage_attestation","attest_author":"https://pith.science/pith/MNENXHRBRSB65SLDFE25STXMGU/action/author_attestation","sign_citation":"https://pith.science/pith/MNENXHRBRSB65SLDFE25STXMGU/action/citation_signature","submit_replication":"https://pith.science/pith/MNENXHRBRSB65SLDFE25STXMGU/action/replication_record"}},"created_at":"2026-05-18T02:24:28.136177+00:00","updated_at":"2026-05-18T02:24:28.136177+00:00"}