{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:MALWILY3BB3ZCHXA2PHNZ3WMPU","short_pith_number":"pith:MALWILY3","canonical_record":{"source":{"id":"0907.0305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-02T08:11:22Z","cross_cats_sorted":[],"title_canon_sha256":"5f0a3a7f743a7ec167abd5a9557651303b259d5a0da2dfaabc59d9ee3cf715a8","abstract_canon_sha256":"b8443074ad2a6c03ed084d93df64ff57815c6d12d9bd02994129514a544fb411"},"schema_version":"1.0"},"canonical_sha256":"6017642f1b0877911ee0d3cedceecc7d1dc4bedf66dfc6f1310651d15621c467","source":{"kind":"arxiv","id":"0907.0305","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.0305","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"0907.0305v1","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.0305","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"MALWILY3BB3Z","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"MALWILY3BB3ZCHXA","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"MALWILY3","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:MALWILY3BB3ZCHXA2PHNZ3WMPU","target":"record","payload":{"canonical_record":{"source":{"id":"0907.0305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-02T08:11:22Z","cross_cats_sorted":[],"title_canon_sha256":"5f0a3a7f743a7ec167abd5a9557651303b259d5a0da2dfaabc59d9ee3cf715a8","abstract_canon_sha256":"b8443074ad2a6c03ed084d93df64ff57815c6d12d9bd02994129514a544fb411"},"schema_version":"1.0"},"canonical_sha256":"6017642f1b0877911ee0d3cedceecc7d1dc4bedf66dfc6f1310651d15621c467","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:15.333669Z","signature_b64":"vzUzqOS9hnK46rxDYnnOr1vsUKeAKbRb0VXGFNB3FRm7zXQzgIfTr3ebkWcdYnX4EKg+Qh56VEGzUiXtTUS4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6017642f1b0877911ee0d3cedceecc7d1dc4bedf66dfc6f1310651d15621c467","last_reissued_at":"2026-05-18T04:02:15.333071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:15.333071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0907.0305","source_version":1,"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-18T04:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PiFD9/7xbuvIEMtaeSlW/TuK2ZNNny9q126BVf0U/EcAG8BsSC/2jZZ743TW+paOfAZfpJxm70QBMaXuSCTkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:44:57.195415Z"},"content_sha256":"e97c74b71a653217c5060e600ec53ab28a64663bb9aa80b86c23bbc92c6e05a6","schema_version":"1.0","event_id":"sha256:e97c74b71a653217c5060e600ec53ab28a64663bb9aa80b86c23bbc92c6e05a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:MALWILY3BB3ZCHXA2PHNZ3WMPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved approximation guarantees for weighted matching in the semi-streaming model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asaf Levin, Danny Segev, Julian Mestre, Leah Epstein","submitted_at":"2009-07-02T08:11:22Z","abstract_excerpt":"We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. of STACS2008, pages 669-680) by devising a deterministic approach whose performance guarantee is 4.91+epsilon. In addition, we study preemptive online algorithms, a sub-class of one-pass algorithms where we are only allowed to maintain a feasible matching in memory at any point in time. All known results prior to Zelke's belong to this sub-class. We provide a lower bound of 4.967 on the competitive ratio of any such deterministic algorithm, and henc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.0305","kind":"arxiv","version":1},"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-18T04:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kT/d3VLxRK3+LM0O/+ftAREvaDlb6E4IV8ZGVhCl/BrBYaYLW6QfnS/dW7Fy7K3GGcXwlUAqCJJRRBTmSxt8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:44:57.195766Z"},"content_sha256":"a3622cbb9191d20731a3393aa836f197328e362fc3f1505db97285254425e2bf","schema_version":"1.0","event_id":"sha256:a3622cbb9191d20731a3393aa836f197328e362fc3f1505db97285254425e2bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MALWILY3BB3ZCHXA2PHNZ3WMPU/bundle.json","state_url":"https://pith.science/pith/MALWILY3BB3ZCHXA2PHNZ3WMPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MALWILY3BB3ZCHXA2PHNZ3WMPU/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-01T02:44:57Z","links":{"resolver":"https://pith.science/pith/MALWILY3BB3ZCHXA2PHNZ3WMPU","bundle":"https://pith.science/pith/MALWILY3BB3ZCHXA2PHNZ3WMPU/bundle.json","state":"https://pith.science/pith/MALWILY3BB3ZCHXA2PHNZ3WMPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MALWILY3BB3ZCHXA2PHNZ3WMPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:MALWILY3BB3ZCHXA2PHNZ3WMPU","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":"b8443074ad2a6c03ed084d93df64ff57815c6d12d9bd02994129514a544fb411","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-02T08:11:22Z","title_canon_sha256":"5f0a3a7f743a7ec167abd5a9557651303b259d5a0da2dfaabc59d9ee3cf715a8"},"schema_version":"1.0","source":{"id":"0907.0305","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.0305","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"0907.0305v1","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.0305","created_at":"2026-05-18T04:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"MALWILY3BB3Z","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"MALWILY3BB3ZCHXA","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"MALWILY3","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:a3622cbb9191d20731a3393aa836f197328e362fc3f1505db97285254425e2bf","target":"graph","created_at":"2026-05-18T04:02:15Z","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 study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. of STACS2008, pages 669-680) by devising a deterministic approach whose performance guarantee is 4.91+epsilon. In addition, we study preemptive online algorithms, a sub-class of one-pass algorithms where we are only allowed to maintain a feasible matching in memory at any point in time. All known results prior to Zelke's belong to this sub-class. We provide a lower bound of 4.967 on the competitive ratio of any such deterministic algorithm, and henc","authors_text":"Asaf Levin, Danny Segev, Julian Mestre, Leah Epstein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-02T08:11:22Z","title":"Improved approximation guarantees for weighted matching in the semi-streaming model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.0305","kind":"arxiv","version":1},"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:e97c74b71a653217c5060e600ec53ab28a64663bb9aa80b86c23bbc92c6e05a6","target":"record","created_at":"2026-05-18T04:02:15Z","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":"b8443074ad2a6c03ed084d93df64ff57815c6d12d9bd02994129514a544fb411","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-02T08:11:22Z","title_canon_sha256":"5f0a3a7f743a7ec167abd5a9557651303b259d5a0da2dfaabc59d9ee3cf715a8"},"schema_version":"1.0","source":{"id":"0907.0305","kind":"arxiv","version":1}},"canonical_sha256":"6017642f1b0877911ee0d3cedceecc7d1dc4bedf66dfc6f1310651d15621c467","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6017642f1b0877911ee0d3cedceecc7d1dc4bedf66dfc6f1310651d15621c467","first_computed_at":"2026-05-18T04:02:15.333071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:15.333071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vzUzqOS9hnK46rxDYnnOr1vsUKeAKbRb0VXGFNB3FRm7zXQzgIfTr3ebkWcdYnX4EKg+Qh56VEGzUiXtTUS4Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:15.333669Z","signed_message":"canonical_sha256_bytes"},"source_id":"0907.0305","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e97c74b71a653217c5060e600ec53ab28a64663bb9aa80b86c23bbc92c6e05a6","sha256:a3622cbb9191d20731a3393aa836f197328e362fc3f1505db97285254425e2bf"],"state_sha256":"a827736be5aae67f5f194294adf27af607abc21f0189beb572ef4633f3bdad1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v/Tnko5NjC7MY3GoYLDzW3nJ0QUYdiP7M1UEee8sCr+JekvC78BXrUKJhp/lYanlOqd3MJm+I33vD/nqGCpMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:44:57.197851Z","bundle_sha256":"e1b5824b95d715f32f795841b70d63f70552fbf3ad219ad4803d55c3bdf3ff7f"}}