{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ROARYSK6WGJD7GTYKIS4CCOT5F","short_pith_number":"pith:ROARYSK6","canonical_record":{"source":{"id":"1111.0837","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-03T13:47:22Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"b6e74e762e590245b272c4bafea72fec482df39ebb914fc20bf0de2f9e5b8598","abstract_canon_sha256":"a77498e29a0272a5aa52a1556a4b2b4131bafd6ae847ef3a1cdc701e32619c34"},"schema_version":"1.0"},"canonical_sha256":"8b811c495eb1923f9a785225c109d3e96fcf443ac4f41f321c466299a4a2ac95","source":{"kind":"arxiv","id":"1111.0837","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0837","created_at":"2026-05-18T02:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0837v5","created_at":"2026-05-18T02:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0837","created_at":"2026-05-18T02:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"ROARYSK6WGJD","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"ROARYSK6WGJD7GTY","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"ROARYSK6","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ROARYSK6WGJD7GTYKIS4CCOT5F","target":"record","payload":{"canonical_record":{"source":{"id":"1111.0837","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-03T13:47:22Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"b6e74e762e590245b272c4bafea72fec482df39ebb914fc20bf0de2f9e5b8598","abstract_canon_sha256":"a77498e29a0272a5aa52a1556a4b2b4131bafd6ae847ef3a1cdc701e32619c34"},"schema_version":"1.0"},"canonical_sha256":"8b811c495eb1923f9a785225c109d3e96fcf443ac4f41f321c466299a4a2ac95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:59.085550Z","signature_b64":"g3LSwbaC8BPg7X4ZUmGaUyY8NGOTQsKo9pFfZjxn4ZEZlckxfkpSvGdl2r+m+vW8CblT7C7WwS7c6vt6rWiBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b811c495eb1923f9a785225c109d3e96fcf443ac4f41f321c466299a4a2ac95","last_reissued_at":"2026-05-18T02:23:59.084908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:59.084908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.0837","source_version":5,"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:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQ6jELesUmOI6zI7BYTFTZzGBH8YW9tWsR58wDkQovxulHJbL71pCY0weIl1DO79aSXG1mVnNJ8XTMHWtamBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:33:52.766962Z"},"content_sha256":"59cb89a53f0cf3a75b3d0b8e77d4534a8f294656922dc5419ec316bd04e10dfc","schema_version":"1.0","event_id":"sha256:59cb89a53f0cf3a75b3d0b8e77d4534a8f294656922dc5419ec316bd04e10dfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ROARYSK6WGJD7GTYKIS4CCOT5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponential Lower Bounds for Polytopes in Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"math.CO","authors_text":"Hans Raj Tiwary, Ronald de Wolf, Samuel Fiorini, Sebastian Pokutta, Serge Massar","submitted_at":"2011-11-03T13:47:22Z","abstract_excerpt":"We solve a 20-year old problem posed by Yannakakis and prove that there exists no polynomial-size linear program (LP) whose associated polytope projects to the traveling salesman polytope, even if the LP is not required to be symmetric. Moreover, we prove that this holds also for the cut polytope and the stable set polytope. These results were discovered through a new connection that we make between one-way quantum communication protocols and semidefinite programming reformulations of LPs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0837","kind":"arxiv","version":5},"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:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aAcsWH2mDv3a497xL+AnXgEjhH0Vebz5cF4HIyJr302sfoSsyZ9BvoF2KpdUsO65btlqd8eoC0fNo82XQ7pBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:33:52.767771Z"},"content_sha256":"772bdebf7eb4de1d6440fa38bb7ec53029bf1f677e4d3be5a1b0ed57f27efe6d","schema_version":"1.0","event_id":"sha256:772bdebf7eb4de1d6440fa38bb7ec53029bf1f677e4d3be5a1b0ed57f27efe6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROARYSK6WGJD7GTYKIS4CCOT5F/bundle.json","state_url":"https://pith.science/pith/ROARYSK6WGJD7GTYKIS4CCOT5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROARYSK6WGJD7GTYKIS4CCOT5F/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-05-23T23:33:52Z","links":{"resolver":"https://pith.science/pith/ROARYSK6WGJD7GTYKIS4CCOT5F","bundle":"https://pith.science/pith/ROARYSK6WGJD7GTYKIS4CCOT5F/bundle.json","state":"https://pith.science/pith/ROARYSK6WGJD7GTYKIS4CCOT5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROARYSK6WGJD7GTYKIS4CCOT5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ROARYSK6WGJD7GTYKIS4CCOT5F","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":"a77498e29a0272a5aa52a1556a4b2b4131bafd6ae847ef3a1cdc701e32619c34","cross_cats_sorted":["cs.CC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-03T13:47:22Z","title_canon_sha256":"b6e74e762e590245b272c4bafea72fec482df39ebb914fc20bf0de2f9e5b8598"},"schema_version":"1.0","source":{"id":"1111.0837","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0837","created_at":"2026-05-18T02:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0837v5","created_at":"2026-05-18T02:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0837","created_at":"2026-05-18T02:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"ROARYSK6WGJD","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"ROARYSK6WGJD7GTY","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"ROARYSK6","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:772bdebf7eb4de1d6440fa38bb7ec53029bf1f677e4d3be5a1b0ed57f27efe6d","target":"graph","created_at":"2026-05-18T02:23:59Z","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":"We solve a 20-year old problem posed by Yannakakis and prove that there exists no polynomial-size linear program (LP) whose associated polytope projects to the traveling salesman polytope, even if the LP is not required to be symmetric. Moreover, we prove that this holds also for the cut polytope and the stable set polytope. These results were discovered through a new connection that we make between one-way quantum communication protocols and semidefinite programming reformulations of LPs.","authors_text":"Hans Raj Tiwary, Ronald de Wolf, Samuel Fiorini, Sebastian Pokutta, Serge Massar","cross_cats":["cs.CC","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-03T13:47:22Z","title":"Exponential Lower Bounds for Polytopes in Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0837","kind":"arxiv","version":5},"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:59cb89a53f0cf3a75b3d0b8e77d4534a8f294656922dc5419ec316bd04e10dfc","target":"record","created_at":"2026-05-18T02:23:59Z","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":"a77498e29a0272a5aa52a1556a4b2b4131bafd6ae847ef3a1cdc701e32619c34","cross_cats_sorted":["cs.CC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-03T13:47:22Z","title_canon_sha256":"b6e74e762e590245b272c4bafea72fec482df39ebb914fc20bf0de2f9e5b8598"},"schema_version":"1.0","source":{"id":"1111.0837","kind":"arxiv","version":5}},"canonical_sha256":"8b811c495eb1923f9a785225c109d3e96fcf443ac4f41f321c466299a4a2ac95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b811c495eb1923f9a785225c109d3e96fcf443ac4f41f321c466299a4a2ac95","first_computed_at":"2026-05-18T02:23:59.084908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:59.084908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g3LSwbaC8BPg7X4ZUmGaUyY8NGOTQsKo9pFfZjxn4ZEZlckxfkpSvGdl2r+m+vW8CblT7C7WwS7c6vt6rWiBBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:59.085550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0837","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59cb89a53f0cf3a75b3d0b8e77d4534a8f294656922dc5419ec316bd04e10dfc","sha256:772bdebf7eb4de1d6440fa38bb7ec53029bf1f677e4d3be5a1b0ed57f27efe6d"],"state_sha256":"36f573c12d4dbbf24f56520415c161ca46a0b22064d4078572ae0095e25cfb3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYClldorbKnhrvW2nFIiiNHesmy+fFqbmjnVuJkCvCvhpA58XBRdvW7/HBVMiTIryOBz3UJUmt/s1BFsJ4A0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T23:33:52.771123Z","bundle_sha256":"40ba12d036223c485d48005ca6beb223047c20d42512c7f53cbd12b78ed771d0"}}