{"as_of":"2026-08-22T09:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:745c3f7826d21c054a6a0912fcea2ed4aadc8914804c8653f149da431112da76","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-08T19:59:51.397294Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2607.05759/citation-record","integrity":"/paper/2607.05759/integrity","json":"/paper/2607.05759/citation-record.json","paper":"/paper/2607.05759"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.570664Z","title":"Information-theoretic feature selection via tensor decomposition and submodularity.IEEE Transactions on Signal Processing, 69:6195– 6205, 2021","venue":null,"work_id":"d8e15c23-e787-4511-aa50-7e7ce8e89cdb","year":2021},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:4195190f305c3b453d432a581ab3b300577c3345b0910d924ede9c00dcda3d1e","observation_id":"5700bbea-45cf-40fc-8144-c608f3bda5ff","resolution":{"observed_at":"2026-07-08T20:05:34.571850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.565163Z","title":"Fast algorithms for maximizing submodular functions","venue":null,"work_id":"9ccedce0-3581-456f-a625-222f5f4008e9","year":2014},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:c4dd1629e4c5e656b1f70c7bcb28ccfdb0d4bb6d6621c23eff06a17269d47626","observation_id":"38f33cef-204b-4a23-baa1-034c07180a84","resolution":{"observed_at":"2026-07-08T20:05:34.566277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.563593Z","title":"Instance specific approximations for submodular maximization","venue":null,"work_id":"3f69c4b2-d872-4baa-9c9e-4bf17f26dbf1","year":2021},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:8b3cbde596d5c7a0fbd942e36e5e260e0926981ac30823e573f119af6d32a142","observation_id":"20cd3276-21db-43e6-9aee-718bd524e944","resolution":{"observed_at":"2026-07-08T20:05:34.564674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.568994Z","title":"Submodular feature selection for partial label learning","venue":null,"work_id":"be968fb7-8ee8-4509-aada-e7c24a11181c","year":2022},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:497d65a9b31347a39342ca95379dbd68ce1cd5d3d0920d4490b29b951e7a6d12","observation_id":"0c319ba1-e050-44a0-9e6f-055417cf7196","resolution":{"observed_at":"2026-07-08T20:05:34.570126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24432/c5xw20","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T10:06:09.313008Z","title":"Becker, R","venue":"UC Irvine","work_id":"87bf1dec-b317-4d1c-834f-647506c211f5","year":1996},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:28f91cd14c095fea3a433ecc390e35a86de3da5d84d46576dcf38d40233d3c92","observation_id":"5d239598-7762-481f-8f0d-f5881bdd199b","resolution":{"observed_at":"2026-07-08T20:05:33.882104Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-04T00:08:29.277373+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-04T00:08:29.277373+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.567020Z","title":"The fast algorithm for submodular maximization","venue":null,"work_id":"2626bbd6-ab96-4ec7-a421-391eaea2a1f7","year":2020},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:251e043d81d0d4fd125ca032d02dc9dcad5c85183d9d11cf49a84db66a5aa763","observation_id":"9f9f5003-9100-471f-8b50-b4de2657b862","resolution":{"observed_at":"2026-07-08T20:05:34.568339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.07808","last_updated":"2023-11-13T23:47:55Z","snapshot_observed_at":"2026-08-16T14:43:36.294905Z","submitted_at":"2023-11-13T23:47:55Z","title":"A Primal-Dual Analysis of Monotone Submodular Maximization","version":1},"cited_work":{"arxiv_id":"2311.07808","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.07808","snapshot_observed_at":"2026-07-08T20:05:34.132707Z","title":"A Primal-Dual Analysis of Monotone Submodular Maximization","venue":"cs.DS","work_id":"a9f417fe-a200-4e93-a58b-c0a1e28ddb5e","year":2023},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"cited_paper":"/paper/2311.07808","citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:752fff59a67774dc7ff4b188e7e6ca582b666164e112d1ac3ca6751d016fec9c","observation_id":"e8bbcade-847b-4673-85e5-e91b49c09ef8","resolution":{"observed_at":"2026-07-08T20:05:34.133897Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1102.3975","last_updated":"2011-02-25T01:12:26Z","snapshot_observed_at":"2026-08-18T19:21:48.901162Z","submitted_at":"2011-02-19T07:25:00Z","title":"Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection","version":2},"cited_work":{"arxiv_id":"1102.3975","doi":null,"metadata_source":"pith","pith_arxiv_id":"1102.3975","snapshot_observed_at":"2026-07-08T20:05:34.130053Z","title":"Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection","venue":"stat.ML","work_id":"154b0f06-cae3-46c7-8ac4-2b11b3491dc0","year":2011},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"cited_paper":"/paper/1102.3975","citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:b45ce31a72279c5553946a52497b1bc35412f55091db67de737df886997e6d99","observation_id":"4a49962d-585f-49d0-b74e-d52227bd68d0","resolution":{"observed_at":"2026-07-08T20:05:34.131503Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.553343Z","title":"Revenue submodularity","venue":null,"work_id":"e247f5e5-26af-4f63-aa71-61dec25cd63b","year":2009},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:dc46fe5172c170bc0680ccd70c049110fe49c76b06c827dd6def3b36af2d3e41","observation_id":"da0d7cb5-d788-4c4a-a7a6-903729c8daed","resolution":{"observed_at":"2026-07-08T20:05:34.554379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.556602Z","title":"A threshold of ln n for approximating set cover.Journal of the ACM, 45(4):634–652, 1998","venue":null,"work_id":"15648550-4a1e-4a1a-bbd2-b22db0ec6bdf","year":1998},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:37fd80eea948fb9af582f313b1962ab65ae9d0d21211dab77ccc6e42ba667410","observation_id":"61ef6116-a338-4909-91c3-2d2f8e0606f1","resolution":{"observed_at":"2026-07-08T20:05:34.557830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.549886Z","title":"Practical budgeted submodular maximization","venue":null,"work_id":"f624287a-730b-4f72-a43a-36c62bb61da8","year":2023},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:237493cd6d77dffad99de16462931016dcfe2fcca7d898c8ace893b73b98027f","observation_id":"f6522a44-1105-417b-8fe0-64334e7c4289","resolution":{"observed_at":"2026-07-08T20:05:34.551076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.551663Z","title":"Budgeted nonparametric learning from data streams","venue":null,"work_id":"ba0b9242-a7dc-4209-8b14-7fe508e5affe","year":2010},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:265b4907d28dbfc16881a28ca451c47183f45566709151bc70894b4c801042ee","observation_id":"a56c3d25-bc54-4a09-a3c0-b1945c139e64","resolution":{"observed_at":"2026-07-08T20:05:34.552789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.554885Z","title":"Scalable deletion-robust submodular maximization: Data summarization with privacy and fairness constraints","venue":null,"work_id":"2dd28609-af8d-410f-b7ab-f5c8dd479a35","year":2018},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:03185c72a9145421de450af93068af4d64c3207699c84483c0f23406fe7562dd","observation_id":"d386d246-6ba5-4aa7-b816-da7b2af10b59","resolution":{"observed_at":"2026-07-08T20:05:34.556052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.558528Z","title":"Maximizing the spread of influence through a social network","venue":null,"work_id":"aa710f13-fe70-46fc-b66f-9c989829cfbc","year":2003},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:568bda254a49c87521900f68ac61e2f1e537d656ee838dc547301936a671cceb","observation_id":"71798e85-52f2-4886-87dc-882e036ea630","resolution":{"observed_at":"2026-07-08T20:05:34.559675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0020-0190(99)00031-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The budgeted maximum cov- erage problem.Information Processing Letters, 70(1):39–45, 1999","venue":"Information Processing Letters","work_id":"454a1cf2-014e-4eba-be2a-c1e88bcee30e","year":1999},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:5792ae0d33d4285a3e9f9c554e5da13ba3a841a15b8571b4ad794383eb010ab0","observation_id":"40b788c4-5e02-433d-80b0-52a326bc9b68","resolution":{"observed_at":"2026-07-08T20:05:33.880384Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T09:19:25.850788+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T09:19:25.850788+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.560174Z","title":"Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies.Journal of Machine Learning Research, 9(2)","venue":null,"work_id":"83d5e0e3-7b31-4bca-ab99-71b62f18aa05","year":2008},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:4c8e64abfa294a48e54d4ab12060694c23357a2560117cd24e6f11797cc97256","observation_id":"9a1b2633-dfa8-4414-95ce-b03dd1784438","resolution":{"observed_at":"2026-07-08T20:05:34.561388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.541005Z","title":"A refined analysis of submodular greedy.Opera- tions Research Letters, 49(4):507–514, 2021","venue":null,"work_id":"326a0339-21a6-471f-b535-b27bd101f2e0","year":2021},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:ce8ecdd381cfdee210214739061b9b62ada2eea2026ebc9a3f967d721737b603","observation_id":"3780b9b8-19ba-4280-820b-2b8a7e5ccd5b","resolution":{"observed_at":"2026-07-08T20:05:34.542210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.542763Z","title":"Cost-effective outbreak detection in networks","venue":null,"work_id":"d8eea4a7-e896-4108-a0f2-ba9c84cf442e","year":2007},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:22bdd5f6d6ba97a3147477f8fd3e253600bfd2bcc112823427dd27ef8aedac56","observation_id":"a7c314f8-2171-4755-bdd1-49ca9cc7c414","resolution":{"observed_at":"2026-07-08T20:05:34.543862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.544374Z","title":"SNAP Datasets: Stanford large network dataset collection","venue":null,"work_id":"1ca5edd6-5128-4184-a3b9-a23e7926f729","year":2014},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:8f77dbd40b055410ed511b9e1be2b66f735ddbb6699d63cdc272b57ae39871b6","observation_id":"133da4a4-5c1c-4d3f-ba31-76d1325b67d7","resolution":{"observed_at":"2026-07-08T20:05:34.545449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.547915Z","title":"Multi-document summarization via budgeted maximization of submodular functions","venue":null,"work_id":"dc5c9d88-9fce-4e64-9104-808e4b35774c","year":2010},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:7bc24eef6b85bcd074344bc9894b5feac21126fb2a7635a0dd5d1c0cbd3f883b","observation_id":"923f72f2-2c22-44c7-8566-74578f2c239f","resolution":{"observed_at":"2026-07-08T20:05:34.549208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.545950Z","title":"Leveraging sparsity for efficient submod- ular data summarization.Advances in Neural Information Processing Systems, 29, 2016","venue":null,"work_id":"484a8864-0dee-4b6b-a33f-7a60974db5ca","year":2016},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:b72bbccc68569babda979e1a7d54c16355f30f96d23a8993e4459fbb85ba028b","observation_id":"36670962-46aa-4b23-b277-1653c9ca88d1","resolution":{"observed_at":"2026-07-08T20:05:34.547339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.539396Z","title":"Nemhauser and Laurence A","venue":null,"work_id":"8ce02e3c-c5ea-4efe-95d5-30fee5bd3515","year":1978},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:9033a0a0cc536f5b45cb49b2d4c61ada7290b1b575000e95c12dc614616cc1c6","observation_id":"239b4509-0484-4476-a088-af910ce3fa91","resolution":{"observed_at":"2026-07-08T20:05:34.540428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.536447Z","title":"Rossi and Nesreen K","venue":null,"work_id":"568f6032-bbdc-4897-b334-c9dbb0bd6612","year":2015},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:2aded4f658f8eeec4bdff5102ff59085e9202a3045a6cd8799cc05e7d20952a1","observation_id":"36e88f75-3e83-40ba-bf61-ddc1debaaa08","resolution":{"observed_at":"2026-07-08T20:05:34.537428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.561896Z","title":"A note on maximizing a submodular set function subject to a knapsack constraint","venue":null,"work_id":"34236fb8-b1cd-4524-9129-d735e2849cbb","year":2004},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:311eac7362e59c2392861c8bb0d7c811ad9f8507509e58f79bec04f626992c92","observation_id":"e509a246-0f22-4686-abc9-1b2b3cf40044","resolution":{"observed_at":"2026-07-08T20:05:34.563070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.533094Z","title":"Revisiting modified greedy algorithm for monotone submodular maximization with a knapsack constraint","venue":null,"work_id":"d79291a1-132b-44b0-844e-516fd5e9c238","year":2021},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:bfc9e4013523a234e66c7a88ad0029dd0be7b8948db62655ba1ff678404f395d","observation_id":"3441ff5a-aa5c-4f70-9efb-6af69a3f6984","resolution":{"observed_at":"2026-07-08T20:05:34.534259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.534807Z","title":"Online processing algorithms for influence maximization","venue":null,"work_id":"84ee07a0-d235-479b-a81a-ac86ee087e60","year":2018},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:ba781d886f86ab39a726621e288a724d414d0c11b5218cad01860bdd7709e7a1","observation_id":"a8461083-0b7b-4b03-a7ca-5f4f765db645","resolution":{"observed_at":"2026-07-08T20:05:34.535915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.537923Z","title":null,"venue":null,"work_id":"394386c7-ff19-4a82-a545-f51d33707ecb","year":1982},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:93a46de55fdbbee7e24ec09ac85810037031a4b08bc712bc5f34561b80efb79c","observation_id":"eb92d447-5121-4407-85bd-a37d3a50c742","resolution":{"observed_at":"2026-07-08T20:05:34.538895Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.531575Z","title":"bring your own greedy","venue":null,"work_id":"7dfc3203-cc4d-4867-9a1f-b8c032eb2888","year":2020},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:483b4f47927bd28feaac575f8542a56ecd7861986d1f7adf4e67c828f9f66d8a","observation_id":"1a1058e6-ae06-4da2-b9ff-1fad40cfcfb3","resolution":{"observed_at":"2026-07-08T20:05:34.532607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9819.321994","doi":"10.1145/3219819.3219944","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Smoothed dilated convolutions for improved dense prediction","venue":null,"work_id":"5587a00c-c16e-46f2-9df2-f84a9cbf4600","year":2018},"citing_paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-08T19:59:51.397294Z"},"links":{"citing_paper":"/paper/2607.05759"},"observation_digest":"sha256:21c2bec779960853fe9bae74cd6c44e1084fa4a1f2a723acf143565249b03e75","observation_id":"a6c90247-a09b-4a05-ac67-96460c68c712","resolution":{"observed_at":"2026-07-08T20:05:33.878461Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.05759","last_updated":"2026-07-07T02:34:10Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T06:22:16.844204Z","submitted_at":"2026-07-07T02:34:10Z","title":"Data-dependent Evaluations for Budgeted Submodular Maximization"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":1,"verified_exact":4,"verified_fuzzy":23},"total_outbound_references":29},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2607.05759."}