{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EGZK7TEU4IYJEULXWFCZ63BOL3","short_pith_number":"pith:EGZK7TEU","canonical_record":{"source":{"id":"1506.06399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-21T18:36:24Z","cross_cats_sorted":[],"title_canon_sha256":"fe7be1a99d558379261665e6d02ba1c24e7ccad36dab7ff3e24b44b58f5967bc","abstract_canon_sha256":"d7812e64ee535011e8c5f1f47121cfed0731897844ba4a080be956a55bd7393e"},"schema_version":"1.0"},"canonical_sha256":"21b2afcc94e230925177b1459f6c2e5ef7506ab72c812e8ad35fd06ddcaabdf5","source":{"kind":"arxiv","id":"1506.06399","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06399","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06399v2","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06399","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"EGZK7TEU4IYJ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EGZK7TEU4IYJEULX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EGZK7TEU","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EGZK7TEU4IYJEULXWFCZ63BOL3","target":"record","payload":{"canonical_record":{"source":{"id":"1506.06399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-21T18:36:24Z","cross_cats_sorted":[],"title_canon_sha256":"fe7be1a99d558379261665e6d02ba1c24e7ccad36dab7ff3e24b44b58f5967bc","abstract_canon_sha256":"d7812e64ee535011e8c5f1f47121cfed0731897844ba4a080be956a55bd7393e"},"schema_version":"1.0"},"canonical_sha256":"21b2afcc94e230925177b1459f6c2e5ef7506ab72c812e8ad35fd06ddcaabdf5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:54.680144Z","signature_b64":"3PC/bkkInOq3m3bIcQrb4PTSECqPwiCp4kCISOwV010T7Y2FrQ9KUyE2kNLtIw9OZVeNWrMwEmirleqC1R4uDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21b2afcc94e230925177b1459f6c2e5ef7506ab72c812e8ad35fd06ddcaabdf5","last_reissued_at":"2026-05-18T01:39:54.679755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:54.679755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.06399","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:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TBcKPhE2A04CMU1eu+7BMEQfC0A8Uea/xacCiQGWrELERKdDP+wFNUubbY/yA+o3hH20LIjy1XH0ZGhhe91JDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:04:37.312587Z"},"content_sha256":"dbc24be10ecd6aa03af54dbd5d593825b347fec988b752c78ca65c06ad63d568","schema_version":"1.0","event_id":"sha256:dbc24be10ecd6aa03af54dbd5d593825b347fec988b752c78ca65c06ad63d568"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EGZK7TEU4IYJEULXWFCZ63BOL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Better Separation between Deterministic and Randomized Query Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Sagnik Mukhopadhyay, Swagato Sanyal","submitted_at":"2015-06-21T18:36:24Z","abstract_excerpt":"We show that there exists a Boolean function $F$ which observes the following separations among deterministic query complexity $(D(F))$, randomized zero error query complexity $(R_0(F))$ and randomized one-sided error query complexity $(R_1(F))$: $R_1(F) = \\widetilde{O}(\\sqrt{D(F)})$ and $R_0(F)=\\widetilde{O}(D(F))^{3/4}$. This refutes the conjecture made by Saks and Wigderson that for any Boolean function $f$, $R_0(f)=\\Omega({D(f)})^{0.753..}$. This also shows widest separation between $R_1(f)$ and $D(f)$ for any Boolean function. The function $F$ was defined by G{\\\"{o}}{\\\"{o}}s, Pitassi and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06399","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:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxq1YsbNRssKxeqZqNo3iFIU80TZ7apBa6UDxjPAs2DE/Hrigm/3v3RcQukRU622IwSEODH9Xhgzjr79ndZUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:04:37.312926Z"},"content_sha256":"fa22e0d774374552e7479b25ec5ec50a18a2951a3514dd2cc7b08d49483ae2a8","schema_version":"1.0","event_id":"sha256:fa22e0d774374552e7479b25ec5ec50a18a2951a3514dd2cc7b08d49483ae2a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EGZK7TEU4IYJEULXWFCZ63BOL3/bundle.json","state_url":"https://pith.science/pith/EGZK7TEU4IYJEULXWFCZ63BOL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EGZK7TEU4IYJEULXWFCZ63BOL3/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-05-28T10:04:37Z","links":{"resolver":"https://pith.science/pith/EGZK7TEU4IYJEULXWFCZ63BOL3","bundle":"https://pith.science/pith/EGZK7TEU4IYJEULXWFCZ63BOL3/bundle.json","state":"https://pith.science/pith/EGZK7TEU4IYJEULXWFCZ63BOL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EGZK7TEU4IYJEULXWFCZ63BOL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EGZK7TEU4IYJEULXWFCZ63BOL3","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":"d7812e64ee535011e8c5f1f47121cfed0731897844ba4a080be956a55bd7393e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-21T18:36:24Z","title_canon_sha256":"fe7be1a99d558379261665e6d02ba1c24e7ccad36dab7ff3e24b44b58f5967bc"},"schema_version":"1.0","source":{"id":"1506.06399","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06399","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06399v2","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06399","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"EGZK7TEU4IYJ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EGZK7TEU4IYJEULX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EGZK7TEU","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:fa22e0d774374552e7479b25ec5ec50a18a2951a3514dd2cc7b08d49483ae2a8","target":"graph","created_at":"2026-05-18T01:39:54Z","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":"We show that there exists a Boolean function $F$ which observes the following separations among deterministic query complexity $(D(F))$, randomized zero error query complexity $(R_0(F))$ and randomized one-sided error query complexity $(R_1(F))$: $R_1(F) = \\widetilde{O}(\\sqrt{D(F)})$ and $R_0(F)=\\widetilde{O}(D(F))^{3/4}$. This refutes the conjecture made by Saks and Wigderson that for any Boolean function $f$, $R_0(f)=\\Omega({D(f)})^{0.753..}$. This also shows widest separation between $R_1(f)$ and $D(f)$ for any Boolean function. The function $F$ was defined by G{\\\"{o}}{\\\"{o}}s, Pitassi and ","authors_text":"Sagnik Mukhopadhyay, Swagato Sanyal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-21T18:36:24Z","title":"Towards Better Separation between Deterministic and Randomized Query Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06399","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:dbc24be10ecd6aa03af54dbd5d593825b347fec988b752c78ca65c06ad63d568","target":"record","created_at":"2026-05-18T01:39:54Z","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":"d7812e64ee535011e8c5f1f47121cfed0731897844ba4a080be956a55bd7393e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-21T18:36:24Z","title_canon_sha256":"fe7be1a99d558379261665e6d02ba1c24e7ccad36dab7ff3e24b44b58f5967bc"},"schema_version":"1.0","source":{"id":"1506.06399","kind":"arxiv","version":2}},"canonical_sha256":"21b2afcc94e230925177b1459f6c2e5ef7506ab72c812e8ad35fd06ddcaabdf5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21b2afcc94e230925177b1459f6c2e5ef7506ab72c812e8ad35fd06ddcaabdf5","first_computed_at":"2026-05-18T01:39:54.679755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:39:54.679755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3PC/bkkInOq3m3bIcQrb4PTSECqPwiCp4kCISOwV010T7Y2FrQ9KUyE2kNLtIw9OZVeNWrMwEmirleqC1R4uDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:39:54.680144Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06399","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbc24be10ecd6aa03af54dbd5d593825b347fec988b752c78ca65c06ad63d568","sha256:fa22e0d774374552e7479b25ec5ec50a18a2951a3514dd2cc7b08d49483ae2a8"],"state_sha256":"14659c29ffa78ec61a7434649317816eaa11f9722e829adda7aaf0445a441178"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQt71PV2bdSfdR9R/cSC92UU7xAnd1LQ6xnLvd+/1JPrP6VvAzhaOUPP4uHLqtPEcKRZg++Xo5+UWxFL69PjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:04:37.314776Z","bundle_sha256":"26a6fdd3b5abfc3818cbaa016877ad0ff33ffb1936b57d6bd5758ffb2fe2468c"}}