{"as_of":"2026-08-20T10:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a0808865cc7bf7736baf290d68d0147bade4d38369733bc1112c05df2c34ae00","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:49:22.378838Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2510.24515/citation-record","integrity":"/paper/2510.24515/integrity","json":"/paper/2510.24515/citation-record.json","paper":"/paper/2510.24515"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:49:22.664053Z","title":"The team orienteering problem,","venue":null,"work_id":"6ffd99d1-a72a-46d3-8edc-4ef60a5037b4","year":1996},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.301713Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:c675fb754533acf1f7fbe7bcc696017ee8911261345818109eb34e2da32fd639","observation_id":"66b07687-4b4c-42fa-a703-60781bbf25e7","resolution":{"observed_at":"2026-08-15T15:49:22.669018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:49:22.650056Z","title":"Multi- robot scheduling for environmental monitoring as a team orienteering problem,","venue":null,"work_id":"67ab49f8-ce43-487b-bb05-356057bb0124","year":2021},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.306673Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:0c861c8186dc0346f6dbd5b98da227792055f777aa94ea02e00271acd1d7a639","observation_id":"3e00d25a-5dcd-4dc9-a7f2-51fe14d2c274","resolution":{"observed_at":"2026-08-15T15:49:22.654603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:49:22.634563Z","title":"A spatio-temporal representation for the orienteering problem with time-varying profits,","venue":null,"work_id":"8cf5cfe7-1906-4e5e-98cb-1c807948a8ec","year":2017},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.311063Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:f49f15be0182b0e4e042e6c1d6708a38dd33cb4e07452af8adcb690c262baf83","observation_id":"173b04ed-e48b-4dbd-bb33-c23bfb0dbbc4","resolution":{"observed_at":"2026-08-15T15:49:22.640597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:49:22.619959Z","title":"Orienteering Problem: A survey of recent variants, solution approaches and applications,","venue":null,"work_id":"f9823718-0209-46dd-ad29-209458c99e6d","year":2016},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.315435Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:092344f12503eacc32b14594eff1af0f305c122a764a51b8091785e9972cac73","observation_id":"4543c375-f62d-4c83-8294-82afcf7d960b","resolution":{"observed_at":"2026-08-15T15:49:22.624805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:49:22.605132Z","title":"Learn to solve the min-max multiple traveling salesmen problem with reinforcement learning,","venue":null,"work_id":"ca2110b0-066c-447e-bd8b-1247b0c5aa3d","year":null},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.320084Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:7a55b1129c86f25cfa8cfd75ddbecdee9eda84cb9c6892cf9bf4df7d926ce9c0","observation_id":"e3b76725-514f-4b4d-8751-4792665916e9","resolution":{"observed_at":"2026-08-15T15:49:22.609743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.02959","last_updated":"2024-07-03T09:52:30Z","snapshot_observed_at":"2026-08-16T13:37:27.301563Z","submitted_at":"2024-07-03T09:52:30Z","title":"Competing for the most profitable tour: The orienteering interdiction game","version":1},"cited_work":{"arxiv_id":"2407.02959","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.02959","snapshot_observed_at":"2026-08-15T15:49:22.450918Z","title":"Competing for the most profitable tour: The orienteering interdiction game","venue":"math.OC","work_id":"a6c275c5-8eea-4823-b600-d99122f42f87","year":2024},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.324530Z"},"links":{"cited_paper":"/paper/2407.02959","citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:b289417797a9e1e7e8518c17acc730afc495af52a5070a9063094a68468e194f","observation_id":"a93edeb8-854f-43f1-a770-fc79719d11b9","resolution":{"observed_at":"2026-08-15T15:49:22.456866Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:49:22.589845Z","title":"DIRECT: A scalable approach for route guidance in Selfish Orienteering Problems,","venue":null,"work_id":"37ed5bb9-84d9-46db-a3ee-df394c3c9d50","year":null},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.329350Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:a9b28b8bbca4af0305663b90cf7826d194d93dbe21f7cf6796be77255acb61a2","observation_id":"3bf35bf7-251b-472f-8e9f-813795920025","resolution":{"observed_at":"2026-08-15T15:49:22.594651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:49:22.575316Z","title":"Prize collecting multiagent orienteer- ing: Price of anarchy bounds and solution methods,","venue":null,"work_id":"c2f12cd0-aa4c-4e6c-8ea8-96f42e3dad2f","year":2020},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.334145Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:528f220e2edde46f85cdbf808d158367c94f2ab65ebbf10eb8121b9f0649d060","observation_id":"be888651-ed16-4863-95d2-58cee8539732","resolution":{"observed_at":"2026-08-15T15:49:22.579784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:49:22.559738Z","title":"Collaborative dynamic scheduling in a self-organizing manufacturing system using multi-agent reinforcement learning,","venue":null,"work_id":"db77d4b8-1f91-48cd-92ff-06ed6c0dc158","year":2024},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.338900Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:a0071e6fc70a0328129ee683df93531a73485af9ad1f6c32e01243ced17eec41","observation_id":"ec52a542-0848-49d4-a561-abf4f513fee8","resolution":{"observed_at":"2026-08-15T15:49:22.564650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:49:22.545367Z","title":"Optimizing task scheduling in human- robot collaboration with deep multi-agent reinforcement learning,","venue":null,"work_id":"3ed4b5ba-9744-4bd2-9bbd-9bc8be1b7c40","year":2021},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.343056Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:fd615393c67428e60eecdeabad95dd84e3e606a2b7fddbe0a5ca30ec8b4ef753","observation_id":"21345f24-b39c-497d-b30f-a0524eaf49fc","resolution":{"observed_at":"2026-08-15T15:49:22.550337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:49:22.531005Z","title":"A dynamic task assignment model for aviation emergency rescue based on multi- agent reinforcement learning,","venue":null,"work_id":"a99063f3-8c61-40db-9c1f-1bb4fcad2b1c","year":2023},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.347261Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:6e5d90f31f7dd9481e95f12a05dc9eb35881fa4ce71974a8a073728a8799693c","observation_id":"15a68cac-e63c-4ace-96e9-16ea94ed60cd","resolution":{"observed_at":"2026-08-15T15:49:22.535739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.07337","last_updated":"2023-08-01T19:36:57Z","snapshot_observed_at":"2026-08-16T15:55:18.855555Z","submitted_at":"2023-02-14T20:48:00Z","title":"Graph Attention Multi-Agent Fleet Autonomy for Advanced Air Mobility","version":3},"cited_work":{"arxiv_id":"2302.07337","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.07337","snapshot_observed_at":"2026-08-15T15:49:22.427321Z","title":"Graph Attention Multi-Agent Fleet Autonomy for Advanced Air Mobility","venue":"cs.RO","work_id":"59711bc1-cd4b-4b8c-8342-5fbac748ba4e","year":2023},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.351355Z"},"links":{"cited_paper":"/paper/2302.07337","citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:50e2cd02da176f5f2c6c2c1eb39ab9754a8f0fca9c2751ee04d3b23247c920d6","observation_id":"544bfbf2-e66d-4aa4-b7bd-78c90ca65377","resolution":{"observed_at":"2026-08-15T15:49:22.434802Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08-15T15:49:22.356869Z","title":"Consensus-based decentralized auctions for robust task allocation,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.356869Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:23f44460cbe3235d8fedfab1fdc62e2d9c1c853a748e64739fc13ddf6e687a88","observation_id":"fea77039-023c-4e29-9f7a-d85a3953bf64","resolution":{"observed_at":"2026-08-15T15:49:22.356869Z","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-15T15:49:22.507369Z","title":"Optimal cost-sharing in general resource selection games,","venue":null,"work_id":"ba3ad0f4-c8b7-44fd-bccd-9f1f7d1e9369","year":2016},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.361724Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:ee671924427feb14cbdae385cd82537204e653c6714d944b90718968da8aab1a","observation_id":"2a6967ef-ab77-44bc-9b7b-31c331827c8d","resolution":{"observed_at":"2026-08-15T15:49:22.512368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:49:22.492039Z","title":"Nash q-learning for general-sum stochastic games,","venue":null,"work_id":"1e98d9d5-7cb2-4b61-90d2-6835964fdec4","year":2003},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.365750Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:f3d6ca300583b3db7efcbf2e380e41e7688e3cebaeaa671433da49191e992ee8","observation_id":"b88d9933-c6fa-4966-988f-7a3b2d65354f","resolution":{"observed_at":"2026-08-15T15:49:22.496874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:49:22.475749Z","title":"Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations,","venue":null,"work_id":"c8d8618e-bce5-4c72-8b32-ab26c7819f13","year":null},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.369687Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:4af9d10ebacc92a8a67a62d0d0df6d9bf9c90e8a47a997e19d7086ddc4dcd918","observation_id":"543bf2e6-9c22-40a5-9b9d-132ef7e07659","resolution":{"observed_at":"2026-08-15T15:49:22.481311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.06764","last_updated":"2019-10-13T20:02:15Z","snapshot_observed_at":"2026-08-15T16:01:17.783695Z","submitted_at":"2019-10-13T20:02:15Z","title":"Stabilizing Transformers for Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.06764","snapshot_observed_at":"2026-08-15T15:49:22.373877Z","title":"Stabilizing Transformers for Reinforcement Learning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.373877Z"},"links":{"cited_paper":"/paper/1910.06764","citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:3a09dc8d18680f5d3530457e3ffa723d1529775f008a3a66e48f31390c08de91","observation_id":"cdeba35a-1efa-4ffe-afcd-fa9a50b79ee1","resolution":{"observed_at":"2026-08-15T15:49:22.373877Z","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-08-15T15:49:22.378838Z","title":"Orienteering problem: A survey of recent variants, solution approaches and applications,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:22.378838Z"},"links":{"citing_paper":"/paper/2510.24515"},"observation_digest":"sha256:58a7dc38a2b2f19f4079686542e4dbc3d65fa5cdf7de02ab70de79d1db6ef825","observation_id":"9332d9e6-77ba-4d08-9693-a3037e297754","resolution":{"observed_at":"2026-08-15T15:49:22.378838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.24515","last_updated":"2026-06-10T10:35:57Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-19T11:38:32.228421Z","submitted_at":"2025-10-28T15:27:26Z","title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":2,"verified_fuzzy":13},"total_outbound_references":18},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2510.24515."}