{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WU6KV7R6UAH2R45PCQSCE54IMM","short_pith_number":"pith:WU6KV7R6","canonical_record":{"source":{"id":"1903.00544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-01T21:29:13Z","cross_cats_sorted":[],"title_canon_sha256":"1d7151a5f3887fbc93331fbb5e7ddc32f87a8ab0b17a8afd61315b5b9d8f4bb6","abstract_canon_sha256":"17566b3cb58ed64c3ca2c2a2ce75307727b93600758d446dcf598b817409fd5b"},"schema_version":"1.0"},"canonical_sha256":"b53caafe3ea00fa8f3af14242277886328acce5a07e3c80df9def652524d6441","source":{"kind":"arxiv","id":"1903.00544","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00544","created_at":"2026-05-17T23:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00544v1","created_at":"2026-05-17T23:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00544","created_at":"2026-05-17T23:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"WU6KV7R6UAH2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WU6KV7R6UAH2R45P","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WU6KV7R6","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WU6KV7R6UAH2R45PCQSCE54IMM","target":"record","payload":{"canonical_record":{"source":{"id":"1903.00544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-01T21:29:13Z","cross_cats_sorted":[],"title_canon_sha256":"1d7151a5f3887fbc93331fbb5e7ddc32f87a8ab0b17a8afd61315b5b9d8f4bb6","abstract_canon_sha256":"17566b3cb58ed64c3ca2c2a2ce75307727b93600758d446dcf598b817409fd5b"},"schema_version":"1.0"},"canonical_sha256":"b53caafe3ea00fa8f3af14242277886328acce5a07e3c80df9def652524d6441","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:14.196250Z","signature_b64":"TPROYta83/CKIa25RE7zF/xAL5y8ZJfQb19ZTWsTVl5Ql0vcudpstVL516uzMiTCvXBXT6cSLaTF9SbtlozkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b53caafe3ea00fa8f3af14242277886328acce5a07e3c80df9def652524d6441","last_reissued_at":"2026-05-17T23:52:14.195608Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:14.195608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.00544","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:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pOgc47k0/Kn2rXWo69QyIZOonkY4/6JTNp5A9Xx6FF4oEBB5NV1yzvaAERM29WY32fKH/AMT9RUBtsgcTQomDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T04:32:22.239470Z"},"content_sha256":"4a1d4408757c62f3ea3263f421bbf0e96c5ab771aa6c629dbec1507dbb8f427d","schema_version":"1.0","event_id":"sha256:4a1d4408757c62f3ea3263f421bbf0e96c5ab771aa6c629dbec1507dbb8f427d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WU6KV7R6UAH2R45PCQSCE54IMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sign-Rank Can Increase Under Intersection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Justin Thaler, Mark Bun, Nikhil S. Mande","submitted_at":"2019-03-01T21:29:13Z","abstract_excerpt":"The communication class $\\mathbf{UPP}^{\\text{cc}}$ is a communication analog of the Turing Machine complexity class $\\mathbf{PP}$. It is characterized by a matrix-analytic complexity measure called sign-rank (also called dimension complexity), and is essentially the most powerful communication class against which we know how to prove lower bounds.\n  For a communication problem $f$, let $f \\wedge f$ denote the function that evaluates $f$ on two disjoint inputs and outputs the AND of the results. We exhibit a communication problem $f$ with $\\mathbf{UPP}(f)= O(\\log n)$, and $\\mathbf{UPP}(f \\wedge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00544","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:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ubtb9EUmJkEiZoDPcxByrrF5q0w8mjmDVae498rckLXNl8hsLGVI3m7iUwr7uvGleNfd6MaM2tjwLllK9H6jBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T04:32:22.240129Z"},"content_sha256":"666d1ab6034e0a76292354849f9566e0b9af142e5a08f0bf293a2e7eda844203","schema_version":"1.0","event_id":"sha256:666d1ab6034e0a76292354849f9566e0b9af142e5a08f0bf293a2e7eda844203"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WU6KV7R6UAH2R45PCQSCE54IMM/bundle.json","state_url":"https://pith.science/pith/WU6KV7R6UAH2R45PCQSCE54IMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WU6KV7R6UAH2R45PCQSCE54IMM/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-20T04:32:22Z","links":{"resolver":"https://pith.science/pith/WU6KV7R6UAH2R45PCQSCE54IMM","bundle":"https://pith.science/pith/WU6KV7R6UAH2R45PCQSCE54IMM/bundle.json","state":"https://pith.science/pith/WU6KV7R6UAH2R45PCQSCE54IMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WU6KV7R6UAH2R45PCQSCE54IMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WU6KV7R6UAH2R45PCQSCE54IMM","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":"17566b3cb58ed64c3ca2c2a2ce75307727b93600758d446dcf598b817409fd5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-01T21:29:13Z","title_canon_sha256":"1d7151a5f3887fbc93331fbb5e7ddc32f87a8ab0b17a8afd61315b5b9d8f4bb6"},"schema_version":"1.0","source":{"id":"1903.00544","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00544","created_at":"2026-05-17T23:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00544v1","created_at":"2026-05-17T23:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00544","created_at":"2026-05-17T23:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"WU6KV7R6UAH2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WU6KV7R6UAH2R45P","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WU6KV7R6","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:666d1ab6034e0a76292354849f9566e0b9af142e5a08f0bf293a2e7eda844203","target":"graph","created_at":"2026-05-17T23:52:14Z","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":"The communication class $\\mathbf{UPP}^{\\text{cc}}$ is a communication analog of the Turing Machine complexity class $\\mathbf{PP}$. It is characterized by a matrix-analytic complexity measure called sign-rank (also called dimension complexity), and is essentially the most powerful communication class against which we know how to prove lower bounds.\n  For a communication problem $f$, let $f \\wedge f$ denote the function that evaluates $f$ on two disjoint inputs and outputs the AND of the results. We exhibit a communication problem $f$ with $\\mathbf{UPP}(f)= O(\\log n)$, and $\\mathbf{UPP}(f \\wedge","authors_text":"Justin Thaler, Mark Bun, Nikhil S. Mande","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-01T21:29:13Z","title":"Sign-Rank Can Increase Under Intersection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00544","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:4a1d4408757c62f3ea3263f421bbf0e96c5ab771aa6c629dbec1507dbb8f427d","target":"record","created_at":"2026-05-17T23:52:14Z","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":"17566b3cb58ed64c3ca2c2a2ce75307727b93600758d446dcf598b817409fd5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-01T21:29:13Z","title_canon_sha256":"1d7151a5f3887fbc93331fbb5e7ddc32f87a8ab0b17a8afd61315b5b9d8f4bb6"},"schema_version":"1.0","source":{"id":"1903.00544","kind":"arxiv","version":1}},"canonical_sha256":"b53caafe3ea00fa8f3af14242277886328acce5a07e3c80df9def652524d6441","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b53caafe3ea00fa8f3af14242277886328acce5a07e3c80df9def652524d6441","first_computed_at":"2026-05-17T23:52:14.195608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:14.195608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TPROYta83/CKIa25RE7zF/xAL5y8ZJfQb19ZTWsTVl5Ql0vcudpstVL516uzMiTCvXBXT6cSLaTF9SbtlozkBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:14.196250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00544","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a1d4408757c62f3ea3263f421bbf0e96c5ab771aa6c629dbec1507dbb8f427d","sha256:666d1ab6034e0a76292354849f9566e0b9af142e5a08f0bf293a2e7eda844203"],"state_sha256":"a7fbd2f5cb71fdd42425e7a83c5dc7c238d0882baa90265bf2eb3f8903612bfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WY+I57oRSN5nKwV5RyBRF1lhtbYbF3V79WssPHajV/m80PXTtO2uLNS7WNiPlPmz/K8qb5hhIpN+T4GI+jb9BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T04:32:22.243776Z","bundle_sha256":"be97d575c5516cf8f0cc6a63c8db03d3f7f749fc13cc1d2a0d9879f9152b8843"}}