{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OVJ3M6Q5VIFSCRR7XEFD252TY4","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":"f163cea215deeb3c387b61404235933b4ecf819472be840bfd04c7b58c05ef09","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-01T15:14:42Z","title_canon_sha256":"1fa922b4c8fb63cd79e4e3f830852e8bceb2eac04f6897c165ab97b6032fc664"},"schema_version":"1.0","source":{"id":"1907.00847","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00847","created_at":"2026-07-05T00:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00847v2","created_at":"2026-07-05T00:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00847","created_at":"2026-07-05T00:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"OVJ3M6Q5VIFS","created_at":"2026-07-05T00:00:34Z"},{"alias_kind":"pith_short_16","alias_value":"OVJ3M6Q5VIFSCRR7","created_at":"2026-07-05T00:00:34Z"},{"alias_kind":"pith_short_8","alias_value":"OVJ3M6Q5","created_at":"2026-07-05T00:00:34Z"}],"graph_snapshots":[{"event_id":"sha256:b85fb3967b39beb1f4e0671a476735ccadab2f6957191794108d349df3125a35","target":"graph","created_at":"2026-07-05T00:00:34Z","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/1907.00847/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we show that every $(2^{n-1}+1)$-vertex induced subgraph of the $n$-dimensional cube graph has maximum degree at least $\\sqrt{n}$. This result is best possible, and improves a logarithmic lower bound shown by Chung, F\\\"uredi, Graham and Seymour in 1988. As a direct consequence, we prove that the sensitivity and degree of a boolean function are polynomially related, solving an outstanding foundational problem in theoretical computer science, the Sensitivity Conjecture of Nisan and Szegedy.","authors_text":"Hao Huang","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-01T15:14:42Z","title":"Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00847","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:2901e162970d6d4eac9e5b3feb7be1a8ad5af154eaec6c9964bc59c23aadbc3a","target":"record","created_at":"2026-07-05T00:00:34Z","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":"f163cea215deeb3c387b61404235933b4ecf819472be840bfd04c7b58c05ef09","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-01T15:14:42Z","title_canon_sha256":"1fa922b4c8fb63cd79e4e3f830852e8bceb2eac04f6897c165ab97b6032fc664"},"schema_version":"1.0","source":{"id":"1907.00847","kind":"arxiv","version":2}},"canonical_sha256":"7553b67a1daa0b21463fb90a3d7753c728bc412660c4f2bd5511ce2b0dee428d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7553b67a1daa0b21463fb90a3d7753c728bc412660c4f2bd5511ce2b0dee428d","first_computed_at":"2026-07-05T00:00:34.972909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:00:34.972909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NO5SmChabG0CB5nsGjcHemt1uKK/Ly112gun5CVrQZxG5E8KZqv/3foVtgvOjOtiJfsJYMZCjVBdbbHIiJQ1AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:00:34.973277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.00847","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2901e162970d6d4eac9e5b3feb7be1a8ad5af154eaec6c9964bc59c23aadbc3a","sha256:b85fb3967b39beb1f4e0671a476735ccadab2f6957191794108d349df3125a35"],"state_sha256":"ad8fcf76fb8049774b77c537d97f8ae9e57cb0a774d7c477cfad7574b3670e04"}