{"as_of":"2026-08-05T14:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3140ee7979d01402254e42af6758c3142193b4c0a8f5874c7edf98bf2608ad71","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-08-05T06:32:48.257954+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-08-02T15:15:02.305845Z","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:aa4eb787850969c7e16c0cc6b9ea3614b923b4454db4ed1cdf7747d307bdc093","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:d4d3d54be2a002862c4c7406c2557a3a1aa1c14483047480c62eb43d144a8813","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:c6404479151fc8e59beec215d0fcae526854dfd9ff68271120d308488fa0d92e","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:73c39d89bc9ada678c5f5707907ccb643edc7856f78bb9506fd17ae6116a7fec","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:b61418ad6a1f6113317de974f8ad89d5ee7cd33717026b02b737987918e6a066","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:01fc9c157b677f0d75d763609080ef1660e98e05f51ff2b745a25d6fe5964a12","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:db3a44b69c6f7da5c609ec4d7b90ba689e29b8bc2ae1695c990328f8447e6785","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:2fde0b9cecc45a957bc0d06329b385322fbf2254054afbca03065ce5b6d090d2","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:0ef78b98396f758025946c874da7bd70658e443626702b44ac611a9a9204b90f","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:391e1c4c832dfce0515caaf615571e7edee6a8ec9464aae263c74b1c91768ac5","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:b1907bb15483f24ac1686a0d6d75bfec41bc1f0abc7828854e268935fe3dca8d","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:9cbb146d102e2463c7d7aa977097faff27acaa347d9a5bf45bc90b39742fcd71","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:ce1726d3f686c35fbcfb4dd447e058eba8dc715a2fbd6530730972176c9208b9","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:fa6e4c1a1b9cb635b0a911cb4f5052c0fcc6e58b6d0b2434dd217b3be8b3c8a6","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:c40c7844cb4d82b4406159b3c0245ffe1b458603dc8e45da470626bce5fed964","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:80be3851339f426b16b5111093f7415d951fb0cb68d1a7e74fbfdca87127bb3d","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:45b2f7df35e7c6d349c23ab748f9ba6516c8a3c1143c5a0e56f200b0a3b4b711","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:704e1e40697357ec0ec1a2cb8b92b480676a6665b42d2b78b0ce6081b52ebe2f","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:040ad6fbba451c398a7d83c154c453f98a204ca701ed4d276ff6bfd939aee830","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:55f38d9757c20618b7d8b8a8b825c7a3a60159639fe40be53a338452221b6053","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:f6f461bfc31145ab7aa3c2ec6cc0a937d2c3bc8939da2c7c65da7e002cfdf661","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:c9765194aec1fd65e127ca9f7dc6f7b034446b3c118ebb0cc0b6780313a79d51","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:d2b3a59ad12be04956409520556552e26b28bef407a2323795e6dc312d79c2a8","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:c6c29da721a556c1c0cb0447ec4fe25d4658648fc2bc022f78d441ed2df0f84a","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:1b957148c133a895439703500c031cd7252fc6d701f3152f966b3fba79141b3c","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:e4a985cbe2447ef559518f18fe35c8baf0682a8177660ab6298e1bada0a7a32b","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:f2c8b218799943fab3afbe4137d5862b54c27ac5d3dedbe2c9018f6de9dd6857","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:9614d54a917f81c09c5d995899358a1b32b410dc035530faeafcc2618f4b1e53","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:1bf1b5c5199f710d5e94882782068f4408c2dc336ab46b635aee8915c7b982f7","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:6bdfbd06bcf1ebfe2fe797b681ab9f30f8b6ad75695146cdb44e2933d29eeead","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:2ec2e69655bc52df7b9f0ac0f3c4c339579595c458ab60d04bd5199657d53bb2","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:b81a91ef9a36f7ee3f1e6949783a922e67c7b55380bdf5a54c5f4efdce1120c7","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:7eeaadddc193a28ed62b973d4b989e2c747cb8d04d9918a9700f36426206e13c","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:053b69c30793e0d7ea4dd2bdf80320dc94b610f2bc315ca4e34d07b6bd5838e5","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:3a662ed1035b89437e1c664b7f74fe6cbab3ecbff6a6ad917d2375556de65acc","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:476c00a921869147af54fb07d9247cfcdec7c1ed4c7a77a7990b54dba755467e","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:f4f4553b4d107af90d9433c034303ab33f50c375ed66dc211cd67b9a23fa43dd","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:16e91f6a7069f7ddd5c582aaa2d8ef5ae16f0914a656efcf6f9aa9cc3b57b70e","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:4f1a62226c8def2cc5cc045311104e3c7c788ad7ce861de76a33374eea88ea3b","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:6d3afdab2fd1692a8b8d2b5a81e50e2b6c23175440687954e673ce21995de1b6","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:31a5a79d646dc90d8ff5d12223427cdbbb4051d990e52248ad4d5469021d7060","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:6c52fa80afc667db5e9721dd1bdd1ed78ccda6dcd86e5991dff50d4d01e54eee","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:024433fedc5b299e77f0b983a68899ce95d4f85e356aeb00a59666ece1667bdd","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-03T15:42:49.885884Z","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-08-02T15:15:02.305845Z","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:97678f14f225c1df0fa4945dd975703bbe9aec3f3129ba35b0144590779d6c1c","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:a0a83580a9552a3c0507d40f3222330eacbf291d4948caedf54226841d50aa42","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:6fb6e4fab8fe2392f11fd0b91bc7ce950823f1a4cdc878594da4cac77bbfeb28","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:00231312ac23f329cceb753f64c17e62fd3c608818a4d9aa9bcb7497052b02f3","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:66013e98b637818713de319de728512ddfedf46f8a0ea01b753f8b33381a25df","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:292e3f1ed36c101c5afdb4f9cfa03803e5980c0b921eb40750a2e20756bc8241","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:31a9fe9b71ecae1193c94e36c134ff094deab629411c1ba449eb06a1492d49e2","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:bc01ceb1c53ab761a502ff4864ffdc5668a4962c98bf767730959f258c6150ab","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:0f42ae8279d0ce1f32cccfd13e08def386ca9f6c874893f71b77358c98210879","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:4049f12aa61ca83dd9038441f8cee38b3149b8ac8e990ec837d84ea3ab6cacfc","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:2a17655a2ec33b9d697814e622bc9d17b307c9a2fd09212bdb11c8dcd95b1a9a","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:2e7f6ce4959551fa61759144e384e678e072f5502e118727758ae5a4ef92b6b0","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:a4188205ef03d903638294c75f9a17ccc48c01b4db6acd1124036dbd89faabdc","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:f8b8dce7f6a66167baab7eebf3552a1284b020e518eb677cee8f776c7225e691","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:95bad9e990643f5ef8ee6dcf6b66f5503c2ee84410751bfd27c547c7ef2dc119","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:a939f8a9e45dd2c88cbe0eee8fac69f2f2814f7cc1a3318bcd60a451f2bf0bc1","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:de4a661be210e99664452cf365f81e80d5ff5897bcd7a4a95191cb608faa41bf","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:6d02bc868c4be520d94ecd7568852db861f9fcc9d9637846cb65a8dcc037c44e","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:fd87683d9bdc2b37ea933ea6e45f609fb30cd67873866c3dd77e5870cfad486d","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:539ae84feb28005250c12f3e8e3fa7e76ac40e80c044047f1d65b15dccf65e7d","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:c3537365b054d020fb1924ccbcd58dc0e821e0a5e89cc6102ecf0baa2d465a89","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:c99319a34cc137c4429c33872ec065bab484ae9223fce38b5039a517b9ff4811","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:1185d873f6045a639b38ad621a76315c2457c4bc84daa10f70399426b64f9ed9","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:1347ee272115fe8e951a46f6e655843bdbdf5b22d4485e931b80b7537883f3b1","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:e0170e6d6b9a3fd69d55af3060d9bbd567915c6b0084e67979e39817307759f1","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:0d5505eb305fcc2c74a91570e0c68b41cf3ff06330ec1363a12e5d2f6fa435f8","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:73d84012eb6523a5fa1c713010f230de48b21ac83b9e68ac28483d03d7c4c302","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:3e43395df96866179514645a0dd3986dbdf9f1ba54eaae7a61a34814f00fb968","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:3d3039346bf699830954f406725e35df2fcafbc71bf501876d7699144ec43574","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:1d866332a387d7ea258f1a6511b59e2738efd35a4f636dbe712bfead52e7613b","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:2fd5bc842eb47fb692f841c29114ad2f5826ec6defadf798798af5de26490891","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:d64682f19aff9b4fea35e2b656c1eaa6e861262febe7af79587c0269702c279e","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:37f638398279a350b62d1a3f6f10f0b00f2ea44f8d336a29199ab34fd52d4567","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:e173ba20f3eb5d557ecc697ba1c5fcbdfb762e8b4fa01cf75d246cb4f2071700","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:8ef8dc3cd0cc25fb314723dc6c667c4c00e0a0eb007709e74f7acf65ea20421f","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:88c0abdbe521a4ec22bd56accb795cffd8c52f2440f13313c8dacf82973eaf89","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:5d77235f835f5528fcd7576b3710a55f3585136f72b20bef9180a08a3b881455","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:b9ec22d6edc4d5e92e70f21423bf3c43b6170ed3a8baa3d8a2c88b95b3c5a4b5","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:4ce781024a1548293905174b26ca575a850a71b98a969eb6999f7914d93333bd","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:62a2c111939fed95937a82c4fbd6c15a4f6248093c3a7c0e73ea67551341ac53","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:9cd58ecd8fd060dfa58fed487da00233f3215f356b6d87c47f02ebeb667bff64","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:31afdd4a9abe1b825e9a85964ec10c1132963dcff5a4e7c36637a6c843ca1653","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:26c0974fda2d9d116a9375a2a83b8f0fb2004965ddc2b8729a677d59323e694d","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:64201c33e82ceddaa8c409132edc24a89032fdcef00e74f56ea31fec8c681091","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:2c11ac9a54bc3182df6b91f648acfb37ecb5fae1bed65ad5fa34cd014cdd43b9","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:62de2cbf7a4e5f648fc2167af6d0c5438586491cc4131d5f2106df67e483afa3","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:c2cf858030fca4ca6795d532b27408f9139aecbcf9bf65bf49eb109dc3b0c98d","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:9902aaf7dde2d3e8ab79aac851fb0be506a85f69e673738ce6968b888b11e1f9","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:efeb8bbcb8bfbd9997256b8ce399ce3a583aa15b8d8ac10fc64a4944b1db7aec","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:81cfedf0b909057ba611af16b5743ba50a941c4727e6a7c09f8e584f4c47781a","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:cf581c860c2385740b0880af7d7fa6e22212dff82d92f863611c8b03f6186c3a","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:be358532b730366ef4d6e4a14b5ce34a76c8e93eeaebfee9635f0dc2bc1cc123","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:157c8d87e8a416fc95ee4f783290e0c40c9f3ccb28137e45e833f60d4d9cb5e7","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:3cb15138b463c18a046915212d935f9bc060da3be070f3a33da2b1fb1efaa9d5","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:100d7bf69f9fcbfc3e84c05963d7797630396beb9bd770d2b771d17e46ef5657","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:ec0175ce31b2913272fb361e90ea948098228f3c137971a48a231b80498c0d0f","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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:093e4b9f4ba3545c5c49f55d6bc5b45e2778d6dbbd5160a3b04d83961f39fb01","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-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-08-02T15:15:02.305845Z","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-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 100 of 300 outbound references and 0 inbound Pith citation observations for arXiv:2605.14296."}