{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:A5UZOQCEMCGCL6DQLV2UBXKWYD","short_pith_number":"pith:A5UZOQCE","schema_version":"1.0","canonical_sha256":"0769974044608c25f8705d7540dd56c0ebd94d88e2181386f7b002923799eed4","source":{"kind":"arxiv","id":"2307.08979","version":1},"attestation_state":"computed","paper":{"title":"Scalable Auction Algorithms for Bipartite Maximum Matching Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Quanquan C. Liu, Samir Khuller, Yiduo Ke","submitted_at":"2023-07-18T05:25:32Z","abstract_excerpt":"In this paper, we give new auction algorithms for maximum weighted bipartite matching (MWM) and maximum cardinality bipartite $b$-matching (MCbM). Our algorithms run in $O\\left(\\log n/\\varepsilon^8\\right)$ and $O\\left(\\log n/\\varepsilon^2\\right)$ rounds, respectively, in the blackboard distributed setting. We show that our MWM algorithm can be implemented in the distributed, interactive setting using $O(\\log^2 n)$ and $O(\\log n)$ bit messages, respectively, directly answering the open question posed by Demange, Gale and Sotomayor [DNO14]. Furthermore, we implement our algorithms in a variety o"},"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":"2307.08979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-18T05:25:32Z","cross_cats_sorted":[],"title_canon_sha256":"f00cab55d8e84e33e840cdd94f62d154a6e7b7d6e668295930ed077fd024cf09","abstract_canon_sha256":"3bb09d356e0630e9c131b70fed4483272fd8ef26a5780b5c9bcbed03da662ada"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:37.069386Z","signature_b64":"2vJIWxV/zK28hXmAcNa/Prm37pOFbH4/lUOVIDqZTjABxO3HOaX43cioEBjMZadVWKnrdy46RH66dlZvIXfdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0769974044608c25f8705d7540dd56c0ebd94d88e2181386f7b002923799eed4","last_reissued_at":"2026-07-05T06:31:37.068886Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:37.068886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Auction Algorithms for Bipartite Maximum Matching Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Quanquan C. Liu, Samir Khuller, Yiduo Ke","submitted_at":"2023-07-18T05:25:32Z","abstract_excerpt":"In this paper, we give new auction algorithms for maximum weighted bipartite matching (MWM) and maximum cardinality bipartite $b$-matching (MCbM). Our algorithms run in $O\\left(\\log n/\\varepsilon^8\\right)$ and $O\\left(\\log n/\\varepsilon^2\\right)$ rounds, respectively, in the blackboard distributed setting. We show that our MWM algorithm can be implemented in the distributed, interactive setting using $O(\\log^2 n)$ and $O(\\log n)$ bit messages, respectively, directly answering the open question posed by Demange, Gale and Sotomayor [DNO14]. Furthermore, we implement our algorithms in a variety o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.08979","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.08979/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.08979","created_at":"2026-07-05T06:31:37.068954+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.08979v1","created_at":"2026-07-05T06:31:37.068954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.08979","created_at":"2026-07-05T06:31:37.068954+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5UZOQCEMCGC","created_at":"2026-07-05T06:31:37.068954+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5UZOQCEMCGCL6DQ","created_at":"2026-07-05T06:31:37.068954+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5UZOQCE","created_at":"2026-07-05T06:31:37.068954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04524","citing_title":"Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A5UZOQCEMCGCL6DQLV2UBXKWYD","json":"https://pith.science/pith/A5UZOQCEMCGCL6DQLV2UBXKWYD.json","graph_json":"https://pith.science/api/pith-number/A5UZOQCEMCGCL6DQLV2UBXKWYD/graph.json","events_json":"https://pith.science/api/pith-number/A5UZOQCEMCGCL6DQLV2UBXKWYD/events.json","paper":"https://pith.science/paper/A5UZOQCE"},"agent_actions":{"view_html":"https://pith.science/pith/A5UZOQCEMCGCL6DQLV2UBXKWYD","download_json":"https://pith.science/pith/A5UZOQCEMCGCL6DQLV2UBXKWYD.json","view_paper":"https://pith.science/paper/A5UZOQCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.08979&json=true","fetch_graph":"https://pith.science/api/pith-number/A5UZOQCEMCGCL6DQLV2UBXKWYD/graph.json","fetch_events":"https://pith.science/api/pith-number/A5UZOQCEMCGCL6DQLV2UBXKWYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5UZOQCEMCGCL6DQLV2UBXKWYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5UZOQCEMCGCL6DQLV2UBXKWYD/action/storage_attestation","attest_author":"https://pith.science/pith/A5UZOQCEMCGCL6DQLV2UBXKWYD/action/author_attestation","sign_citation":"https://pith.science/pith/A5UZOQCEMCGCL6DQLV2UBXKWYD/action/citation_signature","submit_replication":"https://pith.science/pith/A5UZOQCEMCGCL6DQLV2UBXKWYD/action/replication_record"}},"created_at":"2026-07-05T06:31:37.068954+00:00","updated_at":"2026-07-05T06:31:37.068954+00:00"}