{"as_of":"2026-08-11T10:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0309f288a749caa5a480b6626a166b43f8fa0880dfd0700f6df592ac189509e4","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T19:53:09.027483Z","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-21T06:44:00.901151Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.17466","last_updated":"2024-07-24T17:58:49Z","snapshot_observed_at":"2026-07-06T18:51:28.182977Z","submitted_at":"2024-07-24T17:58:49Z","title":"Traversing Pareto Optimal Policies: Provably Efficient Multi-Objective Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17466","snapshot_observed_at":"2026-08-07T13:52:12.434324Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20925","last_updated":"2025-05-27T09:15:03Z","snapshot_observed_at":"2026-08-08T03:06:10.831278Z","submitted_at":"2025-05-27T09:15:03Z","title":"Multi-objective Large Language Model Alignment with Hierarchical Experts","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:52:12.434324Z"},"links":{"cited_paper":"/paper/2407.17466","citing_paper":"/paper/2505.20925"},"observation_digest":"sha256:6c8226ad922a5015b2f8a767d98d592d116b7ebe1227244352c41e97ca0b55d8","observation_id":"b41119ee-d208-4a11-b610-82002cf7e145","resolution":{"observed_at":"2026-08-07T13:52:12.434324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17466","last_updated":"2024-07-24T17:58:49Z","snapshot_observed_at":"2026-07-06T18:51:28.182977Z","submitted_at":"2024-07-24T17:58:49Z","title":"Traversing Pareto Optimal Policies: Provably Efficient Multi-Objective Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17466","snapshot_observed_at":"2026-08-06T12:56:58.106357Z","title":"Traversing pareto optimal policies: Provably efficient multi-objective reinforcement learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.21397","last_updated":"2025-07-29T00:11:59Z","snapshot_observed_at":"2026-08-10T12:13:41.633810Z","submitted_at":"2025-07-29T00:11:59Z","title":"Enabling Pareto-Stationarity Exploration in Multi-Objective Reinforcement Learning: A Multi-Objective Weighted-Chebyshev Actor-Critic Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T12:56:58.106357Z"},"links":{"cited_paper":"/paper/2407.17466","citing_paper":"/paper/2507.21397"},"observation_digest":"sha256:7c871d560abbb47ebeca4cc7647522b3ea9ec2bfeee71b0c62392b0ca719c978","observation_id":"51ab15c2-aa1a-4d51-9507-df65c499ee88","resolution":{"observed_at":"2026-08-06T12:56:58.106357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17466","last_updated":"2024-07-24T17:58:49Z","snapshot_observed_at":"2026-07-06T18:51:28.182977Z","submitted_at":"2024-07-24T17:58:49Z","title":"Traversing Pareto Optimal Policies: Provably Efficient Multi-Objective Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2407.17466","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.17466","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Traversing pareto optimal policies: Provably efficient multi-objective reinforcement learning","venue":null,"work_id":"fd0adec7-bdd7-4893-b960-1e13938f89f1","year":2024},"citing_paper":{"arxiv_id":"2604.24532","last_updated":"2026-04-27T14:32:44Z","snapshot_observed_at":"2026-08-11T08:20:18.946986Z","submitted_at":"2026-04-27T14:32:44Z","title":"A Reward-Free Viewpoint on Multi-Objective Reinforcement Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-08T04:04:19.891421Z"},"links":{"cited_paper":"/paper/2407.17466","citing_paper":"/paper/2604.24532"},"observation_digest":"sha256:f1a201fc1086a1d05cfe16fa29be60c5bec21c92f06d82a45662bec2004edcac","observation_id":"bf288d27-4fa1-4a5c-8e0b-ee6f1ca3725e","resolution":{"observed_at":"2026-05-11T21:51:29.689165Z","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":{"arxiv_id":"2407.17466","last_updated":"2024-07-24T17:58:49Z","snapshot_observed_at":"2026-07-06T18:51:28.182977Z","submitted_at":"2024-07-24T17:58:49Z","title":"Traversing Pareto Optimal Policies: Provably Efficient Multi-Objective Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2407.17466","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.17466","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Traversing pareto optimal policies: Provably efficient multi-objective reinforcement learning","venue":null,"work_id":"fd0adec7-bdd7-4893-b960-1e13938f89f1","year":2024},"citing_paper":{"arxiv_id":"2605.03900","last_updated":"2026-05-05T15:55:19Z","snapshot_observed_at":"2026-07-06T23:16:44.876986Z","submitted_at":"2026-05-05T15:55:19Z","title":"Contextual Multi-Objective Optimization: Rethinking Objectives in Frontier AI Systems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-07T16:26:04.152045Z"},"links":{"cited_paper":"/paper/2407.17466","citing_paper":"/paper/2605.03900"},"observation_digest":"sha256:96b0b75b542b2af989f1e810a03841db35b40e13f16685e714ce4b7d79f751b1","observation_id":"7d4ad250-cbd8-4c5f-9b50-c20acec4f67b","resolution":{"observed_at":"2026-05-11T23:41:18.942894Z","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":{"arxiv_id":"2407.17466","last_updated":"2024-07-24T17:58:49Z","snapshot_observed_at":"2026-07-06T18:51:28.182977Z","submitted_at":"2024-07-24T17:58:49Z","title":"Traversing Pareto Optimal Policies: Provably Efficient Multi-Objective Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2407.17466","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.17466","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Traversing pareto optimal policies: Provably efficient multi-objective reinforcement learning","venue":null,"work_id":"fd0adec7-bdd7-4893-b960-1e13938f89f1","year":2024},"citing_paper":{"arxiv_id":"2605.12771","last_updated":"2026-05-12T21:32:57Z","snapshot_observed_at":"2026-08-10T23:20:02.177146Z","submitted_at":"2026-05-12T21:32:57Z","title":"Adaptive Smooth Tchebycheff Attention for Multi-Objective Policy Optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-14T19:32:35.197431Z"},"links":{"cited_paper":"/paper/2407.17466","citing_paper":"/paper/2605.12771"},"observation_digest":"sha256:6426c36c4f253fe512c22e470ee09f5bd3db6b88224dc012eb30961f84ddb65f","observation_id":"ce8807aa-1619-4c9c-816a-47c858360871","resolution":{"observed_at":"2026-05-14T19:32:51.671927Z","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":{"arxiv_id":"2407.17466","last_updated":"2024-07-24T17:58:49Z","snapshot_observed_at":"2026-07-06T18:51:28.182977Z","submitted_at":"2024-07-24T17:58:49Z","title":"Traversing Pareto Optimal Policies: Provably Efficient Multi-Objective Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2407.17466","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.17466","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Traversing pareto optimal policies: Provably efficient multi-objective reinforcement learning","venue":null,"work_id":"fd0adec7-bdd7-4893-b960-1e13938f89f1","year":2024},"citing_paper":{"arxiv_id":"2605.20619","last_updated":"2026-05-20T02:09:32Z","snapshot_observed_at":"2026-08-10T22:14:25.901919Z","submitted_at":"2026-05-20T02:09:32Z","title":"SURF: Steering the Scalarization Weight to Uniformly Traverse the Pareto Front","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-05-21T06:42:15.135148Z"},"links":{"cited_paper":"/paper/2407.17466","citing_paper":"/paper/2605.20619"},"observation_digest":"sha256:1e87662adaf65c7c610b40ccc199ec1756fd3cf6b92c736bd24be5c25f44467f","observation_id":"fdf2ba28-614f-43f0-b7f6-e57dda7c0738","resolution":{"observed_at":"2026-05-21T06:44:00.902598Z","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":{"arxiv_id":"2407.17466","last_updated":"2024-07-24T17:58:49Z","snapshot_observed_at":"2026-07-06T18:51:28.182977Z","submitted_at":"2024-07-24T17:58:49Z","title":"Traversing Pareto Optimal Policies: Provably Efficient Multi-Objective Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17466","snapshot_observed_at":"2026-07-14T05:38:58.035337Z","title":"Traversing pareto optimal poli- cies: Provably efficient multi-objective reinforcement learning.arXiv preprint arXiv:2407.17466,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11432","last_updated":"2026-07-13T11:37:27Z","snapshot_observed_at":"2026-07-16T23:19:47.238990Z","submitted_at":"2026-07-13T11:37:27Z","title":"Generalizing Preference-based Reinforcement Learning: a Rationality Model for Incomparability","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T05:38:58.035337Z"},"links":{"cited_paper":"/paper/2407.17466","citing_paper":"/paper/2607.11432"},"observation_digest":"sha256:5aa731c4d1a7ba4cf08b07397e3d5c70ce0c96690f26fa0a970f94b49dbd4e83","observation_id":"573a5b80-221b-4ab5-b35d-a7b27625e9ea","resolution":{"observed_at":"2026-07-14T05:38:58.035337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17466","last_updated":"2024-07-24T17:58:49Z","snapshot_observed_at":"2026-07-06T18:51:28.182977Z","submitted_at":"2024-07-24T17:58:49Z","title":"Traversing Pareto Optimal Policies: Provably Efficient Multi-Objective Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17466","snapshot_observed_at":"2026-08-08T19:53:09.027483Z","title":"arXiv preprint arXiv:2407.17466 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04324","last_updated":"2026-08-05T01:08:27Z","snapshot_observed_at":"2026-08-08T23:11:27.612919Z","submitted_at":"2026-08-05T01:08:27Z","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T19:53:09.027483Z"},"links":{"cited_paper":"/paper/2407.17466","citing_paper":"/paper/2608.04324"},"observation_digest":"sha256:4d38116724685755c75b844b9dd477b732330b77dc160e973999fab8e255a3ed","observation_id":"1c10cf1e-909c-499b-9ac3-035e593912f3","resolution":{"observed_at":"2026-08-08T19:53:09.027483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17466","last_updated":"2024-07-24T17:58:49Z","snapshot_observed_at":"2026-07-06T18:51:28.182977Z","submitted_at":"2024-07-24T17:58:49Z","title":"Traversing Pareto Optimal Policies: Provably Efficient Multi-Objective Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17466","snapshot_observed_at":"2026-08-08T19:48:08.805698Z","title":"arXiv preprint arXiv:2407.17466 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04333","last_updated":"2026-08-05T01:21:02Z","snapshot_observed_at":"2026-08-11T03:15:15.809174Z","submitted_at":"2026-08-05T01:21:02Z","title":"Cost-Aware Multi-Objective Bandits: Theory and Application to Budgeted LLM Configuration Evaluation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T19:48:08.805698Z"},"links":{"cited_paper":"/paper/2407.17466","citing_paper":"/paper/2608.04333"},"observation_digest":"sha256:c5ac1bc3dcad9e70df00f2552c03af84e7a377351f9c789012ce0b3a72567f4f","observation_id":"0972ff51-7be1-487c-8a16-2764c24ce67a","resolution":{"observed_at":"2026-08-08T19:48:08.805698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.17466/citation-record","integrity":"/paper/2407.17466/integrity","json":"/paper/2407.17466/citation-record.json","paper":"/paper/2407.17466"},"outbound":[],"paper":{"arxiv_id":"2407.17466","last_updated":"2024-07-24T17:58:49Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:51:28.182977Z","submitted_at":"2024-07-24T17:58:49Z","title":"Traversing Pareto Optimal Policies: Provably Efficient Multi-Objective 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-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 9 inbound Pith citation observations for arXiv:2407.17466."}