{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4NNSUNIH5NNH7SFP4UUZ6YAPQR","short_pith_number":"pith:4NNSUNIH","canonical_record":{"source":{"id":"1604.07432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-25T20:20:02Z","cross_cats_sorted":[],"title_canon_sha256":"bf14779505967b2a397138bbc8eeca50dcdf7e8fc519df0fd4b1cf7a3e55b9fc","abstract_canon_sha256":"4580103c392c8f62900f752dc579d0b2c77b51b1363289865d8a6dc4f6124e5c"},"schema_version":"1.0"},"canonical_sha256":"e35b2a3507eb5a7fc8afe5299f600f84443d052ea266ecb62cce73b7ed628b2d","source":{"kind":"arxiv","id":"1604.07432","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07432","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07432v1","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07432","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"4NNSUNIH5NNH","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4NNSUNIH5NNH7SFP","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4NNSUNIH","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4NNSUNIH5NNH7SFP4UUZ6YAPQR","target":"record","payload":{"canonical_record":{"source":{"id":"1604.07432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-25T20:20:02Z","cross_cats_sorted":[],"title_canon_sha256":"bf14779505967b2a397138bbc8eeca50dcdf7e8fc519df0fd4b1cf7a3e55b9fc","abstract_canon_sha256":"4580103c392c8f62900f752dc579d0b2c77b51b1363289865d8a6dc4f6124e5c"},"schema_version":"1.0"},"canonical_sha256":"e35b2a3507eb5a7fc8afe5299f600f84443d052ea266ecb62cce73b7ed628b2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:19.794880Z","signature_b64":"tgC/atLr0EhneuqNQ5fIqkuoBxVZuBcVvHhNk1n19SGyaGuOI1V4NpmVem5XjBwOn8ID7h5fO5RaqoKdTl3iAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e35b2a3507eb5a7fc8afe5299f600f84443d052ea266ecb62cce73b7ed628b2d","last_reissued_at":"2026-05-18T01:16:19.794289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:19.794289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.07432","source_version":1,"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:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o36IDofcTatlfH6f5kJ7vA5ZNBLrzERoJ4BFV+U6MeQFXcSWdoO4QIuASIq6xkAo9sn4rRrp6LWS7hBsXphwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:33:03.212307Z"},"content_sha256":"011129ef8eccea5dd83a4248e52995a2915537b11fbe941fc994835f1a71270f","schema_version":"1.0","event_id":"sha256:011129ef8eccea5dd83a4248e52995a2915537b11fbe941fc994835f1a71270f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4NNSUNIH5NNH7SFP4UUZ6YAPQR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Degree and Sensitivity: tails of two distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Avishay Tal, Avi Wigderson, Parikshit Gopalan, Rocco Servedio","submitted_at":"2016-04-25T20:20:02Z","abstract_excerpt":"The sensitivity of a Boolean function f is the maximum over all inputs x, of the number of sensitive coordinates of x. The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean function can be computed by a polynomial over the reals of degree poly(s). The best known upper bounds on degree, however, are exponential rather than polynomial in s.\n  Our main result is an approximate version of the conjecture: every Boolean function with sensitivity s can be epsilon-approximated (in L_2) by a polynomial whose degree is O(s log(1/epsilon)). Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07432","kind":"arxiv","version":1},"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:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"etiMScqACo4nvz1eLiljXvtnvyTDpxgeiE8CGhO0qpBIMicOzzYFLqXIrTJdpj/BIrWF823jBDnVqmVKGRenAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:33:03.212968Z"},"content_sha256":"61d90bc9a540384d4a4ee3c3784e967ba4aa9ae1f67f8f3fade8a3acd022b7b0","schema_version":"1.0","event_id":"sha256:61d90bc9a540384d4a4ee3c3784e967ba4aa9ae1f67f8f3fade8a3acd022b7b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR/bundle.json","state_url":"https://pith.science/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR/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-06-04T08:33:03Z","links":{"resolver":"https://pith.science/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR","bundle":"https://pith.science/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR/bundle.json","state":"https://pith.science/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NNSUNIH5NNH7SFP4UUZ6YAPQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4NNSUNIH5NNH7SFP4UUZ6YAPQR","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":"4580103c392c8f62900f752dc579d0b2c77b51b1363289865d8a6dc4f6124e5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-25T20:20:02Z","title_canon_sha256":"bf14779505967b2a397138bbc8eeca50dcdf7e8fc519df0fd4b1cf7a3e55b9fc"},"schema_version":"1.0","source":{"id":"1604.07432","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07432","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07432v1","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07432","created_at":"2026-05-18T01:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"4NNSUNIH5NNH","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4NNSUNIH5NNH7SFP","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4NNSUNIH","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:61d90bc9a540384d4a4ee3c3784e967ba4aa9ae1f67f8f3fade8a3acd022b7b0","target":"graph","created_at":"2026-05-18T01:16:19Z","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":"The sensitivity of a Boolean function f is the maximum over all inputs x, of the number of sensitive coordinates of x. The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean function can be computed by a polynomial over the reals of degree poly(s). The best known upper bounds on degree, however, are exponential rather than polynomial in s.\n  Our main result is an approximate version of the conjecture: every Boolean function with sensitivity s can be epsilon-approximated (in L_2) by a polynomial whose degree is O(s log(1/epsilon)). Th","authors_text":"Avishay Tal, Avi Wigderson, Parikshit Gopalan, Rocco Servedio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-25T20:20:02Z","title":"Degree and Sensitivity: tails of two distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07432","kind":"arxiv","version":1},"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:011129ef8eccea5dd83a4248e52995a2915537b11fbe941fc994835f1a71270f","target":"record","created_at":"2026-05-18T01:16:19Z","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":"4580103c392c8f62900f752dc579d0b2c77b51b1363289865d8a6dc4f6124e5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-25T20:20:02Z","title_canon_sha256":"bf14779505967b2a397138bbc8eeca50dcdf7e8fc519df0fd4b1cf7a3e55b9fc"},"schema_version":"1.0","source":{"id":"1604.07432","kind":"arxiv","version":1}},"canonical_sha256":"e35b2a3507eb5a7fc8afe5299f600f84443d052ea266ecb62cce73b7ed628b2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e35b2a3507eb5a7fc8afe5299f600f84443d052ea266ecb62cce73b7ed628b2d","first_computed_at":"2026-05-18T01:16:19.794289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:19.794289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tgC/atLr0EhneuqNQ5fIqkuoBxVZuBcVvHhNk1n19SGyaGuOI1V4NpmVem5XjBwOn8ID7h5fO5RaqoKdTl3iAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:19.794880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07432","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:011129ef8eccea5dd83a4248e52995a2915537b11fbe941fc994835f1a71270f","sha256:61d90bc9a540384d4a4ee3c3784e967ba4aa9ae1f67f8f3fade8a3acd022b7b0"],"state_sha256":"0e62fe4969d94870b33d8ab3cb99b0e7ec5776fa80f553373e31941144f1de48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RGc3fIB2CYUV22ddF5Ldb51GN1RccfEq7hwuWIVaUOnSkrWvk+YZvHXqW1jjc2jidEgXxW1Z6vWCfvob4Tv1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T08:33:03.215422Z","bundle_sha256":"917adda6e631ed04a645906ffffa50417da4a2dbae2bf99835a711159728dde0"}}