{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BLPK6IKOICNHL2XNSCUKX4G42K","short_pith_number":"pith:BLPK6IKO","canonical_record":{"source":{"id":"1503.07691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-26T11:24:58Z","cross_cats_sorted":[],"title_canon_sha256":"4388354d23d1cec8fc1137cfdc84ab21b262d6c4e759d9313ef5b45dc77bcc37","abstract_canon_sha256":"4306370b91969734adad6f90e448dd5acb218e777ff4cb67b20c6d07c57ff200"},"schema_version":"1.0"},"canonical_sha256":"0adeaf214e409a75eaed90a8abf0dcd2a6ecce2d1a759d739bf867d98c364250","source":{"kind":"arxiv","id":"1503.07691","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07691","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07691v2","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07691","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"BLPK6IKOICNH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BLPK6IKOICNHL2XN","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BLPK6IKO","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BLPK6IKOICNHL2XNSCUKX4G42K","target":"record","payload":{"canonical_record":{"source":{"id":"1503.07691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-26T11:24:58Z","cross_cats_sorted":[],"title_canon_sha256":"4388354d23d1cec8fc1137cfdc84ab21b262d6c4e759d9313ef5b45dc77bcc37","abstract_canon_sha256":"4306370b91969734adad6f90e448dd5acb218e777ff4cb67b20c6d07c57ff200"},"schema_version":"1.0"},"canonical_sha256":"0adeaf214e409a75eaed90a8abf0dcd2a6ecce2d1a759d739bf867d98c364250","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:52.520922Z","signature_b64":"cOM2mGZyRt6vspBre9IdBeBxpudAbcFCI4ZllMfOvHBPyhAwW8QoBAeB5kFirsvpPPBzYjp5x7y/+dPCZEOhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0adeaf214e409a75eaed90a8abf0dcd2a6ecce2d1a759d739bf867d98c364250","last_reissued_at":"2026-05-18T01:55:52.520490Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:52.520490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.07691","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-05-18T01:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lU8b3mun39ScrlTHLFg2UFh/J6toho0NdLNIslGBNBlOzo4xsZdvlogHrsTIlXEczbLdvCQsTotnJUqhxeUiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:08:21.811610Z"},"content_sha256":"55520c0702cc845f053b0ed2a9fcd3437c2f55925699af40c5ad34ee5ba33435","schema_version":"1.0","event_id":"sha256:55520c0702cc845f053b0ed2a9fcd3437c2f55925699af40c5ad34ee5ba33435"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BLPK6IKOICNHL2XNSCUKX4G42K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sensitivity versus Certificate Complexity of Boolean Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andris Ambainis, Jevg\\=enijs Vihrovs, Kri\\v{s}j\\=anis Pr\\=usis","submitted_at":"2015-03-26T11:24:58Z","abstract_excerpt":"Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomially related to block sensitivity. However, it has been notoriously hard to obtain even exponential bounds. Since block sensitivity is known to be polynomially related to certificate complexity, an equivalent of proving this conjecture would be showing that certificate complexity is polynomially related to sensitivity. Previously, it has been shown that $bs(f) \\leq C(f) \\leq 2^{s(f)-1} s(f) - (s(f)-1)$. In this work, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07691","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":""},"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:55:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PwUybOkASTwW0uIgpA32Grl5sBf7aMddo3Rpg1rmMFelCbglGcyzAERJ4wRa7HFDmlLPC460UaCoVfezx1wrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:08:21.811952Z"},"content_sha256":"5c65f3966ee42d2e6f04f1079b162ac1a194df60b7d0e6a42b869a05aee6bc11","schema_version":"1.0","event_id":"sha256:5c65f3966ee42d2e6f04f1079b162ac1a194df60b7d0e6a42b869a05aee6bc11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K/bundle.json","state_url":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLPK6IKOICNHL2XNSCUKX4G42K/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-03T05:08:21Z","links":{"resolver":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K","bundle":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K/bundle.json","state":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLPK6IKOICNHL2XNSCUKX4G42K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BLPK6IKOICNHL2XNSCUKX4G42K","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":"4306370b91969734adad6f90e448dd5acb218e777ff4cb67b20c6d07c57ff200","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-26T11:24:58Z","title_canon_sha256":"4388354d23d1cec8fc1137cfdc84ab21b262d6c4e759d9313ef5b45dc77bcc37"},"schema_version":"1.0","source":{"id":"1503.07691","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07691","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07691v2","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07691","created_at":"2026-05-18T01:55:52Z"},{"alias_kind":"pith_short_12","alias_value":"BLPK6IKOICNH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BLPK6IKOICNHL2XN","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BLPK6IKO","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:5c65f3966ee42d2e6f04f1079b162ac1a194df60b7d0e6a42b869a05aee6bc11","target":"graph","created_at":"2026-05-18T01:55:52Z","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":"Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomially related to block sensitivity. However, it has been notoriously hard to obtain even exponential bounds. Since block sensitivity is known to be polynomially related to certificate complexity, an equivalent of proving this conjecture would be showing that certificate complexity is polynomially related to sensitivity. Previously, it has been shown that $bs(f) \\leq C(f) \\leq 2^{s(f)-1} s(f) - (s(f)-1)$. In this work, ","authors_text":"Andris Ambainis, Jevg\\=enijs Vihrovs, Kri\\v{s}j\\=anis Pr\\=usis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-26T11:24:58Z","title":"Sensitivity versus Certificate Complexity of Boolean Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07691","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:55520c0702cc845f053b0ed2a9fcd3437c2f55925699af40c5ad34ee5ba33435","target":"record","created_at":"2026-05-18T01:55:52Z","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":"4306370b91969734adad6f90e448dd5acb218e777ff4cb67b20c6d07c57ff200","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-26T11:24:58Z","title_canon_sha256":"4388354d23d1cec8fc1137cfdc84ab21b262d6c4e759d9313ef5b45dc77bcc37"},"schema_version":"1.0","source":{"id":"1503.07691","kind":"arxiv","version":2}},"canonical_sha256":"0adeaf214e409a75eaed90a8abf0dcd2a6ecce2d1a759d739bf867d98c364250","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0adeaf214e409a75eaed90a8abf0dcd2a6ecce2d1a759d739bf867d98c364250","first_computed_at":"2026-05-18T01:55:52.520490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:52.520490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cOM2mGZyRt6vspBre9IdBeBxpudAbcFCI4ZllMfOvHBPyhAwW8QoBAeB5kFirsvpPPBzYjp5x7y/+dPCZEOhDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:52.520922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07691","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55520c0702cc845f053b0ed2a9fcd3437c2f55925699af40c5ad34ee5ba33435","sha256:5c65f3966ee42d2e6f04f1079b162ac1a194df60b7d0e6a42b869a05aee6bc11"],"state_sha256":"1da55006cf32b5027da1366a935db43c1be57b7ddc0ef3b5a3e30c6df1dee15b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zGkUIEqIXM3C6gLGqqyvs8evlP/hfItNNRTulOirkpSa+/XCMU6079cyFwKfrAeY1bTMiLS3i02XmQI/Kp0uDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:08:21.813928Z","bundle_sha256":"5c0996a168cb8e09ee88591a6a5c517a2fc6f671becb2a3c1eb7d688c0315141"}}