{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6ZLF7G26JORFQ55CAA523TLFUX","short_pith_number":"pith:6ZLF7G26","canonical_record":{"source":{"id":"1706.00335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-01T15:09:27Z","cross_cats_sorted":[],"title_canon_sha256":"5f65b094669888ed1d8067175a630c4e18c463f54c208eb33255c85a367fed24","abstract_canon_sha256":"674c2d2aca4ae32f01b87a34944872d2b91c503d2bb97888ab31bdeab9b44bae"},"schema_version":"1.0"},"canonical_sha256":"f6565f9b5e4ba25877a2003badcd65a5cb85bd29bc1b791b65f17dc1e270f4bf","source":{"kind":"arxiv","id":"1706.00335","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00335","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00335v2","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00335","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"6ZLF7G26JORF","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ZLF7G26JORFQ55C","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ZLF7G26","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6ZLF7G26JORFQ55CAA523TLFUX","target":"record","payload":{"canonical_record":{"source":{"id":"1706.00335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-01T15:09:27Z","cross_cats_sorted":[],"title_canon_sha256":"5f65b094669888ed1d8067175a630c4e18c463f54c208eb33255c85a367fed24","abstract_canon_sha256":"674c2d2aca4ae32f01b87a34944872d2b91c503d2bb97888ab31bdeab9b44bae"},"schema_version":"1.0"},"canonical_sha256":"f6565f9b5e4ba25877a2003badcd65a5cb85bd29bc1b791b65f17dc1e270f4bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:23.309146Z","signature_b64":"4JMtUct4xbVpxd+2YvgUBrZ/aFPuVdVLHQKXULyNdwODzYcBm5QEoCqnnJa/qZH57Qh1u73s9RHh0ivZB/RyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6565f9b5e4ba25877a2003badcd65a5cb85bd29bc1b791b65f17dc1e270f4bf","last_reissued_at":"2026-05-18T00:42:23.308661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:23.308661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.00335","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-18T00:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"peFXvrw2n0NyAKlhBJpJWtGN6D6V7tlRoDv29R1X9xGULIRjym1LiJlog7H8OPs181E+kW7I5Lpiai+d3DnSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:30:33.543426Z"},"content_sha256":"33a49a61c2ae9ebc49258ea9d4c22ae7396a27b3cea78ce42d5770915538b9ba","schema_version":"1.0","event_id":"sha256:33a49a61c2ae9ebc49258ea9d4c22ae7396a27b3cea78ce42d5770915538b9ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6ZLF7G26JORFQ55CAA523TLFUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Composition Theorem for Randomized Query Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anurag Anshu, Dmitry Gavinsky, Miklos Santha, Priyanka Mukhopadhyay, Rahul Jain, Srijita Kundu, Swagato Sanyal, Troy Lee","submitted_at":"2017-06-01T15:09:27Z","abstract_excerpt":"Let the randomized query complexity of a relation for error probability $\\epsilon$ be denoted by $R_\\epsilon(\\cdot)$. We prove that for any relation $f \\subseteq \\{0,1\\}^n \\times \\mathcal{R}$ and Boolean function $g:\\{0,1\\}^m \\rightarrow \\{0,1\\}$, $R_{1/3}(f\\circ g^n) = \\Omega(R_{4/9}(f)\\cdot R_{1/2-1/n^4}(g))$, where $f \\circ g^n$ is the relation obtained by composing $f$ and $g$. We also show that $R_{1/3}\\left(f \\circ \\left(g^\\oplus_{O(\\log n)}\\right)^n\\right)=\\Omega(\\log n \\cdot R_{4/9}(f) \\cdot R_{1/3}(g))$, where $g^\\oplus_{O(\\log n)}$ is the function obtained by composing the xor functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00335","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-18T00:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2ZzwP0mQJYjr7wouu/TsAhJzbQzA6dRTAD6rI5Ef2/vLDTtTjVhyZHuQ4ErBinaOr4NnSHqTI9DO1NNW+1UCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:30:33.544116Z"},"content_sha256":"c5cdf29aee81d2a767fbb835c945a063e1f7db0b7d7093084f1f29a42a491e17","schema_version":"1.0","event_id":"sha256:c5cdf29aee81d2a767fbb835c945a063e1f7db0b7d7093084f1f29a42a491e17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ZLF7G26JORFQ55CAA523TLFUX/bundle.json","state_url":"https://pith.science/pith/6ZLF7G26JORFQ55CAA523TLFUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ZLF7G26JORFQ55CAA523TLFUX/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-26T08:30:33Z","links":{"resolver":"https://pith.science/pith/6ZLF7G26JORFQ55CAA523TLFUX","bundle":"https://pith.science/pith/6ZLF7G26JORFQ55CAA523TLFUX/bundle.json","state":"https://pith.science/pith/6ZLF7G26JORFQ55CAA523TLFUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ZLF7G26JORFQ55CAA523TLFUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6ZLF7G26JORFQ55CAA523TLFUX","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":"674c2d2aca4ae32f01b87a34944872d2b91c503d2bb97888ab31bdeab9b44bae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-01T15:09:27Z","title_canon_sha256":"5f65b094669888ed1d8067175a630c4e18c463f54c208eb33255c85a367fed24"},"schema_version":"1.0","source":{"id":"1706.00335","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00335","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00335v2","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00335","created_at":"2026-05-18T00:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"6ZLF7G26JORF","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6ZLF7G26JORFQ55C","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6ZLF7G26","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:c5cdf29aee81d2a767fbb835c945a063e1f7db0b7d7093084f1f29a42a491e17","target":"graph","created_at":"2026-05-18T00:42:23Z","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 the randomized query complexity of a relation for error probability $\\epsilon$ be denoted by $R_\\epsilon(\\cdot)$. We prove that for any relation $f \\subseteq \\{0,1\\}^n \\times \\mathcal{R}$ and Boolean function $g:\\{0,1\\}^m \\rightarrow \\{0,1\\}$, $R_{1/3}(f\\circ g^n) = \\Omega(R_{4/9}(f)\\cdot R_{1/2-1/n^4}(g))$, where $f \\circ g^n$ is the relation obtained by composing $f$ and $g$. We also show that $R_{1/3}\\left(f \\circ \\left(g^\\oplus_{O(\\log n)}\\right)^n\\right)=\\Omega(\\log n \\cdot R_{4/9}(f) \\cdot R_{1/3}(g))$, where $g^\\oplus_{O(\\log n)}$ is the function obtained by composing the xor functi","authors_text":"Anurag Anshu, Dmitry Gavinsky, Miklos Santha, Priyanka Mukhopadhyay, 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-06-01T15:09:27Z","title":"A Composition Theorem for Randomized Query Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00335","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:33a49a61c2ae9ebc49258ea9d4c22ae7396a27b3cea78ce42d5770915538b9ba","target":"record","created_at":"2026-05-18T00:42:23Z","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":"674c2d2aca4ae32f01b87a34944872d2b91c503d2bb97888ab31bdeab9b44bae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-01T15:09:27Z","title_canon_sha256":"5f65b094669888ed1d8067175a630c4e18c463f54c208eb33255c85a367fed24"},"schema_version":"1.0","source":{"id":"1706.00335","kind":"arxiv","version":2}},"canonical_sha256":"f6565f9b5e4ba25877a2003badcd65a5cb85bd29bc1b791b65f17dc1e270f4bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6565f9b5e4ba25877a2003badcd65a5cb85bd29bc1b791b65f17dc1e270f4bf","first_computed_at":"2026-05-18T00:42:23.308661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:23.308661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4JMtUct4xbVpxd+2YvgUBrZ/aFPuVdVLHQKXULyNdwODzYcBm5QEoCqnnJa/qZH57Qh1u73s9RHh0ivZB/RyDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:23.309146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00335","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33a49a61c2ae9ebc49258ea9d4c22ae7396a27b3cea78ce42d5770915538b9ba","sha256:c5cdf29aee81d2a767fbb835c945a063e1f7db0b7d7093084f1f29a42a491e17"],"state_sha256":"e555ca303118bc2a86935e109055a942500e8aa3657cb41d0a62c0ce173b8607"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5jYn4jPEEobEe5EgQrQkieETPsQdZdu6aKHzbjKxDxMDh6dEqwS0I17XdiACZD4XMKFEmtp2AAZwTisuZc4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:30:33.547971Z","bundle_sha256":"b778b051f1eeae9a00ea2068b4b00eeaee9cbbdc49c8ec0a914d7e59edf63ada"}}