{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZCHT2OJHM56MYAV6EDEHSHGJSJ","short_pith_number":"pith:ZCHT2OJH","canonical_record":{"source":{"id":"2602.16807","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-02-06T17:52:13Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"6c5f637b5373ac813cf4baa03e5d7be9abb1011a9ab15567659e33fc1ace17e5","abstract_canon_sha256":"6bed2926ff4d07bf83a106747bf26418326cbd35371e4d491dad1687f31f292d"},"schema_version":"1.0"},"canonical_sha256":"c88f3d3927677ccc02be20c8791cc9925495213529bbacae5c3cc3498c5510af","source":{"kind":"arxiv","id":"2602.16807","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZCHT2OJHM56MYAV6EDEHSHGJSJ","target":"record","payload":{"canonical_record":{"source":{"id":"2602.16807","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-02-06T17:52:13Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"6c5f637b5373ac813cf4baa03e5d7be9abb1011a9ab15567659e33fc1ace17e5","abstract_canon_sha256":"6bed2926ff4d07bf83a106747bf26418326cbd35371e4d491dad1687f31f292d"},"schema_version":"1.0"},"canonical_sha256":"c88f3d3927677ccc02be20c8791cc9925495213529bbacae5c3cc3498c5510af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T00:17:10.401491Z","signature_b64":"f1hA3k6zZLWYtXbuc8PdGvAslIuhXS0zwwH8BLvevjhZMcWmyr+B5+3WYi1p+PDVlDK2wQSSkD+jLZuCyzEdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c88f3d3927677ccc02be20c8791cc9925495213529bbacae5c3cc3498c5510af","last_reissued_at":"2026-07-01T00:17:10.400964Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T00:17:10.400964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.16807","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-07-01T00:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXvTA+rrpo/tneQH7s6th30eBkazdflph8FZwwkSm6GIhhPqoQihENPTeWeXP9JSQjLIgUojK+fR6KTbmwfYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:32:26.679543Z"},"content_sha256":"510abdace29f8a1f7726ace42d230b4d850ae38266e6d8fb662a210541f38264","schema_version":"1.0","event_id":"sha256:510abdace29f8a1f7726ace42d230b4d850ae38266e6d8fb662a210541f38264"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZCHT2OJHM56MYAV6EDEHSHGJSJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Upper Bounds for Slicing the Hypercube","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.AI","authors_text":"Blake Bruell, Christopher D. Rosin, Daniel Reichman, Duncan Soiffer, G\\'abor N. S\\'ark\\\"ozy, Mason DiCicco, Nathaniel Itty, Ryan Offstein","submitted_at":"2026-02-06T17:52:13Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.16807","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.16807/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-01T00:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEnREcxA02EG2BZsTeEDn8wAK4gt+XZ6r8VJVrUGu5DrNKY7ll5Ir7Y1nCgPMi51Lcv/16nHEIQlcenaXKOUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:32:26.679933Z"},"content_sha256":"71b04247495c4832c6d342d48ee8981ae58fd3f8e02eaed0ac95f18bd694177d","schema_version":"1.0","event_id":"sha256:71b04247495c4832c6d342d48ee8981ae58fd3f8e02eaed0ac95f18bd694177d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCHT2OJHM56MYAV6EDEHSHGJSJ/bundle.json","state_url":"https://pith.science/pith/ZCHT2OJHM56MYAV6EDEHSHGJSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCHT2OJHM56MYAV6EDEHSHGJSJ/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-08-06T18:32:26Z","links":{"resolver":"https://pith.science/pith/ZCHT2OJHM56MYAV6EDEHSHGJSJ","bundle":"https://pith.science/pith/ZCHT2OJHM56MYAV6EDEHSHGJSJ/bundle.json","state":"https://pith.science/pith/ZCHT2OJHM56MYAV6EDEHSHGJSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCHT2OJHM56MYAV6EDEHSHGJSJ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t/PE8BgNgeg7zcjwRClGUrPqyPUAEjv0935uElxleWGEXeuRXLMFXwkWKwsaTzsBULxuiLRknUaeXSI3QjoGAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T18:32:26.682771Z","bundle_sha256":"63f14741b2a03330d7d7dbd9e45edc2febdee60d709ff1f77e9300d4d3458987"}}