{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FTYW7AP54FIVVBXWX57VHHQG4V","short_pith_number":"pith:FTYW7AP5","schema_version":"1.0","canonical_sha256":"2cf16f81fde1515a86f6bf7f539e06e55035a11cca9f7c01f73b7207c039c1d1","source":{"kind":"arxiv","id":"2211.09106","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2211.09106","created_at":"2026-07-05T05:16:47.787449+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.09106v1","created_at":"2026-07-05T05:16:47.787449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.09106","created_at":"2026-07-05T05:16:47.787449+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTYW7AP54FIV","created_at":"2026-07-05T05:16:47.787449+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTYW7AP54FIVVBXW","created_at":"2026-07-05T05:16:47.787449+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTYW7AP5","created_at":"2026-07-05T05:16:47.787449+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/FTYW7AP54FIVVBXWX57VHHQG4V","json":"https://pith.science/pith/FTYW7AP54FIVVBXWX57VHHQG4V.json","graph_json":"https://pith.science/api/pith-number/FTYW7AP54FIVVBXWX57VHHQG4V/graph.json","events_json":"https://pith.science/api/pith-number/FTYW7AP54FIVVBXWX57VHHQG4V/events.json","paper":"https://pith.science/paper/FTYW7AP5"},"agent_actions":{"view_html":"https://pith.science/pith/FTYW7AP54FIVVBXWX57VHHQG4V","download_json":"https://pith.science/pith/FTYW7AP54FIVVBXWX57VHHQG4V.json","view_paper":"https://pith.science/paper/FTYW7AP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.09106&json=true","fetch_graph":"https://pith.science/api/pith-number/FTYW7AP54FIVVBXWX57VHHQG4V/graph.json","fetch_events":"https://pith.science/api/pith-number/FTYW7AP54FIVVBXWX57VHHQG4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTYW7AP54FIVVBXWX57VHHQG4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTYW7AP54FIVVBXWX57VHHQG4V/action/storage_attestation","attest_author":"https://pith.science/pith/FTYW7AP54FIVVBXWX57VHHQG4V/action/author_attestation","sign_citation":"https://pith.science/pith/FTYW7AP54FIVVBXWX57VHHQG4V/action/citation_signature","submit_replication":"https://pith.science/pith/FTYW7AP54FIVVBXWX57VHHQG4V/action/replication_record"}},"created_at":"2026-07-05T05:16:47.787449+00:00","updated_at":"2026-07-05T05:16:47.787449+00:00"}