{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:Y73Q6OT476XXMM3WZDKCRCPRNC","short_pith_number":"pith:Y73Q6OT4","canonical_record":{"source":{"id":"2102.05536","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-02-10T16:24:37Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"e6d412c9945cb88e33e4f03c17fb5ae0852b0ecf481c8120d9043d0aa7acf140","abstract_canon_sha256":"c61a54bdfa59eaaf2d62ee202dc70e9234672f5e5becd4f15dae4d42545877b4"},"schema_version":"1.0"},"canonical_sha256":"c7f70f3a7cffaf763376c8d42889f168bc0694d0941671d5abf3b9770904c95e","source":{"kind":"arxiv","id":"2102.05536","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.05536","created_at":"2026-07-05T02:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"2102.05536v2","created_at":"2026-07-05T02:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.05536","created_at":"2026-07-05T02:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y73Q6OT476XX","created_at":"2026-07-05T02:16:02Z"},{"alias_kind":"pith_short_16","alias_value":"Y73Q6OT476XXMM3W","created_at":"2026-07-05T02:16:02Z"},{"alias_kind":"pith_short_8","alias_value":"Y73Q6OT4","created_at":"2026-07-05T02:16:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:Y73Q6OT476XXMM3WZDKCRCPRNC","target":"record","payload":{"canonical_record":{"source":{"id":"2102.05536","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-02-10T16:24:37Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"e6d412c9945cb88e33e4f03c17fb5ae0852b0ecf481c8120d9043d0aa7acf140","abstract_canon_sha256":"c61a54bdfa59eaaf2d62ee202dc70e9234672f5e5becd4f15dae4d42545877b4"},"schema_version":"1.0"},"canonical_sha256":"c7f70f3a7cffaf763376c8d42889f168bc0694d0941671d5abf3b9770904c95e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:02.100406Z","signature_b64":"WJkYXvTX7v6+T1j6LA2cfMSq/Gp+x7+atIy5uer5kvlct31IclLUXNCKCXZDUmxqczw5JBAar4TEf94mp+b9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7f70f3a7cffaf763376c8d42889f168bc0694d0941671d5abf3b9770904c95e","last_reissued_at":"2026-07-05T02:16:02.099907Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:02.099907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.05536","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-05T02:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jUKE6zJ/q629ma2AYaNwwqKHrQJuMrDoNIrTWRd6LsXavrsu+Rrpot09TpUlDqJ18BtcoFKI/SgIuxUL0B0KAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:04:16.595122Z"},"content_sha256":"9355c00b6fb0270bcfd90519d92d2147f158b4be7526e6285190cc848fe0e89c","schema_version":"1.0","event_id":"sha256:9355c00b6fb0270bcfd90519d92d2147f158b4be7526e6285190cc848fe0e89c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:Y73Q6OT476XXMM3WZDKCRCPRNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Slicing the hypercube is not easy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"math.CO","authors_text":"Amir Yehudayoff, Gal Yehuda","submitted_at":"2021-02-10T16:24:37Z","abstract_excerpt":"We prove that at least $\\Omega(n^{0.51})$ hyperplanes are needed to slice all edges of the $n$-dimensional hypercube. We provide a couple of applications: lower bounds on the computational complexity of parity, and a lower bound on the cover number of the hypercube by skew hyperplanes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.05536","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/2102.05536/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-05T02:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ulCnESYyI+/AthfNOruk0vcS9YPi98lf6Ihr0buJ+fw+LSZuDg6e3PwACKkUqvNveVkozzCPOTwEQm0bSNxgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:04:16.595631Z"},"content_sha256":"61f7d3ca38ad4365b5492da6104643ab2f68b8cdeb3b6ffd11575c89b83b8541","schema_version":"1.0","event_id":"sha256:61f7d3ca38ad4365b5492da6104643ab2f68b8cdeb3b6ffd11575c89b83b8541"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y73Q6OT476XXMM3WZDKCRCPRNC/bundle.json","state_url":"https://pith.science/pith/Y73Q6OT476XXMM3WZDKCRCPRNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y73Q6OT476XXMM3WZDKCRCPRNC/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-11T03:04:16Z","links":{"resolver":"https://pith.science/pith/Y73Q6OT476XXMM3WZDKCRCPRNC","bundle":"https://pith.science/pith/Y73Q6OT476XXMM3WZDKCRCPRNC/bundle.json","state":"https://pith.science/pith/Y73Q6OT476XXMM3WZDKCRCPRNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y73Q6OT476XXMM3WZDKCRCPRNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:Y73Q6OT476XXMM3WZDKCRCPRNC","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":"c61a54bdfa59eaaf2d62ee202dc70e9234672f5e5becd4f15dae4d42545877b4","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-02-10T16:24:37Z","title_canon_sha256":"e6d412c9945cb88e33e4f03c17fb5ae0852b0ecf481c8120d9043d0aa7acf140"},"schema_version":"1.0","source":{"id":"2102.05536","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.05536","created_at":"2026-07-05T02:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"2102.05536v2","created_at":"2026-07-05T02:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.05536","created_at":"2026-07-05T02:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y73Q6OT476XX","created_at":"2026-07-05T02:16:02Z"},{"alias_kind":"pith_short_16","alias_value":"Y73Q6OT476XXMM3W","created_at":"2026-07-05T02:16:02Z"},{"alias_kind":"pith_short_8","alias_value":"Y73Q6OT4","created_at":"2026-07-05T02:16:02Z"}],"graph_snapshots":[{"event_id":"sha256:61f7d3ca38ad4365b5492da6104643ab2f68b8cdeb3b6ffd11575c89b83b8541","target":"graph","created_at":"2026-07-05T02:16:02Z","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/2102.05536/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that at least $\\Omega(n^{0.51})$ hyperplanes are needed to slice all edges of the $n$-dimensional hypercube. We provide a couple of applications: lower bounds on the computational complexity of parity, and a lower bound on the cover number of the hypercube by skew hyperplanes.","authors_text":"Amir Yehudayoff, Gal Yehuda","cross_cats":["cs.AI","cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-02-10T16:24:37Z","title":"Slicing the hypercube is not easy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.05536","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:9355c00b6fb0270bcfd90519d92d2147f158b4be7526e6285190cc848fe0e89c","target":"record","created_at":"2026-07-05T02:16:02Z","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":"c61a54bdfa59eaaf2d62ee202dc70e9234672f5e5becd4f15dae4d42545877b4","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-02-10T16:24:37Z","title_canon_sha256":"e6d412c9945cb88e33e4f03c17fb5ae0852b0ecf481c8120d9043d0aa7acf140"},"schema_version":"1.0","source":{"id":"2102.05536","kind":"arxiv","version":2}},"canonical_sha256":"c7f70f3a7cffaf763376c8d42889f168bc0694d0941671d5abf3b9770904c95e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7f70f3a7cffaf763376c8d42889f168bc0694d0941671d5abf3b9770904c95e","first_computed_at":"2026-07-05T02:16:02.099907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:16:02.099907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WJkYXvTX7v6+T1j6LA2cfMSq/Gp+x7+atIy5uer5kvlct31IclLUXNCKCXZDUmxqczw5JBAar4TEf94mp+b9Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:16:02.100406Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.05536","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9355c00b6fb0270bcfd90519d92d2147f158b4be7526e6285190cc848fe0e89c","sha256:61f7d3ca38ad4365b5492da6104643ab2f68b8cdeb3b6ffd11575c89b83b8541"],"state_sha256":"3a4a8e2c2e63338fbb1ae845f9aaa8dc79ec4bdcc5f5b4d1763334558326b743"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZjcjuM2Ns9sgj68yFiifDZRuIRTK2NageUQEYJ3Vv2YvGZFyamlHvhp9v+zEQCRFZEH/cqo/iz0U0ybsr7V8Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T03:04:16.600225Z","bundle_sha256":"81845c5bb3cc739deb2f2cd8d2898270d95311dbc2b4c458c58923b4baf5fc28"}}