{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:FTYW7AP54FIVVBXWX57VHHQG4V","short_pith_number":"pith:FTYW7AP5","canonical_record":{"source":{"id":"2211.09106","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-16T18:47:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"556e59ed02730b61735c07183b8313da11ceb98b35a344fe66eacb8957c6f1c4","abstract_canon_sha256":"12f2293d7598b1c615fe6ac26622c99daa6699bd1cdce717c70637bb06532401"},"schema_version":"1.0"},"canonical_sha256":"2cf16f81fde1515a86f6bf7f539e06e55035a11cca9f7c01f73b7207c039c1d1","source":{"kind":"arxiv","id":"2211.09106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.09106","created_at":"2026-07-05T05:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"2211.09106v1","created_at":"2026-07-05T05:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.09106","created_at":"2026-07-05T05:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"FTYW7AP54FIV","created_at":"2026-07-05T05:16:47Z"},{"alias_kind":"pith_short_16","alias_value":"FTYW7AP54FIVVBXW","created_at":"2026-07-05T05:16:47Z"},{"alias_kind":"pith_short_8","alias_value":"FTYW7AP5","created_at":"2026-07-05T05:16:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:FTYW7AP54FIVVBXWX57VHHQG4V","target":"record","payload":{"canonical_record":{"source":{"id":"2211.09106","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-16T18:47:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"556e59ed02730b61735c07183b8313da11ceb98b35a344fe66eacb8957c6f1c4","abstract_canon_sha256":"12f2293d7598b1c615fe6ac26622c99daa6699bd1cdce717c70637bb06532401"},"schema_version":"1.0"},"canonical_sha256":"2cf16f81fde1515a86f6bf7f539e06e55035a11cca9f7c01f73b7207c039c1d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:16:47.787734Z","signature_b64":"sii40VxPh1MChpX+7zPnK66l2VvgAAjk70eLTIejCdXI2rZcjKGL73yZ2W3UBeUqVEZm14nqlmB7NmDxdA5GDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cf16f81fde1515a86f6bf7f539e06e55035a11cca9f7c01f73b7207c039c1d1","last_reissued_at":"2026-07-05T05:16:47.787393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:16:47.787393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.09106","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-07-05T05:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQ+oSqZWWjo352ibUZvOdNK1v9LEr76OyCIVWB2ThM9lkpT2/imzn71aF2BMcMCtIRXJMR45Wuv0oWtkkLRdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T20:43:06.873601Z"},"content_sha256":"d6007282b3f1ac8c3112150bed2d07998e5fffc6519f152c41e5bad7a96f36fd","schema_version":"1.0","event_id":"sha256:d6007282b3f1ac8c3112150bed2d07998e5fffc6519f152c41e5bad7a96f36fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:FTYW7AP54FIVVBXWX57VHHQG4V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Exact Bipartite Matching Polytope Has Exponential Extension Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Ola Svensson, Weiqiang Yuan, Xinrui Jia","submitted_at":"2022-11-16T18:47:39Z","abstract_excerpt":"Given a graph with edges colored red or blue and an integer $k$, the exact perfect matching problem asks if there exists a perfect matching with exactly $k$ red edges. There exists a randomized polylogarithmic-time parallel algorithm to solve this problem, dating back to the eighties, but no deterministic polynomial-time algorithm is known, even for bipartite graphs. In this paper we show that there is no sub-exponential sized linear program that can describe the convex hull of exact matchings in bipartite graphs. In fact, we prove something stronger, that there is no sub-exponential sized lin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.09106","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.09106/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HjxcDupF7rwaNqp+zhKVrRSNHTV7t0xp/zFmCGDKleeMMMtOHizTexUgkM/ePiJh8NzAqTn8KM9x74/yvg+yBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T20:43:06.874109Z"},"content_sha256":"65207a6f09ed5b6593c72da32b2b2ff0e0dbcf7ab0c229167dca7c7a30e1af6c","schema_version":"1.0","event_id":"sha256:65207a6f09ed5b6593c72da32b2b2ff0e0dbcf7ab0c229167dca7c7a30e1af6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTYW7AP54FIVVBXWX57VHHQG4V/bundle.json","state_url":"https://pith.science/pith/FTYW7AP54FIVVBXWX57VHHQG4V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTYW7AP54FIVVBXWX57VHHQG4V/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-20T20:43:06Z","links":{"resolver":"https://pith.science/pith/FTYW7AP54FIVVBXWX57VHHQG4V","bundle":"https://pith.science/pith/FTYW7AP54FIVVBXWX57VHHQG4V/bundle.json","state":"https://pith.science/pith/FTYW7AP54FIVVBXWX57VHHQG4V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTYW7AP54FIVVBXWX57VHHQG4V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:FTYW7AP54FIVVBXWX57VHHQG4V","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":"12f2293d7598b1c615fe6ac26622c99daa6699bd1cdce717c70637bb06532401","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-16T18:47:39Z","title_canon_sha256":"556e59ed02730b61735c07183b8313da11ceb98b35a344fe66eacb8957c6f1c4"},"schema_version":"1.0","source":{"id":"2211.09106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.09106","created_at":"2026-07-05T05:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"2211.09106v1","created_at":"2026-07-05T05:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.09106","created_at":"2026-07-05T05:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"FTYW7AP54FIV","created_at":"2026-07-05T05:16:47Z"},{"alias_kind":"pith_short_16","alias_value":"FTYW7AP54FIVVBXW","created_at":"2026-07-05T05:16:47Z"},{"alias_kind":"pith_short_8","alias_value":"FTYW7AP5","created_at":"2026-07-05T05:16:47Z"}],"graph_snapshots":[{"event_id":"sha256:65207a6f09ed5b6593c72da32b2b2ff0e0dbcf7ab0c229167dca7c7a30e1af6c","target":"graph","created_at":"2026-07-05T05:16: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.09106/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph with edges colored red or blue and an integer $k$, the exact perfect matching problem asks if there exists a perfect matching with exactly $k$ red edges. There exists a randomized polylogarithmic-time parallel algorithm to solve this problem, dating back to the eighties, but no deterministic polynomial-time algorithm is known, even for bipartite graphs. In this paper we show that there is no sub-exponential sized linear program that can describe the convex hull of exact matchings in bipartite graphs. In fact, we prove something stronger, that there is no sub-exponential sized lin","authors_text":"Ola Svensson, Weiqiang Yuan, Xinrui Jia","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-16T18:47:39Z","title":"The Exact Bipartite Matching Polytope Has Exponential Extension Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.09106","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:d6007282b3f1ac8c3112150bed2d07998e5fffc6519f152c41e5bad7a96f36fd","target":"record","created_at":"2026-07-05T05:16: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":"12f2293d7598b1c615fe6ac26622c99daa6699bd1cdce717c70637bb06532401","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-16T18:47:39Z","title_canon_sha256":"556e59ed02730b61735c07183b8313da11ceb98b35a344fe66eacb8957c6f1c4"},"schema_version":"1.0","source":{"id":"2211.09106","kind":"arxiv","version":1}},"canonical_sha256":"2cf16f81fde1515a86f6bf7f539e06e55035a11cca9f7c01f73b7207c039c1d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cf16f81fde1515a86f6bf7f539e06e55035a11cca9f7c01f73b7207c039c1d1","first_computed_at":"2026-07-05T05:16:47.787393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:16:47.787393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sii40VxPh1MChpX+7zPnK66l2VvgAAjk70eLTIejCdXI2rZcjKGL73yZ2W3UBeUqVEZm14nqlmB7NmDxdA5GDg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:16:47.787734Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.09106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6007282b3f1ac8c3112150bed2d07998e5fffc6519f152c41e5bad7a96f36fd","sha256:65207a6f09ed5b6593c72da32b2b2ff0e0dbcf7ab0c229167dca7c7a30e1af6c"],"state_sha256":"cfd6db8fc6390821d482dcbdc732ed083e422b4c22911db2b278c0dd8a5694df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEMK8xuSX6bFG+wnlFKvJNVdYfpj5ulB/0KJT3iNTIC7jMvsOICbHvQsg1/HBZvIQF4z/GV3Zsgkj9q/3HNmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T20:43:06.880509Z","bundle_sha256":"88bd22708cfe33f0da8de11b1dc0ecae74c1c26d76bedc49f1bb5441092c6fdf"}}