{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:4X4ARBB37OE2TJEVUAC3SAUODD","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":"6c9be538ab8bfdbd6aae65a3850ebddce89c7c47f53d6536421c8fca687d5d42","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"math.OC","submitted_at":"2006-07-04T11:39:28Z","title_canon_sha256":"0f77eb9cbe178236a7a7fa97dfa408d16840a179cb759a525e21a50c031d3fa4"},"schema_version":"1.0","source":{"id":"math/0607088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0607088","created_at":"2026-05-18T04:06:46Z"},{"alias_kind":"arxiv_version","alias_value":"math/0607088v1","created_at":"2026-05-18T04:06:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0607088","created_at":"2026-05-18T04:06:46Z"},{"alias_kind":"pith_short_12","alias_value":"4X4ARBB37OE2","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"4X4ARBB37OE2TJEV","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"4X4ARBB3","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:4f70e1aefbdf82fd397c569b7d29f3d6a496cb83dde3a7c02ee01e6ab5e0ea95","target":"graph","created_at":"2026-05-18T04:06:46Z","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 famous Padberg-Rao separation algorithm for b-matching polyhedra can be implemented to run in O(n^2m log(n^2/m)) time in the uncapacitated case, and in O(nm^2 log(n^2/m)) time in the capacitated case (where n is the number of vertices and m is the number of edges of the underlying graph). We give a new and simple algorithm for the capacitated case which can be implemented to run in O(n^2m log(n^2/m)) time.","authors_text":"Adam N. Letchford, Dirk Oliver Theis","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"math.OC","submitted_at":"2006-07-04T11:39:28Z","title":"Odd minimum cut sets and b-matchings revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0607088","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:b0d1aa0268fde263457a210d98fefdf0c8efcf7f4e45c5843a2225d361fd66d3","target":"record","created_at":"2026-05-18T04:06:46Z","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":"6c9be538ab8bfdbd6aae65a3850ebddce89c7c47f53d6536421c8fca687d5d42","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"math.OC","submitted_at":"2006-07-04T11:39:28Z","title_canon_sha256":"0f77eb9cbe178236a7a7fa97dfa408d16840a179cb759a525e21a50c031d3fa4"},"schema_version":"1.0","source":{"id":"math/0607088","kind":"arxiv","version":1}},"canonical_sha256":"e5f808843bfb89a9a495a005b9028e18d8440726da84de1523f8a01976cc642c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5f808843bfb89a9a495a005b9028e18d8440726da84de1523f8a01976cc642c","first_computed_at":"2026-05-18T04:06:46.409649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:46.409649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MgEgkgu4sQK/YEEWQ+U4SBm0Mq1lDpcTA3RLFav0aqUIL3V1/RySmS9hV/bCtMIVOYSRwuBpQ+wupH9Qw8eBBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:46.410368Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0607088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0d1aa0268fde263457a210d98fefdf0c8efcf7f4e45c5843a2225d361fd66d3","sha256:4f70e1aefbdf82fd397c569b7d29f3d6a496cb83dde3a7c02ee01e6ab5e0ea95"],"state_sha256":"a9cbcf1f1f8472a2f752a1a0f8460644468f8eb7e2f51ad466c487261c848a96"}