{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IKH4TABW5ZGW5TFRIWJII7RJP5","short_pith_number":"pith:IKH4TABW","schema_version":"1.0","canonical_sha256":"428fc98036ee4d6eccb14592847e297f4d8a183c8835dd495e66480e0c1ed89e","source":{"kind":"arxiv","id":"2605.14296","version":1},"attestation_state":"computed","paper":{"title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Random arrival order enables semi-streaming algorithms to achieve better approximations than adversarial order for submodular maximization under matroid constraints.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Moran Feldman, Niv Buchbinder, Sherry Sarkar, Siyue Liu","submitted_at":"2026-05-14T02:56:24Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.14296","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-14T02:56:24Z","cross_cats_sorted":[],"title_canon_sha256":"f5ed73728c46d99bfebdd2ce91e7ffd947252982e90a0fea663c2497e002af23","abstract_canon_sha256":"088bc56ce4b836a84d5dd58437d0e71fa92e6ea6013b50a1b9d211e4d8cbf501"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:10.148694Z","signature_b64":"5ohjIp2jNgmv4EWwquvuI5VK50gTDaHr8PLKESetrG5Wkd+S395IJ8WzYCR6hW4vFL4Xr48uoZW/CgjLbnRmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"428fc98036ee4d6eccb14592847e297f4d8a183c8835dd495e66480e0c1ed89e","last_reissued_at":"2026-05-17T23:39:10.148143Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:10.148143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Random arrival order enables semi-streaming algorithms to achieve better approximations than adversarial order for submodular maximization under matroid constraints.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Moran Feldman, Niv Buchbinder, Sherry Sarkar, Siyue Liu","submitted_at":"2026-05-14T02:56:24Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Random arrival order enables semi-streaming algorithms to achieve better approximations than adversarial order for submodular maximization under matroid constraints.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9b2546ba802fa50545abcf7e383854098ac57b20c9bffdbc25ee43b00b28bd9b"},"source":{"id":"2605.14296","kind":"arxiv","version":1},"verdict":{"id":"cecc6ee1-6e32-41e6-9e4b-33beac4055d8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:23:31.956116Z","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.","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","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.","pith_extraction_headline":"Random arrival order enables semi-streaming algorithms to achieve better approximations than adversarial order for submodular maximization under matroid constraints."},"references":{"count":300,"sample":[{"doi":"","year":null,"title":"Niv Buchbinder and Moran Feldman , title =","work_id":"fc7503c2-3352-411e-b422-686b5878967b","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Nguyen and Andrew Suh , title =","work_id":"9fea2415-e32f-441d-a430-9a3dc08e0102","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Streaming Submodular Maximization Under Matroid Constraints , booktitle = proc #","work_id":"1f156834-4622-4553-8dbe-b8c57f8ff598","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The one-way communication complexity of submodular maximization with applications to streaming and robustness , booktitle = proc #","work_id":"bb2df97c-30b5-4fc3-8eaa-878e9740541f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Ehsan Kazemi and Marko Mitrovic and Morteza Zadimoghaddam and Silvio Lattanzi and Amin Karbasi , title =","work_id":"0f77c598-fc77-425b-9815-d61b6abe6849","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":300,"snapshot_sha256":"314b437ae5b8a0a71749e8529f1a0bb008d177cbf35c144a9ecdb04183b119a5","internal_anchors":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.14296","created_at":"2026-05-17T23:39:10.148234+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14296v1","created_at":"2026-05-17T23:39:10.148234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14296","created_at":"2026-05-17T23:39:10.148234+00:00"},{"alias_kind":"pith_short_12","alias_value":"IKH4TABW5ZGW","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"IKH4TABW5ZGW5TFR","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"IKH4TABW","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IKH4TABW5ZGW5TFRIWJII7RJP5","json":"https://pith.science/pith/IKH4TABW5ZGW5TFRIWJII7RJP5.json","graph_json":"https://pith.science/api/pith-number/IKH4TABW5ZGW5TFRIWJII7RJP5/graph.json","events_json":"https://pith.science/api/pith-number/IKH4TABW5ZGW5TFRIWJII7RJP5/events.json","paper":"https://pith.science/paper/IKH4TABW"},"agent_actions":{"view_html":"https://pith.science/pith/IKH4TABW5ZGW5TFRIWJII7RJP5","download_json":"https://pith.science/pith/IKH4TABW5ZGW5TFRIWJII7RJP5.json","view_paper":"https://pith.science/paper/IKH4TABW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14296&json=true","fetch_graph":"https://pith.science/api/pith-number/IKH4TABW5ZGW5TFRIWJII7RJP5/graph.json","fetch_events":"https://pith.science/api/pith-number/IKH4TABW5ZGW5TFRIWJII7RJP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IKH4TABW5ZGW5TFRIWJII7RJP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IKH4TABW5ZGW5TFRIWJII7RJP5/action/storage_attestation","attest_author":"https://pith.science/pith/IKH4TABW5ZGW5TFRIWJII7RJP5/action/author_attestation","sign_citation":"https://pith.science/pith/IKH4TABW5ZGW5TFRIWJII7RJP5/action/citation_signature","submit_replication":"https://pith.science/pith/IKH4TABW5ZGW5TFRIWJII7RJP5/action/replication_record"}},"created_at":"2026-05-17T23:39:10.148234+00:00","updated_at":"2026-05-17T23:39:10.148234+00:00"}