{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EXLEIY33QKEUWCF4PFVWQO7LW5","short_pith_number":"pith:EXLEIY33","schema_version":"1.0","canonical_sha256":"25d644637b82894b08bc796b683bebb76339a70e8be675c9826b724dc131d90b","source":{"kind":"arxiv","id":"1811.02760","version":1},"attestation_state":"computed","paper":{"title":"Weighted Matchings via Unweighted Augmentations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Buddhima Gamlath, Ola Svensson, Sagar Kale, Slobodan Mitrovi\\'c","submitted_at":"2018-11-07T04:48:57Z","abstract_excerpt":"We design a generic method for reducing the task of finding weighted matchings to that of finding short augmenting paths in unweighted graphs. This method enables us to provide efficient implementations for approximating weighted matchings in the streaming model and in the massively parallel computation (MPC) model.\n  In the context of streaming with random edge arrivals, our techniques yield a $(1/2+c)$-approximation algorithm thus breaking the natural barrier of $1/2$. For multi-pass streaming and the MPC model, we show that any algorithm computing a $(1-\\delta)$-approximate unweighted match"},"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":"1811.02760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T04:48:57Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"27e471fe04f1873d1449424aebb0fc803f706c67cd27603be79a5436f3729481","abstract_canon_sha256":"67ec2e50f00e28a1be10fb18c6066330e9c73b21e3deb9111982610007223b71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:20.859886Z","signature_b64":"k1dp9G5OC+DBaqIx17JAcE4vBIXEu0oKwv1q9folrMfnWGkgtP3q45FZPo7GlnOGwpRT2ZChiG6cNXSEzkE4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25d644637b82894b08bc796b683bebb76339a70e8be675c9826b724dc131d90b","last_reissued_at":"2026-05-18T00:01:20.859380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:20.859380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted Matchings via Unweighted Augmentations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Buddhima Gamlath, Ola Svensson, Sagar Kale, Slobodan Mitrovi\\'c","submitted_at":"2018-11-07T04:48:57Z","abstract_excerpt":"We design a generic method for reducing the task of finding weighted matchings to that of finding short augmenting paths in unweighted graphs. This method enables us to provide efficient implementations for approximating weighted matchings in the streaming model and in the massively parallel computation (MPC) model.\n  In the context of streaming with random edge arrivals, our techniques yield a $(1/2+c)$-approximation algorithm thus breaking the natural barrier of $1/2$. For multi-pass streaming and the MPC model, we show that any algorithm computing a $(1-\\delta)$-approximate unweighted match"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02760","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":"1811.02760","created_at":"2026-05-18T00:01:20.859471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02760v1","created_at":"2026-05-18T00:01:20.859471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02760","created_at":"2026-05-18T00:01:20.859471+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXLEIY33QKEU","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXLEIY33QKEUWCF4","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXLEIY33","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05725","citing_title":"Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EXLEIY33QKEUWCF4PFVWQO7LW5","json":"https://pith.science/pith/EXLEIY33QKEUWCF4PFVWQO7LW5.json","graph_json":"https://pith.science/api/pith-number/EXLEIY33QKEUWCF4PFVWQO7LW5/graph.json","events_json":"https://pith.science/api/pith-number/EXLEIY33QKEUWCF4PFVWQO7LW5/events.json","paper":"https://pith.science/paper/EXLEIY33"},"agent_actions":{"view_html":"https://pith.science/pith/EXLEIY33QKEUWCF4PFVWQO7LW5","download_json":"https://pith.science/pith/EXLEIY33QKEUWCF4PFVWQO7LW5.json","view_paper":"https://pith.science/paper/EXLEIY33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02760&json=true","fetch_graph":"https://pith.science/api/pith-number/EXLEIY33QKEUWCF4PFVWQO7LW5/graph.json","fetch_events":"https://pith.science/api/pith-number/EXLEIY33QKEUWCF4PFVWQO7LW5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXLEIY33QKEUWCF4PFVWQO7LW5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXLEIY33QKEUWCF4PFVWQO7LW5/action/storage_attestation","attest_author":"https://pith.science/pith/EXLEIY33QKEUWCF4PFVWQO7LW5/action/author_attestation","sign_citation":"https://pith.science/pith/EXLEIY33QKEUWCF4PFVWQO7LW5/action/citation_signature","submit_replication":"https://pith.science/pith/EXLEIY33QKEUWCF4PFVWQO7LW5/action/replication_record"}},"created_at":"2026-05-18T00:01:20.859471+00:00","updated_at":"2026-05-18T00:01:20.859471+00:00"}