Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T15:29:40.859881Z
Paper Citation Record · LEDGER
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.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T15:29:40.859881Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
19 of 19 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 81bf5d1d-dbd1-42bf-8820-3a9ec8ec779a · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Streaming submodular maximization: massive data summarization on the fly
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation acb904a8-7486-4653-be4f-a50c197e8f8d · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Approxi- mating covering problems by randomized search heuristics using multi-objective models
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 774c8da9-b23a-4805-a7a9-73e45d5e7a17 · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions De- terminantal point processes for machine learning.Founda- tions and Trends® in Machine Learning, 5(2–3):123–286,
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 000fcefb-b08e-49d9-8b82-60047b1626fa · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Subset Selection under Noise
Reference 17
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation b5720959-46db-426a-b062-be7e860d56a7 · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Pareto op- timization for subset selection with dynamic cost con- straints
Reference 18
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 0a558a38-8d58-4736-88d2-610c5b5b9022 · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Maximizing monotone submodular functions over the integer lattice
Reference 19
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ad9c77f3-c538-416f-ba88-aafc3648c028 · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Randomized local search, evolutionary algo- rithms, and the minimum spanning tree problem
Reference 1978
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 87ebae38-7fd8-4192-aabc-cdbe93955028 · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Distributed submodular maximization: Identifying representative ele- ments in massive data
Reference 2002
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 5852d64e-ad8a-41cc-b10c-22431e45db2e · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Learning multiple layers of features from tiny images
Reference 2003
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c22ec544-07f2-4130-833a-f971ffde10de · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Maximizing the spread of influence through a so- cial network
Reference 2009
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 1bddf836-4564-4d1c-a9e0-1ff446ac0906 · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Finding groups in data: an introduction to cluster analysis, volume
Reference 2010
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 0976185e-faab-47cb-9c04-6e47adf7aea6 · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Maximizing submodular functions under ma- troid constraints by evolutionary algorithms
Reference 2011
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation e81c2b6b-bedc-4868-8ff3-a8e5613663d7 · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Running time analysis of multi-objective evolutionary algorithms on a simple discrete optimization problem
Reference 2012
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation eb250c1f-d484-44af-a3aa-07a029d14e50 · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Lazier Than Lazy Greedy
Reference 2013
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 3ef9e61f-0419-4ce3-95e4-eff0b133b060 · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Guaran- tees for greedy maximization of non-submodular functions with applications
Reference 2014
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 789e0f89-e04b-4779-b1dc-84b58b68603d · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Best Algorithms for Approximating the Maxi- mum of a Submodular Set Function
Reference 2015
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 03378407-3d6c-4071-b363-b262c50cd974 · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions An efficient evolutionary algorithm for subset selection with general cost constraints
Reference 2017
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 2fee1599-5bed-43fa-9718-dfcdc35c8110 · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Submodular meets Spectral: Greedy Algorithms for Sub- set Selection, Sparse Approximation and Dictionary Se- lection
Reference 2019
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 36c0e9f8-08c7-4436-b1fb-2b6d5d913255 · outbound
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions Crawford
Reference 2020
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
No inbound Pith citation observations are available.