{"as_of":"2026-08-21T13:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:385952f1bba85cb326ea87128bcdde028c67c21edd8c900b2f26243d5aca1140","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:02:38.677091Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T00:12:39.831275Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.09064","last_updated":"2021-11-23T18:13:48Z","snapshot_observed_at":"2026-08-14T16:03:55.721073Z","submitted_at":"2019-07-22T00:41:49Z","title":"Performance-Complexity Tradeoffs in Greedy Weak Submodular Maximization with Random Sampling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.09064","snapshot_observed_at":"2026-08-14T13:02:38.677091Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06242","last_updated":"2020-01-10T10:47:02Z","snapshot_observed_at":"2026-08-17T05:20:43.839171Z","submitted_at":"2019-08-17T04:50:57Z","title":"Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint","version":6},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:38.677091Z"},"links":{"cited_paper":"/paper/1907.09064","citing_paper":"/paper/1908.06242"},"observation_digest":"sha256:b4b68aca7c3bd086330f4669dba161c49f437fcf60f2f327135bbbbc2760e00d","observation_id":"55c0484c-0927-480b-9ee0-b90eafd89688","resolution":{"observed_at":"2026-08-14T13:02:38.677091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.09064","last_updated":"2021-11-23T18:13:48Z","snapshot_observed_at":"2026-08-14T16:03:55.721073Z","submitted_at":"2019-07-22T00:41:49Z","title":"Performance-Complexity Tradeoffs in Greedy Weak Submodular Maximization with Random Sampling","version":3},"cited_work":{"arxiv_id":"1907.09064","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.09064","snapshot_observed_at":"2026-08-06T00:12:39.831275Z","title":"Performance-Complexity Tradeoffs in Greedy Weak Submodular Maximization with Random Sampling","venue":"cs.DM","work_id":"44d4b37f-ad14-4c74-a112-a24d43b63fe2","year":2019},"citing_paper":{"arxiv_id":"2608.01502","last_updated":"2026-08-02T21:20:16Z","snapshot_observed_at":"2026-08-18T19:24:10.070480Z","submitted_at":"2026-08-02T21:20:16Z","title":"Stochastic Sequential Search in Very-High-Dimensional Feature Selection","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T00:12:38.924338Z"},"links":{"cited_paper":"/paper/1907.09064","citing_paper":"/paper/2608.01502"},"observation_digest":"sha256:6f3b2a8681b7b50e8774bcb48dc4fadec456eb11971421eaa720ec1ebc5831a9","observation_id":"aca3ff50-1fbe-44b2-a62e-32ffcb37f0e6","resolution":{"observed_at":"2026-08-06T00:12:39.878855Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1907.09064/citation-record","integrity":"/paper/1907.09064/integrity","json":"/paper/1907.09064/citation-record.json","paper":"/paper/1907.09064"},"outbound":[],"paper":{"arxiv_id":"1907.09064","last_updated":"2021-11-23T18:13:48Z","latest_version":3,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-14T16:03:55.721073Z","submitted_at":"2019-07-22T00:41:49Z","title":"Performance-Complexity Tradeoffs in Greedy Weak Submodular Maximization with Random Sampling"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1907.09064."}