{"as_of":"2026-08-22T06:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:33c2ecca5705d421689c757102de37ceeb183954b220eea6177a5eae73da50a2","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-22T06:32:14.747728+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-10T22:43:45.744171Z","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-10T22:43:45.894859Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.09983","last_updated":"2023-12-18T14:05:56Z","snapshot_observed_at":"2026-08-16T14:34:19.274440Z","submitted_at":"2023-12-15T17:50:18Z","title":"Toward Computationally Efficient Inverse Reinforcement Learning via Reward Shaping","version":2},"cited_work":{"arxiv_id":"2312.09983","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.09983","snapshot_observed_at":"2026-08-10T22:43:45.894859Z","title":"Toward Computationally Efficient Inverse Reinforcement Learning via Reward Shaping","venue":"cs.LG","work_id":"373bc9d0-1637-4261-a062-ab623fc702fb","year":2023},"citing_paper":{"arxiv_id":"2501.00989","last_updated":"2025-07-24T18:29:56Z","snapshot_observed_at":"2026-08-21T08:19:53.766350Z","submitted_at":"2025-01-02T00:40:55Z","title":"Bootstrapped Reward Shaping","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T22:43:45.744171Z"},"links":{"cited_paper":"/paper/2312.09983","citing_paper":"/paper/2501.00989"},"observation_digest":"sha256:9f3e26e5098e62b0f53607bb826206f1da8c88b962e4084fc449f9ab2a2123b7","observation_id":"2165bdd7-1d2a-4e57-ae6f-507a997b2644","resolution":{"observed_at":"2026-08-10T22:43:45.898525Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.09983/citation-record","integrity":"/paper/2312.09983/integrity","json":"/paper/2312.09983/citation-record.json","paper":"/paper/2312.09983"},"outbound":[],"paper":{"arxiv_id":"2312.09983","last_updated":"2023-12-18T14:05:56Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:34:19.274440Z","submitted_at":"2023-12-15T17:50:18Z","title":"Toward Computationally Efficient Inverse Reinforcement Learning via Reward Shaping"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2312.09983."}