{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PE5LJ6JVNM2HB5OM7BHM6SCWGM","short_pith_number":"pith:PE5LJ6JV","schema_version":"1.0","canonical_sha256":"793ab4f9356b3470f5ccf84ecf4856332ec643dea8f79e671c7ea5f4efc7f55f","source":{"kind":"arxiv","id":"1602.05870","version":4},"attestation_state":"computed","paper":{"title":"Applications of graph containers in the Boolean lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Zsolt Wagner, Andrew Treglown, Jozsef Balogh","submitted_at":"2016-02-18T16:44:07Z","abstract_excerpt":"We apply the graph container method to prove a number of counting results for the Boolean lattice $\\mathcal P(n)$. In particular, we: (i) Give a partial answer to a question of Sapozhenko estimating the number of $t$ error correcting codes in $\\mathcal P(n)$, and we also give an upper bound on the number of transportation codes; (ii) Provide an alternative proof of Kleitman's theorem on the number of antichains in $\\mathcal P(n)$ and give a two-coloured analogue; (iii) Give an asymptotic formula for the number of $(p,q)$-tilted Sperner families in $\\mathcal P(n)$; (iv) Prove a random version o"},"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":"1602.05870","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-18T16:44:07Z","cross_cats_sorted":[],"title_canon_sha256":"c5505f75462db606b134550a29571ae1253c7c0cb808295d38d7f2e9937fceaf","abstract_canon_sha256":"30066e781e86b9349c6a962c30f33d4ab128b3a6526bd007a2b5c0af45af4c19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:17.313166Z","signature_b64":"81pYCdGL8hSH2HD57LIH/6+wR/2RlQb3a1ILckAWtj7Eii0GI3nEUiFT8LbZSuK7Bu8eELbMTOI8fwZwEj/FBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"793ab4f9356b3470f5ccf84ecf4856332ec643dea8f79e671c7ea5f4efc7f55f","last_reissued_at":"2026-05-18T00:23:17.312505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:17.312505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Applications of graph containers in the Boolean lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Zsolt Wagner, Andrew Treglown, Jozsef Balogh","submitted_at":"2016-02-18T16:44:07Z","abstract_excerpt":"We apply the graph container method to prove a number of counting results for the Boolean lattice $\\mathcal P(n)$. In particular, we: (i) Give a partial answer to a question of Sapozhenko estimating the number of $t$ error correcting codes in $\\mathcal P(n)$, and we also give an upper bound on the number of transportation codes; (ii) Provide an alternative proof of Kleitman's theorem on the number of antichains in $\\mathcal P(n)$ and give a two-coloured analogue; (iii) Give an asymptotic formula for the number of $(p,q)$-tilted Sperner families in $\\mathcal P(n)$; (iv) Prove a random version o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05870","kind":"arxiv","version":4},"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":"1602.05870","created_at":"2026-05-18T00:23:17.312614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05870v4","created_at":"2026-05-18T00:23:17.312614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05870","created_at":"2026-05-18T00:23:17.312614+00:00"},{"alias_kind":"pith_short_12","alias_value":"PE5LJ6JVNM2H","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PE5LJ6JVNM2HB5OM","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PE5LJ6JV","created_at":"2026-05-18T12:30:39.010887+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/PE5LJ6JVNM2HB5OM7BHM6SCWGM","json":"https://pith.science/pith/PE5LJ6JVNM2HB5OM7BHM6SCWGM.json","graph_json":"https://pith.science/api/pith-number/PE5LJ6JVNM2HB5OM7BHM6SCWGM/graph.json","events_json":"https://pith.science/api/pith-number/PE5LJ6JVNM2HB5OM7BHM6SCWGM/events.json","paper":"https://pith.science/paper/PE5LJ6JV"},"agent_actions":{"view_html":"https://pith.science/pith/PE5LJ6JVNM2HB5OM7BHM6SCWGM","download_json":"https://pith.science/pith/PE5LJ6JVNM2HB5OM7BHM6SCWGM.json","view_paper":"https://pith.science/paper/PE5LJ6JV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05870&json=true","fetch_graph":"https://pith.science/api/pith-number/PE5LJ6JVNM2HB5OM7BHM6SCWGM/graph.json","fetch_events":"https://pith.science/api/pith-number/PE5LJ6JVNM2HB5OM7BHM6SCWGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PE5LJ6JVNM2HB5OM7BHM6SCWGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PE5LJ6JVNM2HB5OM7BHM6SCWGM/action/storage_attestation","attest_author":"https://pith.science/pith/PE5LJ6JVNM2HB5OM7BHM6SCWGM/action/author_attestation","sign_citation":"https://pith.science/pith/PE5LJ6JVNM2HB5OM7BHM6SCWGM/action/citation_signature","submit_replication":"https://pith.science/pith/PE5LJ6JVNM2HB5OM7BHM6SCWGM/action/replication_record"}},"created_at":"2026-05-18T00:23:17.312614+00:00","updated_at":"2026-05-18T00:23:17.312614+00:00"}