{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4SL76BNJNFS6JTVCAAKJTGBOO2","short_pith_number":"pith:4SL76BNJ","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"},"canonical_sha256":"e497ff05a96965e4cea2001499982e768a6197df6c5d104f3dc2269724b7c65c","source":{"kind":"arxiv","id":"1711.10145","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10145","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10145v1","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10145","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"4SL76BNJNFS6","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4SL76BNJNFS6JTVC","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4SL76BNJ","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4SL76BNJNFS6JTVCAAKJTGBOO2","target":"record","payload":{"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"},"canonical_sha256":"e497ff05a96965e4cea2001499982e768a6197df6c5d104f3dc2269724b7c65c","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"},"source_kind":"arxiv","source_id":"1711.10145","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-05-18T00:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vm4tsJIcAj8Vvuo8l5O6EJ6cJRqWidojvcrJeli/+FV53M6KLbrtwZ3ed520D+H/u2AQyFMmReEOcVB4cckPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:13:43.338153Z"},"content_sha256":"24a1daf7ee051e6f97b7c73c389d14c56d93fdec0a884e5a6429592ef330edea","schema_version":"1.0","event_id":"sha256:24a1daf7ee051e6f97b7c73c389d14c56d93fdec0a884e5a6429592ef330edea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4SL76BNJNFS6JTVCAAKJTGBOO2","target":"graph","payload":{"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"},"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-18T00:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xfz1/6JcfaK6yDUpt9xzyiGHdl4FwTdgKTRE+HSxduKmOakLfyXT0MRrX/XRTVMRyzvA8o/auVyGaNnWZJDJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:13:43.338513Z"},"content_sha256":"01709228788558e67a531cb3df57e4201977bd21e991ed5f06a9ae12e5e27e9c","schema_version":"1.0","event_id":"sha256:01709228788558e67a531cb3df57e4201977bd21e991ed5f06a9ae12e5e27e9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SL76BNJNFS6JTVCAAKJTGBOO2/bundle.json","state_url":"https://pith.science/pith/4SL76BNJNFS6JTVCAAKJTGBOO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SL76BNJNFS6JTVCAAKJTGBOO2/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-06-23T18:13:43Z","links":{"resolver":"https://pith.science/pith/4SL76BNJNFS6JTVCAAKJTGBOO2","bundle":"https://pith.science/pith/4SL76BNJNFS6JTVCAAKJTGBOO2/bundle.json","state":"https://pith.science/pith/4SL76BNJNFS6JTVCAAKJTGBOO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SL76BNJNFS6JTVCAAKJTGBOO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4SL76BNJNFS6JTVCAAKJTGBOO2","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":"9d08e582de9c8a929d61d0cfab1028292bcc8b09e894ada7847da3db777d5c05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-28T06:41:18Z","title_canon_sha256":"3c714641c750fae29ba7bb6089c130fbc348b4b19e85d03f9a50d1eeed37ac5e"},"schema_version":"1.0","source":{"id":"1711.10145","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10145","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10145v1","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10145","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"4SL76BNJNFS6","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4SL76BNJNFS6JTVC","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4SL76BNJ","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:01709228788558e67a531cb3df57e4201977bd21e991ed5f06a9ae12e5e27e9c","target":"graph","created_at":"2026-05-18T00:29:23Z","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 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","authors_text":"Makrand Sinha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-28T06:41:18Z","title":"Lower Bounds for Approximating the Matching Polytope"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10145","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:24a1daf7ee051e6f97b7c73c389d14c56d93fdec0a884e5a6429592ef330edea","target":"record","created_at":"2026-05-18T00:29:23Z","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":"9d08e582de9c8a929d61d0cfab1028292bcc8b09e894ada7847da3db777d5c05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-28T06:41:18Z","title_canon_sha256":"3c714641c750fae29ba7bb6089c130fbc348b4b19e85d03f9a50d1eeed37ac5e"},"schema_version":"1.0","source":{"id":"1711.10145","kind":"arxiv","version":1}},"canonical_sha256":"e497ff05a96965e4cea2001499982e768a6197df6c5d104f3dc2269724b7c65c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e497ff05a96965e4cea2001499982e768a6197df6c5d104f3dc2269724b7c65c","first_computed_at":"2026-05-18T00:29:23.230701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:23.230701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hX8kq0oIYFIcMNuT5j5MOsGklQ16T/dyhrDiVzhVr8HfVMGhn+lkF3FH8ZnLsX/3YSV/xJPV9dy+opyKUSctBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:23.231644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10145","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24a1daf7ee051e6f97b7c73c389d14c56d93fdec0a884e5a6429592ef330edea","sha256:01709228788558e67a531cb3df57e4201977bd21e991ed5f06a9ae12e5e27e9c"],"state_sha256":"a91df8da07e8e16fbe26fe822ce2d147c5c5930c0d18ec8f86a56b81270adf12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tXAmror2XgPJjqFwQykCw6nm2c+E8/Xfz4StLwv4YXXzDcZ8om7HL3/Li2lLdqjL6ezuW5lUhY4AC87NgsXOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:13:43.340539Z","bundle_sha256":"f61e6c84be877ff1371a5d191b20cf9308be5382974ea78488793463719e37e9"}}