{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RSTP4ECXKVKPFYKQ4FXWSS7USF","short_pith_number":"pith:RSTP4ECX","canonical_record":{"source":{"id":"1708.00822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-02T17:02:06Z","cross_cats_sorted":[],"title_canon_sha256":"30222984098e87f823823440ead01711b3e59f5f0ba03a609012e98a37d1d605","abstract_canon_sha256":"1bc0e98ee011d503401a0be7e30e7d1782efb91b130a4bcae1db29b648cea921"},"schema_version":"1.0"},"canonical_sha256":"8ca6fe10575554f2e150e16f694bf491603ef18fc63f60f0955aa51c245b7835","source":{"kind":"arxiv","id":"1708.00822","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00822","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00822v1","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00822","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"RSTP4ECXKVKP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RSTP4ECXKVKPFYKQ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RSTP4ECX","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RSTP4ECXKVKPFYKQ4FXWSS7USF","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-02T17:02:06Z","cross_cats_sorted":[],"title_canon_sha256":"30222984098e87f823823440ead01711b3e59f5f0ba03a609012e98a37d1d605","abstract_canon_sha256":"1bc0e98ee011d503401a0be7e30e7d1782efb91b130a4bcae1db29b648cea921"},"schema_version":"1.0"},"canonical_sha256":"8ca6fe10575554f2e150e16f694bf491603ef18fc63f60f0955aa51c245b7835","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:44.552362Z","signature_b64":"WqW8WxQenOwvAs91cLckEAJeRiqUnk7HWXWHUrt3PuAFB0i4lhmF074tj4FVtIi8u3ONm5kQBHQ21Hr0kAeDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ca6fe10575554f2e150e16f694bf491603ef18fc63f60f0955aa51c245b7835","last_reissued_at":"2026-05-18T00:38:44.551747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:44.551747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00822","source_version":1,"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-18T00:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KrGy3BKre6pk42PJ4Y25WTqmsOSkPNWvmJTIoQ1BIhCPnorNPsd4gEK9wBPfg+jBm07CVVKYoI9cRVNKwmT/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:17:43.530054Z"},"content_sha256":"54e7144f8b95114e7628f42561e149f1e35096236922f852f627440975c2a968","schema_version":"1.0","event_id":"sha256:54e7144f8b95114e7628f42561e149f1e35096236922f852f627440975c2a968"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RSTP4ECXKVKPFYKQ4FXWSS7USF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quadratically Tight Relations for Randomized Query Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dmitry Gavinsky, Hartmut Klauck, Jevgenijs Vihrovs, Miklos Santha, Rahul Jain, Srijita Kundu, Swagato Sanyal, Troy Lee","submitted_at":"2017-08-02T17:02:06Z","abstract_excerpt":"Let $f:\\{0,1\\}^n \\rightarrow \\{0,1\\}$ be a Boolean function. The certificate complexity $C(f)$ is a complexity measure that is quadratically tight for the zero-error randomized query complexity $R_0(f)$: $C(f) \\leq R_0(f) \\leq C(f)^2$. In this paper we study a new complexity measure that we call expectational certificate complexity $EC(f)$, which is also a quadratically tight bound on $R_0(f)$: $EC(f) \\leq R_0(f) = O(EC(f)^2)$. We prove that $EC(f) \\leq C(f) \\leq EC(f)^2$ and show that there is a quadratic separation between the two, thus $EC(f)$ gives a tighter upper bound for $R_0(f)$. The m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00822","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":""},"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-18T00:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5BUBgOeyUAnOufkw/wvFeEUOlfk5l/NGFHOv/i4ZqJeI2BwdezMQng+jfF7gngrwAiKu1881fyt8NcyFeaKKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:17:43.530716Z"},"content_sha256":"c01c17d27a8416d158b564545072a535949eabeae34aa076d7c16c1e64f5279a","schema_version":"1.0","event_id":"sha256:c01c17d27a8416d158b564545072a535949eabeae34aa076d7c16c1e64f5279a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSTP4ECXKVKPFYKQ4FXWSS7USF/bundle.json","state_url":"https://pith.science/pith/RSTP4ECXKVKPFYKQ4FXWSS7USF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSTP4ECXKVKPFYKQ4FXWSS7USF/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-25T19:17:43Z","links":{"resolver":"https://pith.science/pith/RSTP4ECXKVKPFYKQ4FXWSS7USF","bundle":"https://pith.science/pith/RSTP4ECXKVKPFYKQ4FXWSS7USF/bundle.json","state":"https://pith.science/pith/RSTP4ECXKVKPFYKQ4FXWSS7USF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSTP4ECXKVKPFYKQ4FXWSS7USF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RSTP4ECXKVKPFYKQ4FXWSS7USF","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":"1bc0e98ee011d503401a0be7e30e7d1782efb91b130a4bcae1db29b648cea921","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-02T17:02:06Z","title_canon_sha256":"30222984098e87f823823440ead01711b3e59f5f0ba03a609012e98a37d1d605"},"schema_version":"1.0","source":{"id":"1708.00822","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00822","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00822v1","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00822","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"RSTP4ECXKVKP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RSTP4ECXKVKPFYKQ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RSTP4ECX","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:c01c17d27a8416d158b564545072a535949eabeae34aa076d7c16c1e64f5279a","target":"graph","created_at":"2026-05-18T00:38:44Z","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":"Let $f:\\{0,1\\}^n \\rightarrow \\{0,1\\}$ be a Boolean function. The certificate complexity $C(f)$ is a complexity measure that is quadratically tight for the zero-error randomized query complexity $R_0(f)$: $C(f) \\leq R_0(f) \\leq C(f)^2$. In this paper we study a new complexity measure that we call expectational certificate complexity $EC(f)$, which is also a quadratically tight bound on $R_0(f)$: $EC(f) \\leq R_0(f) = O(EC(f)^2)$. We prove that $EC(f) \\leq C(f) \\leq EC(f)^2$ and show that there is a quadratic separation between the two, thus $EC(f)$ gives a tighter upper bound for $R_0(f)$. The m","authors_text":"Dmitry Gavinsky, Hartmut Klauck, Jevgenijs Vihrovs, Miklos Santha, Rahul Jain, Srijita Kundu, Swagato Sanyal, Troy Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-02T17:02:06Z","title":"Quadratically Tight Relations for Randomized Query Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00822","kind":"arxiv","version":1},"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:54e7144f8b95114e7628f42561e149f1e35096236922f852f627440975c2a968","target":"record","created_at":"2026-05-18T00:38:44Z","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":"1bc0e98ee011d503401a0be7e30e7d1782efb91b130a4bcae1db29b648cea921","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-02T17:02:06Z","title_canon_sha256":"30222984098e87f823823440ead01711b3e59f5f0ba03a609012e98a37d1d605"},"schema_version":"1.0","source":{"id":"1708.00822","kind":"arxiv","version":1}},"canonical_sha256":"8ca6fe10575554f2e150e16f694bf491603ef18fc63f60f0955aa51c245b7835","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ca6fe10575554f2e150e16f694bf491603ef18fc63f60f0955aa51c245b7835","first_computed_at":"2026-05-18T00:38:44.551747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:44.551747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WqW8WxQenOwvAs91cLckEAJeRiqUnk7HWXWHUrt3PuAFB0i4lhmF074tj4FVtIi8u3ONm5kQBHQ21Hr0kAeDCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:44.552362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00822","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54e7144f8b95114e7628f42561e149f1e35096236922f852f627440975c2a968","sha256:c01c17d27a8416d158b564545072a535949eabeae34aa076d7c16c1e64f5279a"],"state_sha256":"903d98cb1684a2b516cb6e02acde211c1da29ea3f33a83d2ab259f094c2ce432"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hl5NPpnCDorHOp/kjcPI7z/qRn5COZUgqHo+lN29cRYrWpu7Ke/Q4oR+d/6GA3Bui02HdmtyTaJgdQthZndACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:17:43.534286Z","bundle_sha256":"56d675c384943628de6bafff3a7632219b9099cc33fd3b85c195d296b2496a29"}}