{"as_of":"2026-08-11T11:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c56a6a8a631f30402e65385f0befc4ee6116e829904d780179cc51e0af9ef5a7","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-11T06:34:44.6726+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-07T15:31:58.902463Z","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-07T15:31:59.182939Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.00823","last_updated":"2025-03-01T16:33:54Z","snapshot_observed_at":"2026-08-11T04:49:12.799650Z","submitted_at":"2024-06-02T18:11:47Z","title":"Lasso Bandit with Compatibility Condition on Optimal Arm","version":2},"cited_work":{"arxiv_id":"2406.00823","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.00823","snapshot_observed_at":"2026-08-07T15:31:59.182939Z","title":"Lasso Bandit with Compatibility Condition on Optimal Arm","venue":"stat.ML","work_id":"adead639-9878-495e-9201-84b012437149","year":2024},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.902463Z"},"links":{"cited_paper":"/paper/2406.00823","citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:227b79e23d51ebe442223e17c4472bf1958efd36af9474b6bcd74c0145d9c2c2","observation_id":"1163f8e1-39fc-4122-8a0c-582969b9dc87","resolution":{"observed_at":"2026-08-07T15:31:59.188025Z","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/2406.00823/citation-record","integrity":"/paper/2406.00823/integrity","json":"/paper/2406.00823/citation-record.json","paper":"/paper/2406.00823"},"outbound":[],"paper":{"arxiv_id":"2406.00823","last_updated":"2025-03-01T16:33:54Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-11T04:49:12.799650Z","submitted_at":"2024-06-02T18:11:47Z","title":"Lasso Bandit with Compatibility Condition on Optimal Arm"},"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 1 inbound Pith citation observation for arXiv:2406.00823."}