{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:4X4ARBB37OE2TJEVUAC3SAUODD","short_pith_number":"pith:4X4ARBB3","schema_version":"1.0","canonical_sha256":"e5f808843bfb89a9a495a005b9028e18d8440726da84de1523f8a01976cc642c","source":{"kind":"arxiv","id":"math/0607088","version":1},"attestation_state":"computed","paper":{"title":"Odd minimum cut sets and b-matchings revisited","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Adam N. Letchford, Dirk Oliver Theis","submitted_at":"2006-07-04T11:39:28Z","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."},"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":"math/0607088","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2006-07-04T11:39:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0f77eb9cbe178236a7a7fa97dfa408d16840a179cb759a525e21a50c031d3fa4","abstract_canon_sha256":"6c9be538ab8bfdbd6aae65a3850ebddce89c7c47f53d6536421c8fca687d5d42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:46.410368Z","signature_b64":"MgEgkgu4sQK/YEEWQ+U4SBm0Mq1lDpcTA3RLFav0aqUIL3V1/RySmS9hV/bCtMIVOYSRwuBpQ+wupH9Qw8eBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5f808843bfb89a9a495a005b9028e18d8440726da84de1523f8a01976cc642c","last_reissued_at":"2026-05-18T04:06:46.409649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:46.409649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Odd minimum cut sets and b-matchings revisited","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Adam N. Letchford, Dirk Oliver Theis","submitted_at":"2006-07-04T11:39:28Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0607088","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":"math/0607088","created_at":"2026-05-18T04:06:46.409761+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0607088v1","created_at":"2026-05-18T04:06:46.409761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0607088","created_at":"2026-05-18T04:06:46.409761+00:00"},{"alias_kind":"pith_short_12","alias_value":"4X4ARBB37OE2","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"4X4ARBB37OE2TJEV","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"4X4ARBB3","created_at":"2026-05-18T12:25:53.939244+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/4X4ARBB37OE2TJEVUAC3SAUODD","json":"https://pith.science/pith/4X4ARBB37OE2TJEVUAC3SAUODD.json","graph_json":"https://pith.science/api/pith-number/4X4ARBB37OE2TJEVUAC3SAUODD/graph.json","events_json":"https://pith.science/api/pith-number/4X4ARBB37OE2TJEVUAC3SAUODD/events.json","paper":"https://pith.science/paper/4X4ARBB3"},"agent_actions":{"view_html":"https://pith.science/pith/4X4ARBB37OE2TJEVUAC3SAUODD","download_json":"https://pith.science/pith/4X4ARBB37OE2TJEVUAC3SAUODD.json","view_paper":"https://pith.science/paper/4X4ARBB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0607088&json=true","fetch_graph":"https://pith.science/api/pith-number/4X4ARBB37OE2TJEVUAC3SAUODD/graph.json","fetch_events":"https://pith.science/api/pith-number/4X4ARBB37OE2TJEVUAC3SAUODD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4X4ARBB37OE2TJEVUAC3SAUODD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4X4ARBB37OE2TJEVUAC3SAUODD/action/storage_attestation","attest_author":"https://pith.science/pith/4X4ARBB37OE2TJEVUAC3SAUODD/action/author_attestation","sign_citation":"https://pith.science/pith/4X4ARBB37OE2TJEVUAC3SAUODD/action/citation_signature","submit_replication":"https://pith.science/pith/4X4ARBB37OE2TJEVUAC3SAUODD/action/replication_record"}},"created_at":"2026-05-18T04:06:46.409761+00:00","updated_at":"2026-05-18T04:06:46.409761+00:00"}