{"as_of":"2026-08-09T05:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b85fee52d3a5b0e2feb725b7a77efe3def8274ca26e3f695203ae2566d25d357","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:54:46.227463Z","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-21T23:10:44.700778Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.12055","last_updated":"2023-10-18T15:42:53Z","snapshot_observed_at":"2026-08-01T17:45:48.262145Z","submitted_at":"2023-10-18T15:42:53Z","title":"Understanding Reward Ambiguity Through Optimal Transport Theory in Inverse Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12055","snapshot_observed_at":"2026-08-07T00:54:46.227463Z","title":"Understanding reward ambiguity through optimal transport theory in inverse reinforcement learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.12497","last_updated":"2025-06-18T14:00:38Z","snapshot_observed_at":"2026-08-07T00:45:27.588915Z","submitted_at":"2025-06-14T13:17:47Z","title":"Wasserstein-Barycenter Consensus for Cooperative Multi-Agent Reinforcement Learning","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T00:54:46.227463Z"},"links":{"cited_paper":"/paper/2310.12055","citing_paper":"/paper/2506.12497"},"observation_digest":"sha256:3af87f4cc06ef7390822ce098ed2de16c4e132cf13f1cbd5edd170d757956841","observation_id":"2f42733e-c511-4ad0-b335-1fc0f1732b30","resolution":{"observed_at":"2026-08-07T00:54:46.227463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12055","last_updated":"2023-10-18T15:42:53Z","snapshot_observed_at":"2026-08-01T17:45:48.262145Z","submitted_at":"2023-10-18T15:42:53Z","title":"Understanding Reward Ambiguity Through Optimal Transport Theory in Inverse Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2310.12055","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.12055","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Understanding reward ambiguity through optimal transport theory in inverse reinforcement learning","venue":null,"work_id":"dc8294e9-09fa-482a-999f-fce01c5f45c7","year":2023},"citing_paper":{"arxiv_id":"2509.14521","last_updated":"2026-05-18T12:21:35Z","snapshot_observed_at":"2026-08-01T20:02:47.007665Z","submitted_at":"2025-09-18T01:28:03Z","title":"Geometry-Aware Decentralized Sinkhorn for Wasserstein Barycenters","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-21T23:08:08.096620Z"},"links":{"cited_paper":"/paper/2310.12055","citing_paper":"/paper/2509.14521"},"observation_digest":"sha256:cd94838c1ac35c3f4accac9369327e43c49421070a2f3dd7f15698815bf610eb","observation_id":"6266c9a9-b011-4621-bcb0-7c41d0b62aa2","resolution":{"observed_at":"2026-05-21T23:10:44.702527Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.12055/citation-record","integrity":"/paper/2310.12055/integrity","json":"/paper/2310.12055/citation-record.json","paper":"/paper/2310.12055"},"outbound":[],"paper":{"arxiv_id":"2310.12055","last_updated":"2023-10-18T15:42:53Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-01T17:45:48.262145Z","submitted_at":"2023-10-18T15:42:53Z","title":"Understanding Reward Ambiguity Through Optimal Transport Theory in Inverse 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2310.12055."}