{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BLPK6IKOICNHL2XNSCUKX4G42K","short_pith_number":"pith:BLPK6IKO","schema_version":"1.0","canonical_sha256":"0adeaf214e409a75eaed90a8abf0dcd2a6ecce2d1a759d739bf867d98c364250","source":{"kind":"arxiv","id":"1503.07691","version":2},"attestation_state":"computed","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, "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.07691","created_at":"2026-05-18T01:55:52.520554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07691v2","created_at":"2026-05-18T01:55:52.520554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07691","created_at":"2026-05-18T01:55:52.520554+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLPK6IKOICNH","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLPK6IKOICNHL2XN","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLPK6IKO","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K","json":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K.json","graph_json":"https://pith.science/api/pith-number/BLPK6IKOICNHL2XNSCUKX4G42K/graph.json","events_json":"https://pith.science/api/pith-number/BLPK6IKOICNHL2XNSCUKX4G42K/events.json","paper":"https://pith.science/paper/BLPK6IKO"},"agent_actions":{"view_html":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K","download_json":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K.json","view_paper":"https://pith.science/paper/BLPK6IKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07691&json=true","fetch_graph":"https://pith.science/api/pith-number/BLPK6IKOICNHL2XNSCUKX4G42K/graph.json","fetch_events":"https://pith.science/api/pith-number/BLPK6IKOICNHL2XNSCUKX4G42K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K/action/storage_attestation","attest_author":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K/action/author_attestation","sign_citation":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K/action/citation_signature","submit_replication":"https://pith.science/pith/BLPK6IKOICNHL2XNSCUKX4G42K/action/replication_record"}},"created_at":"2026-05-18T01:55:52.520554+00:00","updated_at":"2026-05-18T01:55:52.520554+00:00"}