{"as_of":"2026-08-15T15:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7ccf7ec9dfcd7f4331b307c79111ade70eb486bfe45fbf3adbb7c51496458baf","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:42:38.796257Z","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.127635Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.13474","last_updated":"2020-06-24T04:37:31Z","snapshot_observed_at":"2026-08-15T07:53:49.267207Z","submitted_at":"2020-06-24T04:37:31Z","title":"Continuous Submodular Function Maximization","version":1},"cited_work":{"arxiv_id":"2006.13474","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.13474","snapshot_observed_at":"2026-08-08T20:42:39.127635Z","title":"Continuous Submodular Function Maximization","venue":"cs.LG","work_id":"5a320d7b-adaf-44ab-b345-53c89fdbcdaa","year":2020},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-08T20:42:38.796257Z"},"links":{"cited_paper":"/paper/2006.13474","citing_paper":"/paper/2502.05028"},"observation_digest":"sha256:ede5fbbce2dd475a49514ef5976656a367463d6d76500bcaf70ceeccc8ffe693","observation_id":"735617f8-0527-41f1-a05f-e4ffe588bf87","resolution":{"observed_at":"2026-08-08T20:42:39.131506Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2006.13474/citation-record","integrity":"/paper/2006.13474/integrity","json":"/paper/2006.13474/citation-record.json","paper":"/paper/2006.13474"},"outbound":[],"paper":{"arxiv_id":"2006.13474","last_updated":"2020-06-24T04:37:31Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T07:53:49.267207Z","submitted_at":"2020-06-24T04:37:31Z","title":"Continuous Submodular Function 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 1 inbound Pith citation observation for arXiv:2006.13474."}