{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RRK5J4LYS2YAI5UOKDESXVYG6V","short_pith_number":"pith:RRK5J4LY","canonical_record":{"source":{"id":"1608.01487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T10:33:53Z","cross_cats_sorted":[],"title_canon_sha256":"ce81d0e8b7ff152da15c71cf3211e4a10ade62049acc9dd1ddda067714fe499f","abstract_canon_sha256":"3d7714ee107fade9c32812ecb0724ec46c4fc01264c0b7fa048a410f28fcd89f"},"schema_version":"1.0"},"canonical_sha256":"8c55d4f17896b004768e50c92bd706f57bac06ec397847cce2344d7c3f2e9c68","source":{"kind":"arxiv","id":"1608.01487","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01487","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01487v2","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01487","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"pith_short_12","alias_value":"RRK5J4LYS2YA","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RRK5J4LYS2YAI5UO","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RRK5J4LY","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RRK5J4LYS2YAI5UOKDESXVYG6V","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T10:33:53Z","cross_cats_sorted":[],"title_canon_sha256":"ce81d0e8b7ff152da15c71cf3211e4a10ade62049acc9dd1ddda067714fe499f","abstract_canon_sha256":"3d7714ee107fade9c32812ecb0724ec46c4fc01264c0b7fa048a410f28fcd89f"},"schema_version":"1.0"},"canonical_sha256":"8c55d4f17896b004768e50c92bd706f57bac06ec397847cce2344d7c3f2e9c68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:19.743592Z","signature_b64":"oDyqwCDB+S02LkeCwo69kNt5P12sB6IRFzu629acC1Niivyy+qPttqCFOQujdhvOGEREkcjPo+p5lUwCvyGODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c55d4f17896b004768e50c92bd706f57bac06ec397847cce2344d7c3f2e9c68","last_reissued_at":"2026-05-18T00:17:19.742789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:19.742789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01487","source_version":2,"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-18T00:17:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jj6b5muaPic+gqlT2WJa8tYXeBHZ7m3ltgRj5upSqFBQuwx6WE/ze8F/jYGGOn3tZ3GwTL96W6rAeZQFHfiyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:42:11.975360Z"},"content_sha256":"755628cf3fc81751fe62d3a95d598650bf5e881a6ba4c4dc30d1bb1a0831998b","schema_version":"1.0","event_id":"sha256:755628cf3fc81751fe62d3a95d598650bf5e881a6ba4c4dc30d1bb1a0831998b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RRK5J4LYS2YAI5UOKDESXVYG6V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Streaming Weighted Matchings: Optimal Meets Greedy","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-08-04T10:33:53Z","abstract_excerpt":"We consider the problem of approximating a maximum weighted matching, when the edges of an underlying weighted graph $G(V,E)$ are revealed in a streaming fashion. We analyze a variant of the previously best-known $(4+\\epsilon)$-approximation algorithm due to Crouch and Stubbs (APPROX, 2014), and prove their conjecture that it achieves a tight approximation factor of $3.5+\\epsilon$.\n  The algorithm splits the stream into substreams on which it runs a greedy maximum matching algorithm. At the end of the stream, the selected edges are given as input to an optimal maximum weighted matching algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01487","kind":"arxiv","version":2},"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-18T00:17:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBdDnDW6ksbM+jP/vzi1fBxpOrylefoma2oEyNLIZqf2JSDpIskvN4Bh8SIYLNRSjisp7HYhkjGMhYn2NxUQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:42:11.976107Z"},"content_sha256":"868529203c88b87de46d69a1e8ddcdd82cc7191cf973be46f8c09c0117b2d65b","schema_version":"1.0","event_id":"sha256:868529203c88b87de46d69a1e8ddcdd82cc7191cf973be46f8c09c0117b2d65b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRK5J4LYS2YAI5UOKDESXVYG6V/bundle.json","state_url":"https://pith.science/pith/RRK5J4LYS2YAI5UOKDESXVYG6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRK5J4LYS2YAI5UOKDESXVYG6V/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-12T02:42:11Z","links":{"resolver":"https://pith.science/pith/RRK5J4LYS2YAI5UOKDESXVYG6V","bundle":"https://pith.science/pith/RRK5J4LYS2YAI5UOKDESXVYG6V/bundle.json","state":"https://pith.science/pith/RRK5J4LYS2YAI5UOKDESXVYG6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRK5J4LYS2YAI5UOKDESXVYG6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RRK5J4LYS2YAI5UOKDESXVYG6V","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":"3d7714ee107fade9c32812ecb0724ec46c4fc01264c0b7fa048a410f28fcd89f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T10:33:53Z","title_canon_sha256":"ce81d0e8b7ff152da15c71cf3211e4a10ade62049acc9dd1ddda067714fe499f"},"schema_version":"1.0","source":{"id":"1608.01487","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01487","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01487v2","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01487","created_at":"2026-05-18T00:17:19Z"},{"alias_kind":"pith_short_12","alias_value":"RRK5J4LYS2YA","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RRK5J4LYS2YAI5UO","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RRK5J4LY","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:868529203c88b87de46d69a1e8ddcdd82cc7191cf973be46f8c09c0117b2d65b","target":"graph","created_at":"2026-05-18T00:17:19Z","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 approximating a maximum weighted matching, when the edges of an underlying weighted graph $G(V,E)$ are revealed in a streaming fashion. We analyze a variant of the previously best-known $(4+\\epsilon)$-approximation algorithm due to Crouch and Stubbs (APPROX, 2014), and prove their conjecture that it achieves a tight approximation factor of $3.5+\\epsilon$.\n  The algorithm splits the stream into substreams on which it runs a greedy maximum matching algorithm. At the end of the stream, the selected edges are given as input to an optimal maximum weighted matching algorit","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-08-04T10:33:53Z","title":"Streaming Weighted Matchings: Optimal Meets Greedy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01487","kind":"arxiv","version":2},"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:755628cf3fc81751fe62d3a95d598650bf5e881a6ba4c4dc30d1bb1a0831998b","target":"record","created_at":"2026-05-18T00:17:19Z","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":"3d7714ee107fade9c32812ecb0724ec46c4fc01264c0b7fa048a410f28fcd89f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T10:33:53Z","title_canon_sha256":"ce81d0e8b7ff152da15c71cf3211e4a10ade62049acc9dd1ddda067714fe499f"},"schema_version":"1.0","source":{"id":"1608.01487","kind":"arxiv","version":2}},"canonical_sha256":"8c55d4f17896b004768e50c92bd706f57bac06ec397847cce2344d7c3f2e9c68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c55d4f17896b004768e50c92bd706f57bac06ec397847cce2344d7c3f2e9c68","first_computed_at":"2026-05-18T00:17:19.742789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:19.742789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oDyqwCDB+S02LkeCwo69kNt5P12sB6IRFzu629acC1Niivyy+qPttqCFOQujdhvOGEREkcjPo+p5lUwCvyGODw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:19.743592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01487","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:755628cf3fc81751fe62d3a95d598650bf5e881a6ba4c4dc30d1bb1a0831998b","sha256:868529203c88b87de46d69a1e8ddcdd82cc7191cf973be46f8c09c0117b2d65b"],"state_sha256":"89b35ad555bc3ac4480a7e262af74a2ba1b0078fb4784a42f6d01543ed463679"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hc68qiLs/wPhBgRmFpaIi+OE7Gk6DL6OzyE4gMH0QiUcM9NUt14sUGZUks86C93lYCvEwxRlWATmWoou6fpXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:42:11.980003Z","bundle_sha256":"754f523acad0bf04d1136bcbfd87c143cbe72e24efe1bb12b45a4ab359be26c1"}}