{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:S4FET7Y6AQEK365RXZY4BFKBAF","short_pith_number":"pith:S4FET7Y6","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"},"canonical_sha256":"970a49ff1e0408adfbb1be71c095410168b762ebefd485e2fc0333139dd9a8ad","source":{"kind":"arxiv","id":"1904.12885","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12885","created_at":"2026-05-17T23:42:41Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12885v2","created_at":"2026-05-17T23:42:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12885","created_at":"2026-05-17T23:42:41Z"},{"alias_kind":"pith_short_12","alias_value":"S4FET7Y6AQEK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S4FET7Y6AQEK365R","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S4FET7Y6","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:S4FET7Y6AQEK365RXZY4BFKBAF","target":"record","payload":{"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"},"canonical_sha256":"970a49ff1e0408adfbb1be71c095410168b762ebefd485e2fc0333139dd9a8ad","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"},"source_kind":"arxiv","source_id":"1904.12885","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1VceqUfwL6bowKd2OYiYHT0t2LKO8qgGinO7RG8KkkN6CzgUDTNQwXIUCs9/OwC6tQ0s5EfRanHtH7tVoEMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:39:14.554138Z"},"content_sha256":"f4f43c44e02feee1feebb5fa4123869fae841930d1942acf4ed3cd225dd5777c","schema_version":"1.0","event_id":"sha256:f4f43c44e02feee1feebb5fa4123869fae841930d1942acf4ed3cd225dd5777c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:S4FET7Y6AQEK365RXZY4BFKBAF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ay8RYKBbKC/KZLAM/6aEHrsY6XKmP43ax4NDyzoAKGGWnZL6S03Pw5UbQoFFA8C6B7JpXuvk3pgJr0Iun0atDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:39:14.554508Z"},"content_sha256":"694ab2044e79b26e48579081905f9e6bd9cc75549e0688aa3a501d3447f67c60","schema_version":"1.0","event_id":"sha256:694ab2044e79b26e48579081905f9e6bd9cc75549e0688aa3a501d3447f67c60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4FET7Y6AQEK365RXZY4BFKBAF/bundle.json","state_url":"https://pith.science/pith/S4FET7Y6AQEK365RXZY4BFKBAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4FET7Y6AQEK365RXZY4BFKBAF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T22:39:14Z","links":{"resolver":"https://pith.science/pith/S4FET7Y6AQEK365RXZY4BFKBAF","bundle":"https://pith.science/pith/S4FET7Y6AQEK365RXZY4BFKBAF/bundle.json","state":"https://pith.science/pith/S4FET7Y6AQEK365RXZY4BFKBAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4FET7Y6AQEK365RXZY4BFKBAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:S4FET7Y6AQEK365RXZY4BFKBAF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"be7df7afc46c8c23177f5a03261989923bdd24c23a5d3e3c6a3bc900ae7deb6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-29T18:06:21Z","title_canon_sha256":"4a2efc431b43154d7380c118660efaa026a3632952b8867ae40b7722bd1542f4"},"schema_version":"1.0","source":{"id":"1904.12885","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12885","created_at":"2026-05-17T23:42:41Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12885v2","created_at":"2026-05-17T23:42:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12885","created_at":"2026-05-17T23:42:41Z"},{"alias_kind":"pith_short_12","alias_value":"S4FET7Y6AQEK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S4FET7Y6AQEK365R","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S4FET7Y6","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:694ab2044e79b26e48579081905f9e6bd9cc75549e0688aa3a501d3447f67c60","target":"graph","created_at":"2026-05-17T23:42:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexander Clifton, Hao Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-29T18:06:21Z","title":"On almost k-covers of hypercubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12885","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f4f43c44e02feee1feebb5fa4123869fae841930d1942acf4ed3cd225dd5777c","target":"record","created_at":"2026-05-17T23:42:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"be7df7afc46c8c23177f5a03261989923bdd24c23a5d3e3c6a3bc900ae7deb6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-29T18:06:21Z","title_canon_sha256":"4a2efc431b43154d7380c118660efaa026a3632952b8867ae40b7722bd1542f4"},"schema_version":"1.0","source":{"id":"1904.12885","kind":"arxiv","version":2}},"canonical_sha256":"970a49ff1e0408adfbb1be71c095410168b762ebefd485e2fc0333139dd9a8ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"970a49ff1e0408adfbb1be71c095410168b762ebefd485e2fc0333139dd9a8ad","first_computed_at":"2026-05-17T23:42:41.744365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:41.744365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6kYuy5wqElnl3ubaHpVxmh3X8bJEBFgjLAQaLDBA5kDdTf76eGAUef/VUfZWynwYcwErF6US1KddUjn8H8V4DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:41.745042Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12885","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4f43c44e02feee1feebb5fa4123869fae841930d1942acf4ed3cd225dd5777c","sha256:694ab2044e79b26e48579081905f9e6bd9cc75549e0688aa3a501d3447f67c60"],"state_sha256":"07c38106a38849d6b2b9a38f0966e67376ec2269d2c5537628f067eb3b44a3a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9285QyXiM7L56xUlxYsK/O8DNEW3CuTmXVUBR8IvKZF3spi0pbHqHQQKKOqxM+LNAvrKvPCqloFH/YtchBnWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:39:14.556571Z","bundle_sha256":"b094093d482d291617e3ca6c6973791fdf5174e5cff195f070fe302420282096"}}