{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E2NFBSKNXKVZ6TT23WRQG6YG4C","short_pith_number":"pith:E2NFBSKN","canonical_record":{"source":{"id":"1811.10752","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2018-11-27T00:11:08Z","cross_cats_sorted":[],"title_canon_sha256":"51fd171753586825ca971b6830e8a9b8762d1828edfc37277330a897842557aa","abstract_canon_sha256":"66ba8854c06f49d227eda217b0551cd6887fc499b4303489746d019ca777f148"},"schema_version":"1.0"},"canonical_sha256":"269a50c94dbaab9f4e7adda3037b06e0b6093c62a735b18d841d080c65c141de","source":{"kind":"arxiv","id":"1811.10752","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10752","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10752v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10752","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"E2NFBSKNXKVZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E2NFBSKNXKVZ6TT2","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E2NFBSKN","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E2NFBSKNXKVZ6TT23WRQG6YG4C","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10752","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2018-11-27T00:11:08Z","cross_cats_sorted":[],"title_canon_sha256":"51fd171753586825ca971b6830e8a9b8762d1828edfc37277330a897842557aa","abstract_canon_sha256":"66ba8854c06f49d227eda217b0551cd6887fc499b4303489746d019ca777f148"},"schema_version":"1.0"},"canonical_sha256":"269a50c94dbaab9f4e7adda3037b06e0b6093c62a735b18d841d080c65c141de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:47.636465Z","signature_b64":"NZn4i3pCU4I4Lqhs4AMcgCI0RtyIxzpiWp6HKIIbW2LsD6mckjDAhBjvznyDLj7dkz/SABm6p8xF/TLHPd0wDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"269a50c94dbaab9f4e7adda3037b06e0b6093c62a735b18d841d080c65c141de","last_reissued_at":"2026-05-17T23:59:47.635980Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:47.635980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10752","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-17T23:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jD3GCtjoesFRMZROAR1sljQ1dRqTACPbTb5nFpaHbf48b/wr+8ojWP4PoDObJuu0erEXzxUC1MvQRcPUK0tIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:14:39.425485Z"},"content_sha256":"9ca6edadf1b41ad25a16ffff96c97b7ca82a2c3defdb3457f60b20823f7a9cc7","schema_version":"1.0","event_id":"sha256:9ca6edadf1b41ad25a16ffff96c97b7ca82a2c3defdb3457f60b20823f7a9cc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E2NFBSKNXKVZ6TT23WRQG6YG4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A composition theorem for randomized query complexity via max conflict complexity","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dmitry Gavinsky, Miklos Santha, Swagato Sanyal, Troy Lee","submitted_at":"2018-11-27T00:11:08Z","abstract_excerpt":"Let $R_\\epsilon(\\cdot)$ stand for the bounded-error randomized query complexity with error $\\epsilon > 0$. For any relation $f \\subseteq \\{0,1\\}^n \\times S$ and partial Boolean function $g \\subseteq \\{0,1\\}^m \\times \\{0,1\\}$, we show that $R_{1/3}(f \\circ g^n) \\in \\Omega(R_{4/9}(f) \\cdot \\sqrt{R_{1/3}(g)})$, where $f \\circ g^n \\subseteq (\\{0,1\\}^m)^n \\times S$ is the composition of $f$ and $g$. We give an example of a relation $f$ and partial Boolean function $g$ for which this lower bound is tight.\n  We prove our composition theorem by introducing a new complexity measure, the max conflict co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10752","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-17T23:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m7WU3uLVP/23XLAajexliF7rZoSN+rQNSo8woE3k2X15qJIFdRkEqoqwGbrH2uT3hxAruYQQK5wNJOHbO60IDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:14:39.426169Z"},"content_sha256":"367d6b84a6b7cb8d2fa508dc219513cbd2b0a9b5cca04538212e52d62157d3f9","schema_version":"1.0","event_id":"sha256:367d6b84a6b7cb8d2fa508dc219513cbd2b0a9b5cca04538212e52d62157d3f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2NFBSKNXKVZ6TT23WRQG6YG4C/bundle.json","state_url":"https://pith.science/pith/E2NFBSKNXKVZ6TT23WRQG6YG4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2NFBSKNXKVZ6TT23WRQG6YG4C/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-25T17:14:39Z","links":{"resolver":"https://pith.science/pith/E2NFBSKNXKVZ6TT23WRQG6YG4C","bundle":"https://pith.science/pith/E2NFBSKNXKVZ6TT23WRQG6YG4C/bundle.json","state":"https://pith.science/pith/E2NFBSKNXKVZ6TT23WRQG6YG4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2NFBSKNXKVZ6TT23WRQG6YG4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E2NFBSKNXKVZ6TT23WRQG6YG4C","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":"66ba8854c06f49d227eda217b0551cd6887fc499b4303489746d019ca777f148","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2018-11-27T00:11:08Z","title_canon_sha256":"51fd171753586825ca971b6830e8a9b8762d1828edfc37277330a897842557aa"},"schema_version":"1.0","source":{"id":"1811.10752","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10752","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10752v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10752","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"E2NFBSKNXKVZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E2NFBSKNXKVZ6TT2","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E2NFBSKN","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:367d6b84a6b7cb8d2fa508dc219513cbd2b0a9b5cca04538212e52d62157d3f9","target":"graph","created_at":"2026-05-17T23:59:47Z","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 $R_\\epsilon(\\cdot)$ stand for the bounded-error randomized query complexity with error $\\epsilon > 0$. For any relation $f \\subseteq \\{0,1\\}^n \\times S$ and partial Boolean function $g \\subseteq \\{0,1\\}^m \\times \\{0,1\\}$, we show that $R_{1/3}(f \\circ g^n) \\in \\Omega(R_{4/9}(f) \\cdot \\sqrt{R_{1/3}(g)})$, where $f \\circ g^n \\subseteq (\\{0,1\\}^m)^n \\times S$ is the composition of $f$ and $g$. We give an example of a relation $f$ and partial Boolean function $g$ for which this lower bound is tight.\n  We prove our composition theorem by introducing a new complexity measure, the max conflict co","authors_text":"Dmitry Gavinsky, Miklos Santha, Swagato Sanyal, Troy Lee","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2018-11-27T00:11:08Z","title":"A composition theorem for randomized query complexity via max conflict complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10752","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:9ca6edadf1b41ad25a16ffff96c97b7ca82a2c3defdb3457f60b20823f7a9cc7","target":"record","created_at":"2026-05-17T23:59:47Z","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":"66ba8854c06f49d227eda217b0551cd6887fc499b4303489746d019ca777f148","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2018-11-27T00:11:08Z","title_canon_sha256":"51fd171753586825ca971b6830e8a9b8762d1828edfc37277330a897842557aa"},"schema_version":"1.0","source":{"id":"1811.10752","kind":"arxiv","version":1}},"canonical_sha256":"269a50c94dbaab9f4e7adda3037b06e0b6093c62a735b18d841d080c65c141de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"269a50c94dbaab9f4e7adda3037b06e0b6093c62a735b18d841d080c65c141de","first_computed_at":"2026-05-17T23:59:47.635980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:47.635980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NZn4i3pCU4I4Lqhs4AMcgCI0RtyIxzpiWp6HKIIbW2LsD6mckjDAhBjvznyDLj7dkz/SABm6p8xF/TLHPd0wDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:47.636465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10752","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ca6edadf1b41ad25a16ffff96c97b7ca82a2c3defdb3457f60b20823f7a9cc7","sha256:367d6b84a6b7cb8d2fa508dc219513cbd2b0a9b5cca04538212e52d62157d3f9"],"state_sha256":"75c905becd8df0bc6ff7124735dda8e2bc81fb882fd8e31b9b5ff8c4f9147910"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Di6oAuOwt71BYQgbgfdQ0xhLk4Ey8VfYN7uM0ojXSWM+hAXm+oRDkQB4FdycE05rKMO1A77ofcSOKq8na0jsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:14:39.430013Z","bundle_sha256":"7ef70b8301706a25afeb5f6a941f3611fddf6f987ccfcd772fae76723b49e961"}}