{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ISX23TYPYEKPQYXKJXNUUCTR7M","short_pith_number":"pith:ISX23TYP","canonical_record":{"source":{"id":"1406.0073","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-31T12:31:08Z","cross_cats_sorted":[],"title_canon_sha256":"4dcfc1d84a29061ebb5660c176fcc483ea300c83c8c4c03d07e1cef26116ecf7","abstract_canon_sha256":"2c6cd35abe61a88fa75cee78e9bb5c363f1ecdfb883753f43317f14334d7f6b9"},"schema_version":"1.0"},"canonical_sha256":"44afadcf0fc114f862ea4ddb4a0a71fb21e84ae1e99a24e4e6df542e45a62921","source":{"kind":"arxiv","id":"1406.0073","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0073","created_at":"2026-05-18T01:12:50Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0073v3","created_at":"2026-05-18T01:12:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0073","created_at":"2026-05-18T01:12:50Z"},{"alias_kind":"pith_short_12","alias_value":"ISX23TYPYEKP","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"ISX23TYPYEKPQYXK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"ISX23TYP","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ISX23TYPYEKPQYXKJXNUUCTR7M","target":"record","payload":{"canonical_record":{"source":{"id":"1406.0073","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-31T12:31:08Z","cross_cats_sorted":[],"title_canon_sha256":"4dcfc1d84a29061ebb5660c176fcc483ea300c83c8c4c03d07e1cef26116ecf7","abstract_canon_sha256":"2c6cd35abe61a88fa75cee78e9bb5c363f1ecdfb883753f43317f14334d7f6b9"},"schema_version":"1.0"},"canonical_sha256":"44afadcf0fc114f862ea4ddb4a0a71fb21e84ae1e99a24e4e6df542e45a62921","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:50.147558Z","signature_b64":"5xhGQEaWj4O4ampckAfJgposjDXx5Y0MceRwWVtLS5GT7TRyvo1/ootz/fJJaxMXaLgUb40ImUFeWpAGVZpZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44afadcf0fc114f862ea4ddb4a0a71fb21e84ae1e99a24e4e6df542e45a62921","last_reissued_at":"2026-05-18T01:12:50.147166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:50.147166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.0073","source_version":3,"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-18T01:12:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhsTfyxutJCVXfTxLYLwBV7R0sv0HQGGSN52woinsNpkrg7tEPoktJFzMXjhOkNMgPYGnUQZnBdNULh5WjbGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:48:55.952120Z"},"content_sha256":"eba9c5175341e874209dafc2f14e1eb105e9558b396ff6e953e44fb68c487636","schema_version":"1.0","event_id":"sha256:eba9c5175341e874209dafc2f14e1eb105e9558b396ff6e953e44fb68c487636"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ISX23TYPYEKPQYXKJXNUUCTR7M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Size of Sets with Small Sensitivity: a Generalization of Simon's Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andris Ambainis, Jevg\\=enijs Vihrovs","submitted_at":"2014-05-31T12:31:08Z","abstract_excerpt":"We study the structure of sets $S\\subseteq\\{0, 1\\}^n$ with small sensitivity. The well-known Simon's lemma says that any $S\\subseteq\\{0, 1\\}^n$ of sensitivity $s$ must be of size at least $2^{n-s}$. This result has been useful for proving lower bounds on sensitivity of Boolean functions, with applications to the theory of parallel computing and the \"sensitivity vs. block sensitivity\" conjecture.\n  In this paper, we take a deeper look at the size of such sets and their structure. We show an unexpected \"gap theorem\": if $S\\subseteq\\{0, 1\\}^n$ has sensitivity $s$, then we either have $|S|=2^{n-s}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0073","kind":"arxiv","version":3},"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-18T01:12:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4ywoL38EvabfxN8b2hJWNKFg3jc4uUcq1kGYqlUIZkKkABYYo9blhMMM7GfEmDhetd04Npq4S8qB/MUdEUBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:48:55.952771Z"},"content_sha256":"b77ed4288afa5f1ac512bf1e3fb90cd2173da372bbdf6603ecece25b9e754fc6","schema_version":"1.0","event_id":"sha256:b77ed4288afa5f1ac512bf1e3fb90cd2173da372bbdf6603ecece25b9e754fc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ISX23TYPYEKPQYXKJXNUUCTR7M/bundle.json","state_url":"https://pith.science/pith/ISX23TYPYEKPQYXKJXNUUCTR7M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ISX23TYPYEKPQYXKJXNUUCTR7M/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-26T23:48:55Z","links":{"resolver":"https://pith.science/pith/ISX23TYPYEKPQYXKJXNUUCTR7M","bundle":"https://pith.science/pith/ISX23TYPYEKPQYXKJXNUUCTR7M/bundle.json","state":"https://pith.science/pith/ISX23TYPYEKPQYXKJXNUUCTR7M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ISX23TYPYEKPQYXKJXNUUCTR7M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ISX23TYPYEKPQYXKJXNUUCTR7M","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":"2c6cd35abe61a88fa75cee78e9bb5c363f1ecdfb883753f43317f14334d7f6b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-31T12:31:08Z","title_canon_sha256":"4dcfc1d84a29061ebb5660c176fcc483ea300c83c8c4c03d07e1cef26116ecf7"},"schema_version":"1.0","source":{"id":"1406.0073","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0073","created_at":"2026-05-18T01:12:50Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0073v3","created_at":"2026-05-18T01:12:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0073","created_at":"2026-05-18T01:12:50Z"},{"alias_kind":"pith_short_12","alias_value":"ISX23TYPYEKP","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"ISX23TYPYEKPQYXK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"ISX23TYP","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:b77ed4288afa5f1ac512bf1e3fb90cd2173da372bbdf6603ecece25b9e754fc6","target":"graph","created_at":"2026-05-18T01:12:50Z","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":"We study the structure of sets $S\\subseteq\\{0, 1\\}^n$ with small sensitivity. The well-known Simon's lemma says that any $S\\subseteq\\{0, 1\\}^n$ of sensitivity $s$ must be of size at least $2^{n-s}$. This result has been useful for proving lower bounds on sensitivity of Boolean functions, with applications to the theory of parallel computing and the \"sensitivity vs. block sensitivity\" conjecture.\n  In this paper, we take a deeper look at the size of such sets and their structure. We show an unexpected \"gap theorem\": if $S\\subseteq\\{0, 1\\}^n$ has sensitivity $s$, then we either have $|S|=2^{n-s}","authors_text":"Andris Ambainis, Jevg\\=enijs Vihrovs","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-31T12:31:08Z","title":"Size of Sets with Small Sensitivity: a Generalization of Simon's Lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0073","kind":"arxiv","version":3},"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:eba9c5175341e874209dafc2f14e1eb105e9558b396ff6e953e44fb68c487636","target":"record","created_at":"2026-05-18T01:12:50Z","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":"2c6cd35abe61a88fa75cee78e9bb5c363f1ecdfb883753f43317f14334d7f6b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-05-31T12:31:08Z","title_canon_sha256":"4dcfc1d84a29061ebb5660c176fcc483ea300c83c8c4c03d07e1cef26116ecf7"},"schema_version":"1.0","source":{"id":"1406.0073","kind":"arxiv","version":3}},"canonical_sha256":"44afadcf0fc114f862ea4ddb4a0a71fb21e84ae1e99a24e4e6df542e45a62921","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44afadcf0fc114f862ea4ddb4a0a71fb21e84ae1e99a24e4e6df542e45a62921","first_computed_at":"2026-05-18T01:12:50.147166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:50.147166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5xhGQEaWj4O4ampckAfJgposjDXx5Y0MceRwWVtLS5GT7TRyvo1/ootz/fJJaxMXaLgUb40ImUFeWpAGVZpZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:50.147558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.0073","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eba9c5175341e874209dafc2f14e1eb105e9558b396ff6e953e44fb68c487636","sha256:b77ed4288afa5f1ac512bf1e3fb90cd2173da372bbdf6603ecece25b9e754fc6"],"state_sha256":"d71e7bb78633ad69d364535bbcfdbc0c18cc30385fd0977f8d3af7177a4f8dc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vcqVCqeVWJC2IoK/kRzkZfXL8rKK/+UGsqcK8hDep84rnTJq1dqnPthnkaC2q+0k6Uf2pGjrSodGrjTFUKexAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:48:55.956092Z","bundle_sha256":"d1ee8f7215055d662c0f4f9131430b7ed282beebd4e2cdab57ad643c1b10a778"}}