{"as_of":"2026-08-15T07:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:09e0fc8365c2320dfb8c87c8b9f57512e4da94d2ffcc46b184deb1270da8d845","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-15T06:32:42.880941+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-08T20:42:39.027006Z","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-08T20:42:39.084831Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.08330","last_updated":"2024-07-24T08:13:26Z","snapshot_observed_at":"2026-08-13T04:42:04.608261Z","submitted_at":"2024-01-16T12:49:10Z","title":"Boosting Gradient Ascent for Continuous DR-submodular Maximization","version":2},"cited_work":{"arxiv_id":"2401.08330","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.08330","snapshot_observed_at":"2026-08-08T20:42:39.084831Z","title":"Boosting Gradient Ascent for Continuous DR-submodular Maximization","venue":"cs.LG","work_id":"a8390a36-ce75-4c03-a900-572fcf44fd1d","year":2024},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-14T01:21:16.688709Z","submitted_at":"2025-02-07T15:57:56Z","title":"Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:39.027006Z"},"links":{"cited_paper":"/paper/2401.08330","citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:90f81d8954da60dd155422c2ca400af8809b27a9f5179153f5342082833e1489","observation_id":"d145699e-4209-4e17-b01a-5e04ddec62cb","resolution":{"observed_at":"2026-08-08T20:42:39.090502Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08330","last_updated":"2024-07-24T08:13:26Z","snapshot_observed_at":"2026-08-13T04:42:04.608261Z","submitted_at":"2024-01-16T12:49:10Z","title":"Boosting Gradient Ascent for Continuous DR-submodular Maximization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08330","snapshot_observed_at":"2026-08-02T21:28:26.156125Z","title":"Boosting gradient ascent for continuous dr-submodular maximization.arXiv preprint arXiv:2401.08330,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.20578","last_updated":"2026-07-10T17:38:26Z","snapshot_observed_at":"2026-08-09T17:28:02.084755Z","submitted_at":"2026-02-24T05:59:42Z","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-02T21:28:26.156125Z"},"links":{"cited_paper":"/paper/2401.08330","citing_paper":"/paper/2602.20578"},"observation_digest":"sha256:af2ecdd28df354ab38b52df93194cd619bb0b10a2393e9e20c941c0967b74ef2","observation_id":"df46b960-6def-4d4d-9815-7c29081efcb0","resolution":{"observed_at":"2026-08-02T21:28:26.156125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2401.08330/citation-record","integrity":"/paper/2401.08330/integrity","json":"/paper/2401.08330/citation-record.json","paper":"/paper/2401.08330"},"outbound":[],"paper":{"arxiv_id":"2401.08330","last_updated":"2024-07-24T08:13:26Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T04:42:04.608261Z","submitted_at":"2024-01-16T12:49:10Z","title":"Boosting Gradient Ascent for Continuous DR-submodular Maximization"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2401.08330."}