{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CIJT3HXODE7GM5A37XDHJAQEEM","short_pith_number":"pith:CIJT3HXO","schema_version":"1.0","canonical_sha256":"12133d9eee193e66741bfdc674820423056fab399dd90dd746c241800eff0492","source":{"kind":"arxiv","id":"2507.00148","version":1},"attestation_state":"computed","paper":{"title":"Sensitivity and Query Complexity under Uncertainty","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Balagopal Komarath, Deepu Benson, Jayalal Sarma, Karteek Sreenivasaiah, Nikhil Mande, Sai Soumya Nalli","submitted_at":"2025-06-30T18:02:39Z","abstract_excerpt":"In this paper, we study the query complexity of Boolean functions in the presence of uncertainty, motivated by parallel computation with an unlimited number of processors where inputs are allowed to be unknown. We allow each query to produce three results: zero, one, or unknown. The output could also be: zero, one, or unknown, with the constraint that we should output ''unknown'' only when we cannot determine the answer from the revealed input bits. Such an extension of a Boolean function is called its hazard-free extension.\n  - We prove an analogue of Huang's celebrated sensitivity theorem [A"},"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":"2507.00148","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-06-30T18:02:39Z","cross_cats_sorted":[],"title_canon_sha256":"7916335548a87c303cd0750d3e41851b2b04aa4fa7a9aab267a6c43bba081210","abstract_canon_sha256":"efaa75a96725c99b220ac3a0c913f528a30b3e2c27da727cc07af7f3fc72a447"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:38.115180Z","signature_b64":"Q56MiuIeaBYwIyTYS+5F9P5QE/HasShTNqQnGx/P+PUu+C2jfNH808Ba+fxbKEUD0zqfKQ+m5I/VpDxH4jJWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12133d9eee193e66741bfdc674820423056fab399dd90dd746c241800eff0492","last_reissued_at":"2026-07-05T11:29:38.114632Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:38.114632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sensitivity and Query Complexity under Uncertainty","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Balagopal Komarath, Deepu Benson, Jayalal Sarma, Karteek Sreenivasaiah, Nikhil Mande, Sai Soumya Nalli","submitted_at":"2025-06-30T18:02:39Z","abstract_excerpt":"In this paper, we study the query complexity of Boolean functions in the presence of uncertainty, motivated by parallel computation with an unlimited number of processors where inputs are allowed to be unknown. We allow each query to produce three results: zero, one, or unknown. The output could also be: zero, one, or unknown, with the constraint that we should output ''unknown'' only when we cannot determine the answer from the revealed input bits. Such an extension of a Boolean function is called its hazard-free extension.\n  - We prove an analogue of Huang's celebrated sensitivity theorem [A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00148","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.00148/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.00148","created_at":"2026-07-05T11:29:38.114696+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.00148v1","created_at":"2026-07-05T11:29:38.114696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00148","created_at":"2026-07-05T11:29:38.114696+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIJT3HXODE7G","created_at":"2026-07-05T11:29:38.114696+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIJT3HXODE7GM5A3","created_at":"2026-07-05T11:29:38.114696+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIJT3HXO","created_at":"2026-07-05T11:29:38.114696+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/CIJT3HXODE7GM5A37XDHJAQEEM","json":"https://pith.science/pith/CIJT3HXODE7GM5A37XDHJAQEEM.json","graph_json":"https://pith.science/api/pith-number/CIJT3HXODE7GM5A37XDHJAQEEM/graph.json","events_json":"https://pith.science/api/pith-number/CIJT3HXODE7GM5A37XDHJAQEEM/events.json","paper":"https://pith.science/paper/CIJT3HXO"},"agent_actions":{"view_html":"https://pith.science/pith/CIJT3HXODE7GM5A37XDHJAQEEM","download_json":"https://pith.science/pith/CIJT3HXODE7GM5A37XDHJAQEEM.json","view_paper":"https://pith.science/paper/CIJT3HXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.00148&json=true","fetch_graph":"https://pith.science/api/pith-number/CIJT3HXODE7GM5A37XDHJAQEEM/graph.json","fetch_events":"https://pith.science/api/pith-number/CIJT3HXODE7GM5A37XDHJAQEEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIJT3HXODE7GM5A37XDHJAQEEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIJT3HXODE7GM5A37XDHJAQEEM/action/storage_attestation","attest_author":"https://pith.science/pith/CIJT3HXODE7GM5A37XDHJAQEEM/action/author_attestation","sign_citation":"https://pith.science/pith/CIJT3HXODE7GM5A37XDHJAQEEM/action/citation_signature","submit_replication":"https://pith.science/pith/CIJT3HXODE7GM5A37XDHJAQEEM/action/replication_record"}},"created_at":"2026-07-05T11:29:38.114696+00:00","updated_at":"2026-07-05T11:29:38.114696+00:00"}