{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4IEBCE3OX4FMXOPST7QVL6MJRP","short_pith_number":"pith:4IEBCE3O","schema_version":"1.0","canonical_sha256":"e20811136ebf0acbb9f29fe155f9898bd43312be48a69b4d7c57a5d74851181c","source":{"kind":"arxiv","id":"1605.07084","version":2},"attestation_state":"computed","paper":{"title":"Low-Sensitivity Functions from Unambiguous Certificates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Avishay Tal, Pooya Hatami, Shalev Ben-David","submitted_at":"2016-05-23T16:38:40Z","abstract_excerpt":"We provide new query complexity separations against sensitivity for total Boolean functions: a power $3$ separation between deterministic (and even randomized or quantum) query complexity and sensitivity, and a power $2.22$ separation between certificate complexity and sensitivity. We get these separations by using a new connection between sensitivity and a seemingly unrelated measure called one-sided unambiguous certificate complexity ($UC_{min}$). We also show that $UC_{min}$ is lower-bounded by fractional block sensitivity, which means we cannot use these techniques to get a super-quadratic"},"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":"1605.07084","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-23T16:38:40Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"8ac950293a432ef2ab27b5490d2b6bb302c16d8944a8c5c12afbdc063c116a66","abstract_canon_sha256":"cc6578eed3dd3bc9a20957b20e0636263ac6e8022a3c613e89a3ad248f694b4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:28.800949Z","signature_b64":"rfgQtQJGC0d9bGnokIQUw4kC+92Gnyx70QFtrzfCpBplafs1xNCbW0K4Q8BqCOInZeIlntaDqNB5FFmImdIfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e20811136ebf0acbb9f29fe155f9898bd43312be48a69b4d7c57a5d74851181c","last_reissued_at":"2026-05-18T00:30:28.800341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:28.800341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Sensitivity Functions from Unambiguous Certificates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Avishay Tal, Pooya Hatami, Shalev Ben-David","submitted_at":"2016-05-23T16:38:40Z","abstract_excerpt":"We provide new query complexity separations against sensitivity for total Boolean functions: a power $3$ separation between deterministic (and even randomized or quantum) query complexity and sensitivity, and a power $2.22$ separation between certificate complexity and sensitivity. We get these separations by using a new connection between sensitivity and a seemingly unrelated measure called one-sided unambiguous certificate complexity ($UC_{min}$). We also show that $UC_{min}$ is lower-bounded by fractional block sensitivity, which means we cannot use these techniques to get a super-quadratic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07084","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":"1605.07084","created_at":"2026-05-18T00:30:28.800429+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07084v2","created_at":"2026-05-18T00:30:28.800429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07084","created_at":"2026-05-18T00:30:28.800429+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IEBCE3OX4FM","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IEBCE3OX4FMXOPS","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IEBCE3O","created_at":"2026-05-18T12:29:58.707656+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/4IEBCE3OX4FMXOPST7QVL6MJRP","json":"https://pith.science/pith/4IEBCE3OX4FMXOPST7QVL6MJRP.json","graph_json":"https://pith.science/api/pith-number/4IEBCE3OX4FMXOPST7QVL6MJRP/graph.json","events_json":"https://pith.science/api/pith-number/4IEBCE3OX4FMXOPST7QVL6MJRP/events.json","paper":"https://pith.science/paper/4IEBCE3O"},"agent_actions":{"view_html":"https://pith.science/pith/4IEBCE3OX4FMXOPST7QVL6MJRP","download_json":"https://pith.science/pith/4IEBCE3OX4FMXOPST7QVL6MJRP.json","view_paper":"https://pith.science/paper/4IEBCE3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07084&json=true","fetch_graph":"https://pith.science/api/pith-number/4IEBCE3OX4FMXOPST7QVL6MJRP/graph.json","fetch_events":"https://pith.science/api/pith-number/4IEBCE3OX4FMXOPST7QVL6MJRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IEBCE3OX4FMXOPST7QVL6MJRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IEBCE3OX4FMXOPST7QVL6MJRP/action/storage_attestation","attest_author":"https://pith.science/pith/4IEBCE3OX4FMXOPST7QVL6MJRP/action/author_attestation","sign_citation":"https://pith.science/pith/4IEBCE3OX4FMXOPST7QVL6MJRP/action/citation_signature","submit_replication":"https://pith.science/pith/4IEBCE3OX4FMXOPST7QVL6MJRP/action/replication_record"}},"created_at":"2026-05-18T00:30:28.800429+00:00","updated_at":"2026-05-18T00:30:28.800429+00:00"}