{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TJNOECFZU2QCYTINNOIR2SLPJG","short_pith_number":"pith:TJNOECFZ","schema_version":"1.0","canonical_sha256":"9a5ae208b9a6a02c4d0d6b911d496f49ace609f1a0786bfe0a24de896a764e8e","source":{"kind":"arxiv","id":"1906.01993","version":1},"attestation_state":"computed","paper":{"title":"Distributed Weighted Matching via Randomized Composable Coresets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"MohammadHossein Bateni, Sepehr Assadi, Vahab Mirrokni","submitted_at":"2019-06-05T12:43:16Z","abstract_excerpt":"Maximum weight matching is one of the most fundamental combinatorial optimization problems with a wide range of applications in data mining and bioinformatics. Developing distributed weighted matching algorithms is challenging due to the sequential nature of efficient algorithms for this problem. In this paper, we develop a simple distributed algorithm for the problem on general graphs with approximation guarantee of $2+\\varepsilon$ that (nearly) matches that of the sequential greedy algorithm. A key advantage of this algorithm is that it can be easily implemented in only two rounds of computa"},"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":"1906.01993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-05T12:43:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"37b1ec28d2fff2b1b6f054ebc9db83cedb64406e9de12239c51eec9cba85de4b","abstract_canon_sha256":"aef5c924accaaec88b8cafe80f7a6ee2d096ff0628048510a7a34c72773db952"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:05.478437Z","signature_b64":"l0s59lLBjg6TUw4i6AWTph5/Uh8DBCCC2ZUsLxKucOmK3JfgBxsskJ8L7Lhm0elQVzWsyw4E/0tT6MnqWgu3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a5ae208b9a6a02c4d0d6b911d496f49ace609f1a0786bfe0a24de896a764e8e","last_reissued_at":"2026-05-17T23:44:05.478010Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:05.478010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Weighted Matching via Randomized Composable Coresets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"MohammadHossein Bateni, Sepehr Assadi, Vahab Mirrokni","submitted_at":"2019-06-05T12:43:16Z","abstract_excerpt":"Maximum weight matching is one of the most fundamental combinatorial optimization problems with a wide range of applications in data mining and bioinformatics. Developing distributed weighted matching algorithms is challenging due to the sequential nature of efficient algorithms for this problem. In this paper, we develop a simple distributed algorithm for the problem on general graphs with approximation guarantee of $2+\\varepsilon$ that (nearly) matches that of the sequential greedy algorithm. A key advantage of this algorithm is that it can be easily implemented in only two rounds of computa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01993","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":"1906.01993","created_at":"2026-05-17T23:44:05.478070+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01993v1","created_at":"2026-05-17T23:44:05.478070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01993","created_at":"2026-05-17T23:44:05.478070+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJNOECFZU2QC","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJNOECFZU2QCYTIN","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJNOECFZ","created_at":"2026-05-18T12:33:27.125529+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/TJNOECFZU2QCYTINNOIR2SLPJG","json":"https://pith.science/pith/TJNOECFZU2QCYTINNOIR2SLPJG.json","graph_json":"https://pith.science/api/pith-number/TJNOECFZU2QCYTINNOIR2SLPJG/graph.json","events_json":"https://pith.science/api/pith-number/TJNOECFZU2QCYTINNOIR2SLPJG/events.json","paper":"https://pith.science/paper/TJNOECFZ"},"agent_actions":{"view_html":"https://pith.science/pith/TJNOECFZU2QCYTINNOIR2SLPJG","download_json":"https://pith.science/pith/TJNOECFZU2QCYTINNOIR2SLPJG.json","view_paper":"https://pith.science/paper/TJNOECFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01993&json=true","fetch_graph":"https://pith.science/api/pith-number/TJNOECFZU2QCYTINNOIR2SLPJG/graph.json","fetch_events":"https://pith.science/api/pith-number/TJNOECFZU2QCYTINNOIR2SLPJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJNOECFZU2QCYTINNOIR2SLPJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJNOECFZU2QCYTINNOIR2SLPJG/action/storage_attestation","attest_author":"https://pith.science/pith/TJNOECFZU2QCYTINNOIR2SLPJG/action/author_attestation","sign_citation":"https://pith.science/pith/TJNOECFZU2QCYTINNOIR2SLPJG/action/citation_signature","submit_replication":"https://pith.science/pith/TJNOECFZU2QCYTINNOIR2SLPJG/action/replication_record"}},"created_at":"2026-05-17T23:44:05.478070+00:00","updated_at":"2026-05-17T23:44:05.478070+00:00"}