{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NQNN5HYASQFYMCJLSWJ3QTWBOK","short_pith_number":"pith:NQNN5HYA","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"},"canonical_sha256":"6c1ade9f00940b86092b9593b84ec172be3b3e9592c6e3d4c7ae16987491112c","source":{"kind":"arxiv","id":"1604.07467","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07467","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07467v3","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07467","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"NQNN5HYASQFY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NQNN5HYASQFYMCJL","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NQNN5HYA","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NQNN5HYASQFYMCJLSWJ3QTWBOK","target":"record","payload":{"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"},"canonical_sha256":"6c1ade9f00940b86092b9593b84ec172be3b3e9592c6e3d4c7ae16987491112c","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"},"source_kind":"arxiv","source_id":"1604.07467","source_version":3,"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-18T01:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GbZwfcq2GJfnOvkevnnFDfJdYYJu+IQDctug/0jbh4PeceYHZM4giyIZW4qei1sBcrE9xKNyN7jxgZbNgC/MDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:53:27.956694Z"},"content_sha256":"1fda3fa7e0497bee855bbafa01c320414487ec934101d7e567eeaea382a1d932","schema_version":"1.0","event_id":"sha256:1fda3fa7e0497bee855bbafa01c320414487ec934101d7e567eeaea382a1d932"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NQNN5HYASQFYMCJLSWJ3QTWBOK","target":"graph","payload":{"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"},"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-18T01:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxfPkWLM3YOWAeh76xINffrZD08jN/UC28B4NpaXZJ8fn/HzzBJg2zBhAsyZrBXqll/sbuBsb7w9dW8Db+smAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:53:27.957037Z"},"content_sha256":"e54a0627fd071cdcc567fb58336e4777b115ba7fcac9fbf1fe4787525b8c433a","schema_version":"1.0","event_id":"sha256:e54a0627fd071cdcc567fb58336e4777b115ba7fcac9fbf1fe4787525b8c433a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK/bundle.json","state_url":"https://pith.science/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK/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-05-28T06:53:27Z","links":{"resolver":"https://pith.science/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK","bundle":"https://pith.science/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK/bundle.json","state":"https://pith.science/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQNN5HYASQFYMCJLSWJ3QTWBOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NQNN5HYASQFYMCJLSWJ3QTWBOK","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":"de21de8f89d5caba8126179675eb8b64ad598052abd987a9a1851c1b70b6ef4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-25T22:52:38Z","title_canon_sha256":"a2e36d4994a8f427ea3f10fbf8947d669375062b4a199b4056b214c2d40279c5"},"schema_version":"1.0","source":{"id":"1604.07467","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07467","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07467v3","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07467","created_at":"2026-05-18T01:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"NQNN5HYASQFY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NQNN5HYASQFYMCJL","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NQNN5HYA","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:e54a0627fd071cdcc567fb58336e4777b115ba7fcac9fbf1fe4787525b8c433a","target":"graph","created_at":"2026-05-18T01:06:20Z","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 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 ","authors_text":"Elena Grigorescu, Morteza Monemizadeh, Samson Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-25T22:52:38Z","title":"Estimating Weighted Matchings in $o(n)$ Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07467","kind":"arxiv","version":3},"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:1fda3fa7e0497bee855bbafa01c320414487ec934101d7e567eeaea382a1d932","target":"record","created_at":"2026-05-18T01:06:20Z","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":"de21de8f89d5caba8126179675eb8b64ad598052abd987a9a1851c1b70b6ef4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-25T22:52:38Z","title_canon_sha256":"a2e36d4994a8f427ea3f10fbf8947d669375062b4a199b4056b214c2d40279c5"},"schema_version":"1.0","source":{"id":"1604.07467","kind":"arxiv","version":3}},"canonical_sha256":"6c1ade9f00940b86092b9593b84ec172be3b3e9592c6e3d4c7ae16987491112c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c1ade9f00940b86092b9593b84ec172be3b3e9592c6e3d4c7ae16987491112c","first_computed_at":"2026-05-18T01:06:20.699048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:20.699048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"88XBEashaMSx2uwnHEGPDtIp/QbsUE8SPEdACd1TaCLCLR493Y7NYGrC5p1O5sQKyYJurqVIyrThyHsu0YZHAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:20.699644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07467","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fda3fa7e0497bee855bbafa01c320414487ec934101d7e567eeaea382a1d932","sha256:e54a0627fd071cdcc567fb58336e4777b115ba7fcac9fbf1fe4787525b8c433a"],"state_sha256":"82161dde9c60aeb2638c9a311a855d9adbbf15d2a4b4f8c6849ffce7700a7bb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GzoUtXC3YEWKQq+2dAE181d7WGkku4oxnbfT8JSx21yJVQMicRCwb+VUwoKnQPqAKLeV5RUwJRFiAaAe9S5FCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:53:27.959057Z","bundle_sha256":"b7bceea23e655637befd5e930a45bd36d5f198b027b7372d992789f4a0b15dcc"}}