{"as_of":"2026-08-09T14:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c387c16f1d0cdf85bd38da35ad2b7a13b74ae90565617a642619c4c6f51d1ac3","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-09T06:31:02.800959+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-01T06:15:18.990560Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.14846","last_updated":"2022-06-29T18:17:28Z","snapshot_observed_at":"2026-08-07T18:48:25.156906Z","submitted_at":"2022-06-29T18:17:28Z","title":"Provably Efficient Reinforcement Learning for Online Adaptive Influence Maximization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.14846","snapshot_observed_at":"2026-08-01T06:15:18.990560Z","title":"Optimal interdiction of illegal network flow","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22009","last_updated":"2026-07-24T06:14:59Z","snapshot_observed_at":"2026-08-06T00:42:53.091179Z","submitted_at":"2026-07-24T06:14:59Z","title":"Practical Graph Optimisation and AI-Driven Models for Active Directory Security Hardening","version":1},"reference_index":167,"source":"pdf_text","source_observed_at":"2026-08-01T06:15:18.990560Z"},"links":{"cited_paper":"/paper/2206.14846","citing_paper":"/paper/2607.22009"},"observation_digest":"sha256:0daecbdb2b8c5e6204503e92e433b9059df7a07351ccbd34070b84a0d47c9095","observation_id":"6636a9f9-1776-435c-b6ff-c1d2c613551c","resolution":{"observed_at":"2026-08-01T06:15:18.990560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2206.14846/citation-record","integrity":"/paper/2206.14846/integrity","json":"/paper/2206.14846/citation-record.json","paper":"/paper/2206.14846"},"outbound":[],"paper":{"arxiv_id":"2206.14846","last_updated":"2022-06-29T18:17:28Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T18:48:25.156906Z","submitted_at":"2022-06-29T18:17:28Z","title":"Provably Efficient Reinforcement Learning for Online Adaptive Influence 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2206.14846."}