{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NQNN5HYASQFYMCJLSWJ3QTWBOK","short_pith_number":"pith:NQNN5HYA","schema_version":"1.0","canonical_sha256":"6c1ade9f00940b86092b9593b84ec172be3b3e9592c6e3d4c7ae16987491112c","source":{"kind":"arxiv","id":"1604.07467","version":3},"attestation_state":"computed","paper":{"title":"Estimating Weighted Matchings in $o(n)$ Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elena Grigorescu, Morteza Monemizadeh, Samson Zhou","submitted_at":"2016-04-25T22:52:38Z","abstract_excerpt":"We consider the problem of estimating the weight of a maximum weighted matching of a weighted graph $G(V,E)$ whose edges are revealed in a streaming fashion. We develop a reduction from the maximum weighted matching problem to the maximum cardinality matching problem that only doubles the approximation factor of a streaming algorithm developed for the maximum cardinality matching problem. Our results hold for the insertion-only and the dynamic (i.e, insertion and deletion) edge-arrival streaming models. The previous best-known reduction is due to Bury and Schwiegelshohn (ESA 2015) who develop "},"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":"1604.07467","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-25T22:52:38Z","cross_cats_sorted":[],"title_canon_sha256":"a2e36d4994a8f427ea3f10fbf8947d669375062b4a199b4056b214c2d40279c5","abstract_canon_sha256":"de21de8f89d5caba8126179675eb8b64ad598052abd987a9a1851c1b70b6ef4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:20.699644Z","signature_b64":"88XBEashaMSx2uwnHEGPDtIp/QbsUE8SPEdACd1TaCLCLR493Y7NYGrC5p1O5sQKyYJurqVIyrThyHsu0YZHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c1ade9f00940b86092b9593b84ec172be3b3e9592c6e3d4c7ae16987491112c","last_reissued_at":"2026-05-18T01:06:20.699048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:20.699048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating Weighted Matchings in $o(n)$ Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elena Grigorescu, Morteza Monemizadeh, Samson Zhou","submitted_at":"2016-04-25T22:52:38Z","abstract_excerpt":"We consider the problem of estimating the weight of a maximum weighted matching of a weighted graph $G(V,E)$ whose edges are revealed in a streaming fashion. We develop a reduction from the maximum weighted matching problem to the maximum cardinality matching problem that only doubles the approximation factor of a streaming algorithm developed for the maximum cardinality matching problem. Our results hold for the insertion-only and the dynamic (i.e, insertion and deletion) edge-arrival streaming models. The previous best-known reduction is due to Bury and Schwiegelshohn (ESA 2015) who develop "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07467","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":"1604.07467","created_at":"2026-05-18T01:06:20.699149+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07467v3","created_at":"2026-05-18T01:06:20.699149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07467","created_at":"2026-05-18T01:06:20.699149+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQNN5HYASQFY","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQNN5HYASQFYMCJL","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQNN5HYA","created_at":"2026-05-18T12:30:36.002864+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/NQNN5HYASQFYMCJLSWJ3QTWBOK","json":"https://pith.science/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK.json","graph_json":"https://pith.science/api/pith-number/NQNN5HYASQFYMCJLSWJ3QTWBOK/graph.json","events_json":"https://pith.science/api/pith-number/NQNN5HYASQFYMCJLSWJ3QTWBOK/events.json","paper":"https://pith.science/paper/NQNN5HYA"},"agent_actions":{"view_html":"https://pith.science/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK","download_json":"https://pith.science/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK.json","view_paper":"https://pith.science/paper/NQNN5HYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07467&json=true","fetch_graph":"https://pith.science/api/pith-number/NQNN5HYASQFYMCJLSWJ3QTWBOK/graph.json","fetch_events":"https://pith.science/api/pith-number/NQNN5HYASQFYMCJLSWJ3QTWBOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK/action/storage_attestation","attest_author":"https://pith.science/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK/action/author_attestation","sign_citation":"https://pith.science/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK/action/citation_signature","submit_replication":"https://pith.science/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK/action/replication_record"}},"created_at":"2026-05-18T01:06:20.699149+00:00","updated_at":"2026-05-18T01:06:20.699149+00:00"}