{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KB6ZTOEO744IXDJ3WWPS3CRL6P","short_pith_number":"pith:KB6ZTOEO","schema_version":"1.0","canonical_sha256":"507d99b88eff388b8d3bb59f2d8a2bf3f56ee64bfca0323dfa67556a0e4ab797","source":{"kind":"arxiv","id":"1701.03730","version":3},"attestation_state":"computed","paper":{"title":"Simplified and Space-Optimal Semi-Streaming for $(2+\\epsilon)$-Approximate Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Wajc, Mohsen Ghaffari","submitted_at":"2017-01-13T17:02:05Z","abstract_excerpt":"In a recent breakthrough, Paz and Schwartzman (SODA'17) presented a single-pass ($2+\\epsilon$)-approximation algorithm for the maximum weight matching problem in the semi-streaming model. Their algorithm uses $O(n\\log^2 n)$ bits of space, for any constant $\\epsilon>0$.\n  We present two simplified and more intuitive analyses, for essentially the same algorithm, which also improve the space complexity to the optimal bound of $O(n\\log n)$ bits --- this is optimal as the output matching requires $\\Omega(n\\log n)$ bits. Our analyses rely on a simple use of the primal-dual method and a simple accoun"},"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":"1701.03730","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-13T17:02:05Z","cross_cats_sorted":[],"title_canon_sha256":"d5c71ec2bdd63af66f51cc4a0e4944d2167dd1f0f29cb53e69fdc8d29a19a9a7","abstract_canon_sha256":"3aef210bc622c9e015948debf0ae06737025130acb763d19b612ea4e3cf7b95a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:15.862408Z","signature_b64":"wnhYVnEg0BbzNx2l/DsxAIpFdiXpbN5DPl0Woel8Mlpc+ZuRHQoOSJSmoOju/LCE1yn+MgOxZxp4z0jpu1YLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"507d99b88eff388b8d3bb59f2d8a2bf3f56ee64bfca0323dfa67556a0e4ab797","last_reissued_at":"2026-05-17T23:57:15.862034Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:15.862034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplified and Space-Optimal Semi-Streaming for $(2+\\epsilon)$-Approximate Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Wajc, Mohsen Ghaffari","submitted_at":"2017-01-13T17:02:05Z","abstract_excerpt":"In a recent breakthrough, Paz and Schwartzman (SODA'17) presented a single-pass ($2+\\epsilon$)-approximation algorithm for the maximum weight matching problem in the semi-streaming model. Their algorithm uses $O(n\\log^2 n)$ bits of space, for any constant $\\epsilon>0$.\n  We present two simplified and more intuitive analyses, for essentially the same algorithm, which also improve the space complexity to the optimal bound of $O(n\\log n)$ bits --- this is optimal as the output matching requires $\\Omega(n\\log n)$ bits. Our analyses rely on a simple use of the primal-dual method and a simple accoun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03730","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":"1701.03730","created_at":"2026-05-17T23:57:15.862090+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03730v3","created_at":"2026-05-17T23:57:15.862090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03730","created_at":"2026-05-17T23:57:15.862090+00:00"},{"alias_kind":"pith_short_12","alias_value":"KB6ZTOEO744I","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KB6ZTOEO744IXDJ3","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KB6ZTOEO","created_at":"2026-05-18T12:31:24.725408+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/KB6ZTOEO744IXDJ3WWPS3CRL6P","json":"https://pith.science/pith/KB6ZTOEO744IXDJ3WWPS3CRL6P.json","graph_json":"https://pith.science/api/pith-number/KB6ZTOEO744IXDJ3WWPS3CRL6P/graph.json","events_json":"https://pith.science/api/pith-number/KB6ZTOEO744IXDJ3WWPS3CRL6P/events.json","paper":"https://pith.science/paper/KB6ZTOEO"},"agent_actions":{"view_html":"https://pith.science/pith/KB6ZTOEO744IXDJ3WWPS3CRL6P","download_json":"https://pith.science/pith/KB6ZTOEO744IXDJ3WWPS3CRL6P.json","view_paper":"https://pith.science/paper/KB6ZTOEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03730&json=true","fetch_graph":"https://pith.science/api/pith-number/KB6ZTOEO744IXDJ3WWPS3CRL6P/graph.json","fetch_events":"https://pith.science/api/pith-number/KB6ZTOEO744IXDJ3WWPS3CRL6P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KB6ZTOEO744IXDJ3WWPS3CRL6P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KB6ZTOEO744IXDJ3WWPS3CRL6P/action/storage_attestation","attest_author":"https://pith.science/pith/KB6ZTOEO744IXDJ3WWPS3CRL6P/action/author_attestation","sign_citation":"https://pith.science/pith/KB6ZTOEO744IXDJ3WWPS3CRL6P/action/citation_signature","submit_replication":"https://pith.science/pith/KB6ZTOEO744IXDJ3WWPS3CRL6P/action/replication_record"}},"created_at":"2026-05-17T23:57:15.862090+00:00","updated_at":"2026-05-17T23:57:15.862090+00:00"}