{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5ILJQLAPZ6W7JFJNZKW55I6JYF","short_pith_number":"pith:5ILJQLAP","schema_version":"1.0","canonical_sha256":"ea16982c0fcfadf4952dcaaddea3c9c1680684e23464ca5b8c490b059198ee3a","source":{"kind":"arxiv","id":"1604.07062","version":1},"attestation_state":"computed","paper":{"title":"Extension Complexity of Independent Set Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Mika G\\\"o\\\"os, Rahul Jain, Thomas Watson","submitted_at":"2016-04-24T17:52:28Z","abstract_excerpt":"We exhibit an $n$-node graph whose independent set polytope requires extended formulations of size exponential in $\\Omega(n/\\log n)$. Previously, no explicit examples of $n$-dimensional $0/1$-polytopes were known with extension complexity larger than exponential in $\\Theta(\\sqrt{n})$. Our construction is inspired by a relatively little-known connection between extended formulations and (monotone) circuit depth."},"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":"1604.07062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-24T17:52:28Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"fb1d78477dc84a27c016971c2072626a228ad486a96706e4d01b2bb194153b25","abstract_canon_sha256":"6820fceae34f33ec7413ca957524be9c7ab1c68d04783a54d0d1e7285e3d80bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:23.156263Z","signature_b64":"QklRaAh+6oGF6CS2CAKLXyr8wAXfb4CBsMP0ZerdcgbMNCWQeupA13R9RdOORhKKEokwQt0s1ZUCnT2LBAU4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea16982c0fcfadf4952dcaaddea3c9c1680684e23464ca5b8c490b059198ee3a","last_reissued_at":"2026-05-18T01:16:23.155771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:23.155771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extension Complexity of Independent Set Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Mika G\\\"o\\\"os, Rahul Jain, Thomas Watson","submitted_at":"2016-04-24T17:52:28Z","abstract_excerpt":"We exhibit an $n$-node graph whose independent set polytope requires extended formulations of size exponential in $\\Omega(n/\\log n)$. Previously, no explicit examples of $n$-dimensional $0/1$-polytopes were known with extension complexity larger than exponential in $\\Theta(\\sqrt{n})$. Our construction is inspired by a relatively little-known connection between extended formulations and (monotone) circuit depth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07062","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.07062","created_at":"2026-05-18T01:16:23.155842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07062v1","created_at":"2026-05-18T01:16:23.155842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07062","created_at":"2026-05-18T01:16:23.155842+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ILJQLAPZ6W7","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ILJQLAPZ6W7JFJN","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ILJQLAP","created_at":"2026-05-18T12:30:01.593930+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/5ILJQLAPZ6W7JFJNZKW55I6JYF","json":"https://pith.science/pith/5ILJQLAPZ6W7JFJNZKW55I6JYF.json","graph_json":"https://pith.science/api/pith-number/5ILJQLAPZ6W7JFJNZKW55I6JYF/graph.json","events_json":"https://pith.science/api/pith-number/5ILJQLAPZ6W7JFJNZKW55I6JYF/events.json","paper":"https://pith.science/paper/5ILJQLAP"},"agent_actions":{"view_html":"https://pith.science/pith/5ILJQLAPZ6W7JFJNZKW55I6JYF","download_json":"https://pith.science/pith/5ILJQLAPZ6W7JFJNZKW55I6JYF.json","view_paper":"https://pith.science/paper/5ILJQLAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07062&json=true","fetch_graph":"https://pith.science/api/pith-number/5ILJQLAPZ6W7JFJNZKW55I6JYF/graph.json","fetch_events":"https://pith.science/api/pith-number/5ILJQLAPZ6W7JFJNZKW55I6JYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ILJQLAPZ6W7JFJNZKW55I6JYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ILJQLAPZ6W7JFJNZKW55I6JYF/action/storage_attestation","attest_author":"https://pith.science/pith/5ILJQLAPZ6W7JFJNZKW55I6JYF/action/author_attestation","sign_citation":"https://pith.science/pith/5ILJQLAPZ6W7JFJNZKW55I6JYF/action/citation_signature","submit_replication":"https://pith.science/pith/5ILJQLAPZ6W7JFJNZKW55I6JYF/action/replication_record"}},"created_at":"2026-05-18T01:16:23.155842+00:00","updated_at":"2026-05-18T01:16:23.155842+00:00"}