{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CY5JMBDBUV6WYNWJGW4VF3FL5P","short_pith_number":"pith:CY5JMBDB","canonical_record":{"source":{"id":"1207.5813","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T20:21:38Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"54c3022c144fea23c2dfdd0532b25671cbd77227cfa15f54e494851a2b0462ab","abstract_canon_sha256":"224f8299527e31c20d3f9e512854a36b93c8b9f3ca7648432bd0f301e803a876"},"schema_version":"1.0"},"canonical_sha256":"163a960461a57d6c36c935b952ecabebe052ec177355f7992927f8d90c8d2eb3","source":{"kind":"arxiv","id":"1207.5813","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5813","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5813v3","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5813","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"CY5JMBDBUV6W","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CY5JMBDBUV6WYNWJ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CY5JMBDB","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CY5JMBDBUV6WYNWJGW4VF3FL5P","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5813","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T20:21:38Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"54c3022c144fea23c2dfdd0532b25671cbd77227cfa15f54e494851a2b0462ab","abstract_canon_sha256":"224f8299527e31c20d3f9e512854a36b93c8b9f3ca7648432bd0f301e803a876"},"schema_version":"1.0"},"canonical_sha256":"163a960461a57d6c36c935b952ecabebe052ec177355f7992927f8d90c8d2eb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:24.559931Z","signature_b64":"GKMn/o72N5HmTECI2o814+RyORrv1kFJAfC+zGOnpR3gOoA7vWi0SmUCInnLbFEbxy0dJuqdEiW4uI5ICguECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"163a960461a57d6c36c935b952ecabebe052ec177355f7992927f8d90c8d2eb3","last_reissued_at":"2026-05-18T03:01:24.559197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:24.559197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5813","source_version":3,"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-18T03:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FU5josOKoIzw3I28t19DUqZ+aI0AEeItpAYFAx0OjGVzvRyPRJCPUnBAQyidq9ftBb8/Cmseg900GkUB9i4MDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:12:55.193898Z"},"content_sha256":"8df88c7af1e07adb75a3f28da4595a0df3803c00bb3ea355d27949792b193133","schema_version":"1.0","event_id":"sha256:8df88c7af1e07adb75a3f28da4595a0df3803c00bb3ea355d27949792b193133"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CY5JMBDBUV6WYNWJGW4VF3FL5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Cutting Plane Method is Polynomial for Perfect Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Karthekeyan Chandrasekaran, Laszlo A. Vegh, Santosh Vempala","submitted_at":"2012-07-24T20:21:38Z","abstract_excerpt":"The cutting plane approach to optimal matchings has been discussed by several authors over the past decades (e.g., Padberg and Rao '82, Grotschel and Holland '85, Lovasz and Plummer '86, Trick '87, Fischetti and Lodi '07) and its convergence has been an open question. We give a cutting plane algorithm that converges in polynomial-time using only Edmonds' blossom inequalities; it maintains half-integral intermediate LP solutions supported by a disjoint union of odd cycles and edges. Our main insight is a method to retain only a subset of the previously added cutting planes based on their dual v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5813","kind":"arxiv","version":3},"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-18T03:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7rFpYlavJhO5Cj9j6XX4D8sw78FJ6A54mjxup4+sGQrzOJBRoR/s+ybUM2tCcSeMdixfkJWayPpjDEJDZZ9MAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:12:55.194309Z"},"content_sha256":"c664fbc290c811c2c3161cf59961bea967473e49b6a2d9d2d10c61c88ef25ee0","schema_version":"1.0","event_id":"sha256:c664fbc290c811c2c3161cf59961bea967473e49b6a2d9d2d10c61c88ef25ee0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CY5JMBDBUV6WYNWJGW4VF3FL5P/bundle.json","state_url":"https://pith.science/pith/CY5JMBDBUV6WYNWJGW4VF3FL5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CY5JMBDBUV6WYNWJGW4VF3FL5P/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-05-26T09:12:55Z","links":{"resolver":"https://pith.science/pith/CY5JMBDBUV6WYNWJGW4VF3FL5P","bundle":"https://pith.science/pith/CY5JMBDBUV6WYNWJGW4VF3FL5P/bundle.json","state":"https://pith.science/pith/CY5JMBDBUV6WYNWJGW4VF3FL5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CY5JMBDBUV6WYNWJGW4VF3FL5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CY5JMBDBUV6WYNWJGW4VF3FL5P","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":"224f8299527e31c20d3f9e512854a36b93c8b9f3ca7648432bd0f301e803a876","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T20:21:38Z","title_canon_sha256":"54c3022c144fea23c2dfdd0532b25671cbd77227cfa15f54e494851a2b0462ab"},"schema_version":"1.0","source":{"id":"1207.5813","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5813","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5813v3","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5813","created_at":"2026-05-18T03:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"CY5JMBDBUV6W","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CY5JMBDBUV6WYNWJ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CY5JMBDB","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:c664fbc290c811c2c3161cf59961bea967473e49b6a2d9d2d10c61c88ef25ee0","target":"graph","created_at":"2026-05-18T03:01:24Z","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":"The cutting plane approach to optimal matchings has been discussed by several authors over the past decades (e.g., Padberg and Rao '82, Grotschel and Holland '85, Lovasz and Plummer '86, Trick '87, Fischetti and Lodi '07) and its convergence has been an open question. We give a cutting plane algorithm that converges in polynomial-time using only Edmonds' blossom inequalities; it maintains half-integral intermediate LP solutions supported by a disjoint union of odd cycles and edges. Our main insight is a method to retain only a subset of the previously added cutting planes based on their dual v","authors_text":"Karthekeyan Chandrasekaran, Laszlo A. Vegh, Santosh Vempala","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T20:21:38Z","title":"The Cutting Plane Method is Polynomial for Perfect Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5813","kind":"arxiv","version":3},"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:8df88c7af1e07adb75a3f28da4595a0df3803c00bb3ea355d27949792b193133","target":"record","created_at":"2026-05-18T03:01:24Z","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":"224f8299527e31c20d3f9e512854a36b93c8b9f3ca7648432bd0f301e803a876","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T20:21:38Z","title_canon_sha256":"54c3022c144fea23c2dfdd0532b25671cbd77227cfa15f54e494851a2b0462ab"},"schema_version":"1.0","source":{"id":"1207.5813","kind":"arxiv","version":3}},"canonical_sha256":"163a960461a57d6c36c935b952ecabebe052ec177355f7992927f8d90c8d2eb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"163a960461a57d6c36c935b952ecabebe052ec177355f7992927f8d90c8d2eb3","first_computed_at":"2026-05-18T03:01:24.559197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:24.559197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GKMn/o72N5HmTECI2o814+RyORrv1kFJAfC+zGOnpR3gOoA7vWi0SmUCInnLbFEbxy0dJuqdEiW4uI5ICguECg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:24.559931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5813","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8df88c7af1e07adb75a3f28da4595a0df3803c00bb3ea355d27949792b193133","sha256:c664fbc290c811c2c3161cf59961bea967473e49b6a2d9d2d10c61c88ef25ee0"],"state_sha256":"047c2e56ef47501243865c9a3ca1f9f99ef29e61534dfc33228dfad73273f5dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMP9lIW7dxkHylPDPrPRs1waLxLaIw0QnMA496oDeaIoQzwtDtwreI5WMbCERywUT3XJacZZQK/dNDUBCQaxCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:12:55.198731Z","bundle_sha256":"eea647d00eb35b52eeab7d7d576db556fc9c7e9d847dbbeff7a77054642d0bc6"}}