{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WQ5LQWJSRSMOXLFBULNUDNXYQX","short_pith_number":"pith:WQ5LQWJS","schema_version":"1.0","canonical_sha256":"b43ab859328c98ebaca1a2db41b6f885cbf4be13c0525b614743048ea2390077","source":{"kind":"arxiv","id":"1408.0807","version":5},"attestation_state":"computed","paper":{"title":"Polynomial size linear programs for problems in P","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe","submitted_at":"2014-08-04T20:12:55Z","abstract_excerpt":"A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\\ss} proved the striking result that the Edmonds' matching polytope has exponential extension complexity. Here for each $n=|V|$ we describe a perfect matching polytope that is different from Edmonds' polytope and define a weaker notion of extended formulation. We show that the new polytope has a weak extended formulation (WEF) $Q$ of polynomial size. For each graph $G$ with $n$ vert"},"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":"1408.0807","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-04T20:12:55Z","cross_cats_sorted":[],"title_canon_sha256":"688f724c6563bde4cf8b67e01b8bc465c8b68375b0c0220205f97757411758a0","abstract_canon_sha256":"66554eedeb9f4e3e315f69e7b469b380d24e599aa51505dd705e27bf50e89e79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:36.025461Z","signature_b64":"V65hTJdLKiCMgMG+MKoxaUomU14uOsuGO8aXh6cvqSwhbeeASMqXuWlhrRdR0sR1LxFxwlarWF2nJcxaJoO7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b43ab859328c98ebaca1a2db41b6f885cbf4be13c0525b614743048ea2390077","last_reissued_at":"2026-05-18T00:17:36.024767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:36.024767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial size linear programs for problems in P","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe","submitted_at":"2014-08-04T20:12:55Z","abstract_excerpt":"A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\\ss} proved the striking result that the Edmonds' matching polytope has exponential extension complexity. Here for each $n=|V|$ we describe a perfect matching polytope that is different from Edmonds' polytope and define a weaker notion of extended formulation. We show that the new polytope has a weak extended formulation (WEF) $Q$ of polynomial size. For each graph $G$ with $n$ vert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0807","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.0807","created_at":"2026-05-18T00:17:36.024868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.0807v5","created_at":"2026-05-18T00:17:36.024868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0807","created_at":"2026-05-18T00:17:36.024868+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQ5LQWJSRSMO","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQ5LQWJSRSMOXLFB","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQ5LQWJS","created_at":"2026-05-18T12:28:54.890064+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/WQ5LQWJSRSMOXLFBULNUDNXYQX","json":"https://pith.science/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX.json","graph_json":"https://pith.science/api/pith-number/WQ5LQWJSRSMOXLFBULNUDNXYQX/graph.json","events_json":"https://pith.science/api/pith-number/WQ5LQWJSRSMOXLFBULNUDNXYQX/events.json","paper":"https://pith.science/paper/WQ5LQWJS"},"agent_actions":{"view_html":"https://pith.science/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX","download_json":"https://pith.science/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX.json","view_paper":"https://pith.science/paper/WQ5LQWJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.0807&json=true","fetch_graph":"https://pith.science/api/pith-number/WQ5LQWJSRSMOXLFBULNUDNXYQX/graph.json","fetch_events":"https://pith.science/api/pith-number/WQ5LQWJSRSMOXLFBULNUDNXYQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX/action/storage_attestation","attest_author":"https://pith.science/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX/action/author_attestation","sign_citation":"https://pith.science/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX/action/citation_signature","submit_replication":"https://pith.science/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX/action/replication_record"}},"created_at":"2026-05-18T00:17:36.024868+00:00","updated_at":"2026-05-18T00:17:36.024868+00:00"}