{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZCHT2OJHM56MYAV6EDEHSHGJSJ","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":"6bed2926ff4d07bf83a106747bf26418326cbd35371e4d491dad1687f31f292d","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-02-06T17:52:13Z","title_canon_sha256":"6c5f637b5373ac813cf4baa03e5d7be9abb1011a9ab15567659e33fc1ace17e5"},"schema_version":"1.0","source":{"id":"2602.16807","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.16807","created_at":"2026-07-01T00:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"2602.16807v2","created_at":"2026-07-01T00:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.16807","created_at":"2026-07-01T00:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZCHT2OJHM56M","created_at":"2026-07-01T00:17:10Z"},{"alias_kind":"pith_short_16","alias_value":"ZCHT2OJHM56MYAV6","created_at":"2026-07-01T00:17:10Z"},{"alias_kind":"pith_short_8","alias_value":"ZCHT2OJH","created_at":"2026-07-01T00:17:10Z"}],"graph_snapshots":[{"event_id":"sha256:71b04247495c4832c6d342d48ee8981ae58fd3f8e02eaed0ac95f18bd694177d","target":"graph","created_at":"2026-07-01T00:17:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.16807/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A collection of hyperplanes $\\mathcal{H}$ slices all edges of the $n$-dimensional hypercube $Q_n$ with vertex set $\\{-1,1\\}^n$ if, for every edge $e$ in the hypercube, there exists a hyperplane in $\\mathcal{H}$ intersecting $e$ in its interior. Let $S(n)$ be the minimum number of hyperplanes needed to slice $Q_n$. We prove that $S(n) \\leq \\lceil \\frac{4n}{5} \\rceil$, except when $n$ is an odd multiple of $5$, in which case $S(n) \\leq \\frac{4n}{5} +1$. This improves upon the previously known upper bound of $S(n) \\leq \\lceil\\frac{5n}{6} \\rceil$ due to Paterson reported in 1971. We also obtain ne","authors_text":"Blake Bruell, Christopher D. Rosin, Daniel Reichman, Duncan Soiffer, G\\'abor N. S\\'ark\\\"ozy, Mason DiCicco, Nathaniel Itty, Ryan Offstein","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-02-06T17:52:13Z","title":"Improved Upper Bounds for Slicing the Hypercube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.16807","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:510abdace29f8a1f7726ace42d230b4d850ae38266e6d8fb662a210541f38264","target":"record","created_at":"2026-07-01T00:17:10Z","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":"6bed2926ff4d07bf83a106747bf26418326cbd35371e4d491dad1687f31f292d","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-02-06T17:52:13Z","title_canon_sha256":"6c5f637b5373ac813cf4baa03e5d7be9abb1011a9ab15567659e33fc1ace17e5"},"schema_version":"1.0","source":{"id":"2602.16807","kind":"arxiv","version":2}},"canonical_sha256":"c88f3d3927677ccc02be20c8791cc9925495213529bbacae5c3cc3498c5510af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c88f3d3927677ccc02be20c8791cc9925495213529bbacae5c3cc3498c5510af","first_computed_at":"2026-07-01T00:17:10.400964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T00:17:10.400964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f1hA3k6zZLWYtXbuc8PdGvAslIuhXS0zwwH8BLvevjhZMcWmyr+B5+3WYi1p+PDVlDK2wQSSkD+jLZuCyzEdAA==","signature_status":"signed_v1","signed_at":"2026-07-01T00:17:10.401491Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.16807","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:510abdace29f8a1f7726ace42d230b4d850ae38266e6d8fb662a210541f38264","sha256:71b04247495c4832c6d342d48ee8981ae58fd3f8e02eaed0ac95f18bd694177d"],"state_sha256":"7077951241449c4a870266f5642d8f63785578f4d8c6eff1d926dd7bd2603f6c"}