{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:B4EIYXZEWDPMA4OCOUQCGBR6XJ","short_pith_number":"pith:B4EIYXZE","schema_version":"1.0","canonical_sha256":"0f088c5f24b0dec071c2752023063eba4cacd5c8970c19bba5791f78be9a26fd","source":{"kind":"arxiv","id":"1407.7882","version":3},"attestation_state":"computed","paper":{"title":"Distributed Maximum Matching in Bounded Degree Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Dana Ron, Guy Even, Moti Medina","submitted_at":"2014-07-29T20:42:30Z","abstract_excerpt":"We present deterministic distributed algorithms for computing approximate maximum cardinality matchings and approximate maximum weight matchings. Our algorithm for the unweighted case computes a matching whose size is at least $(1-\\eps)$ times the optimal in $\\Delta^{O(1/\\eps)} + O\\left(\\frac{1}{\\eps^2}\\right) \\cdot\\log^*(n)$ rounds where $n$ is the number of vertices in the graph and $\\Delta$ is the maximum degree. Our algorithm for the edge-weighted case computes a matching whose weight is at least $(1-\\eps)$ times the optimal in $\\log(\\min\\{1/\\wmin,n/\\eps\\})^{O(1/\\eps)}\\cdot(\\Delta^{O(1/\\ep"},"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":"1407.7882","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-29T20:42:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"20b746fe798e11e944d2d959f633bcbac4f60fe80271817557418ac1f51d211b","abstract_canon_sha256":"9535ec04b4a940cc7faadb888e739d208080bd51c003f5c60c58d8be66f4c7cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:53.713723Z","signature_b64":"vCtaAoa5TgRYMCoGPP1hbVsjh6E40ZAKCy2q+C+BBx9TC1iDj2m4JZvbo/hfjiRXmxePs9kMiK1d62taEIF+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f088c5f24b0dec071c2752023063eba4cacd5c8970c19bba5791f78be9a26fd","last_reissued_at":"2026-05-18T02:37:53.713118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:53.713118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Maximum Matching in Bounded Degree Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Dana Ron, Guy Even, Moti Medina","submitted_at":"2014-07-29T20:42:30Z","abstract_excerpt":"We present deterministic distributed algorithms for computing approximate maximum cardinality matchings and approximate maximum weight matchings. Our algorithm for the unweighted case computes a matching whose size is at least $(1-\\eps)$ times the optimal in $\\Delta^{O(1/\\eps)} + O\\left(\\frac{1}{\\eps^2}\\right) \\cdot\\log^*(n)$ rounds where $n$ is the number of vertices in the graph and $\\Delta$ is the maximum degree. Our algorithm for the edge-weighted case computes a matching whose weight is at least $(1-\\eps)$ times the optimal in $\\log(\\min\\{1/\\wmin,n/\\eps\\})^{O(1/\\eps)}\\cdot(\\Delta^{O(1/\\ep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7882","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.7882","created_at":"2026-05-18T02:37:53.713202+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7882v3","created_at":"2026-05-18T02:37:53.713202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7882","created_at":"2026-05-18T02:37:53.713202+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4EIYXZEWDPM","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4EIYXZEWDPMA4OC","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4EIYXZE","created_at":"2026-05-18T12:28:19.803747+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/B4EIYXZEWDPMA4OCOUQCGBR6XJ","json":"https://pith.science/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ.json","graph_json":"https://pith.science/api/pith-number/B4EIYXZEWDPMA4OCOUQCGBR6XJ/graph.json","events_json":"https://pith.science/api/pith-number/B4EIYXZEWDPMA4OCOUQCGBR6XJ/events.json","paper":"https://pith.science/paper/B4EIYXZE"},"agent_actions":{"view_html":"https://pith.science/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ","download_json":"https://pith.science/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ.json","view_paper":"https://pith.science/paper/B4EIYXZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7882&json=true","fetch_graph":"https://pith.science/api/pith-number/B4EIYXZEWDPMA4OCOUQCGBR6XJ/graph.json","fetch_events":"https://pith.science/api/pith-number/B4EIYXZEWDPMA4OCOUQCGBR6XJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ/action/storage_attestation","attest_author":"https://pith.science/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ/action/author_attestation","sign_citation":"https://pith.science/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ/action/citation_signature","submit_replication":"https://pith.science/pith/B4EIYXZEWDPMA4OCOUQCGBR6XJ/action/replication_record"}},"created_at":"2026-05-18T02:37:53.713202+00:00","updated_at":"2026-05-18T02:37:53.713202+00:00"}