{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NMH2KNI5HZN4HV6HZCJTDI4J2R","short_pith_number":"pith:NMH2KNI5","schema_version":"1.0","canonical_sha256":"6b0fa5351d3e5bc3d7c7c89331a389d468d9d20dd4411d1d73aed3cfc2ecd9bd","source":{"kind":"arxiv","id":"1806.00541","version":2},"attestation_state":"computed","paper":{"title":"Extension Complexity of the Correlation Polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Johanna Seif, Marco Macchia, Pierre Aboulker, Samuel Fiorini, Tony Huynh","submitted_at":"2018-06-01T20:59:09Z","abstract_excerpt":"We prove that for every $n$-vertex graph $G$, the extension complexity of the correlation polytope of $G$ is $2^{O(\\mathrm{tw}(G) + \\log n)}$, where $\\mathrm{tw}(G)$ is the treewidth of $G$. Our main result is that this bound is tight for graphs contained in minor-closed classes."},"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":"1806.00541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-01T20:59:09Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"aa00ceba7b66f94d8915cf57b58eee5fa10f973ae73a0b3bb73bacd24ec5885b","abstract_canon_sha256":"ed3892595ffab82b28d78fd25e292e291b8da28661677d2fd622030ad2ccabcc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:53.203661Z","signature_b64":"RSoC4ggGZQQLg7O+JQLjTE+0v1GIu7ZPTImNONoymxRbFLdBNdl8/vKn4P03h75GuoSk7opYJq4MlmneHxx7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b0fa5351d3e5bc3d7c7c89331a389d468d9d20dd4411d1d73aed3cfc2ecd9bd","last_reissued_at":"2026-05-18T00:02:53.203096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:53.203096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extension Complexity of the Correlation Polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Johanna Seif, Marco Macchia, Pierre Aboulker, Samuel Fiorini, Tony Huynh","submitted_at":"2018-06-01T20:59:09Z","abstract_excerpt":"We prove that for every $n$-vertex graph $G$, the extension complexity of the correlation polytope of $G$ is $2^{O(\\mathrm{tw}(G) + \\log n)}$, where $\\mathrm{tw}(G)$ is the treewidth of $G$. Our main result is that this bound is tight for graphs contained in minor-closed classes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00541","kind":"arxiv","version":2},"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":"1806.00541","created_at":"2026-05-18T00:02:53.203179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00541v2","created_at":"2026-05-18T00:02:53.203179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00541","created_at":"2026-05-18T00:02:53.203179+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMH2KNI5HZN4","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMH2KNI5HZN4HV6H","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMH2KNI5","created_at":"2026-05-18T12:32:40.477152+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/NMH2KNI5HZN4HV6HZCJTDI4J2R","json":"https://pith.science/pith/NMH2KNI5HZN4HV6HZCJTDI4J2R.json","graph_json":"https://pith.science/api/pith-number/NMH2KNI5HZN4HV6HZCJTDI4J2R/graph.json","events_json":"https://pith.science/api/pith-number/NMH2KNI5HZN4HV6HZCJTDI4J2R/events.json","paper":"https://pith.science/paper/NMH2KNI5"},"agent_actions":{"view_html":"https://pith.science/pith/NMH2KNI5HZN4HV6HZCJTDI4J2R","download_json":"https://pith.science/pith/NMH2KNI5HZN4HV6HZCJTDI4J2R.json","view_paper":"https://pith.science/paper/NMH2KNI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00541&json=true","fetch_graph":"https://pith.science/api/pith-number/NMH2KNI5HZN4HV6HZCJTDI4J2R/graph.json","fetch_events":"https://pith.science/api/pith-number/NMH2KNI5HZN4HV6HZCJTDI4J2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMH2KNI5HZN4HV6HZCJTDI4J2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMH2KNI5HZN4HV6HZCJTDI4J2R/action/storage_attestation","attest_author":"https://pith.science/pith/NMH2KNI5HZN4HV6HZCJTDI4J2R/action/author_attestation","sign_citation":"https://pith.science/pith/NMH2KNI5HZN4HV6HZCJTDI4J2R/action/citation_signature","submit_replication":"https://pith.science/pith/NMH2KNI5HZN4HV6HZCJTDI4J2R/action/replication_record"}},"created_at":"2026-05-18T00:02:53.203179+00:00","updated_at":"2026-05-18T00:02:53.203179+00:00"}