{"as_of":"2026-08-12T05:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3015d1a65a6724711d170b83cdf786f6edde8278664ce7e714d1285f2b58413b","coverage":[{"denominator":3,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T18:58:14.701248Z","state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2605.27073/citation-record","integrity":"/paper/2605.27073/integrity","json":"/paper/2605.27073/citation-record.json","paper":"/paper/2605.27073"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.10949","last_updated":"2024-01-24T20:43:24Z","snapshot_observed_at":"2026-07-06T17:18:03.597390Z","submitted_at":"2024-01-18T19:34:46Z","title":"The Synergy Between Optimal Transport Theory and Multi-Agent Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2401.10949","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.10949","snapshot_observed_at":"2026-06-29T19:03:51.305662Z","title":"(2008).Gradient Flows: In Metric Spaces and in the Space of Probability Measures","venue":null,"work_id":"b131a66d-1adc-4aa1-a80a-f2e616f22920","year":2008},"citing_paper":{"arxiv_id":"2605.27073","last_updated":"2026-05-26T14:23:22Z","snapshot_observed_at":"2026-08-01T14:25:46.740086Z","submitted_at":"2026-05-26T14:23:22Z","title":"Learning to Orchestrate Agents under Uncertainty","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T18:58:14.701248Z"},"links":{"cited_paper":"/paper/2401.10949","citing_paper":"/paper/2605.27073"},"observation_digest":"sha256:7ea65273e07764ba98a971f4455b41a8574af632cd2a0870282cbce36f625f18","observation_id":"985fcbea-d805-44ba-9fee-a5058d3c1c5d","resolution":{"observed_at":"2026-06-29T19:03:51.307523Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T18:58:14.701248Z","title":"14 Wang, Q","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.27073","last_updated":"2026-05-26T14:23:22Z","snapshot_observed_at":"2026-08-01T14:25:46.740086Z","submitted_at":"2026-05-26T14:23:22Z","title":"Learning to Orchestrate Agents under Uncertainty","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T18:58:14.701248Z"},"links":{"citing_paper":"/paper/2605.27073"},"observation_digest":"sha256:361a871f5eb4ae74492a4221ffba7a9320a3fdfcd65ebc9b370557fbd5fb6138","observation_id":"e3c4f276-7bfc-4d88-8a54-26902ded9735","resolution":{"observed_at":"2026-06-29T18:58:14.701248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T18:58:14.701248Z","title":"For anyλ∈R , convexity of y7→e λy on[0,1]implies that for everyy∈[0,1], eλy ≤(1−y)e 0 +ye λ = 1−y+ye λ","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2605.27073","last_updated":"2026-05-26T14:23:22Z","snapshot_observed_at":"2026-08-01T14:25:46.740086Z","submitted_at":"2026-05-26T14:23:22Z","title":"Learning to Orchestrate Agents under Uncertainty","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T18:58:14.701248Z"},"links":{"citing_paper":"/paper/2605.27073"},"observation_digest":"sha256:1e0fa0e2ec07c7d80e68946a7b1ea89673cc83a8a55c562500b7ef7531eadebc","observation_id":"019cb23d-5348-4dc1-8adf-9a54a3c61266","resolution":{"observed_at":"2026-06-29T18:58:14.701248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.27073","last_updated":"2026-05-26T14:23:22Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-01T14:25:46.740086Z","submitted_at":"2026-05-26T14:23:22Z","title":"Learning to Orchestrate Agents under Uncertainty"},"reference_resolution":{"displayed":3,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":3},"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 12 August 2026, this Paper Citation Record lists 3 of 3 outbound references and 0 inbound Pith citation observations for arXiv:2605.27073."}