{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HXXXVRU42N5OQLAYUTN32YPFQK","short_pith_number":"pith:HXXXVRU4","canonical_record":{"source":{"id":"1409.6366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-22T22:40:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9701a79a1d858e2affb16c0f7e46803cff9786d10849199aafbaf56ed12526fe","abstract_canon_sha256":"0672555490e43d0bf9b899f05af16bbc86ee8ab9b2f03cc4218dd1ebc6bdc5fa"},"schema_version":"1.0"},"canonical_sha256":"3def7ac69cd37ae82c18a4dbbd61e58296d6034fa7d019e8631303db61cb805b","source":{"kind":"arxiv","id":"1409.6366","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6366","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6366v1","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6366","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"HXXXVRU42N5O","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HXXXVRU42N5OQLAY","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HXXXVRU4","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HXXXVRU42N5OQLAYUTN32YPFQK","target":"record","payload":{"canonical_record":{"source":{"id":"1409.6366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-22T22:40:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9701a79a1d858e2affb16c0f7e46803cff9786d10849199aafbaf56ed12526fe","abstract_canon_sha256":"0672555490e43d0bf9b899f05af16bbc86ee8ab9b2f03cc4218dd1ebc6bdc5fa"},"schema_version":"1.0"},"canonical_sha256":"3def7ac69cd37ae82c18a4dbbd61e58296d6034fa7d019e8631303db61cb805b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:07.299024Z","signature_b64":"VTHaLzUkvjtjAkkF2MKSzLO6uh7oAMYayh3NShQooTu4/FLRE1sn3Km8D1LhcDEqTAi66x0+jdMc9urMRKLcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3def7ac69cd37ae82c18a4dbbd61e58296d6034fa7d019e8631303db61cb805b","last_reissued_at":"2026-05-18T02:42:07.298414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:07.298414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.6366","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-18T02:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FhfXI8F0UtL+7DyHs6zt70lSS/Tt7bZPoPfAaTqlxloj4j0EgN7xwprt9OWqhSAOYnsNoKuVOJ0m7Mbv3nr6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T16:58:08.741543Z"},"content_sha256":"3d52269bf5ecbf8287822a059e1ddda0d3978ae7d076b500e0c3205eee15256e","schema_version":"1.0","event_id":"sha256:3d52269bf5ecbf8287822a059e1ddda0d3978ae7d076b500e0c3205eee15256e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HXXXVRU42N5OQLAYUTN32YPFQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A direct proof for Lovett's bound on the communication complexity of low rank matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Thomas Rothvoss","submitted_at":"2014-09-22T22:40:24Z","abstract_excerpt":"The log-rank conjecture in communication complexity suggests that the deterministic communication complexity of any Boolean rank-r function is bounded by polylog(r). Recently, major progress was made by Lovett who proved that the communication complexity is bounded by O(r^1/2 * log r). Lovett's proof is based on known estimates on the discrepancy of low-rank matrices. We give a simple, direct proof based on a hyperplane rounding argument that in our opinion sheds more light on the reason why a root factor suffices and what is necessary to improve on this factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6366","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-18T02:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N6cDLKNKPtGbOKvGvk+hXS466wY4iNzrAAi8rXfnNqlk5QER6qX+2S0QO9ceujdjPwOBs0RDSpGYTrXqUiGOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T16:58:08.741982Z"},"content_sha256":"82c0cfd3fdd0df49ab640ca1d6641d3cf50bcd7563d3fad6b7511261f20fcbad","schema_version":"1.0","event_id":"sha256:82c0cfd3fdd0df49ab640ca1d6641d3cf50bcd7563d3fad6b7511261f20fcbad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXXXVRU42N5OQLAYUTN32YPFQK/bundle.json","state_url":"https://pith.science/pith/HXXXVRU42N5OQLAYUTN32YPFQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXXXVRU42N5OQLAYUTN32YPFQK/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-08-09T16:58:08Z","links":{"resolver":"https://pith.science/pith/HXXXVRU42N5OQLAYUTN32YPFQK","bundle":"https://pith.science/pith/HXXXVRU42N5OQLAYUTN32YPFQK/bundle.json","state":"https://pith.science/pith/HXXXVRU42N5OQLAYUTN32YPFQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXXXVRU42N5OQLAYUTN32YPFQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HXXXVRU42N5OQLAYUTN32YPFQK","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":"0672555490e43d0bf9b899f05af16bbc86ee8ab9b2f03cc4218dd1ebc6bdc5fa","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-22T22:40:24Z","title_canon_sha256":"9701a79a1d858e2affb16c0f7e46803cff9786d10849199aafbaf56ed12526fe"},"schema_version":"1.0","source":{"id":"1409.6366","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6366","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6366v1","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6366","created_at":"2026-05-18T02:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"HXXXVRU42N5O","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HXXXVRU42N5OQLAY","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HXXXVRU4","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:82c0cfd3fdd0df49ab640ca1d6641d3cf50bcd7563d3fad6b7511261f20fcbad","target":"graph","created_at":"2026-05-18T02:42:07Z","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 log-rank conjecture in communication complexity suggests that the deterministic communication complexity of any Boolean rank-r function is bounded by polylog(r). Recently, major progress was made by Lovett who proved that the communication complexity is bounded by O(r^1/2 * log r). Lovett's proof is based on known estimates on the discrepancy of low-rank matrices. We give a simple, direct proof based on a hyperplane rounding argument that in our opinion sheds more light on the reason why a root factor suffices and what is necessary to improve on this factor.","authors_text":"Thomas Rothvoss","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-22T22:40:24Z","title":"A direct proof for Lovett's bound on the communication complexity of low rank matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6366","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:3d52269bf5ecbf8287822a059e1ddda0d3978ae7d076b500e0c3205eee15256e","target":"record","created_at":"2026-05-18T02:42:07Z","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":"0672555490e43d0bf9b899f05af16bbc86ee8ab9b2f03cc4218dd1ebc6bdc5fa","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-22T22:40:24Z","title_canon_sha256":"9701a79a1d858e2affb16c0f7e46803cff9786d10849199aafbaf56ed12526fe"},"schema_version":"1.0","source":{"id":"1409.6366","kind":"arxiv","version":1}},"canonical_sha256":"3def7ac69cd37ae82c18a4dbbd61e58296d6034fa7d019e8631303db61cb805b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3def7ac69cd37ae82c18a4dbbd61e58296d6034fa7d019e8631303db61cb805b","first_computed_at":"2026-05-18T02:42:07.298414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:07.298414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VTHaLzUkvjtjAkkF2MKSzLO6uh7oAMYayh3NShQooTu4/FLRE1sn3Km8D1LhcDEqTAi66x0+jdMc9urMRKLcBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:07.299024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6366","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d52269bf5ecbf8287822a059e1ddda0d3978ae7d076b500e0c3205eee15256e","sha256:82c0cfd3fdd0df49ab640ca1d6641d3cf50bcd7563d3fad6b7511261f20fcbad"],"state_sha256":"7485893de994100ee8d9eae4746777c3ee9a0a0aca43b6fe3428f6c8d7cbe86b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y8bOzbo7rgCgm4f2Z22TkdVOXMXT54Wt0sIfH40MXnW83Gj3FGxFsxiFjjdpxDBNhea9j+k+//vUpE44tBakAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T16:58:08.745353Z","bundle_sha256":"c08dc84761c6fadfbf3a9b66f4aef81e89f41cc259e13a50fbaf644320535084"}}