Pith Number

pith:IKH4TABW

pith:2026:IKH4TABW5ZGW5TFRIWJII7RJP5

not attested not anchored not stored refs resolved

Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order

Moran Feldman, Niv Buchbinder, Sherry Sarkar, Siyue Liu

Random arrival order enables semi-streaming algorithms to achieve better approximations than adversarial order for submodular maximization under matroid constraints.

arxiv:2605.14296 v1 · 2026-05-14 · cs.DS

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{IKH4TABW5ZGW5TFRIWJII7RJP5}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest 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.

C2weakest 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.

C3one 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.

References

300 extracted · 300 resolved · 5 Pith anchors

[1] Niv Buchbinder and Moran Feldman , title =

[2] Nguyen and Andrew Suh , title =

[3] Streaming Submodular Maximization Under Matroid Constraints , booktitle = proc #

[4] The one-way communication complexity of submodular maximization with applications to streaming and robustness , booktitle = proc #

[5] Ehsan Kazemi and Marko Mitrovic and Morteza Zadimoghaddam and Silvio Lattanzi and Amin Karbasi , title =

Receipt and verification

First computed	2026-05-17T23:39:10.148143Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

428fc98036ee4d6eccb14592847e297f4d8a183c8835dd495e66480e0c1ed89e

Aliases

arxiv: 2605.14296 · arxiv_version: 2605.14296v1 · doi: 10.48550/arxiv.2605.14296 · pith_short_12: IKH4TABW5ZGW · pith_short_16: IKH4TABW5ZGW5TFR · pith_short_8: IKH4TABW

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/IKH4TABW5ZGW5TFRIWJII7RJP5 \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 428fc98036ee4d6eccb14592847e297f4d8a183c8835dd495e66480e0c1ed89e

Canonical record JSON

{
  "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
  }
}