{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GM5EY4DMQ2C6AXUNUXVWJVSVWZ","short_pith_number":"pith:GM5EY4DM","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"},"canonical_sha256":"333a4c706c8685e05e8da5eb64d655b64cdabd1c24e36454ea3bc306b60bfaf5","source":{"kind":"arxiv","id":"1304.6906","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6906","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6906v1","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6906","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"pith_short_12","alias_value":"GM5EY4DMQ2C6","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GM5EY4DMQ2C6AXUN","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GM5EY4DM","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GM5EY4DMQ2C6AXUNUXVWJVSVWZ","target":"record","payload":{"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"},"canonical_sha256":"333a4c706c8685e05e8da5eb64d655b64cdabd1c24e36454ea3bc306b60bfaf5","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"},"source_kind":"arxiv","source_id":"1304.6906","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:27:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vG6vZ0urAQAaZYBuVTyGg4mGQrBjKEY7F7XIBhiB3z189Nc1Zvk5+bCJ8zttg3N/jyrcFHlPyeqaylnlkvveAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:31:33.181143Z"},"content_sha256":"c37b6f3da642d986004837b512846101dc7260a327cccf2377a569d9e46c3b96","schema_version":"1.0","event_id":"sha256:c37b6f3da642d986004837b512846101dc7260a327cccf2377a569d9e46c3b96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GM5EY4DMQ2C6AXUNUXVWJVSVWZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:27:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIzREX+4a1K+QSqU8ipYD/QplXG0pZQLFOb32Dh3sUksjjIWSKr2cUExjTYnh//ue33p46A1+zN0+WGtUO3iDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:31:33.181504Z"},"content_sha256":"2afda72f2b7b42da89ac325aeb4061fd19f4b32fb11baa994bc87c0d8c635536","schema_version":"1.0","event_id":"sha256:2afda72f2b7b42da89ac325aeb4061fd19f4b32fb11baa994bc87c0d8c635536"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/bundle.json","state_url":"https://pith.science/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T20:31:33Z","links":{"resolver":"https://pith.science/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ","bundle":"https://pith.science/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/bundle.json","state":"https://pith.science/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GM5EY4DMQ2C6AXUNUXVWJVSVWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GM5EY4DMQ2C6AXUNUXVWJVSVWZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bedb7a3f2aad7a3d91e6cefe98a00f3c9207e38dedc938d10e7722739e91dd6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-25T13:34:46Z","title_canon_sha256":"4a9f22f2a9479898dfa3e2b2a442dc64ddd041b5e2ba0e09e25a4913d809aa52"},"schema_version":"1.0","source":{"id":"1304.6906","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6906","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6906v1","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6906","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"pith_short_12","alias_value":"GM5EY4DMQ2C6","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GM5EY4DMQ2C6AXUN","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GM5EY4DM","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:2afda72f2b7b42da89ac325aeb4061fd19f4b32fb11baa994bc87c0d8c635536","target":"graph","created_at":"2026-05-18T03:27:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Adi Ros\\'en, Christian Konrad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-25T13:34:46Z","title":"Approximating Semi-Matchings in Streaming and in Two-Party Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6906","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c37b6f3da642d986004837b512846101dc7260a327cccf2377a569d9e46c3b96","target":"record","created_at":"2026-05-18T03:27:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bedb7a3f2aad7a3d91e6cefe98a00f3c9207e38dedc938d10e7722739e91dd6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-25T13:34:46Z","title_canon_sha256":"4a9f22f2a9479898dfa3e2b2a442dc64ddd041b5e2ba0e09e25a4913d809aa52"},"schema_version":"1.0","source":{"id":"1304.6906","kind":"arxiv","version":1}},"canonical_sha256":"333a4c706c8685e05e8da5eb64d655b64cdabd1c24e36454ea3bc306b60bfaf5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"333a4c706c8685e05e8da5eb64d655b64cdabd1c24e36454ea3bc306b60bfaf5","first_computed_at":"2026-05-18T03:27:10.820913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:10.820913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3BNYAaa6l9RILkg48oTfUUOLmCGyZ6Ejmu2LF+qe0yqPoVLmzruGf9ycGQrxQfCyG9K2Sybk+E6p+BlT8qQqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:10.821646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6906","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c37b6f3da642d986004837b512846101dc7260a327cccf2377a569d9e46c3b96","sha256:2afda72f2b7b42da89ac325aeb4061fd19f4b32fb11baa994bc87c0d8c635536"],"state_sha256":"c75f9cb84edd3a8b8365f61f0d75c30445767a38dd78cbf07536485a2807c342"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pwDqJKkrNbzoekHGQYkKh8QKO2le6DmOOUf1/OcIdDDqbUyCJLdb0zIbL3JEGVEVeO7H0F9+9Ws2xtratp4aCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:31:33.183455Z","bundle_sha256":"a3b8e467a7fb392e3eb8c2475f2e0301e69f6e10d7e23b3aea10ec70aca9e1a5"}}