{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BWAAIFZBUTQEUNWBE3266DG2TB","short_pith_number":"pith:BWAAIFZB","canonical_record":{"source":{"id":"1512.00661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-02T12:07:38Z","cross_cats_sorted":[],"title_canon_sha256":"6b396b9355a591ffe2a5222695215fab1385bf730a505772c3228b5001769cd0","abstract_canon_sha256":"765cb218b3a3b08ca84b3d569f9c328ee4c898b65de7ca05f01e8851ec22c8a4"},"schema_version":"1.0"},"canonical_sha256":"0d80041721a4e04a36c126f5ef0cda987a15c1b41e7a1e3616d61c26de2669f5","source":{"kind":"arxiv","id":"1512.00661","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00661","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00661v1","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00661","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"BWAAIFZBUTQE","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BWAAIFZBUTQEUNWB","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BWAAIFZB","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BWAAIFZBUTQEUNWBE3266DG2TB","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-02T12:07:38Z","cross_cats_sorted":[],"title_canon_sha256":"6b396b9355a591ffe2a5222695215fab1385bf730a505772c3228b5001769cd0","abstract_canon_sha256":"765cb218b3a3b08ca84b3d569f9c328ee4c898b65de7ca05f01e8851ec22c8a4"},"schema_version":"1.0"},"canonical_sha256":"0d80041721a4e04a36c126f5ef0cda987a15c1b41e7a1e3616d61c26de2669f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:25.436507Z","signature_b64":"9vtkg8gBVFZ10eUhXqo5Mm8wusbizu3ripskezctJSBufzUARKLbUbLYoiP7p/aWS7IJWRjw1s/GDELXvzcrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d80041721a4e04a36c126f5ef0cda987a15c1b41e7a1e3616d61c26de2669f5","last_reissued_at":"2026-05-18T01:25:25.435977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:25.435977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00661","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-18T01:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQt3DJqQ+zwG00ScCtjvv2VbuB7xLR+MnuXUsYCa24vw6cdMFkIhXqCd7FwSG3G+CoiqDhrERfqURNrppd4sAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:06:29.230433Z"},"content_sha256":"febda1d40ea5fb1806146f406105ff068ae1637d5fae848b6574676383aa447e","schema_version":"1.0","event_id":"sha256:febda1d40ea5fb1806146f406105ff068ae1637d5fae848b6574676383aa447e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BWAAIFZBUTQEUNWBE3266DG2TB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost quadratic gap between partition complexity and query/communication complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andris Ambainis, Martins Kokainis","submitted_at":"2015-12-02T12:07:38Z","abstract_excerpt":"We show nearly quadratic separations between two pairs of complexity measures:\n  1. We show that there is a Boolean function $f$ with $D(f)=\\Omega((D^{sc}(f))^{2-o(1)})$ where $D(f)$ is the deterministic query complexity of $f$ and $D^{sc}$ is the subcube partition complexity of $f$;\n  2. As a consequence, we obtain that there is a communication task $f(x, y)$ such that $D^{cc}(f)=\\Omega(\\log^{2-o(1)}\\chi(f))$ where $D^{cc}(f)$ is the deterministic 2-party communication complexity of $f$ (in the standard 2-party model of communication) and $\\chi(f)$ is the partition number of $f$.\n  Both of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00661","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-18T01:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0YLLZYC4SO6VHnDglMZb12zI8YjwNigAhBHZnBwMGDyCwQ9KZMgJtMgXo3B/vDXYP8B3tfSL/N9xCI686I9NAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:06:29.231129Z"},"content_sha256":"240015d89bffe5e10747f7e1f552dc158bb952ea9e3e2bf05d442ea29b44f620","schema_version":"1.0","event_id":"sha256:240015d89bffe5e10747f7e1f552dc158bb952ea9e3e2bf05d442ea29b44f620"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWAAIFZBUTQEUNWBE3266DG2TB/bundle.json","state_url":"https://pith.science/pith/BWAAIFZBUTQEUNWBE3266DG2TB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWAAIFZBUTQEUNWBE3266DG2TB/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-26T04:06:29Z","links":{"resolver":"https://pith.science/pith/BWAAIFZBUTQEUNWBE3266DG2TB","bundle":"https://pith.science/pith/BWAAIFZBUTQEUNWBE3266DG2TB/bundle.json","state":"https://pith.science/pith/BWAAIFZBUTQEUNWBE3266DG2TB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWAAIFZBUTQEUNWBE3266DG2TB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BWAAIFZBUTQEUNWBE3266DG2TB","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":"765cb218b3a3b08ca84b3d569f9c328ee4c898b65de7ca05f01e8851ec22c8a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-02T12:07:38Z","title_canon_sha256":"6b396b9355a591ffe2a5222695215fab1385bf730a505772c3228b5001769cd0"},"schema_version":"1.0","source":{"id":"1512.00661","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00661","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00661v1","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00661","created_at":"2026-05-18T01:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"BWAAIFZBUTQE","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BWAAIFZBUTQEUNWB","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BWAAIFZB","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:240015d89bffe5e10747f7e1f552dc158bb952ea9e3e2bf05d442ea29b44f620","target":"graph","created_at":"2026-05-18T01:25:25Z","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 nearly quadratic separations between two pairs of complexity measures:\n  1. We show that there is a Boolean function $f$ with $D(f)=\\Omega((D^{sc}(f))^{2-o(1)})$ where $D(f)$ is the deterministic query complexity of $f$ and $D^{sc}$ is the subcube partition complexity of $f$;\n  2. As a consequence, we obtain that there is a communication task $f(x, y)$ such that $D^{cc}(f)=\\Omega(\\log^{2-o(1)}\\chi(f))$ where $D^{cc}(f)$ is the deterministic 2-party communication complexity of $f$ (in the standard 2-party model of communication) and $\\chi(f)$ is the partition number of $f$.\n  Both of th","authors_text":"Andris Ambainis, Martins Kokainis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-02T12:07:38Z","title":"Almost quadratic gap between partition complexity and query/communication complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00661","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:febda1d40ea5fb1806146f406105ff068ae1637d5fae848b6574676383aa447e","target":"record","created_at":"2026-05-18T01:25:25Z","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":"765cb218b3a3b08ca84b3d569f9c328ee4c898b65de7ca05f01e8851ec22c8a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-02T12:07:38Z","title_canon_sha256":"6b396b9355a591ffe2a5222695215fab1385bf730a505772c3228b5001769cd0"},"schema_version":"1.0","source":{"id":"1512.00661","kind":"arxiv","version":1}},"canonical_sha256":"0d80041721a4e04a36c126f5ef0cda987a15c1b41e7a1e3616d61c26de2669f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d80041721a4e04a36c126f5ef0cda987a15c1b41e7a1e3616d61c26de2669f5","first_computed_at":"2026-05-18T01:25:25.435977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:25.435977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9vtkg8gBVFZ10eUhXqo5Mm8wusbizu3ripskezctJSBufzUARKLbUbLYoiP7p/aWS7IJWRjw1s/GDELXvzcrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:25.436507Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00661","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:febda1d40ea5fb1806146f406105ff068ae1637d5fae848b6574676383aa447e","sha256:240015d89bffe5e10747f7e1f552dc158bb952ea9e3e2bf05d442ea29b44f620"],"state_sha256":"dc221a2c4bd8970227caf94f813603fc1144c59e9e5101a28d03d7acd65d4208"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cn6v/aNo+l+PSH1aZpXZDwx/3ZnU8JbuKmsISAooEnCcETDU6MHdiBAncKmteGKui3/axRz9+paG4F4Ruh+bDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:06:29.234814Z","bundle_sha256":"67e30eeed07d10a698c121ea23ad22f158f3b5073993be4641b92ca09f2a0223"}}