{"as_of":"2026-08-11T13:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c020a8a03313856d1e27593ab8beabb262d3204ca69eb1ef430e42ca04b6ec99","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-11T06:34:44.6726+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:38.909277Z","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-06T10:09:18.661812Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.18442","last_updated":"2023-05-29T02:54:31Z","snapshot_observed_at":"2026-08-02T03:42:41.595899Z","submitted_at":"2023-05-29T02:54:31Z","title":"Improved Projection-free Online Continuous Submodular Maximization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18442","snapshot_observed_at":"2026-08-08T20:42:38.909277Z","title":"Improved projection-free online continuous submodular maximization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05028","last_updated":"2025-02-07T15:57:56Z","snapshot_observed_at":"2026-08-10T12:10:35.709406Z","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":45,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.909277Z"},"links":{"cited_paper":"/paper/2305.18442","citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:ea1018bc128143524f4322403908f2384ec7df9bf1f16a0781acde4db5d5b0de","observation_id":"9b9be261-c349-4d23-ae51-167feb4682ff","resolution":{"observed_at":"2026-08-08T20:42:38.909277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18442","last_updated":"2023-05-29T02:54:31Z","snapshot_observed_at":"2026-08-02T03:42:41.595899Z","submitted_at":"2023-05-29T02:54:31Z","title":"Improved Projection-free Online Continuous Submodular Maximization","version":1},"cited_work":{"arxiv_id":"2305.18442","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.18442","snapshot_observed_at":"2026-08-06T10:09:18.661812Z","title":"Improved Projection-free Online Continuous Submodular Maximization","venue":"cs.LG","work_id":"189861cc-bee3-49f5-8ef2-14769814c842","year":2023},"citing_paper":{"arxiv_id":"2508.00523","last_updated":"2025-08-01T11:00:19Z","snapshot_observed_at":"2026-08-09T16:40:14.334466Z","submitted_at":"2025-08-01T11:00:19Z","title":"Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T10:09:15.914337Z"},"links":{"cited_paper":"/paper/2305.18442","citing_paper":"/paper/2508.00523"},"observation_digest":"sha256:0af69171f5a83b6b96c1d1c12d59f73fcee0b877153c0e1daf5cf2f8c56fea3a","observation_id":"1221c095-8a5e-4ecc-bc67-9289003dfa88","resolution":{"observed_at":"2026-08-06T10:09:18.666594Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.18442/citation-record","integrity":"/paper/2305.18442/integrity","json":"/paper/2305.18442/citation-record.json","paper":"/paper/2305.18442"},"outbound":[],"paper":{"arxiv_id":"2305.18442","last_updated":"2023-05-29T02:54:31Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T03:42:41.595899Z","submitted_at":"2023-05-29T02:54:31Z","title":"Improved Projection-free Online Continuous 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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2305.18442."}