{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:T6RRQE3M2BRMM66454WMJZBM52","short_pith_number":"pith:T6RRQE3M","canonical_record":{"source":{"id":"2408.15434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-08-27T22:34:17Z","cross_cats_sorted":[],"title_canon_sha256":"35cabacb7f4de0650c3736f8352b4fab5a061abea8edb3be073ea8c3422bf05a","abstract_canon_sha256":"82c4eea81c2f17fab17124bc1e68c95628da447a5d3da156e925fe4251aa8ee2"},"schema_version":"1.0"},"canonical_sha256":"9fa318136cd062c67bdcef2cc4e42ceebf031df17d3281579096cbb7b9e11e08","source":{"kind":"arxiv","id":"2408.15434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.15434","created_at":"2026-07-05T09:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"2408.15434v1","created_at":"2026-07-05T09:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.15434","created_at":"2026-07-05T09:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"T6RRQE3M2BRM","created_at":"2026-07-05T09:00:11Z"},{"alias_kind":"pith_short_16","alias_value":"T6RRQE3M2BRMM664","created_at":"2026-07-05T09:00:11Z"},{"alias_kind":"pith_short_8","alias_value":"T6RRQE3M","created_at":"2026-07-05T09:00:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:T6RRQE3M2BRMM66454WMJZBM52","target":"record","payload":{"canonical_record":{"source":{"id":"2408.15434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-08-27T22:34:17Z","cross_cats_sorted":[],"title_canon_sha256":"35cabacb7f4de0650c3736f8352b4fab5a061abea8edb3be073ea8c3422bf05a","abstract_canon_sha256":"82c4eea81c2f17fab17124bc1e68c95628da447a5d3da156e925fe4251aa8ee2"},"schema_version":"1.0"},"canonical_sha256":"9fa318136cd062c67bdcef2cc4e42ceebf031df17d3281579096cbb7b9e11e08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:11.825475Z","signature_b64":"EyIsoWvopsetCor6cI9QRe8qhLliAg3Wpyvr2n0SQ7yMzbNzO6YE3GqFuxNjRXNoOJrzxqAjiEGSxisokpAlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fa318136cd062c67bdcef2cc4e42ceebf031df17d3281579096cbb7b9e11e08","last_reissued_at":"2026-07-05T09:00:11.824867Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:11.824867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.15434","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-07-05T09:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mZNMwgKdbgC+3fvuxigvyKE0/cbRLJAotIBebrrBmPdC9yKt68hHBho0TxehCAR13DAnBkTd6caAqVQTBZz1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:30:06.997167Z"},"content_sha256":"d525f3e5b834cf88d98bea6255603e350d66e255f0f780a1c2cbb4da5ac396b8","schema_version":"1.0","event_id":"sha256:d525f3e5b834cf88d98bea6255603e350d66e255f0f780a1c2cbb4da5ac396b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:T6RRQE3M2BRMM66454WMJZBM52","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weighted Matching in the Random-Order Streaming and Robust Communication Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Diba Hashemi, Weronika Wrzos-Kaminska","submitted_at":"2024-08-27T22:34:17Z","abstract_excerpt":"We study the maximum weight matching problem in the random-order semi-streaming model and in the robust communication model. Unlike many other sublinear models, in these two frameworks, there is a large gap between the guarantees of the best known algorithms for the unweighted and weighted versions of the problem.\n  In the random-order semi-streaming setting, the edges of an $n$-vertex graph arrive in a stream in a random order. The goal is to compute an approximate maximum weight matching with a single pass over the stream using $O(n\\text{ polylog } n)$ space. Our main result is a $(2/3-\\epsi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.15434","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.15434/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gpg0NZK1xvokglBuZC8KnBVnfOBTVfGs7dP2A3yUp2EGWv2N2G/KZnZXgWqfDCCLLy2+l2iWzsFwyyZKwLvnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:30:06.997700Z"},"content_sha256":"500ef09eb34830d8eb3b84a55ba7b24976a04b6e04ebaad169bd4eb782520104","schema_version":"1.0","event_id":"sha256:500ef09eb34830d8eb3b84a55ba7b24976a04b6e04ebaad169bd4eb782520104"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T6RRQE3M2BRMM66454WMJZBM52/bundle.json","state_url":"https://pith.science/pith/T6RRQE3M2BRMM66454WMJZBM52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T6RRQE3M2BRMM66454WMJZBM52/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-08-16T20:30:07Z","links":{"resolver":"https://pith.science/pith/T6RRQE3M2BRMM66454WMJZBM52","bundle":"https://pith.science/pith/T6RRQE3M2BRMM66454WMJZBM52/bundle.json","state":"https://pith.science/pith/T6RRQE3M2BRMM66454WMJZBM52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T6RRQE3M2BRMM66454WMJZBM52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:T6RRQE3M2BRMM66454WMJZBM52","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":"82c4eea81c2f17fab17124bc1e68c95628da447a5d3da156e925fe4251aa8ee2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-08-27T22:34:17Z","title_canon_sha256":"35cabacb7f4de0650c3736f8352b4fab5a061abea8edb3be073ea8c3422bf05a"},"schema_version":"1.0","source":{"id":"2408.15434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.15434","created_at":"2026-07-05T09:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"2408.15434v1","created_at":"2026-07-05T09:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.15434","created_at":"2026-07-05T09:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"T6RRQE3M2BRM","created_at":"2026-07-05T09:00:11Z"},{"alias_kind":"pith_short_16","alias_value":"T6RRQE3M2BRMM664","created_at":"2026-07-05T09:00:11Z"},{"alias_kind":"pith_short_8","alias_value":"T6RRQE3M","created_at":"2026-07-05T09:00:11Z"}],"graph_snapshots":[{"event_id":"sha256:500ef09eb34830d8eb3b84a55ba7b24976a04b6e04ebaad169bd4eb782520104","target":"graph","created_at":"2026-07-05T09:00:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.15434/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the maximum weight matching problem in the random-order semi-streaming model and in the robust communication model. Unlike many other sublinear models, in these two frameworks, there is a large gap between the guarantees of the best known algorithms for the unweighted and weighted versions of the problem.\n  In the random-order semi-streaming setting, the edges of an $n$-vertex graph arrive in a stream in a random order. The goal is to compute an approximate maximum weight matching with a single pass over the stream using $O(n\\text{ polylog } n)$ space. Our main result is a $(2/3-\\epsi","authors_text":"Diba Hashemi, Weronika Wrzos-Kaminska","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-08-27T22:34:17Z","title":"Weighted Matching in the Random-Order Streaming and Robust Communication Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.15434","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:d525f3e5b834cf88d98bea6255603e350d66e255f0f780a1c2cbb4da5ac396b8","target":"record","created_at":"2026-07-05T09:00:11Z","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":"82c4eea81c2f17fab17124bc1e68c95628da447a5d3da156e925fe4251aa8ee2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-08-27T22:34:17Z","title_canon_sha256":"35cabacb7f4de0650c3736f8352b4fab5a061abea8edb3be073ea8c3422bf05a"},"schema_version":"1.0","source":{"id":"2408.15434","kind":"arxiv","version":1}},"canonical_sha256":"9fa318136cd062c67bdcef2cc4e42ceebf031df17d3281579096cbb7b9e11e08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fa318136cd062c67bdcef2cc4e42ceebf031df17d3281579096cbb7b9e11e08","first_computed_at":"2026-07-05T09:00:11.824867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:00:11.824867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EyIsoWvopsetCor6cI9QRe8qhLliAg3Wpyvr2n0SQ7yMzbNzO6YE3GqFuxNjRXNoOJrzxqAjiEGSxisokpAlDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:00:11.825475Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.15434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d525f3e5b834cf88d98bea6255603e350d66e255f0f780a1c2cbb4da5ac396b8","sha256:500ef09eb34830d8eb3b84a55ba7b24976a04b6e04ebaad169bd4eb782520104"],"state_sha256":"8730229ec7f3e103ea8220ff4435eeda7b13d4bea2baf9bf2bebdb12992f58e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2q3yQbutIHV3Yjn4r+WZvfLHwg++ShnQgv96/C1VaF6WimWY63G/jSihnEmm3gwQh3j8xFCz6WnHUSb4NDOVAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T20:30:07.003240Z","bundle_sha256":"5d4ec3033d0394bb68108ea28d7605fc6eefbff14be0e8f52df640fa83fceab6"}}