{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RNA3OE4JUKGTT6WTGPY55N5YNE","short_pith_number":"pith:RNA3OE4J","schema_version":"1.0","canonical_sha256":"8b41b71389a28d39fad333f1deb7b869168a96e8f3627f0882ee5384f741faf5","source":{"kind":"arxiv","id":"1307.3543","version":6},"attestation_state":"computed","paper":{"title":"A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Stefan Weltge, Volker Kaibel","submitted_at":"2013-07-12T19:23:30Z","abstract_excerpt":"We establish that the extension complexity of the nXn correlation polytope is at least 1.5^n by a short proof that is self-contained except for using the fact that every face of a polyhedron is the intersection of all facets it is contained in. The main innovative aspect of the proof is a simple combinatorial argument showing that the rectangle covering number of the unique-disjointness matrix is at least 1.5^n, and thus the nondeterministic communication complexity of the unique-disjointness predicate is at least .58n. We thereby slightly improve on the previously best known lower bounds 1.24"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1307.3543","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-12T19:23:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"40bba10db43c3f345eae459b04cd3416768fa84932c080788801b87e57195257","abstract_canon_sha256":"721d4b19c9569210a0f6716002ef3b183bdb74eb577cd9777dba16a66142cfba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:02.186882Z","signature_b64":"DNMlXJp5gCa6cXYByVS2x3S2owcRSdBXh9Z5uIXeL0highPURz/Q3agSWfYOi0q0t36UmUMZ7bdH9Wbo42xkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b41b71389a28d39fad333f1deb7b869168a96e8f3627f0882ee5384f741faf5","last_reissued_at":"2026-05-18T01:20:02.186202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:02.186202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Stefan Weltge, Volker Kaibel","submitted_at":"2013-07-12T19:23:30Z","abstract_excerpt":"We establish that the extension complexity of the nXn correlation polytope is at least 1.5^n by a short proof that is self-contained except for using the fact that every face of a polyhedron is the intersection of all facets it is contained in. The main innovative aspect of the proof is a simple combinatorial argument showing that the rectangle covering number of the unique-disjointness matrix is at least 1.5^n, and thus the nondeterministic communication complexity of the unique-disjointness predicate is at least .58n. We thereby slightly improve on the previously best known lower bounds 1.24"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3543","kind":"arxiv","version":6},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.3543","created_at":"2026-05-18T01:20:02.186301+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3543v6","created_at":"2026-05-18T01:20:02.186301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3543","created_at":"2026-05-18T01:20:02.186301+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNA3OE4JUKGT","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNA3OE4JUKGTT6WT","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNA3OE4J","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RNA3OE4JUKGTT6WTGPY55N5YNE","json":"https://pith.science/pith/RNA3OE4JUKGTT6WTGPY55N5YNE.json","graph_json":"https://pith.science/api/pith-number/RNA3OE4JUKGTT6WTGPY55N5YNE/graph.json","events_json":"https://pith.science/api/pith-number/RNA3OE4JUKGTT6WTGPY55N5YNE/events.json","paper":"https://pith.science/paper/RNA3OE4J"},"agent_actions":{"view_html":"https://pith.science/pith/RNA3OE4JUKGTT6WTGPY55N5YNE","download_json":"https://pith.science/pith/RNA3OE4JUKGTT6WTGPY55N5YNE.json","view_paper":"https://pith.science/paper/RNA3OE4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3543&json=true","fetch_graph":"https://pith.science/api/pith-number/RNA3OE4JUKGTT6WTGPY55N5YNE/graph.json","fetch_events":"https://pith.science/api/pith-number/RNA3OE4JUKGTT6WTGPY55N5YNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNA3OE4JUKGTT6WTGPY55N5YNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNA3OE4JUKGTT6WTGPY55N5YNE/action/storage_attestation","attest_author":"https://pith.science/pith/RNA3OE4JUKGTT6WTGPY55N5YNE/action/author_attestation","sign_citation":"https://pith.science/pith/RNA3OE4JUKGTT6WTGPY55N5YNE/action/citation_signature","submit_replication":"https://pith.science/pith/RNA3OE4JUKGTT6WTGPY55N5YNE/action/replication_record"}},"created_at":"2026-05-18T01:20:02.186301+00:00","updated_at":"2026-05-18T01:20:02.186301+00:00"}