{"as_of":"2026-08-11T09:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d825e2ec7aedde27373f2ec2645e486bd244dae2b8e58f323585b92203c4f7c6","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:33:23.475198Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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-07T15:29:36.639787Z","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-07T15:29:40.550652Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"cited_work":{"arxiv_id":"2501.15219","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.15219","snapshot_observed_at":"2026-08-07T15:29:40.550652Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","venue":"cs.CL","work_id":"48b6e29d-cebe-43b0-9bad-a45e38a4e2b3","year":2025},"citing_paper":{"arxiv_id":"2505.15069","last_updated":"2025-05-21T03:33:27Z","snapshot_observed_at":"2026-08-09T06:54:44.395367Z","submitted_at":"2025-05-21T03:33:27Z","title":"In-Domain African Languages Translation Using LLMs and Multi-armed Bandits","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:36.639787Z"},"links":{"cited_paper":"/paper/2501.15219","citing_paper":"/paper/2505.15069"},"observation_digest":"sha256:87894a366904de4a05bd0c598d0052f9ef542a72e5e5cd1a6d1565e93e0a5e84","observation_id":"5938f137-df06-47a6-bd86-92408e7c88c9","resolution":{"observed_at":"2026-08-07T15:29:40.622815Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2501.15219/citation-record","integrity":"/paper/2501.15219/integrity","json":"/paper/2501.15219/citation-record.json","paper":"/paper/2501.15219"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.03856","last_updated":"2024-05-01T20:44:01Z","snapshot_observed_at":"2026-07-06T15:39:18.493629Z","submitted_at":"2023-06-06T16:51:03Z","title":"Iterative Translation Refinement with Large Language Models","version":2},"cited_work":{"arxiv_id":"2306.03856","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.03856","snapshot_observed_at":"2026-08-10T14:33:24.100683Z","title":"Iterative Translation Refinement with Large Language Models","venue":"cs.CL","work_id":"235d5392-f44d-470a-a99b-63814661bae7","year":2023},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:22.818078Z"},"links":{"cited_paper":"/paper/2306.03856","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:abbd2dbf35a9ba07badf5f41ad58a04171ca35b0fc9836e77d890116cd512f1f","observation_id":"e85f4945-6716-45d5-9a9c-46869034b7a8","resolution":{"observed_at":"2026-08-10T14:33:24.169797Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"2010.11125","last_updated":"2020-10-21T17:01:23Z","snapshot_observed_at":"2026-08-03T03:40:16.352796Z","submitted_at":"2020-10-21T17:01:23Z","title":"Beyond English-Centric Multilingual Machine Translation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.11125","snapshot_observed_at":"2026-08-10T14:33:22.875978Z","title":"Preprint, arXiv:2010.11125","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:22.875978Z"},"links":{"cited_paper":"/paper/2010.11125","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:cfee372d31884eb78573e0d811991eeb6c098e4f5f64fef2b91e1170ee90a786","observation_id":"f7b0aa50-f486-4eba-9600-b45d2cad82eb","resolution":{"observed_at":"2026-08-10T14:33:22.875978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15006","last_updated":"2024-02-26T12:17:25Z","snapshot_observed_at":"2026-07-06T17:21:01.918787Z","submitted_at":"2024-01-26T17:07:08Z","title":"Airavata: Introducing Hindi Instruction-tuned LLM","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15006","snapshot_observed_at":"2026-08-10T14:33:22.936699Z","title":"arXiv preprint arXiv: 2401.15006","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:22.936699Z"},"links":{"cited_paper":"/paper/2401.15006","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:e09c7ed6471ca0bffcd2bfcd020373d50349524afefb70d323fd1ec16c686b65","observation_id":"387701ba-ad80-461c-bf4f-dd64c78939b3","resolution":{"observed_at":"2026-08-10T14:33:22.936699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13257","last_updated":"2025-01-09T22:21:56Z","snapshot_observed_at":"2026-08-09T03:38:22.081528Z","submitted_at":"2024-03-20T02:38:01Z","title":"Arcee's MergeKit: A Toolkit for Merging Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13257","snapshot_observed_at":"2026-08-10T14:33:22.951335Z","title":"Preprint, arXiv:2403.13257","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:22.951335Z"},"links":{"cited_paper":"/paper/2403.13257","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:c177b6861589f4b46ae612dbc78eca7fcffbb186f6ceecf5bd827900d548d3a8","observation_id":"5fad8eb9-f69d-4440-bd72-9008d5b41a38","resolution":{"observed_at":"2026-08-10T14:33:22.951335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01680","last_updated":"2024-04-19T01:15:16Z","snapshot_observed_at":"2026-08-10T13:10:07.804621Z","submitted_at":"2024-01-21T23:36:14Z","title":"Large Language Model based Multi-Agents: A Survey of Progress and Challenges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01680","snapshot_observed_at":"2026-08-10T14:33:22.999746Z","title":"Preprint, arXiv:2402.01680","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:22.999746Z"},"links":{"cited_paper":"/paper/2402.01680","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:f50c41007b8fcce5c54497e36308c085dfe87ccf94dfe314bffd5eeef4a79a40","observation_id":"8ead6f8f-e5a8-448a-a4ee-9dfcd35ed488","resolution":{"observed_at":"2026-08-10T14:33:22.999746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08306","last_updated":"2024-05-06T17:13:27Z","snapshot_observed_at":"2026-07-06T16:47:28.959555Z","submitted_at":"2023-11-14T16:49:33Z","title":"On-the-Fly Fusion of Large Language Models and Machine Translation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08306","snapshot_observed_at":"2026-08-10T14:33:23.031405Z","title":"In International Conference on Learning Representations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.031405Z"},"links":{"cited_paper":"/paper/2311.08306","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:94fd83255c9b9c27069cb14f2ec4ff1d81838df1e04f8ce5a6b911cb5b223d92","observation_id":"1fda9995-a6c2-4e52-b578-ae538eef6c07","resolution":{"observed_at":"2026-08-10T14:33:23.031405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.05589","last_updated":"2024-08-08T07:15:04Z","snapshot_observed_at":"2026-07-06T16:59:15.553868Z","submitted_at":"2023-12-09T14:49:34Z","title":"A Review of Hybrid and Ensemble in Deep Learning for Natural Language Processing","version":2},"cited_work":{"arxiv_id":"2312.05589","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.05589","snapshot_observed_at":"2026-08-10T14:33:23.934292Z","title":"A Review of Hybrid and Ensemble in Deep Learning for Natural Language Processing","venue":"cs.AI","work_id":"5d4b5dd5-e600-4a58-9f38-d048f46e810c","year":2023},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.050752Z"},"links":{"cited_paper":"/paper/2312.05589","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:affeb0575065ac2df4b193f4dbfea9add4c875f3a35bf3f01fc03d253d725af2","observation_id":"375832ef-66e2-4c49-a56c-395ec1432beb","resolution":{"observed_at":"2026-08-10T14:33:23.957194Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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.12391","last_updated":"2024-07-17T08:11:47Z","snapshot_observed_at":"2026-07-06T18:47:37.971415Z","submitted_at":"2024-07-17T08:11:47Z","title":"LLM Inference Serving: Survey of Recent Advances and Opportunities","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12391","snapshot_observed_at":"2026-08-10T14:33:23.061202Z","title":"Preprint, arXiv:2407.12391","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.061202Z"},"links":{"cited_paper":"/paper/2407.12391","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:366a460fe69b1a92c735588077de43c30810ce0d64fb85854ab67b32782d8771","observation_id":"556cc18c-1955-4184-80cf-807e20f5c077","resolution":{"observed_at":"2026-08-10T14:33:23.061202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08210","last_updated":"2020-01-23T18:58:48Z","snapshot_observed_at":"2026-08-07T14:04:34.554184Z","submitted_at":"2020-01-22T18:59:17Z","title":"Multilingual Denoising Pre-training for Neural Machine Translation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08210","snapshot_observed_at":"2026-08-10T14:33:23.068071Z","title":"Preprint, arXiv:2001.08210","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.068071Z"},"links":{"cited_paper":"/paper/2001.08210","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:96cc29eb7683a9ecb8bbf74db53847fc34133b2a00552345f94da4091ea58c38","observation_id":"2f809faf-13d1-4fe3-9f20-d52fcd9d93b8","resolution":{"observed_at":"2026-08-10T14:33:23.068071Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.01890","last_updated":"2021-06-03T14:34:17Z","snapshot_observed_at":"2026-08-10T05:15:35.052238Z","submitted_at":"2021-06-03T14:34:17Z","title":"SimCLS: A Simple Framework for Contrastive Learning of Abstractive Summarization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.01890","snapshot_observed_at":"2026-08-10T14:33:23.072912Z","title":"Preprint, arXiv:2106.01890","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.072912Z"},"links":{"cited_paper":"/paper/2106.01890","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:0cf5595f1b5af775a7875c45c9dc7ca717920ef9d7cd3641ff92b4a6c6987721","observation_id":"2c391bf9-dabb-4a93-8e00-11cd2c653360","resolution":{"observed_at":"2026-08-10T14:33:23.072912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-10T14:33:23.104079Z","title":"Preprint, arXiv:2311.08692","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.104079Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:4f0c63edf0b1f70652e01378b1fa7b977fa381b8cf472d2414a153d14d9f425b","observation_id":"26cd1e96-7607-4fa0-b425-3844ef8e213e","resolution":{"observed_at":"2026-08-10T14:33:23.104079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17651","last_updated":"2023-05-25T19:13:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-03-30T18:30:01Z","title":"Self-Refine: Iterative Refinement with Self-Feedback","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.17651","snapshot_observed_at":"2026-08-10T14:33:23.151982Z","title":"Preprint, arXiv:2303.17651","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.151982Z"},"links":{"cited_paper":"/paper/2303.17651","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:88e8ea19fe0b16dfb8d1dcb1314dfe63be2f53c0b57ad1f60c376a4957c69af4","observation_id":"945625f8-b032-4caa-b2fa-ea5dc136a93c","resolution":{"observed_at":"2026-08-10T14:33:23.151982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-10T14:33:23.226445Z","title":"Preprint, arXiv:2303.08774","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.226445Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:8a1a4695a03856215a7321f5d44f7bcd10f2de272045583b88f4caa6e788670c","observation_id":"60d1c8d9-6646-4403-8311-558f0b3585fc","resolution":{"observed_at":"2026-08-10T14:33:23.226445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.02155","last_updated":"2022-03-04T07:04:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-03-04T07:04:42Z","title":"Training language models to follow instructions with human feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.02155","snapshot_observed_at":"2026-08-10T14:33:23.256634Z","title":"Preprint, arXiv:2203.02155","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.256634Z"},"links":{"cited_paper":"/paper/2203.02155","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:f5a2c81e5846a0e1507e11642971b328508cca453792c1a354eb7623999d4a13","observation_id":"07a97135-8ae9-4299-b978-9b080a8dba70","resolution":{"observed_at":"2026-08-10T14:33:23.256634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.03188","last_updated":"2023-08-30T03:47:34Z","snapshot_observed_at":"2026-08-09T17:18:47.922122Z","submitted_at":"2023-08-06T18:38:52Z","title":"Automatically Correcting Large Language Models: Surveying the landscape of diverse self-correction strategies","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.03188","snapshot_observed_at":"2026-08-10T14:33:23.285923Z","title":"Preprint, arXiv:2308.03188","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.285923Z"},"links":{"cited_paper":"/paper/2308.03188","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:af7186c947147084e694b78aac63868e06da4b6eaa077ddd0d1b17c0d9061833","observation_id":"dedb540a-abd9-4678-9ec1-23e99d8e55a3","resolution":{"observed_at":"2026-08-10T14:33:23.285923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14878","last_updated":"2023-10-23T23:18:18Z","snapshot_observed_at":"2026-08-03T14:14:53.917511Z","submitted_at":"2023-05-24T08:30:05Z","title":"Leveraging GPT-4 for Automatic Translation Post-Editing","version":2},"cited_work":{"arxiv_id":"2305.14878","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.14878","snapshot_observed_at":"2026-08-10T14:33:23.772794Z","title":"Leveraging GPT-4 for Automatic Translation Post-Editing","venue":"cs.CL","work_id":"55a31877-52bd-45ce-8ada-3790008660aa","year":2023},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.309309Z"},"links":{"cited_paper":"/paper/2305.14878","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:f7461ea34a889f4119157e05cdd114fb5e6373efb1df177fc62bf00eb5c873c2","observation_id":"d9f02e1a-f778-4809-8dba-24e51a5a55c5","resolution":{"observed_at":"2026-08-10T14:33:23.790289Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"2203.06569","last_updated":"2023-05-26T05:48:29Z","snapshot_observed_at":"2026-08-07T17:12:33.580104Z","submitted_at":"2022-03-13T05:05:10Z","title":"SummaReranker: A Multi-Task Mixture-of-Experts Re-ranking Framework for Abstractive Summarization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.06569","snapshot_observed_at":"2026-08-10T14:33:23.338984Z","title":"Preprint, arXiv:2203.06569","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.338984Z"},"links":{"cited_paper":"/paper/2203.06569","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:9eea673760be8a42328e8b516f5bd97a081b21d2b86d27825508e92814fe0ff2","observation_id":"68d30eec-c159-4afd-8c13-c19e9bbdcb8f","resolution":{"observed_at":"2026-08-10T14:33:23.338984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.05100","last_updated":"2023-06-27T09:57:58Z","snapshot_observed_at":"2026-08-04T18:56:03.233715Z","submitted_at":"2022-11-09T18:48:09Z","title":"BLOOM: A 176B-Parameter Open-Access Multilingual Language Model","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.05100","snapshot_observed_at":"2026-08-10T14:33:23.355258Z","title":"Preprint, arXiv:2211.05100","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.355258Z"},"links":{"cited_paper":"/paper/2211.05100","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:6d5109ae9c662a8c27b2a3998f828d213332053bb14cf22a6b8ad995edd64a66","observation_id":"1f47ec05-c9f9-4399-aac3-36fb4485f07d","resolution":{"observed_at":"2026-08-10T14:33:23.355258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.01325","last_updated":"2022-02-15T19:09:36Z","snapshot_observed_at":"2026-08-06T19:18:51.065158Z","submitted_at":"2020-09-02T19:54:41Z","title":"Learning to summarize from human feedback","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.01325","snapshot_observed_at":"2026-08-10T14:33:23.393313Z","title":"Preprint, arXiv:2009.01325","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.393313Z"},"links":{"cited_paper":"/paper/2009.01325","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:113acbfa05a7389ebd6eb4205819a2518e251fb6ba4c9d3b272afc45c436109a","observation_id":"f7483a5c-3721-43ad-b243-555f92bea205","resolution":{"observed_at":"2026-08-10T14:33:23.393313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.04672","last_updated":"2022-08-25T17:10:53Z","snapshot_observed_at":"2026-07-06T13:29:47.927628Z","submitted_at":"2022-07-11T07:33:36Z","title":"No Language Left Behind: Scaling Human-Centered Machine Translation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.04672","snapshot_observed_at":"2026-08-10T14:33:23.428018Z","title":"Preprint, arXiv:2207.04672","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.428018Z"},"links":{"cited_paper":"/paper/2207.04672","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:1f2c480e8a1199072fda197231143169d41c26a8bd15b457d51f763872aa2f3a","observation_id":"2016ff94-361f-4bc3-b490-d62c9da2fafe","resolution":{"observed_at":"2026-08-10T14:33:23.428018Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.10491","last_updated":"2024-01-22T17:16:37Z","snapshot_observed_at":"2026-08-04T23:37:08.155969Z","submitted_at":"2024-01-19T05:02:46Z","title":"Knowledge Fusion of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.10491","snapshot_observed_at":"2026-08-10T14:33:23.448595Z","title":"Preprint, arXiv:2401.10491","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.448595Z"},"links":{"cited_paper":"/paper/2401.10491","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:f33a527dfa431b3ee8e3d119cae4f8b3640febe13bbf2743b252248942a9e4e5","observation_id":"bc529397-2375-4071-b025-d8fd1ed6b7b2","resolution":{"observed_at":"2026-08-10T14:33:23.448595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.10385","last_updated":"2021-01-25T20:12:52Z","snapshot_observed_at":"2026-07-06T10:35:27.081526Z","submitted_at":"2021-01-25T20:12:52Z","title":"Online and Scalable Model Selection with Multi-Armed Bandits","version":1},"cited_work":{"arxiv_id":"2101.10385","doi":null,"metadata_source":"pith","pith_arxiv_id":"2101.10385","snapshot_observed_at":"2026-08-10T14:33:23.549774Z","title":"Online and Scalable Model Selection with Multi-Armed Bandits","venue":"cs.LG","work_id":"230cc123-d7e0-4bdc-b93f-d4aa2392652c","year":2021},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.458104Z"},"links":{"cited_paper":"/paper/2101.10385","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:d8bcfba3f71c03c39bc8047143f6cf5b4fdc364a0cbc02104a1478c4e485ca6b","observation_id":"c25e3c44-40ca-4aae-bfff-6ce553cf8ef0","resolution":{"observed_at":"2026-08-10T14:33:23.587291Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"2305.14282","last_updated":"2023-10-26T18:21:30Z","snapshot_observed_at":"2026-08-04T14:22:18.115194Z","submitted_at":"2023-05-23T17:27:22Z","title":"INSTRUCTSCORE: Explainable Text Generation Evaluation with Finegrained Feedback","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14282","snapshot_observed_at":"2026-08-10T14:33:23.463850Z","title":"Preprint, arXiv:2305.14282","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.463850Z"},"links":{"cited_paper":"/paper/2305.14282","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:132e8d9732b5581b5e5a26cbc15ee29b156aa9c5cab3b979729790127ba965fd","observation_id":"4285c4e6-943b-4f7c-9558-62514a80b005","resolution":{"observed_at":"2026-08-10T14:33:23.463850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.11934","last_updated":"2021-03-11T18:45:13Z","snapshot_observed_at":"2026-08-09T05:32:57.900052Z","submitted_at":"2020-10-22T17:58:14Z","title":"mT5: A massively multilingual pre-trained text-to-text transformer","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.11934","snapshot_observed_at":"2026-08-10T14:33:23.468892Z","title":"Preprint, arXiv:2010.11934","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.468892Z"},"links":{"cited_paper":"/paper/2010.11934","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:d44a821083bf87e2bf507f968d86bb8ab95be95ebbec33cbf31c8bd7a98e59ff","observation_id":"19cf54c2-587a-4ec3-b38a-a66ce02e9b12","resolution":{"observed_at":"2026-08-10T14:33:23.468892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16363","last_updated":"2024-05-01T20:42:28Z","snapshot_observed_at":"2026-08-01T22:52:35.092898Z","submitted_at":"2024-02-26T07:33:05Z","title":"LLM Inference Unveiled: Survey and Roofline Model Insights","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16363","snapshot_observed_at":"2026-08-10T14:33:23.475198Z","title":"Preprint, arXiv:2402.16363","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.475198Z"},"links":{"cited_paper":"/paper/2402.16363","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:99447b20e7aebb30043dbe0eac8638e0f31781f288ca4afb03f83c285c6cf16e","observation_id":"efee327c-f6a9-4646-89db-c9a658546c73","resolution":{"observed_at":"2026-08-10T14:33:23.475198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.5602","last_updated":"2013-12-19T16:00:08Z","snapshot_observed_at":"2026-07-06T03:31:23.521122Z","submitted_at":"2013-12-19T16:00:08Z","title":"Playing Atari with Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.5602","snapshot_observed_at":"2026-08-10T14:33:23.179129Z","title":"Preprint, arXiv:1312.5602","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.179129Z"},"links":{"cited_paper":"/paper/1312.5602","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:737d57af6b1f878fbc6977861464efcd913bf57ac6038a14978f7b4be5d288ca","observation_id":"f2263175-cc95-4ea9-a361-302ddf772255","resolution":{"observed_at":"2026-08-10T14:33:23.179129Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:33:24.236540Z","title":"In Proceedings of the Ninth Workshop on Statistical Machine Translation, pages 12–58, Baltimore, Maryland, USA","venue":null,"work_id":"570fd67d-e324-4f3f-afc6-34de2e4728f2","year":2014},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:22.747442Z"},"links":{"citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:206945ea489a75110f3019ce6744f99b8def1850137555cb4367a8ae27bee4d0","observation_id":"026a372b-f0e1-4678-90a0-554ee69f2907","resolution":{"observed_at":"2026-08-10T14:33:24.274619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1512.03385","last_updated":"2015-12-10T19:51:55Z","snapshot_observed_at":"2026-07-06T04:39:28.429064Z","submitted_at":"2015-12-10T19:51:55Z","title":"Deep Residual Learning for Image Recognition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.03385","snapshot_observed_at":"2026-08-10T14:33:23.020495Z","title":"Preprint, arXiv:1512.03385","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.020495Z"},"links":{"cited_paper":"/paper/1512.03385","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:8e04c4fa9402d031fb0f89b6e4ff01f9291de4ac15e90763a938d99ccb0a6b6a","observation_id":"83fbc3c0-502a-4860-91e5-62962254c7f1","resolution":{"observed_at":"2026-08-10T14:33:23.020495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.01846","last_updated":"2018-11-05T17:04:35Z","snapshot_observed_at":"2026-07-06T07:12:44.495733Z","submitted_at":"2018-11-05T17:04:35Z","title":"Reinforcement Learning based Dynamic Model Selection for Short-Term Load Forecasting","version":1},"cited_work":{"arxiv_id":"1811.01846","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.01846","snapshot_observed_at":"2026-08-10T14:33:24.063612Z","title":"Reinforcement Learning based Dynamic Model Selection for Short-Term Load Forecasting","venue":"cs.LG","work_id":"5e24ad01-3a42-448c-bb2c-80b7b4f8acc2","year":2018},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:22.907152Z"},"links":{"cited_paper":"/paper/1811.01846","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:647e551652461957ef6dbe32fc63b4944d7164531baf06d3c333c0de8cf5c0b1","observation_id":"40f81a7b-9c8d-48c4-90e2-450fab208481","resolution":{"observed_at":"2026-08-10T14:33:24.068295Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"1905.08874","last_updated":"2019-05-21T21:12:23Z","snapshot_observed_at":"2026-07-06T07:54:35.511356Z","submitted_at":"2019-05-21T21:12:23Z","title":"Adaptive Model Selection Framework: An Application to Airline Pricing","version":1},"cited_work":{"arxiv_id":"1905.08874","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.08874","snapshot_observed_at":"2026-08-10T14:33:23.674195Z","title":"Adaptive Model Selection Framework: An Application to Airline Pricing","venue":"cs.LG","work_id":"b95929e3-31a7-43b4-b094-bb34df4d8453","year":2019},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.370514Z"},"links":{"cited_paper":"/paper/1905.08874","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:fd88c153d6c14d9d4ce61f6f79d9c09cda620baa76dfc2f2d0a8d48ee66c2d9f","observation_id":"84777a52-65ac-49ef-ab92-4942db35145b","resolution":{"observed_at":"2026-08-10T14:33:23.707029Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"1911.02116","last_updated":"2020-04-08T01:02:17Z","snapshot_observed_at":"2026-08-02T09:09:10.011185Z","submitted_at":"2019-11-05T22:42:00Z","title":"Unsupervised Cross-lingual Representation Learning at Scale","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.02116","snapshot_observed_at":"2026-08-10T14:33:22.845612Z","title":"Preprint, arXiv:1911.02116","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:22.845612Z"},"links":{"cited_paper":"/paper/1911.02116","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:800678465b9e1b02f0b141701faacdb60924dc8b5b92e8a5d9e2e28668c74e6c","observation_id":"7f1adec8-85fb-4c0c-89a2-4577a569533e","resolution":{"observed_at":"2026-08-10T14:33:22.845612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.03193","last_updated":"2021-06-06T17:58:12Z","snapshot_observed_at":"2026-08-01T11:21:28.445632Z","submitted_at":"2021-06-06T17:58:12Z","title":"The FLORES-101 Evaluation Benchmark for Low-Resource and Multilingual Machine Translation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.03193","snapshot_observed_at":"2026-08-10T14:33:22.976676Z","title":"Preprint, arXiv:2106.03193","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:22.976676Z"},"links":{"cited_paper":"/paper/2106.03193","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:321bdf2be38353257a644f615166248d428fecfd5bab9a6f9f61dc26eb88f331","observation_id":"f22b811a-3faa-4aaf-ab41-c27b97442c58","resolution":{"observed_at":"2026-08-10T14:33:22.976676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.10684","last_updated":"2022-10-26T16:14:05Z","snapshot_observed_at":"2026-08-03T02:24:22.577450Z","submitted_at":"2021-12-20T17:05:11Z","title":"Efficient Large Scale Language Modeling with Mixtures of Experts","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.10684","snapshot_observed_at":"2026-08-10T14:33:22.720381Z","title":"Preprint, arXiv:2112.10684","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:22.720381Z"},"links":{"cited_paper":"/paper/2112.10684","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:e0bfe5b36005ad62686d6a76f6016df28278e20aec65810aeda3e3628ad21240","observation_id":"f3dd5bc0-b804-493f-999d-4fe705cc09d8","resolution":{"observed_at":"2026-08-10T14:33:22.720381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02170","last_updated":"2024-11-15T04:30:04Z","snapshot_observed_at":"2026-08-07T04:49:42.215176Z","submitted_at":"2023-10-03T16:05:48Z","title":"A Dynamic LLM-Powered Agent Network for Task-Oriented Agent Collaboration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02170","snapshot_observed_at":"2026-08-10T14:33:23.076665Z","title":"Preprint, arXiv:2310.02170","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:23.076665Z"},"links":{"cited_paper":"/paper/2310.02170","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:95a538d8ff8a23f6ee3da4e7359038479e43d860d86ee853aaa0321a6ca21d57","observation_id":"f9a344ec-c16f-49f0-9888-83e87f3fd8dc","resolution":{"observed_at":"2026-08-10T14:33:23.076665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.10774","last_updated":"2024-06-14T23:32:32Z","snapshot_observed_at":"2026-07-06T17:17:56.276857Z","submitted_at":"2024-01-19T15:48:40Z","title":"Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.10774","snapshot_observed_at":"2026-08-10T14:33:22.772646Z","title":"Preprint, arXiv:2401.10774","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-10T14:33:22.772646Z"},"links":{"cited_paper":"/paper/2401.10774","citing_paper":"/paper/2501.15219"},"observation_digest":"sha256:9ada5ec2fa48a73b45998308289c162d914e9f099781c04eef05060d65a51567","observation_id":"f4354785-9f15-4db9-b00f-f651b000ebab","resolution":{"observed_at":"2026-08-10T14:33:22.772646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.15219","last_updated":"2025-01-25T13:50:18Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-11T06:00:17.621907Z","submitted_at":"2025-01-25T13:50:18Z","title":"Faster Machine Translation Ensembling with Reinforcement Learning and Competitive Correction"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":6,"parse_uncertain":0,"unresolved":28,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":35},"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 35 of 35 outbound references and 1 inbound Pith citation observation for arXiv:2501.15219."}