{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:S4FET7Y6AQEK365RXZY4BFKBAF","short_pith_number":"pith:S4FET7Y6","schema_version":"1.0","canonical_sha256":"970a49ff1e0408adfbb1be71c095410168b762ebefd485e2fc0333139dd9a8ad","source":{"kind":"arxiv","id":"1904.12885","version":2},"attestation_state":"computed","paper":{"title":"On almost k-covers of hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Clifton, Hao Huang","submitted_at":"2019-04-29T18:06:21Z","abstract_excerpt":"In this paper, we consider the following problem: what is the minimum number of affine hyperplanes in $\\mathbb{R}^n$, such that all the vertices of $\\{0, 1\\}^n \\setminus \\{\\vec{0}\\}$ are covered at least $k$ times, and $\\vec{0}$ is uncovered? The $k=1$ case is the well-known Alon-F\\\"uredi theorem which says a minimum of $n$ affine hyperplanes is required, proved by the Combinatorial Nullstellensatz.\n  We develop an analogue of the Lubell-Yamamoto-Meshalkin inequality for subset sums, and completely solve the fractional version of this problem, which also provides an asymptotic answer to the in"},"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":"1904.12885","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-29T18:06:21Z","cross_cats_sorted":[],"title_canon_sha256":"4a2efc431b43154d7380c118660efaa026a3632952b8867ae40b7722bd1542f4","abstract_canon_sha256":"be7df7afc46c8c23177f5a03261989923bdd24c23a5d3e3c6a3bc900ae7deb6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:41.745042Z","signature_b64":"6kYuy5wqElnl3ubaHpVxmh3X8bJEBFgjLAQaLDBA5kDdTf76eGAUef/VUfZWynwYcwErF6US1KddUjn8H8V4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"970a49ff1e0408adfbb1be71c095410168b762ebefd485e2fc0333139dd9a8ad","last_reissued_at":"2026-05-17T23:42:41.744365Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:41.744365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On almost k-covers of hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Clifton, Hao Huang","submitted_at":"2019-04-29T18:06:21Z","abstract_excerpt":"In this paper, we consider the following problem: what is the minimum number of affine hyperplanes in $\\mathbb{R}^n$, such that all the vertices of $\\{0, 1\\}^n \\setminus \\{\\vec{0}\\}$ are covered at least $k$ times, and $\\vec{0}$ is uncovered? The $k=1$ case is the well-known Alon-F\\\"uredi theorem which says a minimum of $n$ affine hyperplanes is required, proved by the Combinatorial Nullstellensatz.\n  We develop an analogue of the Lubell-Yamamoto-Meshalkin inequality for subset sums, and completely solve the fractional version of this problem, which also provides an asymptotic answer to the in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12885","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":"1904.12885","created_at":"2026-05-17T23:42:41.744462+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.12885v2","created_at":"2026-05-17T23:42:41.744462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12885","created_at":"2026-05-17T23:42:41.744462+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4FET7Y6AQEK","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4FET7Y6AQEK365R","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4FET7Y6","created_at":"2026-05-18T12:33:27.125529+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/S4FET7Y6AQEK365RXZY4BFKBAF","json":"https://pith.science/pith/S4FET7Y6AQEK365RXZY4BFKBAF.json","graph_json":"https://pith.science/api/pith-number/S4FET7Y6AQEK365RXZY4BFKBAF/graph.json","events_json":"https://pith.science/api/pith-number/S4FET7Y6AQEK365RXZY4BFKBAF/events.json","paper":"https://pith.science/paper/S4FET7Y6"},"agent_actions":{"view_html":"https://pith.science/pith/S4FET7Y6AQEK365RXZY4BFKBAF","download_json":"https://pith.science/pith/S4FET7Y6AQEK365RXZY4BFKBAF.json","view_paper":"https://pith.science/paper/S4FET7Y6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.12885&json=true","fetch_graph":"https://pith.science/api/pith-number/S4FET7Y6AQEK365RXZY4BFKBAF/graph.json","fetch_events":"https://pith.science/api/pith-number/S4FET7Y6AQEK365RXZY4BFKBAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4FET7Y6AQEK365RXZY4BFKBAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4FET7Y6AQEK365RXZY4BFKBAF/action/storage_attestation","attest_author":"https://pith.science/pith/S4FET7Y6AQEK365RXZY4BFKBAF/action/author_attestation","sign_citation":"https://pith.science/pith/S4FET7Y6AQEK365RXZY4BFKBAF/action/citation_signature","submit_replication":"https://pith.science/pith/S4FET7Y6AQEK365RXZY4BFKBAF/action/replication_record"}},"created_at":"2026-05-17T23:42:41.744462+00:00","updated_at":"2026-05-17T23:42:41.744462+00:00"}