{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GM5EY4DMQ2C6AXUNUXVWJVSVWZ","short_pith_number":"pith:GM5EY4DM","schema_version":"1.0","canonical_sha256":"333a4c706c8685e05e8da5eb64d655b64cdabd1c24e36454ea3bc306b60bfaf5","source":{"kind":"arxiv","id":"1304.6906","version":1},"attestation_state":"computed","paper":{"title":"Approximating Semi-Matchings in Streaming and in Two-Party Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adi Ros\\'en, Christian Konrad","submitted_at":"2013-04-25T13:34:46Z","abstract_excerpt":"We study the communication complexity and streaming complexity of approximating unweighted semi-matchings. A semi-matching in a bipartite graph G = (A, B, E), with n = |A|, is a subset of edges S that matches all A vertices to B vertices with the goal usually being to do this as fairly as possible. While the term 'semi-matching' was coined in 2003 by Harvey et al. [WADS 2003], the problem had already previously been studied in the scheduling literature under different names.\n  We present a deterministic one-pass streaming algorithm that for any 0 <= \\epsilon <= 1 uses space O(n^{1+\\epsilon}) a"},"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":"1304.6906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-25T13:34:46Z","cross_cats_sorted":[],"title_canon_sha256":"4a9f22f2a9479898dfa3e2b2a442dc64ddd041b5e2ba0e09e25a4913d809aa52","abstract_canon_sha256":"bedb7a3f2aad7a3d91e6cefe98a00f3c9207e38dedc938d10e7722739e91dd6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:10.821646Z","signature_b64":"3BNYAaa6l9RILkg48oTfUUOLmCGyZ6Ejmu2LF+qe0yqPoVLmzruGf9ycGQrxQfCyG9K2Sybk+E6p+BlT8qQqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"333a4c706c8685e05e8da5eb64d655b64cdabd1c24e36454ea3bc306b60bfaf5","last_reissued_at":"2026-05-18T03:27:10.820913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:10.820913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Semi-Matchings in Streaming and in Two-Party Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adi Ros\\'en, Christian Konrad","submitted_at":"2013-04-25T13:34:46Z","abstract_excerpt":"We study the communication complexity and streaming complexity of approximating unweighted semi-matchings. A semi-matching in a bipartite graph G = (A, B, E), with n = |A|, is a subset of edges S that matches all A vertices to B vertices with the goal usually being to do this as fairly as possible. While the term 'semi-matching' was coined in 2003 by Harvey et al. [WADS 2003], the problem had already previously been studied in the scheduling literature under different names.\n  We present a deterministic one-pass streaming algorithm that for any 0 <= \\epsilon <= 1 uses space O(n^{1+\\epsilon}) a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6906","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":"1304.6906","created_at":"2026-05-18T03:27:10.821032+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6906v1","created_at":"2026-05-18T03:27:10.821032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6906","created_at":"2026-05-18T03:27:10.821032+00:00"},{"alias_kind":"pith_short_12","alias_value":"GM5EY4DMQ2C6","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GM5EY4DMQ2C6AXUN","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GM5EY4DM","created_at":"2026-05-18T12:27:45.050594+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/GM5EY4DMQ2C6AXUNUXVWJVSVWZ","json":"https://pith.science/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ.json","graph_json":"https://pith.science/api/pith-number/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/graph.json","events_json":"https://pith.science/api/pith-number/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/events.json","paper":"https://pith.science/paper/GM5EY4DM"},"agent_actions":{"view_html":"https://pith.science/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ","download_json":"https://pith.science/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ.json","view_paper":"https://pith.science/paper/GM5EY4DM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6906&json=true","fetch_graph":"https://pith.science/api/pith-number/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/action/storage_attestation","attest_author":"https://pith.science/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/action/author_attestation","sign_citation":"https://pith.science/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/action/citation_signature","submit_replication":"https://pith.science/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/action/replication_record"}},"created_at":"2026-05-18T03:27:10.821032+00:00","updated_at":"2026-05-18T03:27:10.821032+00:00"}