{"as_of":"2026-08-08T05:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ec016eb682e206ffa00ae77c7cb3fd313eb01aa9f4d38187b4f7b9a04211b7f","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-07T06:34:17.273281+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-05-12T04:33:08.990277Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T06:11:22.888729Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.10176","last_updated":"2021-03-18T11:23:39Z","snapshot_observed_at":"2026-07-06T10:51:06.246768Z","submitted_at":"2021-03-18T11:23:39Z","title":"Maximum Entropy Reinforcement Learning with Mixture Policies","version":1},"cited_work":{"arxiv_id":"2103.10176","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.10176","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Maximum entropy reinforcement learning with mixture policies","venue":null,"work_id":"870f9cb2-0e9a-4bf4-b7e2-d8d63bbc89cb","year":2021},"citing_paper":{"arxiv_id":"2605.09157","last_updated":"2026-05-09T20:37:52Z","snapshot_observed_at":"2026-08-02T18:03:50.564757Z","submitted_at":"2026-05-09T20:37:52Z","title":"Revisiting Mixture Policies in Entropy-Regularized Actor-Critic","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-12T04:33:08.990277Z"},"links":{"cited_paper":"/paper/2103.10176","citing_paper":"/paper/2605.09157"},"observation_digest":"sha256:e3eb530806303329af4a7f76c20c8cf05d8a089b042d86d141d65939ca3b484e","observation_id":"b32971d6-eae0-44ce-a01b-38de8aa42cb1","resolution":{"observed_at":"2026-05-12T06:11:22.891727Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2103.10176/citation-record","integrity":"/paper/2103.10176/integrity","json":"/paper/2103.10176/citation-record.json","paper":"/paper/2103.10176"},"outbound":[],"paper":{"arxiv_id":"2103.10176","last_updated":"2021-03-18T11:23:39Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T10:51:06.246768Z","submitted_at":"2021-03-18T11:23:39Z","title":"Maximum Entropy Reinforcement Learning with Mixture Policies"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2103.10176."}