{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WQ5LQWJSRSMOXLFBULNUDNXYQX","short_pith_number":"pith:WQ5LQWJS","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"},"canonical_sha256":"b43ab859328c98ebaca1a2db41b6f885cbf4be13c0525b614743048ea2390077","source":{"kind":"arxiv","id":"1408.0807","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0807","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0807v5","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0807","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"WQ5LQWJSRSMO","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WQ5LQWJSRSMOXLFB","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WQ5LQWJS","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WQ5LQWJSRSMOXLFBULNUDNXYQX","target":"record","payload":{"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"},"canonical_sha256":"b43ab859328c98ebaca1a2db41b6f885cbf4be13c0525b614743048ea2390077","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"},"source_kind":"arxiv","source_id":"1408.0807","source_version":5,"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:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZTxyQLM02yF2tM6PcEOOQsr7IlZs4hJHsNM1AtPY/tBZuCfNYRLxNUv83A4E8JuY7gU0pGZ5mKJot7RFKdCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:36:15.187683Z"},"content_sha256":"9d67c9c725e6bbb46c1efe32972a6643c25ea7c7726893267a08f9c4d0e0fee9","schema_version":"1.0","event_id":"sha256:9d67c9c725e6bbb46c1efe32972a6643c25ea7c7726893267a08f9c4d0e0fee9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WQ5LQWJSRSMOXLFBULNUDNXYQX","target":"graph","payload":{"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"},"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:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"51eX0sGNkau2lT0ygauPimVrxVpDFZisESQaLU6IyNuTzliFek1ZGrlo8ZRJ5yu5j1z5WIyhUTQd/G2E3DRDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:36:15.188029Z"},"content_sha256":"57b65c8845779fd79bef70d0ce03ed6ae7ceb6530f8c464e6f4f91d9ec66d641","schema_version":"1.0","event_id":"sha256:57b65c8845779fd79bef70d0ce03ed6ae7ceb6530f8c464e6f4f91d9ec66d641"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX/bundle.json","state_url":"https://pith.science/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX/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-01T09:36:15Z","links":{"resolver":"https://pith.science/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX","bundle":"https://pith.science/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX/bundle.json","state":"https://pith.science/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQ5LQWJSRSMOXLFBULNUDNXYQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WQ5LQWJSRSMOXLFBULNUDNXYQX","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":"66554eedeb9f4e3e315f69e7b469b380d24e599aa51505dd705e27bf50e89e79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-04T20:12:55Z","title_canon_sha256":"688f724c6563bde4cf8b67e01b8bc465c8b68375b0c0220205f97757411758a0"},"schema_version":"1.0","source":{"id":"1408.0807","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0807","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0807v5","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0807","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"WQ5LQWJSRSMO","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WQ5LQWJSRSMOXLFB","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WQ5LQWJS","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:57b65c8845779fd79bef70d0ce03ed6ae7ceb6530f8c464e6f4f91d9ec66d641","target":"graph","created_at":"2026-05-18T00:17:36Z","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":"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","authors_text":"David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-04T20:12:55Z","title":"Polynomial size linear programs for problems in P"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0807","kind":"arxiv","version":5},"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:9d67c9c725e6bbb46c1efe32972a6643c25ea7c7726893267a08f9c4d0e0fee9","target":"record","created_at":"2026-05-18T00:17:36Z","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":"66554eedeb9f4e3e315f69e7b469b380d24e599aa51505dd705e27bf50e89e79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-04T20:12:55Z","title_canon_sha256":"688f724c6563bde4cf8b67e01b8bc465c8b68375b0c0220205f97757411758a0"},"schema_version":"1.0","source":{"id":"1408.0807","kind":"arxiv","version":5}},"canonical_sha256":"b43ab859328c98ebaca1a2db41b6f885cbf4be13c0525b614743048ea2390077","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b43ab859328c98ebaca1a2db41b6f885cbf4be13c0525b614743048ea2390077","first_computed_at":"2026-05-18T00:17:36.024767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:36.024767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V65hTJdLKiCMgMG+MKoxaUomU14uOsuGO8aXh6cvqSwhbeeASMqXuWlhrRdR0sR1LxFxwlarWF2nJcxaJoO7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:36.025461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0807","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d67c9c725e6bbb46c1efe32972a6643c25ea7c7726893267a08f9c4d0e0fee9","sha256:57b65c8845779fd79bef70d0ce03ed6ae7ceb6530f8c464e6f4f91d9ec66d641"],"state_sha256":"c68483ae807d7be718cbb8b5537f7154ad76f02b44a96e8b101198957e7a8af2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xHPKJdIj16RI3NW6Deub3wTAm3DChIrveK3jVW8kpo46Olk4LVA6KFawz2xoeRDq/3tgFhLC1GAYhuRnjotNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:36:15.190144Z","bundle_sha256":"3c83e5e6b91192bd0957441bf0dfccc6911936e6f8ce42495d4a6e08162b4735"}}