{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IKH4TABW5ZGW5TFRIWJII7RJP5","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":"088bc56ce4b836a84d5dd58437d0e71fa92e6ea6013b50a1b9d211e4d8cbf501","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-14T02:56:24Z","title_canon_sha256":"f5ed73728c46d99bfebdd2ce91e7ffd947252982e90a0fea663c2497e002af23"},"schema_version":"1.0","source":{"id":"2605.14296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14296","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14296v1","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14296","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"IKH4TABW5ZGW","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"IKH4TABW5ZGW5TFR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"IKH4TABW","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:a11c901bb35c97e20b00594808bcb689176ca7da3868a417ded6ca4acf7c91ae","target":"graph","created_at":"2026-05-17T23:39:10Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For matroids our improved results show a separation between adversarial and random order semi-streaming algorithms, and exponentially improve the number of passes necessary for getting 1-1/e-ε approximation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The arrival order is drawn uniformly at random from all permutations; if the order is only approximately random or has hidden correlations the stated guarantees may not hold."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"New random-order semi-streaming algorithms improve approximation guarantees over adversarial-order results for submodular maximization under matroids and related constraints, with an exponential reduction in passes needed for near-optimal matroid results."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Random arrival order enables semi-streaming algorithms to achieve better approximations than adversarial order for submodular maximization under matroid constraints."}],"snapshot_sha256":"9b2546ba802fa50545abcf7e383854098ac57b20c9bffdbc25ee43b00b28bd9b"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study random order semi-streaming algorithms for submodular maximization under a wide range of combinatorial constraint classes, including matroids, matroid $p$-parity, $p$-exchange systems and $p$-systems. For most of these classes of constraints, our results are the first improvement over what is known to be achievable for adversarial order. For matroids, matching and $p$-matchoids, previous random order results were known, and we improve over some of these as well. In the case of matroids, our improved results show a separation between adversarial and random order semi-streaming algorith","authors_text":"Moran Feldman, Niv Buchbinder, Sherry Sarkar, Siyue Liu","cross_cats":[],"headline":"Random arrival order enables semi-streaming algorithms to achieve better approximations than adversarial order for submodular maximization under matroid constraints.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order"},"references":{"count":300,"internal_anchors":5,"resolved_work":300,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Niv Buchbinder and Moran Feldman , title =","work_id":"fc7503c2-3352-411e-b422-686b5878967b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Nguyen and Andrew Suh , title =","work_id":"9fea2415-e32f-441d-a430-9a3dc08e0102","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Streaming Submodular Maximization Under Matroid Constraints , booktitle = proc #","work_id":"1f156834-4622-4553-8dbe-b8c57f8ff598","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"The one-way communication complexity of submodular maximization with applications to streaming and robustness , booktitle = proc #","work_id":"bb2df97c-30b5-4fc3-8eaa-878e9740541f","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Ehsan Kazemi and Marko Mitrovic and Morteza Zadimoghaddam and Silvio Lattanzi and Amin Karbasi , title =","work_id":"0f77c598-fc77-425b-9815-d61b6abe6849","year":null}],"snapshot_sha256":"314b437ae5b8a0a71749e8529f1a0bb008d177cbf35c144a9ecdb04183b119a5"},"source":{"id":"2605.14296","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:23:31.956116Z","id":"cecc6ee1-6e32-41e6-9e4b-33beac4055d8","model_set":{"reader":"grok-4.3"},"one_line_summary":"New random-order semi-streaming algorithms improve approximation guarantees over adversarial-order results for submodular maximization under matroids and related constraints, with an exponential reduction in passes needed for near-optimal matroid results.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Random arrival order enables semi-streaming algorithms to achieve better approximations than adversarial order for submodular maximization under matroid constraints.","strongest_claim":"For matroids our improved results show a separation between adversarial and random order semi-streaming algorithms, and exponentially improve the number of passes necessary for getting 1-1/e-ε approximation.","weakest_assumption":"The arrival order is drawn uniformly at random from all permutations; if the order is only approximately random or has hidden correlations the stated guarantees may not hold."}},"verdict_id":"cecc6ee1-6e32-41e6-9e4b-33beac4055d8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cda502eba9d945047af34aa8ee9bffefa6581de9654867add8405be812b9d478","target":"record","created_at":"2026-05-17T23:39:10Z","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":"088bc56ce4b836a84d5dd58437d0e71fa92e6ea6013b50a1b9d211e4d8cbf501","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-14T02:56:24Z","title_canon_sha256":"f5ed73728c46d99bfebdd2ce91e7ffd947252982e90a0fea663c2497e002af23"},"schema_version":"1.0","source":{"id":"2605.14296","kind":"arxiv","version":1}},"canonical_sha256":"428fc98036ee4d6eccb14592847e297f4d8a183c8835dd495e66480e0c1ed89e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"428fc98036ee4d6eccb14592847e297f4d8a183c8835dd495e66480e0c1ed89e","first_computed_at":"2026-05-17T23:39:10.148143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:10.148143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ohjIp2jNgmv4EWwquvuI5VK50gTDaHr8PLKESetrG5Wkd+S395IJ8WzYCR6hW4vFL4Xr48uoZW/CgjLbnRmBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:10.148694Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cda502eba9d945047af34aa8ee9bffefa6581de9654867add8405be812b9d478","sha256:a11c901bb35c97e20b00594808bcb689176ca7da3868a417ded6ca4acf7c91ae"],"state_sha256":"fabe7c6fb853a085912169063454227c5140b6d7e96fa2ae3bb1136e00f95550"}