{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4SL76BNJNFS6JTVCAAKJTGBOO2","short_pith_number":"pith:4SL76BNJ","schema_version":"1.0","canonical_sha256":"e497ff05a96965e4cea2001499982e768a6197df6c5d104f3dc2269724b7c65c","source":{"kind":"arxiv","id":"1711.10145","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds for Approximating the Matching Polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Makrand Sinha","submitted_at":"2017-11-28T06:41:18Z","abstract_excerpt":"We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\\varepsilon)$ for any $\\frac2n \\le \\varepsilon \\le 1$ must have at least $\\binom{n}{{\\alpha}/{\\varepsilon}}$ defining inequalities where $0<\\alpha<1$ is an absolute constant. This is tight as exhibited by the $(1+\\varepsilon)$ approximating linear program obtained by dropping the odd set constraints of size larger than $({1+\\varepsilon})/{\\varepsilon}$ from the description of the matching polytope. Previously, a tight lower bound of $2^{\\Omega(n)}$ was only known for $\\vare"},"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":"1711.10145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-28T06:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"3c714641c750fae29ba7bb6089c130fbc348b4b19e85d03f9a50d1eeed37ac5e","abstract_canon_sha256":"9d08e582de9c8a929d61d0cfab1028292bcc8b09e894ada7847da3db777d5c05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:23.231644Z","signature_b64":"hX8kq0oIYFIcMNuT5j5MOsGklQ16T/dyhrDiVzhVr8HfVMGhn+lkF3FH8ZnLsX/3YSV/xJPV9dy+opyKUSctBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e497ff05a96965e4cea2001499982e768a6197df6c5d104f3dc2269724b7c65c","last_reissued_at":"2026-05-18T00:29:23.230701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:23.230701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Approximating the Matching Polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Makrand Sinha","submitted_at":"2017-11-28T06:41:18Z","abstract_excerpt":"We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\\varepsilon)$ for any $\\frac2n \\le \\varepsilon \\le 1$ must have at least $\\binom{n}{{\\alpha}/{\\varepsilon}}$ defining inequalities where $0<\\alpha<1$ is an absolute constant. This is tight as exhibited by the $(1+\\varepsilon)$ approximating linear program obtained by dropping the odd set constraints of size larger than $({1+\\varepsilon})/{\\varepsilon}$ from the description of the matching polytope. Previously, a tight lower bound of $2^{\\Omega(n)}$ was only known for $\\vare"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10145","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":"1711.10145","created_at":"2026-05-18T00:29:23.230867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10145v1","created_at":"2026-05-18T00:29:23.230867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10145","created_at":"2026-05-18T00:29:23.230867+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SL76BNJNFS6","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SL76BNJNFS6JTVC","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SL76BNJ","created_at":"2026-05-18T12:31:00.734936+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/4SL76BNJNFS6JTVCAAKJTGBOO2","json":"https://pith.science/pith/4SL76BNJNFS6JTVCAAKJTGBOO2.json","graph_json":"https://pith.science/api/pith-number/4SL76BNJNFS6JTVCAAKJTGBOO2/graph.json","events_json":"https://pith.science/api/pith-number/4SL76BNJNFS6JTVCAAKJTGBOO2/events.json","paper":"https://pith.science/paper/4SL76BNJ"},"agent_actions":{"view_html":"https://pith.science/pith/4SL76BNJNFS6JTVCAAKJTGBOO2","download_json":"https://pith.science/pith/4SL76BNJNFS6JTVCAAKJTGBOO2.json","view_paper":"https://pith.science/paper/4SL76BNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10145&json=true","fetch_graph":"https://pith.science/api/pith-number/4SL76BNJNFS6JTVCAAKJTGBOO2/graph.json","fetch_events":"https://pith.science/api/pith-number/4SL76BNJNFS6JTVCAAKJTGBOO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SL76BNJNFS6JTVCAAKJTGBOO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SL76BNJNFS6JTVCAAKJTGBOO2/action/storage_attestation","attest_author":"https://pith.science/pith/4SL76BNJNFS6JTVCAAKJTGBOO2/action/author_attestation","sign_citation":"https://pith.science/pith/4SL76BNJNFS6JTVCAAKJTGBOO2/action/citation_signature","submit_replication":"https://pith.science/pith/4SL76BNJNFS6JTVCAAKJTGBOO2/action/replication_record"}},"created_at":"2026-05-18T00:29:23.230867+00:00","updated_at":"2026-05-18T00:29:23.230867+00:00"}