{"as_of":"2026-08-18T00:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e0069421d4a3c135e57a49811ac5c321dc1aaaa75dfda48355ecf43c4b3bf9c4","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:48:18.504316Z","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-06T16:22:26.579706Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.13372","last_updated":"2024-05-24T14:14:19Z","snapshot_observed_at":"2026-08-16T15:13:30.578756Z","submitted_at":"2023-07-25T09:46:02Z","title":"Submodular Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13372","snapshot_observed_at":"2026-08-10T22:44:35.724004Z","title":"Submodular reinforcement learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.01071","last_updated":"2025-01-02T05:41:21Z","snapshot_observed_at":"2026-08-17T16:53:41.657348Z","submitted_at":"2025-01-02T05:41:21Z","title":"Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-10T22:44:35.724004Z"},"links":{"cited_paper":"/paper/2307.13372","citing_paper":"/paper/2501.01071"},"observation_digest":"sha256:c4287220c9b55e52fa4380de8f6e2e112658ee9141ec8d1527867900fc0e397e","observation_id":"ed293357-a6ac-4bdf-88ef-c3df1fcc2945","resolution":{"observed_at":"2026-08-10T22:44:35.724004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13372","last_updated":"2024-05-24T14:14:19Z","snapshot_observed_at":"2026-08-16T15:13:30.578756Z","submitted_at":"2023-07-25T09:46:02Z","title":"Submodular Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13372","snapshot_observed_at":"2026-08-15T19:48:18.504316Z","title":"N., and Krause, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.15385","last_updated":"2025-06-18T11:59:15Z","snapshot_observed_at":"2026-08-16T02:13:27.098103Z","submitted_at":"2025-06-18T11:59:15Z","title":"Provable Maximum Entropy Manifold Exploration via Diffusion Models","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T19:48:18.504316Z"},"links":{"cited_paper":"/paper/2307.13372","citing_paper":"/paper/2506.15385"},"observation_digest":"sha256:bbdcba8e90fa4fb9032684551d009a8d891bfff46df4775eceb0b6b23727436c","observation_id":"a6941a96-f167-4990-a7a5-6642208b0ddc","resolution":{"observed_at":"2026-08-15T19:48:18.504316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13372","last_updated":"2024-05-24T14:14:19Z","snapshot_observed_at":"2026-08-16T15:13:30.578756Z","submitted_at":"2023-07-25T09:46:02Z","title":"Submodular Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2307.13372","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.13372","snapshot_observed_at":"2026-08-06T16:22:26.579706Z","title":"Submodular Reinforcement Learning","venue":"cs.LG","work_id":"550e1cb2-f2bd-41f3-97f8-3709c0427625","year":2023},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.521631Z"},"links":{"cited_paper":"/paper/2307.13372","citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:e71b14485470ed64d0a2cb470b2006276f66bc456a39ccf318b58561dc897165","observation_id":"849bb8c3-526e-4a72-8623-6b20c14df2e9","resolution":{"observed_at":"2026-08-06T16:22:26.584763Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2307.13372/citation-record","integrity":"/paper/2307.13372/integrity","json":"/paper/2307.13372/citation-record.json","paper":"/paper/2307.13372"},"outbound":[],"paper":{"arxiv_id":"2307.13372","last_updated":"2024-05-24T14:14:19Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T15:13:30.578756Z","submitted_at":"2023-07-25T09:46:02Z","title":"Submodular Reinforcement Learning"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2307.13372."}