{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5Q3UKINDI7J3VFZSLD4OGQKZ7M","short_pith_number":"pith:5Q3UKIND","schema_version":"1.0","canonical_sha256":"ec374521a347d3ba973258f8e34159fb3d576b5a74f81eb449b43d004d89bbb5","source":{"kind":"arxiv","id":"1702.02559","version":3},"attestation_state":"computed","paper":{"title":"Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sagar Kale, Sumedh Tirodkar","submitted_at":"2017-02-08T18:48:02Z","abstract_excerpt":"We consider the maximum matching problem in the semi-streaming model formalized by Feigenbaum, Kannan, McGregor, Suri, and Zhang that is inspired by giant graphs of today. As our main result, we give a two-pass $(1/2 + 1/16)$-approximation algorithm for triangle-free graphs and a two-pass $(1/2 + 1/32)$-approximation algorithm for general graphs; these improve the approximation ratios of $1/2 + 1/52$ for bipartite graphs and $1/2 + 1/140$ for general graphs by Konrad, Magniez, and Mathieu. In three passes, we achieve approximation ratios of $1/2 + 1/10$ for triangle-free graphs and $1/2 + 1/19"},"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":"1702.02559","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-08T18:48:02Z","cross_cats_sorted":[],"title_canon_sha256":"9c494594f538ab2e8480989b944d7e73feca9bb65d8613c5749c4d272df0dde4","abstract_canon_sha256":"6657561951c0dec05d2aa8d460d37964ef51c61c609d218114f0e8b76ac171b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:00.378940Z","signature_b64":"RjHU8eJPAXmM6M2KxqIiESEo0pXD0P6bx7l/0WWf3bXhQ6BEFlMqZ9upyP1Gr+rU5LNg3yLlbGGzrIvfR1SbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec374521a347d3ba973258f8e34159fb3d576b5a74f81eb449b43d004d89bbb5","last_reissued_at":"2026-05-18T00:46:00.378258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:00.378258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sagar Kale, Sumedh Tirodkar","submitted_at":"2017-02-08T18:48:02Z","abstract_excerpt":"We consider the maximum matching problem in the semi-streaming model formalized by Feigenbaum, Kannan, McGregor, Suri, and Zhang that is inspired by giant graphs of today. As our main result, we give a two-pass $(1/2 + 1/16)$-approximation algorithm for triangle-free graphs and a two-pass $(1/2 + 1/32)$-approximation algorithm for general graphs; these improve the approximation ratios of $1/2 + 1/52$ for bipartite graphs and $1/2 + 1/140$ for general graphs by Konrad, Magniez, and Mathieu. In three passes, we achieve approximation ratios of $1/2 + 1/10$ for triangle-free graphs and $1/2 + 1/19"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02559","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":"1702.02559","created_at":"2026-05-18T00:46:00.378349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02559v3","created_at":"2026-05-18T00:46:00.378349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02559","created_at":"2026-05-18T00:46:00.378349+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Q3UKINDI7J3","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Q3UKINDI7J3VFZS","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Q3UKIND","created_at":"2026-05-18T12:31:00.734936+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/5Q3UKINDI7J3VFZSLD4OGQKZ7M","json":"https://pith.science/pith/5Q3UKINDI7J3VFZSLD4OGQKZ7M.json","graph_json":"https://pith.science/api/pith-number/5Q3UKINDI7J3VFZSLD4OGQKZ7M/graph.json","events_json":"https://pith.science/api/pith-number/5Q3UKINDI7J3VFZSLD4OGQKZ7M/events.json","paper":"https://pith.science/paper/5Q3UKIND"},"agent_actions":{"view_html":"https://pith.science/pith/5Q3UKINDI7J3VFZSLD4OGQKZ7M","download_json":"https://pith.science/pith/5Q3UKINDI7J3VFZSLD4OGQKZ7M.json","view_paper":"https://pith.science/paper/5Q3UKIND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02559&json=true","fetch_graph":"https://pith.science/api/pith-number/5Q3UKINDI7J3VFZSLD4OGQKZ7M/graph.json","fetch_events":"https://pith.science/api/pith-number/5Q3UKINDI7J3VFZSLD4OGQKZ7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Q3UKINDI7J3VFZSLD4OGQKZ7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Q3UKINDI7J3VFZSLD4OGQKZ7M/action/storage_attestation","attest_author":"https://pith.science/pith/5Q3UKINDI7J3VFZSLD4OGQKZ7M/action/author_attestation","sign_citation":"https://pith.science/pith/5Q3UKINDI7J3VFZSLD4OGQKZ7M/action/citation_signature","submit_replication":"https://pith.science/pith/5Q3UKINDI7J3VFZSLD4OGQKZ7M/action/replication_record"}},"created_at":"2026-05-18T00:46:00.378349+00:00","updated_at":"2026-05-18T00:46:00.378349+00:00"}