{"as_of":"2026-08-17T03:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b75015a32d55710bf5efaa8f89377057b85fd06e35a2326a8dd7d3973670e228","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:35:17.858524Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"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.01029/citation-record","integrity":"/paper/1908.01029/integrity","json":"/paper/1908.01029/citation-record.json","paper":"/paper/1908.01029"},"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:35:18.145790Z","title":"Badanidiyuru and J","venue":null,"work_id":"46c42051-db06-4021-a7ad-e6733d4ad0fe","year":2014},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.762129Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:0db9b7e499bfebc3be089d13621888a5c9e30ab8ff67cfcbae7ed5655a984090","observation_id":"2d2d65c2-00bb-4c5b-8615-7374161ee323","resolution":{"observed_at":"2026-08-14T15:35:18.151054Z","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:35:18.133485Z","title":"Borgs, M","venue":null,"work_id":"0751141b-af13-4e60-b2d1-ee1981ade660","year":2014},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.767030Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:5b643d3a41fa3f8713cb9913f0feaaef76687037125e400f8b7b965b21e4306f","observation_id":"d97ae4b5-bd42-466b-a04b-e540d48e48ef","resolution":{"observed_at":"2026-08-14T15:35:18.137564Z","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:35:18.120508Z","title":null,"venue":null,"work_id":"6be0ae3b-cb34-4f39-8e6c-b91b7fd744de","year":2010},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.772123Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:b0b74a97b6a43aeb86b0699b79d301cfa18c9d8f171f94cabf32350d3f26bcd3","observation_id":"8ee02806-67ec-446c-9d1f-5bc6accaa2b2","resolution":{"observed_at":"2026-08-14T15:35:18.125261Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:35:17.776991Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.776991Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:71783dfbdc12e7a3e5cff6d945561cf6477263bb77056d280e0aa175059cd6ee","observation_id":"3bbffa6b-341e-4105-81b7-befb28844969","resolution":{"observed_at":"2026-08-14T15:35:17.776991Z","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-14T15:35:18.097984Z","title":"Friedrich and F","venue":null,"work_id":"e0ded9b3-eff3-444c-b187-dda2522572ac","year":2014},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.781247Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:d6f8724f9669c291729862838dce7c3206d388543e89ec53970687b0e120e3f7","observation_id":"b762ac59-9b7d-4443-aa08-d75e6d41c9c3","resolution":{"observed_at":"2026-08-14T15:35:18.102332Z","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:35:18.085738Z","title":"Friedrich and F","venue":null,"work_id":"c46dcf50-104c-4fa7-b30e-52f766f652b5","year":2015},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.786719Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:b95fced5ad1bb270eff1cc8f28bc9f91c671bf172e0cf0ad69cbb366708a9604","observation_id":"364b72e0-0072-40ab-9bdf-ab3c660959d0","resolution":{"observed_at":"2026-08-14T15:35:18.089953Z","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:35:18.074497Z","title":"Friedrich, A","venue":null,"work_id":"5960f0d2-ab43-4d7e-a527-4369ef0e8382","year":2018},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.791099Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:813842ccb5db9059679eab48a899e6bcc7cd3e064ffa6e86b113871e880a7d29","observation_id":"23d3ccb9-e79e-4791-ad25-f35aaff0d593","resolution":{"observed_at":"2026-08-14T15:35:18.078306Z","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:35:18.063466Z","title":"Goyal, F","venue":null,"work_id":"bfb3a50f-3bb8-4df6-9226-152410998bd1","year":2013},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.795241Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:57b771f15c3faa3d27348e7113c9b06000339234b99081436e6ba3ba594e6a9c","observation_id":"cfba5ca9-7be5-4831-864f-f0082182b7be","resolution":{"observed_at":"2026-08-14T15:35:18.067254Z","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:35:18.051964Z","title":"Guillory and J","venue":null,"work_id":"a4b8a744-3762-4952-bd14-e6bf0d7f2f9a","year":2011},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.798904Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:d2bc3417d1a7d9fdaf2c14e815efa7fa363510bdaca01e328a47512db56337a2","observation_id":"417f0794-80b6-4533-a220-e9025504cc4e","resolution":{"observed_at":"2026-08-14T15:35:18.056178Z","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:35:18.040823Z","title":"Horoba and F","venue":null,"work_id":"4735442e-3102-44a5-874b-ff25db6ce1d5","year":2009},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.803956Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:6bd7f96881df14bb0f08bd40714fe1f77653964e8c064956e70a5eabb0bfc00d","observation_id":"dc95304e-9446-4432-bb32-40305d92bf3f","resolution":{"observed_at":"2026-08-14T15:35:18.044727Z","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:35:18.029550Z","title":null,"venue":null,"work_id":"e187c800-8c2e-4363-b03b-017a6b08a14e","year":2013},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.807759Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:8e00b07a90876326b4cfe454d186c5a0a12df5756e3ffde1729e6b745b66a272","observation_id":"693c4821-541e-4ef1-801e-585257877c81","resolution":{"observed_at":"2026-08-14T15:35:18.033309Z","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-14T15:35:18.018552Z","title":"Kempe, J","venue":null,"work_id":"4c4a1226-1c87-4a63-8f54-a8e20948536c","year":2003},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.811637Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:a6664cca02ee67d9e184f9833f80c4524277c8a9a556cdfc8c8c4d912ae1c575","observation_id":"b5090f7f-d446-4265-af8d-616cc5978502","resolution":{"observed_at":"2026-08-14T15:35:18.022087Z","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:35:18.007699Z","title":"Kuhnle, T","venue":null,"work_id":"d34eddf8-2f78-4261-a0b3-86632544d862","year":2017},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.816265Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:a68e9b7569ecb1f05fe7c18458020c06cccff569ed2f174ac02c3a561cc08cef","observation_id":"6628ec80-88b2-4c6f-8dd9-f8bf89481695","resolution":{"observed_at":"2026-08-14T15:35:18.011590Z","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:35:17.996680Z","title":"Laumanns, L","venue":null,"work_id":"e9334261-5e0e-4bfc-8dec-ddf69c698d1e","year":2002},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.821495Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:8cfb2f92edfb6c8bbd45a77ade0eff16aa161f6835ceda409607147f2f522f97","observation_id":"ea3a0198-fc47-45e2-baa6-d4cda3f13736","resolution":{"observed_at":"2026-08-14T15:35:18.000465Z","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:35:17.985253Z","title":"Leskovec and A","venue":null,"work_id":"58b7bb70-109f-4f74-bee0-16fb12ce08f5","year":2015},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.825427Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:dab657caa8934698ce0f2cf0e7d94e7f54460a9d29ffe8378da70b6ee7513f7b","observation_id":"cb7c1ec9-1e4d-4024-9f97-d750f0260b4b","resolution":{"observed_at":"2026-08-14T15:35:17.989113Z","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:35:17.974756Z","title":"Mirzasoleiman, A","venue":null,"work_id":"ba9a6518-783a-4585-b585-f3356291de3f","year":2015},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.829391Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:807a8a4002afceee8aba1a0eb2a727347f502f68d1102b9805e7137cd7f88de3","observation_id":"4fb89813-ec73-45ff-9a25-0bf62b57a668","resolution":{"observed_at":"2026-08-14T15:35:17.978436Z","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:35:17.963764Z","title":"Mirzasoleiman, M","venue":null,"work_id":"53befeb2-a7e6-49e4-9c83-64c0ef3ea861","year":2016},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.833410Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:27fcc63164e7d5c70a77b9a5db8a4ca944b789317b1a274b35ae089037a7f848","observation_id":"54b10278-7190-4575-8adb-16d0de50ffd5","resolution":{"observed_at":"2026-08-14T15:35:17.967823Z","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:35:17.951497Z","title":null,"venue":null,"work_id":"60b6dfdf-ec26-4f20-9ebd-7e93c6ca4eb9","year":1978},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.837947Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:7a6bf60051245ec9d27aee544971937601159d4afb67f926518345f56cffe8a3","observation_id":"17f06b8e-b7ab-4779-a79e-667a70da4f9e","resolution":{"observed_at":"2026-08-14T15:35:17.955718Z","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-14T15:35:17.939844Z","title":"Norouzi-Fard, A","venue":null,"work_id":"60bdd7d6-0507-419d-98a9-79f05ec5d341","year":2016},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.842166Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:23105927560ebdd55f85549eb58269f6414d99a7b081502baac41a97b6a91d3e","observation_id":"1cb7a4ee-8361-40aa-8dc6-87f261d78a4f","resolution":{"observed_at":"2026-08-14T15:35:17.943575Z","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:35:17.926108Z","title":null,"venue":null,"work_id":"777a9502-82a6-4c97-b851-f2516441f2cf","year":2015},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.846068Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:07b86bf6e142eddb9af4419dafd23b37b4280dbbac92d67b81f24c8f996210d2","observation_id":"a8bea8c8-a1f4-4b9c-945e-27502b80d536","resolution":{"observed_at":"2026-08-14T15:35:17.931415Z","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-14T15:35:17.913723Z","title":null,"venue":null,"work_id":"c575216a-5504-49da-b921-7fefba604bb2","year":2015},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.850041Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:1723efe8b021d0b06cb1a83b1d957c6190df4fdab910495fd6e45aaac6d4976d","observation_id":"7089fe41-26ae-44fa-8607-40ca8c8f8664","resolution":{"observed_at":"2026-08-14T15:35:17.917646Z","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-14T15:35:17.901631Z","title":"Qian, J.-C","venue":null,"work_id":"9dd0c1b6-f29e-4307-bdfd-83ef3a575366","year":2017},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.854854Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:a456fa45b418470c14e9b171811eefaee644be32625cf0cabdd39874c0577cc3","observation_id":"f77081b1-8417-4b91-979b-d0c846236cd4","resolution":{"observed_at":"2026-08-14T15:35:17.905976Z","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:35:17.888226Z","title":null,"venue":null,"work_id":"958f1f0d-976a-4bac-8435-daf3ec25b422","year":1982},"citing_paper":{"arxiv_id":"1908.01029","last_updated":"2019-08-02T19:46:33Z","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T15:35:17.858524Z"},"links":{"citing_paper":"/paper/1908.01029"},"observation_digest":"sha256:d34f7fd13bfc76014681d2f152878f06bef43fadf5f1bc8ee9145f03da9ce837","observation_id":"8a114c91-0bf1-4331-bb9d-9fe9125b3a2e","resolution":{"observed_at":"2026-08-14T15:35:17.893224Z","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.01029","last_updated":"2019-08-02T19:46:33Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T15:33:12.042286Z","submitted_at":"2019-08-02T19:46:33Z","title":"An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":23},"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 17 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:1908.01029."}