{"as_of":"2026-08-16T11:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6f81f4e5e5dc9205194c9e9cfd58626584421afa71b9e3c9e150914a8fd0333a","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:02:38.847492Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.06242/citation-record","integrity":"/paper/1908.06242/integrity","json":"/paper/1908.06242/citation-record.json","paper":"/paper/1908.06242"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:39.634034Z","title":"and Vondrák, J","venue":null,"work_id":"54f95621-ec28-4af8-a561-42906923d6db","year":2014},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.650320Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:73b430a8c0b9f44aac785f39030bf7ce244f71449af06c3e70cd21f48c462a01","observation_id":"3923b73b-b5e2-46f8-b359-6e3f62378516","resolution":{"observed_at":"2026-08-14T13:02:39.639843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.610495Z","title":null,"venue":null,"work_id":"a00af6f3-8ad8-403d-9250-e0dbe07c11bd","year":2018},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.656754Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:4b7621323c4b5624cbacb39074934814cd8a5fe567b0d817c2bd334fc82a5cdf","observation_id":"2ff1c507-fa3e-45ba-966a-8aabfd1a3fe6","resolution":{"observed_at":"2026-08-14T13:02:39.618486Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.593205Z","title":null,"venue":null,"work_id":"3ff23aad-de19-4f84-9637-10f35f8d0bb0","year":2016},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.663029Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:95866abb6d77e0529d38151c90b07e660325302fcbca44eb0f631c4ad2a446f5","observation_id":"add3a82f-6017-404c-a868-80d42c7e781d","resolution":{"observed_at":"2026-08-14T13:02:39.598355Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.559850Z","title":"and Feldman, M","venue":null,"work_id":"60f41c7b-3197-4ee4-a8b6-5425b1227697","year":2018},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.668680Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:14dec3697f56c9a9c3e9ee390f08adf2723849009bc6ba565c01ed794e249931","observation_id":"371c13db-1662-411a-8a6d-8a5b99a32dfe","resolution":{"observed_at":"2026-08-14T13:02:39.565003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.539327Z","title":"S., and Schwartz, R","venue":null,"work_id":"556b4589-9669-4767-9cf5-665954aec389","year":2014},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.673097Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:169a8d31236411779e3b3e83404f94e84bff2c3ebed474e47044afcbeed93e70","observation_id":"fcc3578d-7f9a-47a4-9218-5346fe8996bf","resolution":{"observed_at":"2026-08-14T13:02:39.546059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.09064","last_updated":"2021-11-23T18:13:48Z","snapshot_observed_at":"2026-08-14T16:03:55.721073Z","submitted_at":"2019-07-22T00:41:49Z","title":"Performance-Complexity Tradeoffs in Greedy Weak Submodular Maximization with Random Sampling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.09064","snapshot_observed_at":"2026-08-14T13:02:38.677091Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.677091Z"},"links":{"cited_paper":"/paper/1907.09064","citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:c0bc1a81865f5971d6e6a6f1c0046e3dc6926d7cc442807dac95b1a9a7d4d965","observation_id":"55c0484c-0927-480b-9ee0-b90eafd89688","resolution":{"observed_at":"2026-08-14T13:02:38.677091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:02:39.512781Z","title":null,"venue":null,"work_id":"b24ecb2f-54a6-4102-a9d6-8c0da49d0dc5","year":2019},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.684124Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:47b5bad8cf2c9488394e520cedd48ff338ae57b7445f8474548c8b6ad2b04d03","observation_id":"fce50080-f341-4c9f-b305-7881d39b8ef0","resolution":{"observed_at":"2026-08-14T13:02:39.519971Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.482290Z","title":null,"venue":null,"work_id":"f33cf355-e553-4d25-b332-7a54b8cd010c","year":2019},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.692920Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:fcb0e52f19190e6c5ddcf5a17335777be554dc16919bd73dc7dbb90b9a2d0803","observation_id":"60245e01-ad76-4daf-a542-4baf411b42b1","resolution":{"observed_at":"2026-08-14T13:02:39.489393Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.462358Z","title":null,"venue":null,"work_id":"37a86a2f-5b68-466f-908d-bf4dd4d28202","year":2017},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.700585Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:1c207be0bf589bc8f1dbcba6659678e03436ab47547f11b4ad919385dc316555","observation_id":"2e7bbe71-c509-4d41-ac8d-7fb7c24b3877","resolution":{"observed_at":"2026-08-14T13:02:39.471553Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.438291Z","title":null,"venue":null,"work_id":"e5b969c0-6d2a-4516-892f-fac1087a4c8f","year":2011},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.705961Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:73ae97c5da61d050858f47d331b077f86986860f7287d87758b3a6a9e20fcbbe","observation_id":"382b1ab3-fab5-448f-8f51-89771a7316af","resolution":{"observed_at":"2026-08-14T13:02:39.445341Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.416502Z","title":null,"venue":null,"work_id":"9bd9689a-0b94-486b-89aa-358dd00c733b","year":2011},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.713769Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:2f8656689e7ee27fb9e2e405e68381e305b7277ea9533779c66bbf1c251df990","observation_id":"2fac6a37-e0af-45ca-bbe8-b2102699006b","resolution":{"observed_at":"2026-08-14T13:02:39.421269Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.397370Z","title":null,"venue":null,"work_id":"fa3f6330-6300-4d7e-8d5b-42bbfe34df86","year":2010},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.719481Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:ee23cec86d0c9cdda351d697e640afad67d33a553fa3c115f6126a085404d69a","observation_id":"6700b4ea-11d8-4577-84c7-8980699dddb2","resolution":{"observed_at":"2026-08-14T13:02:39.404521Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.383438Z","title":null,"venue":null,"work_id":"f702bf16-072f-4e62-875f-1269f8bda7a1","year":2019},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.724646Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:361124a7491c35770bbdfbf5105de2ab0243403e5b17dcc0cc721424dfc5db54","observation_id":"780c6da3-6713-4092-9572-9d7a33dfe1ed","resolution":{"observed_at":"2026-08-14T13:02:39.388314Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.359800Z","title":null,"venue":null,"work_id":"1c274681-842c-4477-9ad3-58176f410ae5","year":2018},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.729368Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:fc53854d29d49bd52ab999f326128719a5766ba9709395d869193c181cd07245","observation_id":"f2f2552a-e18e-4b30-a7c3-963ce5f4ce22","resolution":{"observed_at":"2026-08-14T13:02:39.365804Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.338269Z","title":"and Singer, Y","venue":null,"work_id":"0cad11b7-54ea-449a-b0c4-71e69bb06cbf","year":2017},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.733600Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:f31a1c929edf796ccbb3cb6fd4fd3a7719faa6737faeb7cdbe98fa156887c4ab","observation_id":"921a782c-7ad6-46b6-b09c-9336514e2be4","resolution":{"observed_at":"2026-08-14T13:02:39.343873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.320252Z","title":"and Bilmes, J","venue":null,"work_id":"e9507087-2710-47bb-877a-d4c4318f4686","year":2012},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.739503Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:4a2ed30c8b5a92ead97ad578dcd8c69ea05c0d8963408557cb0720a59785d6eb","observation_id":"80256a14-5f57-498a-bf49-eff959b6cac0","resolution":{"observed_at":"2026-08-14T13:02:39.327574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.273821Z","title":"and Bilmes, J","venue":null,"work_id":"833ce6dc-7360-4292-a99a-c3675e8d7407","year":2019},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.746414Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:e960a5de85b4975c2f4ac0d9c20484009c2954ab2b783b2dd6cf1c2ee84e3cca","observation_id":"018f04cb-ff9c-479a-bb15-7c0abf5c869f","resolution":{"observed_at":"2026-08-14T13:02:39.282207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.238589Z","title":null,"venue":null,"work_id":"606e3f76-5eb5-441c-8391-bd9451d4449d","year":2020},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.753431Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:945cccc73fa275f81bc7cd0f737456cb5e3e01e99df2fea2e38e4c588e9c0539","observation_id":"8c364b13-29be-426a-8780-dd7588270f39","resolution":{"observed_at":"2026-08-14T13:02:39.250762Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.223296Z","title":"R., Dimakis, A","venue":null,"work_id":"c328d865-292a-4c65-b312-6efc8d6af487","year":2017},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.757919Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:74ddce7baeb33559f30431a643cc282548e120a244869a1dad037ccccfdad882","observation_id":"bd99e326-d660-495d-8faa-9ff900f3d1d7","resolution":{"observed_at":"2026-08-14T13:02:39.228366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.200515Z","title":null,"venue":null,"work_id":"9b12cdb2-423d-46b7-93b3-fa7b7ecb03d2","year":2008},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.761514Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:61a076028892b5a7e0f01815a499a555d4a8b55577e3fb61dd82564887d36997","observation_id":"c949fd94-897e-4660-95b8-8ef0f00ae69e","resolution":{"observed_at":"2026-08-14T13:02:39.208456Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.179154Z","title":null,"venue":null,"work_id":"1a1780b3-5097-4363-8c25-6981af3e0435","year":2019},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.768372Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:edf28e014749bb0d5e9be866d79d3bff36d3d4edad21fb444355af07bb6b46fd","observation_id":"e2351b23-a553-40bb-8fd9-19fd182e5cb0","resolution":{"observed_at":"2026-08-14T13:02:39.186446Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.161388Z","title":null,"venue":null,"work_id":"af849b80-9dfd-4b5d-94e1-9e23815a3d75","year":2010},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.772831Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:8c5693b0c97c61cf7df44ca9963f1671db33f900d588e2967fade49a7f779802","observation_id":"2dacff75-0dc6-4a01-beeb-730bf9e2fe26","resolution":{"observed_at":"2026-08-14T13:02:39.165276Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.142737Z","title":null,"venue":null,"work_id":"30c127aa-30a8-4b73-839c-1ecb2294cede","year":2007},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.776833Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:1c2e975ae064d59472449de309249f6f18814b625f108ff6a776793ef924ec00","observation_id":"0be3212e-3213-442f-9fd2-0e77e84f7f6a","resolution":{"observed_at":"2026-08-14T13:02:39.149635Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.118897Z","title":"and Bilmes, J","venue":null,"work_id":"ea09dcf7-9e16-427d-a71b-fd3b5ea10773","year":2010},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.782807Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:ff03d807b09c6bf46fd42658cf61cd79c5b45e853c8d32db6e3808e2366dbc07","observation_id":"63265d73-1e91-4e10-af3d-fc3339c09133","resolution":{"observed_at":"2026-08-14T13:02:39.123375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.088888Z","title":null,"venue":null,"work_id":"2f145e01-74f8-4385-9557-2335aa699d39","year":1978},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.787255Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:7838fe02c4f316cbd1d8c4850e792f29dbaed7b71ef5365e8b4687a0071d7256","observation_id":"652f1002-78cc-49f9-a761-ece8f6307677","resolution":{"observed_at":"2026-08-14T13:02:39.095220Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.068927Z","title":null,"venue":null,"work_id":"ae16fd5e-bc6c-4947-8ef6-dc1bb1b7bcf7","year":2016},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.791533Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:213424ed66f7f621377cfb2ec241ef5e7b1e6b0dd13278dd7df9bf2e19093a5e","observation_id":"565b428c-32b7-42ed-b43a-e55ee2f667a2","resolution":{"observed_at":"2026-08-14T13:02:39.075292Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.052509Z","title":null,"venue":null,"work_id":"55141ca9-0617-4d66-8819-a46b6d1efcf2","year":2015},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.800797Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:b36ec9c5b186a309d5017f1e5f8a8dc74cca22a4b7ddeaedae353c423fb496f5","observation_id":"16b45931-7e0d-44b5-a339-cebe33c3eef1","resolution":{"observed_at":"2026-08-14T13:02:39.057603Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.031026Z","title":"L., Wolsey, L","venue":null,"work_id":"0f589742-183f-4591-be9c-e9de2ece775f","year":1978},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.808366Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:9a9eeeb4021a4c48708209f781b5042878a3c96d6032589ab3a43a5a9c3c7608","observation_id":"5e03142e-65f3-48be-bcda-7c95cbfb530d","resolution":{"observed_at":"2026-08-14T13:02:39.036288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:39.013859Z","title":"S., La Cava, W., Orzechowski, P., Urbanowicz, R","venue":null,"work_id":"8572de25-09a1-4ebc-97f2-c994f98b7b7d","year":2017},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.817916Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:4e1730f6e1ae01e0aff945fd6c4f49389c693188c314323ba53e948cab417e9d","observation_id":"681d7e2d-cae3-4238-a5d6-224c22c677d4","resolution":{"observed_at":"2026-08-14T13:02:39.019970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:38.994347Z","title":"E., Bradley, J","venue":null,"work_id":"d2cf65ec-f346-4667-a287-ab525af63209","year":2014},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.824549Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:d72b0f2a184bf18c0ee3fc3835d1926951d2428ee43f10cb83c8dd670e7f9847","observation_id":"640571d4-cdab-494c-b094-d3bde81c4d8e","resolution":{"observed_at":"2026-08-14T13:02:39.000608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:38.975480Z","title":null,"venue":null,"work_id":"d890f625-8707-4a88-98e9-f984339c1193","year":2018},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.832139Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:3f794680a7cfb9048cae35f83c6c0ba9479245850bade6332c288d01301f542c","observation_id":"8b2940d6-358a-4711-9707-d7526604010a","resolution":{"observed_at":"2026-08-14T13:02:38.981424Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:38.953074Z","title":null,"venue":null,"work_id":"ece17272-1a99-431e-8fc4-1fab0bd714f1","year":2015},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.836399Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:df130eb4e4a415bdb00a5686d4431e3b584ae3f4e4559a915cbbb9d0c0d22e64","observation_id":"b9b96f39-8bb0-4dfe-a252-7435306476e7","resolution":{"observed_at":"2026-08-14T13:02:38.963762Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:38.931478Z","title":"O., Jegelka, S., Rathod, V., and Murphy, K","venue":null,"work_id":"47db8278-1387-4aef-bc32-b1549891af98","year":2017},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.841298Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:445513e8733d1b259e9d5c483c18fc2bba8bb0322a344cf0fc26ae0dd914de6b","observation_id":"8be8eba9-9e57-47a8-a3e0-143b2202ae30","resolution":{"observed_at":"2026-08-14T13:02:38.937185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T13:02:38.912495Z","title":null,"venue":null,"work_id":"f3c506a0-1b6f-4e30-90a1-ec80026e2e7e","year":2014},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.847492Z"},"links":{"citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:7b8f7e293a1614dd8cbd70d1577da539220b988c2d7394e8bb59ffaf448e443d","observation_id":"121ff7c9-a9aa-49a7-88b9-11a6fb44ea74","resolution":{"observed_at":"2026-08-14T13:02:38.918642Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","latest_version":6,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T03:51:52.809530Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":34},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:1908.06242."}