{"as_of":"2026-08-08T23:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a933e6b56a55ab1db718cc16426715be09edf336f71fc0edeeb39b8f6cb8dfbb","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T15:12:44.509076Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2602.01568/citation-record","integrity":"/paper/2602.01568/integrity","json":"/paper/2602.01568/citation-record.json","paper":"/paper/2602.01568"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems37, 6648–6710 (2024)","venue":null,"work_id":"b413a731-eafc-4130-b383-b131147438ca","year":2024},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:08de5080e7c2e38a6d9d858b2cf9691d5435da0551a0fcfb9845e8a1e5d46e3c","observation_id":"50acc576-73e9-46d2-bb6d-3aa7fad7633e","resolution":{"observed_at":"2026-05-21T15:14:13.590745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Econometrica: Journal of the Econometric Society pp","venue":null,"work_id":"7249ff8b-e22c-4ebe-9a5c-46a98119577e","year":1987},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:36a40cb80b15bd40a93dbca926743fe4c62f9ae6144ab09e83ac6e1e064af06d","observation_id":"ccb86b92-0747-4498-9b64-2043dcd0f5ba","resolution":{"observed_at":"2026-05-21T15:14:13.562665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SIAM (1998)","venue":null,"work_id":"c9eed201-e7c3-4d95-980e-9b83339f2951","year":1998},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:89f30d48402089bd6119a40ac2051d5680fadb35b8ccddb9520a6cacaeae8be7","observation_id":"8b6f5751-f6b9-4561-96aa-458072f412aa","resolution":{"observed_at":"2026-05-21T15:14:13.616906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Automatica17(5), 749–754 (1981)","venue":null,"work_id":"ab45b5e1-3a0b-4fd7-a4b7-14d4ce585de4","year":1981},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:0b96a0db6ed1f6988f3e935696e93f19a9aea1aa5466b60c2eec03b8087198f5","observation_id":"1be450ad-ab86-42e4-913f-351279a4c45c","resolution":{"observed_at":"2026-05-21T15:14:13.577065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.18703","last_updated":"2024-10-28T20:51:59Z","snapshot_observed_at":"2026-08-06T15:22:38.346478Z","submitted_at":"2024-05-29T02:27:47Z","title":"Bridging the Gap between Partially Observable Stochastic Games and Sparse POMDP Methods","version":2},"cited_work":{"arxiv_id":"2405.18703","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.18703","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2405.18703 (2024)","venue":null,"work_id":"902d6e1b-7083-4111-97e1-c35732f0969f","year":2024},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"cited_paper":"/paper/2405.18703","citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:cfb608d0d7880700f645abfbe2b6c0428c00f3bf3ca5514116330f3f9311db74","observation_id":"4276fd13-ef35-41b5-9d7e-2952303e220d","resolution":{"observed_at":"2026-05-21T15:14:13.365560Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An- nals of Operations Research34(1992)","venue":null,"work_id":"27b2495b-2b8a-4396-98f3-6bb97516b711","year":1992},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:8665a4f8a3cefffb680bfdf831a67844be799dba4f9c1e964981d1f80868f15d","observation_id":"8390a328-894c-4070-9eaa-55151cefc7df","resolution":{"observed_at":"2026-05-21T15:14:13.593052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Operations Research21(1), 37–44 (1973)","venue":null,"work_id":"b6d699f4-43a6-4719-8638-52fe9549752d","year":1973},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:84c8eb545c86a2efdf80634f9f313c713b658c88979f2d7f7fc71e0dee500567","observation_id":"96b773f9-ab3c-4f43-b7a1-b59bc227aef4","resolution":{"observed_at":"2026-05-21T15:14:13.625907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Games and Economic Behavior4(2), 182–201 (1992)","venue":null,"work_id":"f6b0ec94-c5eb-425a-83d8-82287175e0ba","year":1992},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:9aa59759c4b50a02434626bd60bac3d988b438dfd99f493fab314f0afd7e69cf","observation_id":"51e9fcd4-3df3-4866-8b61-de5521b18c6e","resolution":{"observed_at":"2026-05-21T15:14:13.610406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"European Journal of Operational Research1(1), 1–11 (1977)","venue":null,"work_id":"6ace1148-6abf-49c2-8d6b-117a15c3439c","year":1977},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:b8648b61456cf9d081f673eef1359f83186ca8a507346bee2dca16d7a9f98640","observation_id":"5d0d552d-299d-442a-991d-ae10d7b5f0db","resolution":{"observed_at":"2026-05-21T15:14:13.599993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Management Science70(10), 7308–7324 (2024)","venue":null,"work_id":"8d7d9721-b09a-401e-9c52-8d8649535cee","year":2024},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:4b5b8c3e939d2ec3e8ac444c7dca9d4625befe5f2945c3faeca4a284596e6fc3","observation_id":"e980bd39-f0cd-4003-9cec-107e793cdf04","resolution":{"observed_at":"2026-05-21T15:14:13.587385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In: IJCAI","venue":null,"work_id":"12a337a2-5757-48ea-be7a-8246a545b0e2","year":2019},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:ff26beb19cb7aba9e5284ea791e66eaa8442ca7de7935e7a8ced8ecf05900a93","observation_id":"55608ddc-2962-4c38-aed1-588a5d853bb0","resolution":{"observed_at":"2026-05-21T15:14:13.629608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Annals of Operations Research 235(1), 129–153 (2015)","venue":null,"work_id":"40f74ed4-eb6b-4a24-b160-b66838df7b45","year":2015},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:c35073b0499b50b9972a0ec7ba56f8298044f81a98d712f2c7f84f4914f0dd89","observation_id":"77b58853-9235-4cde-ac08-622b9a677b55","resolution":{"observed_at":"2026-05-21T15:14:13.585309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems","venue":null,"work_id":"e1960962-954e-4495-869a-9cb20883150f","year":2004},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:07dffe1667aee994699990d4f270faebc9483fdb8d62f185c99685ac964764a9","observation_id":"a105612d-56b8-4096-8229-54b25b8ed488","resolution":{"observed_at":"2026-05-21T15:14:13.617860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Computational management science6(4), 377–397 (2009)","venue":null,"work_id":"6541d210-d455-42bc-a6c3-3d682478cfe6","year":2009},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:2bb1ab841a447809e8566b0e054ef47269124288c65db55d0db8f1ab3aca5f66","observation_id":"0898c089-550f-4d2e-8fe8-48e627924e61","resolution":{"observed_at":"2026-05-21T15:14:13.612364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In: Proceedings of the AAAI Confer- ence on Artificial Intelligence","venue":null,"work_id":"e3790884-22bc-4481-9bbe-40a4c8f87a43","year":2021},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:f8b0409df51db00abccc0a414008941099484799613eb6f7a9486708cc164de6","observation_id":"31a21e3a-83ae-45bf-a72a-8b1477e56004","resolution":{"observed_at":"2026-05-21T15:14:13.605660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Springer Sci- ence & Business Media (2012)","venue":null,"work_id":"01b2e722-9d8c-47b6-bb83-13257d4f540b","year":2012},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:744ce272890b0a8413a1d9a877a65804c67cdf5695078b98f53ef26f7aed447b","observation_id":"fde91d27-3192-4171-a10f-4cabcbbc2f86","resolution":{"observed_at":"2026-05-21T15:14:13.610595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Journal of the Operational Research Society32(9), 783–792 (1981)","venue":null,"work_id":"b201448d-937d-43a9-9b6b-f358e42889f6","year":1981},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:01f9d07c72d9304e19d45d6fc8baac6612b78ed7209668d4a9ca1552aaf2e6fa","observation_id":"15e27195-41f8-4f9d-b0e2-c672dccaad78","resolution":{"observed_at":"2026-05-21T15:14:13.588892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In: IEEE International Conference on Robotics and Automation (ICRA) (2020)","venue":null,"work_id":"c21c7c4f-6a7b-4374-95f6-bd9b62c5c58c","year":2020},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:3e327ac92f513c172cd4ca2719bac30f21915f2ab908ca2db395bf200f1ba47a","observation_id":"51141c04-0619-4811-82f4-3b270d741f47","resolution":{"observed_at":"2026-05-21T15:14:13.597667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In: AAAI","venue":null,"work_id":"042d9dff-1a11-4eaa-bebe-aa248cd041ca","year":2004},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:a214fd1198cf077cd3b08eec40e7a95db811215f707339daf560407d2a09ae29","observation_id":"80dd00ef-3317-4719-bc82-7becf74b8de8","resolution":{"observed_at":"2026-05-21T15:14:13.580665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mathematical programming32(2), 146–164 (1985)","venue":null,"work_id":"97faaaef-89c5-44d8-81d6-1e021b88749c","year":1985},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:89ef8f8ebdd7d233f8090d7878438e04dc005b640c55d444a4595a36ae63bb28","observation_id":"959d5b99-72cc-4edd-a7a7-3d7e8fdc8566","resolution":{"observed_at":"2026-05-21T15:14:13.613978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"IEEE Robotics and Automation Letters (RA-L) (2024)","venue":null,"work_id":"964f766c-b6ff-4463-9159-8ffca54e21e7","year":2024},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:7d5eaf9d5b2d8a66f391024b9ebec53b1c54b5a85ac7478d820eaffa3ef92b6c","observation_id":"274d54dc-25cf-4e3d-8a67-98e9de9f00ac","resolution":{"observed_at":"2026-05-21T15:14:13.608836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In: 2004 IEEE/RSJ international conference on intelligent robots and systems (IROS)(IEEE Cat","venue":null,"work_id":"13913fe9-f4bc-4f92-85ec-7388b1937d7f","year":2004},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:986c86b8b005ac09115eada0e79a7e4e1d755457ff7654fac21e069f9d0ea402","observation_id":"11cd2813-685e-4be3-8e50-0e44d384537b","resolution":{"observed_at":"2026-05-21T15:14:13.623853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems34, 11987–11998 (2021)","venue":null,"work_id":"4316bf94-e1ae-4b7e-ac32-982bb030284d","year":2021},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:07c763f9cf38e8f5d64dd9f51512504351d479481cc0ba54ef5113f4726aa091","observation_id":"1a315157-96a7-4f4a-997e-5c978e7313ba","resolution":{"observed_at":"2026-05-21T15:14:13.608389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Springer Science & Business Media (2002)","venue":null,"work_id":"63024c23-db8c-474e-9bf7-917816fe3275","year":2002},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:1128a3bfd5e90ebcb6d3851b6c5b09dd1b87a24e96862b00afe930165dd210b3","observation_id":"d79c3927-712c-4dda-a98d-e51aee9a2c96","resolution":{"observed_at":"2026-05-21T15:14:13.582627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11228-013-0271-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Set-Valued and Variational Analysis22(4), 691–720 (2014).https://doi.org/10.1007/s11228-013-0271-4","venue":null,"work_id":"3553a6ad-ac90-41a1-b4da-dc30fddf8363","year":2014},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:99553b21ac61f36d2399fce6085d26a4466bb7491d1d3cb4a0f0fefa1841a110","observation_id":"accf700d-6c0b-4907-84bd-ef5f0136498b","resolution":{"observed_at":"2026-05-21T15:14:13.310490Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03767","last_updated":"2024-04-23T17:54:36Z","snapshot_observed_at":"2026-08-05T20:56:26.911904Z","submitted_at":"2024-03-28T13:00:49Z","title":"Mathematical Program Networks","version":2},"cited_work":{"arxiv_id":"2404.03767","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.03767","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2404.03767 (2024)","venue":null,"work_id":"efb31290-ce4e-4290-8da6-8dc8679b0758","year":2024},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"cited_paper":"/paper/2404.03767","citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:a4af2cdfa46f6ef4ab82feea11296a1dabb55ccc585a02e77e39d9bcdae4e9f9","observation_id":"c79fe7a0-7c96-4b6e-a76e-9c13fff1a59d","resolution":{"observed_at":"2026-05-21T15:14:13.369642Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SIAM Journal on Opti- mization (2023)","venue":null,"work_id":"168395aa-62cb-429d-9671-0fd27ccaa418","year":2023},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:c976726571154fb49a8cdba76fa9470b09c0e983a426dc4a9660501420ed4cd8","observation_id":"9d39571f-5b6d-4cda-9ada-d9864315e226","resolution":{"observed_at":"2026-05-21T15:14:13.615746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SIAM Journal on Optimization (2024)","venue":null,"work_id":"e3645fa3-8513-46b7-a2fc-ba4c31799a35","year":2024},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:2d0bfd529c207f32ffbe93672977337236f6c55f17f277a9bd4c9fa667aab2c3","observation_id":"e7f04357-689a-4553-bcc0-24658ce4ad09","resolution":{"observed_at":"2026-05-21T15:14:13.595212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Energy320, 135418 (2025)","venue":null,"work_id":"33f99c33-0822-4939-a586-6b1e7407c2b3","year":2025},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:65a35de08c3000296917dd3bfee35e96a022a737f0ecc804e20fd68abc04f68f","observation_id":"798d7b76-a707-42a1-b659-4cfde6698d14","resolution":{"observed_at":"2026-05-21T15:14:13.597921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In: Machine learning proceedings 1994, pp","venue":null,"work_id":"dde8760f-cba8-4851-bbbf-f44b77d37069","year":1994},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:336d711b7df9d2db0b4a5273f8b3f2064ed452fc3e7c16a2d2479484f3ecfc7f","observation_id":"61cb9268-e96c-4ad3-8ce4-78701fa7aac7","resolution":{"observed_at":"2026-05-21T15:14:13.620012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Advances in Neural Information Pro- cessing Systems35, 18296–18308 (2022)","venue":null,"work_id":"0fc5e10c-2d6a-4e5e-aaf8-eb1b53d731d4","year":2022},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:c4bc2528b9424f855e495eba58d7f462ec8968d74edcc785d61b1fa6e7325c1d","observation_id":"eb059d91-e083-4ee6-83b5-508e1cad73c5","resolution":{"observed_at":"2026-05-21T15:14:13.602445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cambridge University Press (1996) Title Suppressed Due to Excessive Length 19","venue":null,"work_id":"d903fe66-8390-4c41-8bfe-34c57dd3e056","year":1996},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:88cedf60b04c30547cdee1f36eff911b00298baae9d2ab44a599e6bf33864de9","observation_id":"b51c7eb4-1527-492d-83a1-08372448319c","resolution":{"observed_at":"2026-05-21T15:14:13.606347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2504.15019","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2504.15019 (2025)","venue":null,"work_id":"ae7fdead-0d5d-4c02-b58b-136a3c038ce1","year":2025},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:4d5220d0d1c15b7af7a9089af5e3604a523be380e18e92973e1d728838aa114c","observation_id":"7b08a3ba-fe7a-4fc1-85dc-382a81192a3c","resolution":{"observed_at":"2026-05-21T15:14:13.364772Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In: The Foundations of Price Theory Vol 4, pp","venue":null,"work_id":"2f448c93-6136-44c3-bfbb-4532984d95f7","year":2024},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:4c36bff6211cf5f973201c7603f15b8841885459781cf7fb3f955f1ac4b84b19","observation_id":"95055d74-aee3-453a-b871-b4b73a61cbf0","resolution":{"observed_at":"2026-05-21T15:14:13.627863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Springer (1999)","venue":null,"work_id":"16ec49ea-cd25-4d2b-a57a-89881d5ed88b","year":1999},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:d958dd4b22318989dd57de6c6ecfc4c217a7b99c8f45bc80983a3fd937b54528","observation_id":"a2e49b1a-9519-47e8-a862-a577c5595b05","resolution":{"observed_at":"2026-05-21T15:14:13.586342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b0a05f18-e464-4dba-8357-519140bd3bc1","year":2025},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:60a5f904e93459361c371d6436616c9a5e4e941af0abc73b0901fad424b47ed5","observation_id":"bd6a5233-9bf4-423f-aa21-54b47122a1f8","resolution":{"observed_at":"2026-05-21T15:14:13.560444Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems34, 7522– 7533 (2021)","venue":null,"work_id":"2109b0de-ff02-40df-86a7-19046ea1cf22","year":2021},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:4e3a3919dcce7f9cc5f7a1551f897ecd8f29bb8cc836b1ea33c0031edc879852","observation_id":"ff3569d9-1b09-4b0c-b691-ca0f370b34ce","resolution":{"observed_at":"2026-05-21T15:14:13.622082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mathematical Methods of Operations Research99(1), 77–114 (2024)","venue":null,"work_id":"3bbabc96-1876-4832-875b-249e339f1838","year":2024},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:a1c9b5745e94451ab7f5f58b27d97e32587892f290b139516306abf9cc5ae3d1","observation_id":"a0b5b927-17a9-4c86-943b-fa7b63f0036a","resolution":{"observed_at":"2026-05-21T15:14:13.572761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the national academy of sciences39(10), 1095–1100 (1953)","venue":null,"work_id":"5753aad5-a308-4ae3-b85a-d7accda26e1c","year":1953},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:d820ff3ced845767fc317ece5c6faa29d91dc7757adc4490c30588f9ab45b90a","observation_id":"4ccaa6ed-b210-426d-897d-255216d09995","resolution":{"observed_at":"2026-05-21T15:14:13.570773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Operations Research31(2), 254–272 (1983)","venue":null,"work_id":"ae317c51-bf82-4055-b1e8-9a0d1666a0f1","year":1983},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:c14cf3730a76116235ab449ebc1d1b7bf7a6859965ef6a913b9f928d1904eaf8","observation_id":"382ac12b-ae40-441d-bcb0-58cde8ae8b4c","resolution":{"observed_at":"2026-05-21T15:14:13.584480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Journal of Information and Optimization Sciences2(1), 51–68 (1981)","venue":null,"work_id":"9455d529-93e8-4d12-9ad7-a846f9b5adf1","year":1981},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:016570e5cba58fbf8e5d2c32d2085a8e12ebecbbf754901ac2117d994b2ff05a","observation_id":"9e8f6fce-ad05-4a25-86fb-88d56e142e5f","resolution":{"observed_at":"2026-05-21T15:14:13.592565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"(No Title) (1952)","venue":null,"work_id":"7aea9565-dc2a-4284-af2e-e48b2008ffcb","year":1952},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:4de67441257937f9fe98a9dad28d789d3be1846bfa7471bf4522ac088ed292c2","observation_id":"42876585-47ca-43f2-aa47-d3696dee3fcd","resolution":{"observed_at":"2026-05-21T15:14:13.594293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Advances in neural information processing systems20(2007)","venue":null,"work_id":"da9988ff-9514-4aae-a6d8-b4fd53fb41bc","year":2007},"citing_paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-21T15:12:44.509076Z"},"links":{"citing_paper":"/paper/2602.01568"},"observation_digest":"sha256:d0a99235ba98f050ff8a8b6c629da448e3df9fe9d0134ce84d61977312262d7d","observation_id":"c2dddc5d-314b-4a3d-9428-f67e120823c9","resolution":{"observed_at":"2026-05-21T15:14:13.554055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2602.01568","last_updated":"2026-05-14T23:41:20Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-07-06T22:44:04.951815Z","submitted_at":"2026-02-02T03:03:29Z","title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":4,"verified_fuzzy":38},"total_outbound_references":43},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2602.01568."}