{"as_of":"2026-08-01T01:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a8a24bc6e0028a9dc9e612c970d7a486e65e31b83f4eb1d1c6e299d6a3eb1e3a","coverage":[{"denominator":300,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T02:30:41.877918Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-07-31T06:34:12.847434+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.14296/citation-record","integrity":"/paper/2605.14296/integrity","json":"/paper/2605.14296/citation-record.json","paper":"/paper/2605.14296"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fc7503c2-3352-411e-b422-686b5878967b","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:cd8ea2ebb5e6bcfc11405a79d45db0b8ed45969862be383b8d3b94fea90a5317","observation_id":"1e9bae7e-8446-49f1-9a65-ab760d3a6b4c","resolution":{"observed_at":"2026-05-15T04:35:02.422358Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nguyen and Andrew Suh , title =","venue":null,"work_id":"9fea2415-e32f-441d-a430-9a3dc08e0102","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:a919ddbcb06f6807082ef4dad3830223a582c8926e5f9bc13826668ee81a5659","observation_id":"349212b0-3f5e-418c-b783-1ffca27a2576","resolution":{"observed_at":"2026-05-15T04:35:02.460646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Streaming Submodular Maximization Under Matroid Constraints , booktitle = proc #","venue":null,"work_id":"1f156834-4622-4553-8dbe-b8c57f8ff598","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:655a741681dcf820e7bfa0ae99b43f3abd1b4b83bb5846b092e9e1d70617e673","observation_id":"fb805e3c-470c-43d6-9a10-0601d4ff6bc8","resolution":{"observed_at":"2026-05-15T04:35:02.394651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The one-way communication complexity of submodular maximization with applications to streaming and robustness , booktitle = proc #","venue":null,"work_id":"bb2df97c-30b5-4fc3-8eaa-878e9740541f","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:b98429d1296ef372e39b3ebc5def9391c1076fb210e4ee4827dc2b3acad4ecc9","observation_id":"7e5296da-e0bd-49c7-b0a0-612734868d7e","resolution":{"observed_at":"2026-05-15T04:35:02.398631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0f77c598-fc77-425b-9815-d61b6abe6849","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:070285d973e93318c49f2053ca10c2008298d83174e0d151371583a34099ef04","observation_id":"c7e5d62f-6921-49ab-95e9-32409f33618d","resolution":{"observed_at":"2026-05-15T04:35:02.379953Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2013 , url =","venue":null,"work_id":"b1b300eb-0442-40d2-92fd-119e371ae51f","year":2013},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:a6647b59065203c60410b259f05f185a434d1fcf584975b8caccafd5efcdb721","observation_id":"505d0cc6-fb7c-4939-a107-4bf899426678","resolution":{"observed_at":"2026-05-15T04:35:02.413977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d3459bea-3eec-459b-b132-b692aa0a09b5","year":2020},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:ace75a432bba500dadae6403c017fe8deadffcd5628a8e9a14db17cab14036f2","observation_id":"a2bf7813-ec35-4614-9611-551273fbcc5c","resolution":{"observed_at":"2026-05-15T04:35:02.250674Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2018 , url =","venue":null,"work_id":"d7fb774d-1b48-44f0-a2f8-cd60730628c8","year":2018},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:4fbbf21584a3ec85fc6277ed946b92505c688a14fb599fa0145c3c1e60c16d39","observation_id":"e16a4ef6-9e0a-413f-b57a-0e27691a7b8c","resolution":{"observed_at":"2026-05-15T04:35:02.280225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d77705e2-a9d4-49b6-b15b-91ae4eeb86ce","year":2022},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:ea620352a366ff4b52a5e70a281ad8afa3fbe554757bba45bfc96e853e69aa41","observation_id":"c0c88a5f-b1f3-4ffa-9745-1f236a726fd9","resolution":{"observed_at":"2026-05-15T04:35:01.601558Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"aba88f12-30c2-4c23-8085-9ce00bbae182","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:aabf13c1fac9e298a1a60966c7384da0de7e3a5e4f07a68cf095e1c61b330929","observation_id":"9785d4c8-41a5-4ded-93b2-1a954164b792","resolution":{"observed_at":"2026-05-15T04:35:01.668965Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5d8eec7b-fbf1-40be-a50a-7e32a771ccc3","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:431281ba4391773d124ada49cc2f430f0de7a657ebd9a0b5aad0e8ecfaac4fd6","observation_id":"f369ae54-41fc-43ac-a190-8827d53922df","resolution":{"observed_at":"2026-05-15T04:35:02.198016Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5a3dfae4-2980-4b5a-8d40-5799c429b5d3","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:256af51adaf6367cbdeecfcedc8ad8043e07ba7cfd1d8851e90c906bddcd2f0d","observation_id":"bdac46b3-cf2e-4e50-b240-5bd104fb8095","resolution":{"observed_at":"2026-05-15T04:35:02.456829Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"173d0b31-2998-4a84-bafb-27123ac8e5ad","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:e27f60ed8973e0be1c34d1388158e61a0f91f8564ada06aebad01ac6c0135509","observation_id":"fed3c94a-abf4-45f5-987b-b5d45073c823","resolution":{"observed_at":"2026-05-15T04:35:01.331667Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SIGecom Exchanges , volume =","venue":null,"work_id":"04cf897f-2965-48c7-a9c5-36922bf48f9f","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:01c1768608f5ee3fe15fa63304ffb1502d18e07aeeb5d37345bd456cc6fad5a8","observation_id":"3e2a0972-6650-42a2-ac0a-3b3691284d5c","resolution":{"observed_at":"2026-05-15T04:35:02.493090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"602b8897-924b-47ae-b334-194747d136ae","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:98e31c908ba979538f8236aa8ef91c3c73253d7f242163f917f06b8a00f29aa4","observation_id":"678e4e44-c5a9-4291-8d13-4cea47d7cf9b","resolution":{"observed_at":"2026-05-15T04:35:01.552146Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Elenberg and Moran Feldman and Amin Karbasi , title =","venue":null,"work_id":"ea4b47f3-3658-44cb-b1e2-cc17b56e72c5","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:fdd6d8f0d4362022be4e5c53865ccf98064c7c97cc6a9f5ff29d1c4e55774e78","observation_id":"9def9041-15d7-4dbe-aaea-2d77b449126b","resolution":{"observed_at":"2026-05-15T04:35:02.372528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Primal-Dual Analysis of Monotone Submodular Maximization , journal =","venue":null,"work_id":"8c912d56-b157-46b0-a705-7b579843dc56","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:85ea232bc6e830613f944b6559fa1e1832b41f447640d811ff0e2b5f054ba5bd","observation_id":"eabe5d3d-182b-42f6-b978-57212033a291","resolution":{"observed_at":"2026-05-15T04:35:01.412174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f310e425-a5a5-4235-8c95-1a9ce1b97c11","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:4158740369f8536a48b52079ac000424496a58b04199fe02ada49fc3db4f1b5f","observation_id":"9da209ba-8c99-44fd-b71f-928eab31d867","resolution":{"observed_at":"2026-05-15T04:35:02.193608Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"eab94df4-6cde-4e55-9ce1-38fb232b7e37","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:fea082e0cbd4858afc5fd469254d91a433a54472b00e764a021b65fa04fa20c8","observation_id":"af95a575-8545-4d47-b4ec-30a2f396ca4e","resolution":{"observed_at":"2026-05-15T04:35:02.383649Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e855de12-8c50-4e49-84f0-696723b68552","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:6ffe75ba01dde6b4ef05d69bb8ff95e8b0e37d79a6efb3128d8bb0b1f49fbad8","observation_id":"c3fb70d8-fe2b-40cf-986e-ab393d6f3ef3","resolution":{"observed_at":"2026-05-15T04:35:02.387307Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"855bdc15-12f8-4622-aa34-eee2247649f2","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:a3bad17373f5fea6b57d5b5b1b6fbc66d021cd8052176c78f492ad8610a21194","observation_id":"a535319e-445a-4f11-ad2e-4c4576c74380","resolution":{"observed_at":"2026-05-15T04:35:02.376282Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b891986a-643e-4f8c-9bf0-f8a77a1330dd","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:542f73663069bbc9cad4e7313ec9f863f2e0779383870cc29843dbe73b10265d","observation_id":"ba71471e-48bb-4153-b15f-595f32156179","resolution":{"observed_at":"2026-05-15T04:35:02.390554Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"1078d7f5-1f39-4a2c-9694-92e81aec2891","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:6b4552f033f62b9cc4de5e144114c8de36312b6e2b475be6046a8ad77f142b5e","observation_id":"10a116de-491a-4a9d-9b7d-c241cc051502","resolution":{"observed_at":"2026-05-15T04:35:02.418551Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"08cfca50-e211-4f7f-9cb3-13eaf950a0ea","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:445b04f53165d811bbc35c407877ae3a4f07dfb2530e6a1af89c3c1bab22be35","observation_id":"02d775c2-49c5-464f-af54-9e6cc504b944","resolution":{"observed_at":"2026-05-15T04:35:02.341229Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"da84c5a5-ccf9-47b9-8cc4-287c05bd072e","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:0d7f21f42972b3168c84691887e6a86ec9921d58fdcbdf58ee0a5c51b0760c73","observation_id":"8c523b0e-4eef-4f74-901d-97ec3b3d816f","resolution":{"observed_at":"2026-05-15T04:35:02.215673Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17679","last_updated":"2025-05-07T10:37:14Z","snapshot_observed_at":"2026-07-06T21:14:19.350177Z","submitted_at":"2025-04-24T15:52:58Z","title":"Extremal negative dependence and the strongly Rayleigh property","version":2},"cited_work":{"arxiv_id":"2504.17679","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17679","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2504.17679 , year=","venue":null,"work_id":"ee9e6c3e-8d1e-4fd1-9e9f-fbb960c32270","year":2025},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"cited_paper":"/paper/2504.17679","citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:7c86fac87ccded5a96e9acf6985304cdd5a1b95ca36a91557b039d4f5265bbc2","observation_id":"fd84e65c-9e36-48fc-abf7-f56de5de72a9","resolution":{"observed_at":"2026-05-15T02:33:32.582310Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bcbbd909-6908-4018-9d44-b8978bb4493a","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:ca298052a6cdbf0eb755f6584802b7cba777baf53231b9ad4c37aaf087c68541","observation_id":"fc12e337-9399-4100-9f7f-0f67e6accfb4","resolution":{"observed_at":"2026-05-15T04:35:02.352323Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization , booktitle =","venue":null,"work_id":"bb8c213d-a6b3-4dfb-a290-406b1e5ec396","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:5c7110e8ac52cde6d9ac052a3952d8d12ef04de8e5f17e17a49da094c9cfe166","observation_id":"c72e4733-1aaf-44ce-8b91-a41fd65b98b3","resolution":{"observed_at":"2026-05-15T04:35:02.437779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Vaidya , title =","venue":null,"work_id":"05bab8dc-1f14-481c-8269-d75be4dc1e3a","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:8bb5d5b0c932016f44fbef4aace65fe8e7c4c8d1779b5e7f79f85daf4cf488b3","observation_id":"b8bf4bce-46f0-45d8-9095-e2d337e6ac3e","resolution":{"observed_at":"2026-05-15T04:35:02.060089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SSR Computational Mathematics and Mathematical Physics , volume =","venue":null,"work_id":"a0d8901e-d9d0-466a-8d55-ba4e415ee023","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:c9d154fe61b2e158ae4daea283019ed613013994e33b4c573441e9a3255cb0c7","observation_id":"8f9be158-d501-496e-b103-793ea1e29f56","resolution":{"observed_at":"2026-05-15T04:35:01.756783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"ee7bfd44-2db8-4a37-bb46-37def8db33c1","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:f7458956aa83566afb945da2b9aaea111f72d51a2495cd0f71a783043121c9d6","observation_id":"799bd9aa-e8e8-4c52-8210-cd3d9f309dde","resolution":{"observed_at":"2026-05-15T04:35:01.721928Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"292afe7e-c11c-47eb-b5df-3bf3b8f9e6b7","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:54e70db42e9e9c58e8c91ab19c4f57e365063890bc1fb83bb7a999d24d0a8938","observation_id":"1c4b127b-87eb-4f0f-b423-d3c9a288e6fc","resolution":{"observed_at":"2026-05-15T04:35:02.064880Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the 9th ACM conference on Electronic commerce , pages=","venue":null,"work_id":"1e953262-4f94-49db-a055-64df941434e3","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:ba58fdc14c280b895ecf60a4855534967151f24b9f385b82110498960271f1c9","observation_id":"7ca5b319-bb18-45a9-addc-0cfa5c988f8b","resolution":{"observed_at":"2026-05-15T04:35:02.430016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"aa23649d-0896-4ee6-ae8d-9ff5f12ec22c","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:fa09ca0cae52caac05eafd052d74ea43daa91187189c86af7fe1d84e87bd1d17","observation_id":"9b9dcc5f-0463-4e85-833b-9d6d39238093","resolution":{"observed_at":"2026-05-15T04:35:01.637737Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Operations Research Letters (ORL) , volume=","venue":null,"work_id":"43edc81b-dd10-451a-bad3-6da0be044a7a","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:e39c2f075e9b2bcc3008cd529df12518b3e0f7fa2766eac7eb2d5bb209fc44ad","observation_id":"713e6078-7966-45b3-bd37-3a91af16c649","resolution":{"observed_at":"2026-05-15T04:35:01.659859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0211201c-0fac-42f9-8b5c-152708103ba5","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:451271051cf78a196e8c2afc52ab005c33045b53025f8b44712ed391d5cfb7dc","observation_id":"c374791b-cc7d-4b25-97b0-c390f5334a08","resolution":{"observed_at":"2026-05-15T04:35:02.220412Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mathematics of Operations Research (MOR) , volume=","venue":null,"work_id":"cccf5d50-3e56-4723-921f-d6db8f830ba4","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:cddc937b05d38dfdde2db319f3c04991312ce2576dbd3854e6932d77214873fb","observation_id":"a3d3b741-d11d-4bc1-ae48-00dffeb1ef9e","resolution":{"observed_at":"2026-05-15T04:35:02.228924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"dd69b7ec-cabb-4853-886f-034f7e8a78cc","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:2b664a07fbee97fa17f7c3d7a036b458f6b15ac2e5d5c3993bf10be890b4ee73","observation_id":"2138df38-2aa6-4f93-a03f-1b142d2f1ba4","resolution":{"observed_at":"2026-05-15T04:35:02.224528Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b64df504-f3ff-4cfe-a45e-7e76c1f02fb9","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:953b6572c9a754be2c439c0abd51b35f1cec9ec5bd6fd7441dd47e5b1521db69","observation_id":"94742611-b537-4254-a9c0-2555550f8938","resolution":{"observed_at":"2026-05-15T04:35:01.628865Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"13b70e2c-086c-44b4-abcc-731e70b4e841","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:1f48a552b66d4b466046b2d7b58f645a91d3127d436c8e210f9bd852cf535f31","observation_id":"c027f7c6-7d23-4353-b73d-3afe5889bd81","resolution":{"observed_at":"2026-05-15T04:35:01.641594Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ACM Journal of Experimental Algorithmics , volume=","venue":null,"work_id":"302a9006-9cc4-466a-bed5-7417c62ae433","year":2022},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:4809a2e119b20a4f41321aaa7cd2060482b18e0780a5482941c0032b24c40ad2","observation_id":"6a7e7c6a-45e1-4a3a-8564-62497cf0fad5","resolution":{"observed_at":"2026-05-15T04:35:01.576761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"818af886-9cb7-4af5-8357-e8f3e7012e78","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:447eb751f71586aa0d9bb86e1c7ef1f97b3f595f334fd437ff234e31ef202eb7","observation_id":"3c47d5f5-6800-473b-ac54-1437ccdaaec0","resolution":{"observed_at":"2026-05-15T04:35:02.284458Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02582","last_updated":"2024-03-05T01:33:09Z","snapshot_observed_at":"2026-07-06T17:39:37.064843Z","submitted_at":"2024-03-05T01:33:09Z","title":"On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication","version":1},"cited_work":{"arxiv_id":"2403.02582","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.02582","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2403.02582 , year=","venue":null,"work_id":"2620a240-4a70-45e3-baff-b875bf14140a","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"cited_paper":"/paper/2403.02582","citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:f17b3a813def82e01d33f30594ec068677e20997e3af7ade0eb4204324935529","observation_id":"d8731299-f8ef-410a-a1fd-e420b9a5eb93","resolution":{"observed_at":"2026-05-15T02:33:32.567522Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.06069","last_updated":"2024-09-24T21:42:53Z","snapshot_observed_at":"2026-07-06T17:57:35.831578Z","submitted_at":"2024-04-09T07:15:53Z","title":"Fully Dynamic Matching and Ordered Ruzsa-Szemer\\'edi Graphs","version":4},"cited_work":{"arxiv_id":"2404.06069","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.06069","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2404.06069 , year=","venue":null,"work_id":"942338e5-dc9b-451d-b970-a950749dfdef","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"cited_paper":"/paper/2404.06069","citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:fe5b257acb0a7cc280b82f3010329c50f669c70e09e70f1bc02fba89b9ca6f47","observation_id":"26d8688f-76af-473c-98ac-37239dce9951","resolution":{"observed_at":"2026-05-15T02:33:32.570390Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Communications in Statistics - Theory and Methods , volume=","venue":null,"work_id":"00553f7f-0ed1-4297-8981-4ef57e250aea","year":1981},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:6810137a45520b16d0a3db425fd0428edf7eb6088857b56b4b5edec1a052c0db","observation_id":"f6cae629-7505-4421-ac63-46c8b272872b","resolution":{"observed_at":"2026-05-15T04:35:02.233174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The Annals of Statistics , pages=","venue":null,"work_id":"d0ccfd28-7a5c-439d-8b12-0b4b123b725d","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:a98163f7eeed19b79fdfd33f35b297bc2fb45e0b1e75faaa042abea48ead1f56","observation_id":"474c8a60-5f08-49af-8a92-06f2c6508a10","resolution":{"observed_at":"2026-05-15T04:35:01.403420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T01:00:29.956873Z","title":"BRICS Report Series , volume=","venue":null,"work_id":"cde640ab-379d-4c29-b7cf-64284ca27df1","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:e2ceb251c0daba5a493a9d9940c2a7d301ddb33729a9c69092cc2c1729f8bd6a","observation_id":"7e8acecd-dec2-4f0d-b983-9d21b195f484","resolution":{"observed_at":"2026-05-15T04:35:02.344770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Random Structures & Algorithms , volume=","venue":null,"work_id":"5d324d06-e68b-47d3-9dbc-a88449ef423e","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:5d849fe78afe055baf5f30d3a5b726a1fcf33c45a24ac3e5da3cb70bc40e1c2b","observation_id":"ca98a000-eb5b-482c-8ed7-859fa6f38060","resolution":{"observed_at":"2026-05-15T04:35:01.399011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d9bd43ce-efaf-4f85-af24-2cc4713c30ff","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:e6a1c9957f3567f710899a87d7a67bb6a8df194ce3940ad2231bc3b1709bdecd","observation_id":"6dd3c0f8-497f-478f-9cd7-ad24d5e66405","resolution":{"observed_at":"2026-05-15T04:35:01.339975Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Balanced matroids , booktitle = proc #","venue":null,"work_id":"70b1b38b-85bc-4513-91de-fe3a1b8301fd","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:9a62ab1aa46d93c7ea7b269db4e32a6f70443c5bbd7b16a1c2737e7280bc96f6","observation_id":"555837c3-e258-4b9c-87b0-898ab817d3ff","resolution":{"observed_at":"2026-05-15T04:35:02.410074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Journal of Theoretical Probability , volume=","venue":null,"work_id":"9bad577a-1de3-4aa5-b99e-04caa3b46d7a","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:8ffaa5f7c22b357a1ef918ae3c969b1b62659d336b8d7d5b0b7e12a85867be98","observation_id":"549c71c3-8302-40bb-8a6e-c7e9eefc6465","resolution":{"observed_at":"2026-05-15T04:35:01.353184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A note on the almost sure convergence of sums of negatively dependent random variables , journal=","venue":null,"work_id":"a694f2d9-41c9-43da-8c82-cb27f01f2e9a","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:5e5e44fd8760a0222c08123060624b735e144aa06ebf7bd1a076274ab0b4adae","observation_id":"6cdbc062-08aa-42be-a763-59e0496b5d86","resolution":{"observed_at":"2026-05-15T04:35:01.606583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stochastic Processes and Their Applications , volume=","venue":null,"work_id":"95b5dd09-c845-4af1-8c39-6e6e607cebf7","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:8c959aea16e2d561e519f3f17e31881da242b31941cc780f6e83b1065c3b247b","observation_id":"cc6c6c1f-75bd-4ca6-b779-65ec7ae0bb8a","resolution":{"observed_at":"2026-05-15T04:35:02.484193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Negative dependence and the geometry of polynomials , journal=","venue":null,"work_id":"7b850a81-5eac-433b-880e-d5eccd78785d","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:1a9eed65dea75f8c2481689c3924cab26f89dfce75e352400be4083aac5d049b","observation_id":"039e087d-d803-491e-9eb2-e3d36cabd223","resolution":{"observed_at":"2026-05-15T04:35:02.480411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fef7e41c-3ce4-46c3-ba8a-abae7d973c51","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:15c9d3e57e360960fbbcd8b5c904c50327e6013f3a1c42a2b981101075b5f2b3","observation_id":"a5d57b86-9f55-42d6-b84c-b5acd6a3e5dc","resolution":{"observed_at":"2026-05-15T04:35:02.472487Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Communications in Mathematical Physics , volume=","venue":null,"work_id":"0a5eb316-d4ae-44ef-976c-b8e262a7b7fe","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:a26ac7cdc619bcecc86d92745d5b1c08b9803c250fabf4020e132b30d4a67522","observation_id":"d9fc473e-592d-488c-a686-06717ad28167","resolution":{"observed_at":"2026-05-15T04:35:01.902269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"BRICS Report Series , volume=","venue":null,"work_id":"03a48412-584e-444a-8245-aa399288c2c9","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:2b581047ad2c0a6e7236191b9c3b86397dac8f07a175146ea4b9299db62745db","observation_id":"594692e8-24f0-480f-98cf-ac6354c33d0e","resolution":{"observed_at":"2026-05-15T04:35:02.511715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Multi-budgeted matchings and matroid intersection via dependent rounding , booktitle = proc #","venue":null,"work_id":"e1868a65-f374-47df-9647-7f3663a84d7c","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:3ce7560f68d4f37bc288ef706e3688116d8397b28d67b0e27cc884629c2a9698","observation_id":"54d04ca2-9b32-4066-a71f-78973e43070e","resolution":{"observed_at":"2026-05-15T04:35:01.303770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5dbc33a0-b45d-4559-8ddf-8868ef6309f2","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:496f2df7c80c9fa860bd9b5d7c9bb05ca307da1f0895d17594a26f40472f4b64","observation_id":"c3be3e10-874e-4118-9915-22abe89c29b3","resolution":{"observed_at":"2026-05-15T04:35:01.443565Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Biometrika , volume=","venue":null,"work_id":"d8ed06bf-2e3f-4d8b-ae7b-0839a92100a5","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:194ea754ad221f48266dfec2520826cb6e0c27b53906445cbdf2c9ff7c335d0b","observation_id":"03e60748-f924-4be9-a055-dc7ff0dd0657","resolution":{"observed_at":"2026-05-15T04:35:01.451214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Combinatorics, Probability and Computing , volume=","venue":null,"work_id":"2ec382be-2684-4f5f-99cf-d921007ee60e","year":2014},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:899794bf5452ab168bccacac60f30570c01bc3596664df1ad72edd0c23aa0a82","observation_id":"a3e020ce-cd5a-49d6-901c-b1683cf056a2","resolution":{"observed_at":"2026-05-15T04:35:02.507770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c767724d-3f55-4260-8383-d0ff9a16e61e","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:579bf94c52b4d97329a828242aa746b6ca87d6fa0d31ef7f903a5e92943b67e2","observation_id":"6e6cb0bd-f620-4fee-a64e-51316d0da3fa","resolution":{"observed_at":"2026-05-15T04:35:01.800436Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Naval research logistics quarterly , volume=","venue":null,"work_id":"2799f567-b765-4231-a759-9b5e0a3b5080","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:b8735ab828ea76c0dfd1bf32dac385aad99cfb2a55141e383b1c200a48a99170","observation_id":"b15b288f-a23d-427e-937b-c7e9e56a200e","resolution":{"observed_at":"2026-05-15T04:35:01.734595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the National Academy of Sciences , volume=","venue":null,"work_id":"b7cf506a-7e21-4127-b563-7ec7c17eb5c9","year":1957},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:47311d1fa0a5b1302f0b5ca07e5106c5925f71fca767c58e7e34d50944eaa50a","observation_id":"4927a18e-cf2a-436f-ad5a-4bc195ad62b7","resolution":{"observed_at":"2026-05-15T04:35:01.764859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Canadian Journal of mathematics , volume=","venue":null,"work_id":"420f512b-816a-4065-b68f-3d139a94cfcc","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:4873567310371652395c6b78e2651596cedf63309ab5bda6143caf1777a62aac","observation_id":"1adea1a3-6a67-4ca7-86d0-bf81c358ab2a","resolution":{"observed_at":"2026-05-15T04:35:01.748185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f69946f2-3a67-48bc-b694-1ffe2e6be435","year":1973},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:152316d132e6a6e5f878148f27dd6e85fd01b33fea624fcf64732da83b096ab5","observation_id":"bb0d24ae-8a31-45c0-a598-d028fac9ef41","resolution":{"observed_at":"2026-05-15T04:35:01.464241Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"552ab1b0-3171-4405-aabb-4963ff0280dc","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:4ebd9a5eb7a98726cba445cbe1161c0396315bf803513a6d508b750839d76542","observation_id":"34c878bb-e9d5-46ef-9406-0f2a47b5c48b","resolution":{"observed_at":"2026-05-15T04:35:02.166223Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5f9031a8-c760-4056-8964-174ea9476a0f","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:161fd3f9a7c7ca20e0aab64c97de89a5592715f2540215442281f5d017043bad","observation_id":"c21f219b-7c7d-4aac-acf0-8e61221a6f95","resolution":{"observed_at":"2026-05-15T04:35:01.863729Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e8a8842b-14d1-4a0b-8298-f53b7d699c47","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:5aec0f1f6f3f65293e94071782c073c5142aadf446ba9b70aeda11d3125e5bf7","observation_id":"e37a2b80-e9fe-4de3-b08d-03393dd0261c","resolution":{"observed_at":"2026-05-15T04:35:01.468750Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f323d28b-00a1-465c-b409-b86eca1db6dc","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:cd8549702b35487bfc2a6018d22355572ce88f0be2f0964bda2655047e67497f","observation_id":"762e485c-9af9-4b51-b6b6-17c1f07c8185","resolution":{"observed_at":"2026-05-15T04:35:01.827039Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Combinatorica , volume=","venue":null,"work_id":"6116209c-4a02-4517-88ad-b159d2f8da4e","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:e2d1de6ee617f0088a8cf3b0f2f30b095d6757783873bb1afee733a29ec1b8f3","observation_id":"5976b3f1-e4a8-447f-9e74-b2d582f70e9b","resolution":{"observed_at":"2026-05-15T04:35:01.859789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ACM Transactions on Algorithms (TALG) , volume=","venue":null,"work_id":"3f8b8259-8d18-42a4-913e-4c8bdec428bb","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:21c28c3d733ebd26a949e386bdc74716d33cf2a8c963f73af302632c9a64ff67","observation_id":"31d42c50-0c7d-4752-960a-3f5a8ef75605","resolution":{"observed_at":"2026-05-15T04:35:01.473517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0902.1617","last_updated":"2009-07-30T01:57:21Z","snapshot_observed_at":"2026-07-06T01:50:52.765254Z","submitted_at":"2009-02-10T09:45:27Z","title":"Perfect Matchings in \\~O(n^{1.5}) Time in Regular Bipartite Graphs","version":2},"cited_work":{"arxiv_id":"0902.1617","doi":null,"metadata_source":"pith","pith_arxiv_id":"0902.1617","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Perfect Matchings in \\~O(n^{1.5}) Time in Regular Bipartite Graphs","venue":"cs.DS","work_id":"f27c2004-a30b-4596-bf31-83f61db9e800","year":2009},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"cited_paper":"/paper/0902.1617","citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:aea79584c34eec7ddbbc1c60983c2dfaadbe1c6ff3fda3e71fdcf453ca006c60","observation_id":"8ee772dc-428e-48b5-8c9e-0be67242cf6b","resolution":{"observed_at":"2026-05-15T02:33:32.578956Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b97a6e8c-4fea-4eca-bcf9-d9c5c71f7c50","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:9f9332a6c51e8480eed24d1c4265cabb6ac00d0b142b5431c7acd9a3f7b3e8ea","observation_id":"ea02f92b-a89c-42b6-ac6a-348a7128b3b8","resolution":{"observed_at":"2026-05-15T04:35:01.269448Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"1993 , publisher=","venue":null,"work_id":"58aa407c-20cf-40f8-aa47-7ca52705cd15","year":1993},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:dccc8bde81a61cb1bd34c240e36cbff47d0969acb58b213e1a5c115538c371e3","observation_id":"d4c921ee-8a9e-45de-b878-58b609a2151b","resolution":{"observed_at":"2026-05-15T04:35:01.460020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Matching theory , volume=","venue":null,"work_id":"34d9c52e-80cb-4c64-a1d3-f02b7d71be12","year":2009},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:3fc2af0c306bf8ea9805030392dee6617d4460fbf0e888de335c0e5dd3742af0","observation_id":"894f8183-67e4-4823-a014-72fda5bef17e","resolution":{"observed_at":"2026-05-15T04:35:01.282824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2010 , publisher=","venue":null,"work_id":"8a73b880-6cb4-443d-8d8e-54dc4cb02c87","year":2010},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:38b612c71e122768715e83f51a1a64b108f206ffa9336cb62e7156f82b7e4b12","observation_id":"87edcce9-8e44-45f1-8f78-8816bcee6c2b","resolution":{"observed_at":"2026-05-15T04:35:02.468716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"98d66831-5753-46d4-9dc5-1e371ffa9f55","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:d109ee21f374b56e9471b2d755191f33ad1ca4eb8ef4bbd0588ae8198af6dec2","observation_id":"d8828fea-5711-4192-ab1d-96e78675ef82","resolution":{"observed_at":"2026-05-15T04:35:01.264944Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Modern graph theory , year=2013, publisher=","venue":null,"work_id":"31f1b756-554d-4dc6-baa2-8961296742a6","year":2013},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:53abc55c9bd839e739739490b14a911ef8d00b680b98d5872c0ee658f1c96269","observation_id":"48112e0a-a2be-4342-922f-9786b3567c1d","resolution":{"observed_at":"2026-05-15T04:35:01.235572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Information Processing Letters (IPL) , volume=","venue":null,"work_id":"a4221427-a265-4a46-9efb-64c531e6c162","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:a691bcd0d378f2ac42bff42514882e7653e22a37ac2797664113e79bb4771c1f","observation_id":"86b38123-f7e6-479d-8731-ca52db0d0af3","resolution":{"observed_at":"2026-05-15T04:35:01.278426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A matching algorithm for regular bipartite graphs , journal=","venue":null,"work_id":"4f478071-444c-456a-ab5b-e57cfb971b36","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:ddc1608f6fbd12d463337c955d132018ca4a7b70602e2f3b4727f5495d5fc2ff","observation_id":"d488e47a-60cf-4fb9-8f46-fd76248f27a8","resolution":{"observed_at":"2026-05-15T04:35:01.296089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Combinatorica , volume=","venue":null,"work_id":"e6c340b5-d2cc-4e2b-b652-c8ed90b35401","year":1987},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:c7e83c357d1b0df907f293d5977f78b8aa8540a556d9dcfb6572f259960f38c1","observation_id":"2129602f-9f93-4b5c-8108-b10b05372ea6","resolution":{"observed_at":"2026-05-15T04:35:01.291401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"29f96cd8-dae8-49d1-98f8-743f53b5eff5","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:0c539d8d4931c3a1677b68c67f410c592c551c14f7d14a0e6bb59b22c06a271c","observation_id":"1b079101-3be7-48dc-98ef-1df8745848b1","resolution":{"observed_at":"2026-05-15T04:35:01.327865Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Combinatorics, Probability and Computing , volume=","venue":null,"work_id":"50ff6d71-dd87-42d2-bf39-c98bb277ec26","year":2007},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:421bb97f3e7d0d7d9c4beaa2dbb36b7239df524f1c6888ba808f19b4b1ad89e1","observation_id":"2984c1dd-0ef2-4da8-9b90-68a8573f1c78","resolution":{"observed_at":"2026-05-15T04:35:01.506178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Journal of Combinatorial Optimization , volume=","venue":null,"work_id":"ebb88acb-d017-4e21-b407-beea75d992aa","year":2004},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:7aa42277b846f650503db78f3f795c7228a394049d0ee5ff03c270d6918af501","observation_id":"da5783ba-f25d-4571-b419-aef798b0d5b6","resolution":{"observed_at":"2026-05-15T04:35:01.502111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b2cbe2fa-7629-4c22-baea-20f9f9230a03","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:d03fea8377a99e94f6169409b63feb81bce47844febd8282fa8ab285a7ab3622","observation_id":"ad929f6c-5bf9-4c10-ad4c-a4b8c5f2e81b","resolution":{"observed_at":"2026-05-15T04:35:02.402260Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5368c68c-cf56-41e0-81cc-2ff46c89a456","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:9af168590537e4a8e5805055770227faf799c598cfb63c8a0267529cd8898d94","observation_id":"b97dfeae-bab3-4f92-a0d4-9b75998073fa","resolution":{"observed_at":"2026-05-15T04:35:02.188789Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Operations Research Letters , volume=","venue":null,"work_id":"426c0935-306b-4ebe-b484-c83bfc75a560","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:d7fdd4978619d4f4787441093b968de561e862340d444a17bc6f84433f411450","observation_id":"c8f55350-69b0-4499-934b-0a14d9bea309","resolution":{"observed_at":"2026-05-15T04:35:01.498308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"991f95ed-0d59-4441-9809-c3c44f0d02e4","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:51b3613fc56e9828bcb21c701cddf823fa4c2c804e44324641b95f8eb1127141","observation_id":"37ce8a9f-3822-463e-abff-986b9cf0fd85","resolution":{"observed_at":"2026-05-15T04:35:01.910774Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1704.06528","last_updated":"2017-09-22T23:08:49Z","snapshot_observed_at":"2026-07-06T05:38:42.851444Z","submitted_at":"2017-04-21T13:21:25Z","title":"Fairness in Resource Allocation and Slowed-down Dependent Rounding","version":2},"cited_work":{"arxiv_id":"1704.06528","doi":null,"metadata_source":"pith","pith_arxiv_id":"1704.06528","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fairness in Resource Allocation and Slowed-down Dependent Rounding","venue":"cs.DS","work_id":"0e5fd6a8-3bc1-4b35-a440-c37322eec781","year":2017},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"cited_paper":"/paper/1704.06528","citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:62c7d8d145ac9f556a9a5f2a8324231e4b2a7fd380ba038e4bc60c4e3461d0bc","observation_id":"063f5d98-f860-4f0f-977a-a8ff43cca6f2","resolution":{"observed_at":"2026-05-15T02:33:32.573181Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9720a937-14b0-4761-a75f-2fe032f0814c","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:e955908be78338a2c9b7420e251a76fecc76b475f2d8a188db01edd331a42600","observation_id":"915e200d-5da6-440c-922e-1ccec73d79a4","resolution":{"observed_at":"2026-05-15T04:35:01.255270Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mathematical programming , volume=","venue":null,"work_id":"ae432c3e-0e06-4398-a774-c9770231fc80","year":2002},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:cf9f1e81682c678789c9420d1eacaebf02d379e7863ba145b52bc910be4715d2","observation_id":"a40d0df5-79ed-4388-b97c-b9cd103b107d","resolution":{"observed_at":"2026-05-15T04:35:02.450216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9e53e54f-1a9b-4e14-a5c8-c1c0c05efb4e","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:99d8755de90a889f91f39394bb2dca42b4838ea9fd9449604bb881bc29e2fa8f","observation_id":"2d5e9354-6ff7-49d6-a305-a129e8e1d4a3","resolution":{"observed_at":"2026-05-15T04:35:01.654203Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f07305c0-8c48-4710-9ca6-633c25734fd4","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:64164f0858fe3d73b26c8bde44502ce0ad107ae78c4e249a5d545196a430f761","observation_id":"08ac569b-9598-4fee-9f2f-78fc6ec8eccc","resolution":{"observed_at":"2026-05-15T04:35:02.330361Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"When LP is the cure for your matching woes: Improved bounds for stochastic matchings , journal=","venue":null,"work_id":"0a2b18aa-6486-4d17-bb13-87fefde98e35","year":2012},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:f6735877412a3fa15120ec7e7fec911be63571fa524172b70c2992b806d70513","observation_id":"257288a5-d1ae-4b99-8847-e91c92738fb9","resolution":{"observed_at":"2026-05-15T04:35:02.333907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Maximizing a monotone submodular function subject to a matroid constraint , journal=sicomp, volume=","venue":null,"work_id":"4460e8ee-7e97-492d-9ffe-e18fefb4e85c","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:9091720a2764cdc3e5ad14229583b05d10c36b2a131b1bc1c8f83c0ae0d570cd","observation_id":"11addc5c-d317-4e42-b4fd-b01d0d3521c7","resolution":{"observed_at":"2026-05-15T04:35:02.313760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mathematical programming , volume=","venue":null,"work_id":"0093943a-877a-44c1-a9f3-b663a57938ac","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:588d7a07cf210f689642b4c89a8561063a075900f3df65e28350a4c10ad099a2","observation_id":"c5886abe-30c3-4e8e-96e7-93bd625661f5","resolution":{"observed_at":"2026-05-15T04:35:02.321515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2006 , publisher =","venue":null,"work_id":"b8d758f6-4f5f-4511-a33b-545f8178ae18","year":2006},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:1192d3ecdaa41759b0f74ff2e92732f1e9954d88fd15e8fe0318a96b8f6e6ef4","observation_id":"9433fb19-414f-4143-aafe-0bb12d2474ef","resolution":{"observed_at":"2026-05-15T04:35:02.337892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"76273ef0-478d-4915-bb8a-34f1034d855a","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:8aecf63848009c5a1282fc988d43fab75358a88cf5115fd5d006041255a6e340","observation_id":"c3ef4b3c-628b-439a-9383-6b4871368d3f","resolution":{"observed_at":"2026-05-15T04:35:02.364014Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"cc50a0fd-c154-4e18-b692-d0e7ffd8ba90","year":null},"citing_paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-05-15T02:30:41.877918Z"},"links":{"citing_paper":"/paper/2605.14296"},"observation_digest":"sha256:6f1c67bc63bc17a1ec8b21a469a1f2bb8fc71cde58cf77b4a6674f5acd53a891","observation_id":"f6ce7932-cbf7-42f6-af9f-9f14ec7b46d3","resolution":{"observed_at":"2026-05-15T04:35:02.305468Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.14296","last_updated":"2026-05-14T02:56:24Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:56:24Z","title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":1,"unresolved":45,"verified_exact":3,"verified_fuzzy":49},"total_outbound_references":300},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"thesis":"As of 1 August 2026, this Paper Citation Record lists 100 of 300 outbound references and 0 inbound Pith citation observations for arXiv:2605.14296."}