{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OPUTIX5K75WRRQYAJ5GOBILFIZ","short_pith_number":"pith:OPUTIX5K","schema_version":"1.0","canonical_sha256":"73e9345faaff6d18c3004f4ce0a165466c8ff33b2a4bf125de6d11e78cedc43a","source":{"kind":"arxiv","id":"1704.08462","version":1},"attestation_state":"computed","paper":{"title":"Communication complexity of approximate maximum matching in the message-passing model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bozidar Radunovic, Milan Vojnovic, Qin Zhang, Zengfeng Huang","submitted_at":"2017-04-27T07:49:13Z","abstract_excerpt":"We consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model. The maximum matching problem is one of the most fundamental graph combinatorial problems, with a variety of applications.\n  The input to the problem is a graph $G$ that has $n$ vertices and the set of edges partitioned over $k$ sites, and an approximation ratio parameter $\\alpha$. The output is required to be a matching in $G$ that has to be reported by one of the sites, whose size is at least factor $\\alpha$ of the size of a maximum matching in $"},"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":"1704.08462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-27T07:49:13Z","cross_cats_sorted":[],"title_canon_sha256":"b37651ab32476ebf7368ee9c6ed76f9c6ff64bae4b46a8d7a60a643a43f47ae7","abstract_canon_sha256":"54463b803b09b43ae2ad9cce5a08256b47687ce14664a93f4ded897278bfdf2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.641660Z","signature_b64":"M5W0J1KI1TmI9YFj533bokuVH+TL837g2l8wJq9VIklF7z83lBxDFbcYPQapzJkh9/HhRU4Ihlb/N7wHAVcVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73e9345faaff6d18c3004f4ce0a165466c8ff33b2a4bf125de6d11e78cedc43a","last_reissued_at":"2026-05-18T00:45:27.641283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.641283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication complexity of approximate maximum matching in the message-passing model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bozidar Radunovic, Milan Vojnovic, Qin Zhang, Zengfeng Huang","submitted_at":"2017-04-27T07:49:13Z","abstract_excerpt":"We consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model. The maximum matching problem is one of the most fundamental graph combinatorial problems, with a variety of applications.\n  The input to the problem is a graph $G$ that has $n$ vertices and the set of edges partitioned over $k$ sites, and an approximation ratio parameter $\\alpha$. The output is required to be a matching in $G$ that has to be reported by one of the sites, whose size is at least factor $\\alpha$ of the size of a maximum matching in $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08462","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":"1704.08462","created_at":"2026-05-18T00:45:27.641344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08462v1","created_at":"2026-05-18T00:45:27.641344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08462","created_at":"2026-05-18T00:45:27.641344+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPUTIX5K75WR","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPUTIX5K75WRRQYA","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPUTIX5K","created_at":"2026-05-18T12:31:34.259226+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/OPUTIX5K75WRRQYAJ5GOBILFIZ","json":"https://pith.science/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ.json","graph_json":"https://pith.science/api/pith-number/OPUTIX5K75WRRQYAJ5GOBILFIZ/graph.json","events_json":"https://pith.science/api/pith-number/OPUTIX5K75WRRQYAJ5GOBILFIZ/events.json","paper":"https://pith.science/paper/OPUTIX5K"},"agent_actions":{"view_html":"https://pith.science/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ","download_json":"https://pith.science/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ.json","view_paper":"https://pith.science/paper/OPUTIX5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08462&json=true","fetch_graph":"https://pith.science/api/pith-number/OPUTIX5K75WRRQYAJ5GOBILFIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OPUTIX5K75WRRQYAJ5GOBILFIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ/action/storage_attestation","attest_author":"https://pith.science/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ/action/author_attestation","sign_citation":"https://pith.science/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ/action/citation_signature","submit_replication":"https://pith.science/pith/OPUTIX5K75WRRQYAJ5GOBILFIZ/action/replication_record"}},"created_at":"2026-05-18T00:45:27.641344+00:00","updated_at":"2026-05-18T00:45:27.641344+00:00"}