{"as_of":"2026-08-16T10:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a6f70fee6f691c42b7b61b0cd371465a1a437db9c59a9ff4535ef8c65b3a9077","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:29:40.859881Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"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.01230/citation-record","integrity":"/paper/1908.01230/integrity","json":"/paper/1908.01230/citation-record.json","paper":"/paper/1908.01230"},"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-14T15:29:41.234090Z","title":"Streaming submodular maximization: massive data summarization on the fly","venue":null,"work_id":"db7b6366-5ecf-4ed9-87dd-9e92084e0a29","year":2014},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.753010Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:427f83cff8e2b969bf302d488113c7ebc55c562dc8144f21754c9baa3cfea7dd","observation_id":"81bf5d1d-dbd1-42bf-8820-3a9ec8ec779a","resolution":{"observed_at":"2026-08-14T15:29:41.239234Z","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-14T15:29:41.133145Z","title":"Approxi- mating covering problems by randomized search heuristics using multi-objective models","venue":null,"work_id":"5ea47821-d4bc-422e-ada9-6b65a78d3d3b","year":2010},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.791290Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:c9a52502984477f4de758a2cb37de508a576d3528b1ace21b6f173f246eda9c5","observation_id":"acb904a8-7486-4653-be4f-a50c197e8f8d","resolution":{"observed_at":"2026-08-14T15:29:41.138429Z","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-14T15:29:41.063646Z","title":"De- terminantal point processes for machine learning.Founda- tions and Trends® in Machine Learning, 5(2–3):123–286,","venue":null,"work_id":"af57c999-1591-48fd-a137-1552bdfcfd4b","year":2012},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.813671Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:450b767b5ae12bc990958dcc63582efbc0304b29588c27b1975abc313b7da623","observation_id":"774c8da9-b23a-4805-a7a9-73e45d5e7a17","resolution":{"observed_at":"2026-08-14T15:29:41.069803Z","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-14T15:29:40.951079Z","title":"Subset Selection under Noise","venue":null,"work_id":"09a2325f-a906-45fa-894a-2ae087fae621","year":2017},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.847285Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:b8404dfdfd266f02374a98c66398a2cec1e06e98ff3d674ff652d167b2e1a5b6","observation_id":"000fcefb-b08e-49d9-8b82-60047b1626fa","resolution":{"observed_at":"2026-08-14T15:29:40.956579Z","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-14T15:29:40.931815Z","title":"Pareto op- timization for subset selection with dynamic cost con- straints","venue":null,"work_id":"5c6d2ed2-afc2-4137-bacc-b9a861d2e531","year":2019},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.853503Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:6d299c6bf61b112f87611a1b42df0b88e7504234fce14aa15a4345dea718f24e","observation_id":"b5720959-46db-426a-b062-be7e860d56a7","resolution":{"observed_at":"2026-08-14T15:29:40.938417Z","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-14T15:29:40.898909Z","title":"Maximizing monotone submodular functions over the integer lattice","venue":null,"work_id":"9805c3a7-155b-427b-9136-c65135223a1d","year":2016},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.859881Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:31e37aff201a735e5005b554ba7d4dc3ad16b19519deeef0e02426aaef23652a","observation_id":"0a558a38-8d58-4736-88d2-610c5b5b9022","resolution":{"observed_at":"2026-08-14T15:29:40.918265Z","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-14T15:29:40.970128Z","title":"Randomized local search, evolutionary algo- rithms, and the minimum spanning tree problem","venue":null,"work_id":"56bb5d6b-3add-405b-b914-57442b1203bc","year":2007},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":1978,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.841605Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:62648dcb4e131ad09241e2d4a82cd169bc132bc96254e3812d8a38914aacbff4","observation_id":"ad9c77f3-c538-416f-ba88-aafc3648c028","resolution":{"observed_at":"2026-08-14T15:29:40.976074Z","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-14T15:29:41.027610Z","title":"Distributed submodular maximization: Identifying representative ele- ments in massive data","venue":null,"work_id":"17135072-cc3f-490c-8e21-4c5aa20c4ef8","year":2013},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.824792Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:832a8df792974c7d0d90ddf83512095cdec8347392c5ffc8a6a528127173bfb8","observation_id":"87ebae38-7fd8-4192-aabc-cdbe93955028","resolution":{"observed_at":"2026-08-14T15:29:41.033166Z","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-14T15:29:41.082676Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":"9d15fbad-9f86-4568-94e0-b3ca31e9db0c","year":2009},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.807791Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:b0114c74fafbcb33a87bb85384ecf2bed0da4f6c25328595c13ce64a851fb63d","observation_id":"5852d64e-ad8a-41cc-b10c-22431e45db2e","resolution":{"observed_at":"2026-08-14T15:29:41.088468Z","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-14T15:29:41.100686Z","title":"Maximizing the spread of influence through a so- cial network","venue":null,"work_id":"62c9a7fa-9a80-4789-ac2f-0896a0d96aa0","year":2003},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.802606Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:8e73fa186ae8c21dc1c1afeb385632cb1cdad2d19aaf8a5264a27797a3939def","observation_id":"c22ec544-07f2-4130-833a-f971ffde10de","resolution":{"observed_at":"2026-08-14T15:29:41.106427Z","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-14T15:29:41.117234Z","title":"Finding groups in data: an introduction to cluster analysis, volume","venue":null,"work_id":"d13af7a1-70ee-4180-a6ee-72a1fa8f8e7c","year":2009},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.797120Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:6edbe300f722b331068722cefc45ba870e43d988b74a1f4f70c3ec9ac14845b5","observation_id":"1bddf836-4564-4d1c-a9e0-1ff446ac0906","resolution":{"observed_at":"2026-08-14T15:29:41.122426Z","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-14T15:29:41.149885Z","title":"Maximizing submodular functions under ma- troid constraints by evolutionary algorithms","venue":null,"work_id":"ec70f1d6-edb4-4610-9986-a18ad0a93910","year":2014},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.783983Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:84fe0dd690412f0b52c727e2080641eb4e58f4da9d568ec33a2a8c647acf5ed7","observation_id":"0976185e-faab-47cb-9c04-6e47adf7aea6","resolution":{"observed_at":"2026-08-14T15:29:41.155431Z","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-14T15:29:41.045170Z","title":"Running time analysis of multi-objective evolutionary algorithms on a simple discrete optimization problem","venue":null,"work_id":"ced72fbf-b0d0-4af8-9203-b29d0d8254be","year":2002},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.818652Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:7859d169a3f56bea8a4e76de6a4b9e0eab4bcfe136a2bf54042bec5390be8c64","observation_id":"e81c2b6b-bedc-4868-8ff3-a8e5613663d7","resolution":{"observed_at":"2026-08-14T15:29:41.051461Z","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-14T15:29:41.006842Z","title":"Lazier Than Lazy Greedy","venue":null,"work_id":"abe02963-5c01-4692-8683-2eb0e945269d","year":2015},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.830168Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:b1f079ab37ddba9cfa3302b79237357e5c4c980625350a71af02891ba490f8f6","observation_id":"eb250c1f-d484-44af-a3aa-07a029d14e50","resolution":{"observed_at":"2026-08-14T15:29:41.013211Z","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-14T15:29:41.217411Z","title":"Guaran- tees for greedy maximization of non-submodular functions with applications","venue":null,"work_id":"45b0a36d-a682-4575-9ab2-5b3c3d409cb2","year":2017},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.759830Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:079daca076348965d6eef497a7a0b8dad7bdda422117c50a886d6512c7c7420d","observation_id":"3ef9e61f-0419-4ce3-95e4-eff0b133b060","resolution":{"observed_at":"2026-08-14T15:29:41.222919Z","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-14T15:29:40.988350Z","title":"Best Algorithms for Approximating the Maxi- mum of a Submodular Set Function","venue":null,"work_id":"72801817-b1c9-4214-b4d6-5e3a6291bbbe","year":1978},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.835623Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:79c77097163c478bdb48d195b606807aa4c1ecc2bae7f8ab125c2791da5ee8be","observation_id":"789e0f89-e04b-4779-b1dc-84b58b68603d","resolution":{"observed_at":"2026-08-14T15:29:40.993804Z","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-14T15:29:41.200668Z","title":"An efficient evolutionary algorithm for subset selection with general cost constraints","venue":null,"work_id":"df016435-9fe4-4f3d-b143-295f0ea7c3b2","year":2020},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.767043Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:8a8b6fbeab00021f996d7df392c72b5c889ca29cc8fc862bc1299189f7a9ce4c","observation_id":"03378407-3d6c-4071-b363-b262c50cd974","resolution":{"observed_at":"2026-08-14T15:29:41.205962Z","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-14T15:29:41.168275Z","title":"Submodular meets Spectral: Greedy Algorithms for Sub- set Selection, Sparse Approximation and Dictionary Se- lection","venue":null,"work_id":"5825770e-bd87-4341-aeab-68598b878d1c","year":2011},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.778120Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:e5984eb7ee22f87bb394c267fb6cf079f32a1255966e057df4ee99fa35bed9d2","observation_id":"2fee1599-5bed-43fa-9718-dfcdc35c8110","resolution":{"observed_at":"2026-08-14T15:29:41.173385Z","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-14T15:29:41.184638Z","title":"Crawford","venue":null,"work_id":"092668be-9ead-4ac9-8190-336d72c935c0","year":2019},"citing_paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions","version":5},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-14T15:29:40.772941Z"},"links":{"citing_paper":"/paper/1908.01230"},"observation_digest":"sha256:8bf279c622cbe6864a2b839c029e69e6e6aedfd803d7cdc6dc7c031a41b78b1b","observation_id":"36c0e9f8-08c7-4436-b1fb-2b6d5d913255","resolution":{"observed_at":"2026-08-14T15:29:41.189611Z","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"}}],"paper":{"arxiv_id":"1908.01230","last_updated":"2021-07-05T18:02:23Z","latest_version":5,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T07:38:31.704219Z","submitted_at":"2019-08-03T20:28:16Z","title":"Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":19},"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 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:1908.01230."}