{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Q2OTA3UTMYKRXYKFMD4N7XRNJR","short_pith_number":"pith:Q2OTA3UT","canonical_record":{"source":{"id":"1411.6712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-25T03:08:40Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"af173fd611040f6823f203de13725e5703653ebf0a5a72c0689915d45ae43188","abstract_canon_sha256":"f2cf228577e2803d020d532ece9e8b49a089df0169f8d71115cd01bd9a18cd9d"},"schema_version":"1.0"},"canonical_sha256":"869d306e9366151be14560f8dfde2d4c789c3829f4a01e7f46995af1d4efcfe5","source":{"kind":"arxiv","id":"1411.6712","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6712","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6712v1","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6712","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"Q2OTA3UTMYKR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q2OTA3UTMYKRXYKF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q2OTA3UT","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Q2OTA3UTMYKRXYKFMD4N7XRNJR","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-25T03:08:40Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"af173fd611040f6823f203de13725e5703653ebf0a5a72c0689915d45ae43188","abstract_canon_sha256":"f2cf228577e2803d020d532ece9e8b49a089df0169f8d71115cd01bd9a18cd9d"},"schema_version":"1.0"},"canonical_sha256":"869d306e9366151be14560f8dfde2d4c789c3829f4a01e7f46995af1d4efcfe5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:47.519954Z","signature_b64":"VCgmxF2T5LsKIjnXK23wRkFb0dRP+dRutalz75dSF2WSPltIEs+/IPAGTioMtegNXFo7Q9AmzAe5zic1kCGsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"869d306e9366151be14560f8dfde2d4c789c3829f4a01e7f46995af1d4efcfe5","last_reissued_at":"2026-05-18T02:32:47.519308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:47.519308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6712","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:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fxq6ihD9+vy6YMkXEqvoFq5SN8A6+WyYz9s8ayphqokdc+ayL4naSgvydPOcswbrs4RcgHt5vbcC/Be2Ys/oBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:02:54.899822Z"},"content_sha256":"bd42dfb1580efcaeff590437fed92525ffc754763c64c9988c828fd38505d595","schema_version":"1.0","event_id":"sha256:bd42dfb1580efcaeff590437fed92525ffc754763c64c9988c828fd38505d595"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Q2OTA3UTMYKRXYKFMD4N7XRNJR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The square root rank of the correlation polytope is exponential","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"cs.CC","authors_text":"Troy Lee, Zhaohui Wei","submitted_at":"2014-11-25T03:08:40Z","abstract_excerpt":"The square root rank of a nonnegative matrix $A$ is the minimum rank of a matrix $B$ such that $A=B \\circ B$, where $\\circ$ denotes entrywise product. We show that the square root rank of the slack matrix of the correlation polytope is exponential. Our main technique is a way to lower bound the rank of certain matrices under arbitrary sign changes of the entries using properties of the roots of polynomials in number fields. The square root rank is an upper bound on the positive semidefinite rank of a matrix, and corresponds the special case where all matrices in the factorization are rank-one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6712","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:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ieyg/DqKWEAbyTGtsqetSOmMubUZzfD1ic/43xFz8AsrkiJx9O10Ymmkz7ukbLUE+AFxLtmV76oBqQdMwqIzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:02:54.900352Z"},"content_sha256":"e2c94269f739130165800e142de21c55e2daf92bc6d260c509cfa6d0e7b5840b","schema_version":"1.0","event_id":"sha256:e2c94269f739130165800e142de21c55e2daf92bc6d260c509cfa6d0e7b5840b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2OTA3UTMYKRXYKFMD4N7XRNJR/bundle.json","state_url":"https://pith.science/pith/Q2OTA3UTMYKRXYKFMD4N7XRNJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2OTA3UTMYKRXYKFMD4N7XRNJR/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-09T22:02:54Z","links":{"resolver":"https://pith.science/pith/Q2OTA3UTMYKRXYKFMD4N7XRNJR","bundle":"https://pith.science/pith/Q2OTA3UTMYKRXYKFMD4N7XRNJR/bundle.json","state":"https://pith.science/pith/Q2OTA3UTMYKRXYKFMD4N7XRNJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2OTA3UTMYKRXYKFMD4N7XRNJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Q2OTA3UTMYKRXYKFMD4N7XRNJR","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":"f2cf228577e2803d020d532ece9e8b49a089df0169f8d71115cd01bd9a18cd9d","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-25T03:08:40Z","title_canon_sha256":"af173fd611040f6823f203de13725e5703653ebf0a5a72c0689915d45ae43188"},"schema_version":"1.0","source":{"id":"1411.6712","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6712","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6712v1","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6712","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"Q2OTA3UTMYKR","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q2OTA3UTMYKRXYKF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q2OTA3UT","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:e2c94269f739130165800e142de21c55e2daf92bc6d260c509cfa6d0e7b5840b","target":"graph","created_at":"2026-05-18T02:32: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":"The square root rank of a nonnegative matrix $A$ is the minimum rank of a matrix $B$ such that $A=B \\circ B$, where $\\circ$ denotes entrywise product. We show that the square root rank of the slack matrix of the correlation polytope is exponential. Our main technique is a way to lower bound the rank of certain matrices under arbitrary sign changes of the entries using properties of the roots of polynomials in number fields. The square root rank is an upper bound on the positive semidefinite rank of a matrix, and corresponds the special case where all matrices in the factorization are rank-one.","authors_text":"Troy Lee, Zhaohui Wei","cross_cats":["math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-25T03:08:40Z","title":"The square root rank of the correlation polytope is exponential"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6712","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:bd42dfb1580efcaeff590437fed92525ffc754763c64c9988c828fd38505d595","target":"record","created_at":"2026-05-18T02:32: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":"f2cf228577e2803d020d532ece9e8b49a089df0169f8d71115cd01bd9a18cd9d","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-25T03:08:40Z","title_canon_sha256":"af173fd611040f6823f203de13725e5703653ebf0a5a72c0689915d45ae43188"},"schema_version":"1.0","source":{"id":"1411.6712","kind":"arxiv","version":1}},"canonical_sha256":"869d306e9366151be14560f8dfde2d4c789c3829f4a01e7f46995af1d4efcfe5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"869d306e9366151be14560f8dfde2d4c789c3829f4a01e7f46995af1d4efcfe5","first_computed_at":"2026-05-18T02:32:47.519308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:47.519308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VCgmxF2T5LsKIjnXK23wRkFb0dRP+dRutalz75dSF2WSPltIEs+/IPAGTioMtegNXFo7Q9AmzAe5zic1kCGsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:47.519954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6712","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd42dfb1580efcaeff590437fed92525ffc754763c64c9988c828fd38505d595","sha256:e2c94269f739130165800e142de21c55e2daf92bc6d260c509cfa6d0e7b5840b"],"state_sha256":"d1dadc6d587fee187ee10ec26e4ff73be96d8b02c639091cd1bf3e16ffb30523"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pbb6HV2VcwiYhWyhlnYhK4IPqK5Z0+iYBBvoQv/YzRu0a3S0qIw0QInsK/ChlM2HJlf1FlSHd088uTRtdPPuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T22:02:54.905597Z","bundle_sha256":"1f9bdf0bddb8d29ca9557cbf82b0ebb1f5215406cf63a486554cba1d67695a8f"}}