{"as_of":"2026-08-09T11:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:597af977d11c718b83d07242ec3b3a9e5656fce54e02f5ff68cf60c8219e5cf5","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:40:09.868243Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2506.01927/citation-record","integrity":"/paper/2506.01927/integrity","json":"/paper/2506.01927/citation-record.json","paper":"/paper/2506.01927"},"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-07T11:40:57.967134Z","title":"MIT Press, 2024","venue":null,"work_id":"91d60295-c879-452c-b76c-3d95fa3dca54","year":2024},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:47.286139Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:db6f7d08a5ce780415a4996c7a4fb2b36182b9045edf0fa360da75d26b6fa8d5","observation_id":"d845588f-9336-4d0d-86b4-89f8b37f907c","resolution":{"observed_at":"2026-08-07T11:40:58.052372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.05492","last_updated":"2022-10-11T14:47:35Z","snapshot_observed_at":"2026-07-06T14:03:42.001135Z","submitted_at":"2022-10-11T14:47:35Z","title":"Mastering the Game of No-Press Diplomacy via Human-Regularized Reinforcement Learning and Planning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.05492","snapshot_observed_at":"2026-08-07T11:39:47.380375Z","title":"Mastering the game of no-press diplomacy via human-regularized reinforcement learning and planning.arXiv preprint arXiv:2210.05492, 2022","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:47.380375Z"},"links":{"cited_paper":"/paper/2210.05492","citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:c2f3b943dcce988913e231241dd04635457a8c50af63ee0f0c27d1d68104bf4e","observation_id":"fca4374f-d281-4765-a598-2e441dbe33c8","resolution":{"observed_at":"2026-08-07T11:39:47.380375Z","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-07T11:40:57.900508Z","title":"Springer, 2018","venue":null,"work_id":"4296d164-1283-4133-9592-272ae0d73e8a","year":2018},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:47.456523Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:0ad20730a259240bcc1436c5b9c2809433459eb23f400c8cae1a1e3c6ea9a9ea","observation_id":"1e3df3c1-19ce-4a5e-934e-342a8e8fdaa4","resolution":{"observed_at":"2026-08-07T11:40:57.908050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.18703","snapshot_observed_at":"2026-08-07T11:39:47.566631Z","title":"Bridging the Gap be- tween Partially Observable Stochastic Games and Sparse POMDP Methods, May 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:47.566631Z"},"links":{"cited_paper":"/paper/2405.18703","citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:bc061a0b3b74029ca245c7be0a3c6d096c8895fbaa580ae0c59e1ad16e22aa7e","observation_id":"e1a024c3-66b4-490c-92ab-0c092a84dfe1","resolution":{"observed_at":"2026-08-07T11:39:47.566631Z","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-07T11:40:57.804971Z","title":"Julia: A fresh approach to numerical computing.SIAM review, 59(1):65–98, 2017","venue":null,"work_id":"8f833792-e5ed-4622-ad4f-b1533e076689","year":2017},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:48.880142Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:7a88e7cf67330421c1b4f22100266507e90a424a3643afc42783f9582453f3d1","observation_id":"17fb916f-9394-46a2-883c-f2c9f9418daa","resolution":{"observed_at":"2026-08-07T11:40:57.829313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:39:51.667355Z","title":"Deep counterfactual regret minimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:51.667355Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:36da7db13160ef39625d9bcd68c1f654cdbbf262fc5a0040774c18a06abc832f","observation_id":"fda21ea0-75dd-4caa-abe6-85479eb71b68","resolution":{"observed_at":"2026-08-07T11:39:51.667355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09713","last_updated":"2020-02-18T22:55:48Z","snapshot_observed_at":"2026-08-04T14:49:33.747828Z","submitted_at":"2019-10-22T00:44:37Z","title":"ALGAMES: A Fast Solver for Constrained Dynamic Games","version":2},"cited_work":{"arxiv_id":"1910.09713","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.09713","snapshot_observed_at":"2026-08-07T11:40:09.955336Z","title":"ALGAMES: A Fast Solver for Constrained Dynamic Games","venue":"cs.RO","work_id":"efa13d58-01df-44bf-9728-aa27781d40f6","year":2019},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:51.789239Z"},"links":{"cited_paper":"/paper/1910.09713","citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:6a3d0eeedbd3c44e1d867540b8255673805ad41b095d36c5bf40d654d23b5480","observation_id":"e39fed7c-98d5-4de1-a85b-0f2a248f27d9","resolution":{"observed_at":"2026-08-07T11:40:10.032366Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:57.706865Z","title":"Interac- tive pomdps: Properties and preliminary results","venue":null,"work_id":"2dbd0ebd-d8ad-4061-9430-beb06b633b15","year":2004},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:51.881339Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:ab7ed219b3891763deca73975cd28846bf8f98afa10fc3ce515a9401134e5c2c","observation_id":"dd2b9ebd-3636-4082-9b55-e3d4d39552cf","resolution":{"observed_at":"2026-08-07T11:40:57.755271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:56.049712Z","title":"Learning others’ intentional models in multi-agent settings using interac- tive pomdps.Advances in Neural Information Processing Systems, 31, 2018","venue":null,"work_id":"1758ef5b-ea58-4c93-a3f8-c73eeffa8180","year":2018},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:51.998451Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:71ea7013b817e444ab76a3ca65b3d666143d6dc57124cf4b4049a909af510af7","observation_id":"b339a653-310d-4e1a-a924-09810e93175b","resolution":{"observed_at":"2026-08-07T11:40:57.514956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.01121","last_updated":"2016-06-28T15:28:30Z","snapshot_observed_at":"2026-08-08T22:18:19.349556Z","submitted_at":"2016-03-03T15:01:54Z","title":"Deep Reinforcement Learning from Self-Play in Imperfect-Information Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.01121","snapshot_observed_at":"2026-08-07T11:39:52.100527Z","title":"Deep reinforcement learning from self-play in imperfect-information games","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:52.100527Z"},"links":{"cited_paper":"/paper/1603.01121","citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:b354b512eef8b666a5d57900cd3b0bb0171567783e82e8bb41067882cc1f1475","observation_id":"5426a82d-6cab-4e5a-aeb9-3d3ae4be1268","resolution":{"observed_at":"2026-08-07T11:39:52.100527Z","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-07T11:40:55.925846Z","title":"Flux: Elegant machine learning with julia","venue":null,"work_id":"86ce0111-9f57-4d67-ac0e-c6da4f5f5124","year":2018},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:52.178782Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:09df5d2b50d6dcc6d9768028a886073956ddd583abc31730565c761c50fabb84","observation_id":"cebeb383-717a-4b90-8f9a-c03c6fda6cad","resolution":{"observed_at":"2026-08-07T11:40:55.994955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:55.546316Z","title":"Rethinking formal models of partially observable multiagent decision making.Artifi- cial Intelligence, 303:103645, 2022","venue":null,"work_id":"24d30921-21ee-4c0c-9e19-2beb875a6094","year":2022},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:52.259736Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:f1dc0b06dd6a4eed2fce9faeead669766377523d10bc2324b437c13882fc3e63","observation_id":"e3ae1e63-b8ad-482c-be52-b2d7a56f08f7","resolution":{"observed_at":"2026-08-07T11:40:55.869606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:53.233024Z","title":"Multi-hypothesis interactions in game-theoretic motion planning","venue":null,"work_id":"cd1c284d-d3b5-4ce5-a41c-15657587b0fb","year":2021},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:52.329091Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:52ca34be3a66f862d87d89b01815c7496e5cc048a785f16a6e2f99d99fe588be","observation_id":"1ecec939-c349-4843-96ce-6c9937728db1","resolution":{"observed_at":"2026-08-07T11:40:54.881763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:36.063649Z","title":"A unified game-theoretic approach to multiagent reinforcement learning.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":"cc90ff60-fb3e-43a9-baa8-54266f24717f","year":2017},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:52.399851Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:2313ef0f343132002be88cfaac4552cc51c90947100b95dc7ec6dd72c350955a","observation_id":"9924e5bc-3649-43f7-8a0c-d9a1d81de9a6","resolution":{"observed_at":"2026-08-07T11:40:45.356992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:35.949508Z","title":"On gradient-based learning in continuous games.SIAM Journal on Mathematics of Data Science, 2(1):103–131, 2020","venue":null,"work_id":"e931a7b4-8939-464d-99b6-50b24385784e","year":2020},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:52.467191Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:a32f14a4c73026ded58d3eb799aa63fbe0a72c6ba512e10f5e17e04501673033","observation_id":"30fa4a22-ef9c-4158-9678-e83c042ef5e2","resolution":{"observed_at":"2026-08-07T11:40:36.022715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:35.740946Z","title":"XDO: A Double Oracle Algorithm for Extensive-Form Games","venue":null,"work_id":"f8f7f7b7-2c2e-446d-a5b4-88d347acb13b","year":2021},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:52.554041Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:f1c9d719c73aa8c45dc4188b6b11096bbb3a386a74218a18f2b52bc08cb73f3a","observation_id":"75a8cfac-3420-4cc4-b8ca-a801bd2df9de","resolution":{"observed_at":"2026-08-07T11:40:35.886313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:32.884117Z","title":"Mastering the game of stratego with model-free multi- agent reinforcement learning.Science, 378(6623):990– 996, 2022","venue":null,"work_id":"ed183721-6b37-493d-8bc9-f21132d6d709","year":2022},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:52.771635Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:cb666f3fa46b84347c5d1c22bc56e7b6fff4c90755de1c6d0745bd0d75519ca0","observation_id":"ce6c373f-e282-4bf6-b728-e11e7d0e6bcf","resolution":{"observed_at":"2026-08-07T11:40:34.930887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:24.134743Z","title":"Learn- ing mixed strategies in trajectory games","venue":null,"work_id":"5e6fe95b-d340-41b7-b106-3095cea731c1","year":2022},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:52.921199Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:082cc38d7d5c54a86bf3014939fe7aedfda76efaf4d82c68cb9c795868dd0945","observation_id":"0c1eecbc-ab72-43e7-a7bc-9579deba3396","resolution":{"observed_at":"2026-08-07T11:40:31.436635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:23.401759Z","title":"Belief space planning assuming maximum likelihood observations","venue":null,"work_id":"59b345c0-ca4c-4e67-9856-e6e7a4a80e4e","year":2010},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:53.019565Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:427a822af4ee1d58b7f289b4caf2fa1daf79726e0d793c3a58f16bfc46889a3a","observation_id":"117816f2-8c0e-47f3-befa-8424c45f0994","resolution":{"observed_at":"2026-08-07T11:40:23.658211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:12.315705Z","title":"Information gathering actions over human internal state","venue":null,"work_id":"255917aa-6cc6-4907-98a6-59306d9863e7","year":2016},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:53.103529Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:ccf4eedee59dc32d6b0e7359fbc30c658937c1b87afe62da8779d267c2843a5d","observation_id":"5767c8fb-2929-4ffc-953b-8c7c72d8b8ee","resolution":{"observed_at":"2026-08-07T11:40:23.082566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:12.169752Z","title":"Theory of mind for a humanoid robot","venue":null,"work_id":"ed7c6a93-1bfd-4d44-a0f9-aba0a19c5585","year":2002},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:53.213353Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:a1cbec8ca4128b3a81757eafa3a4fef6559c344895de3e84fdf23f8bb6e0a92f","observation_id":"b2bdba09-f0e1-4b7e-9e7f-72e60d159f99","resolution":{"observed_at":"2026-08-07T11:40:12.226782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:12.100132Z","title":"Stochastic dynamic games in belief space","venue":null,"work_id":"0e6bf096-245d-477f-a0cc-1219dd23f637","year":2021},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:53.375610Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:c1d6be8eab00268cc7765c4e22fd1484eabced57d4001dc2126e48afebc7866c","observation_id":"3d5ce6d6-75f2-49f1-b8a6-361f7c8af0cb","resolution":{"observed_at":"2026-08-07T11:40:12.120079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:12.040301Z","title":"Online planning for interactive-pomdps using nested monte carlo tree search","venue":null,"work_id":"84301597-4cce-4155-a556-ed222ac8b9fb","year":2022},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:40:07.102440Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:431f83ddfbe38057501b908612dfe891b415c6b729e2ab6cc0438650d2e11d24","observation_id":"0868ce87-1bd3-4f95-9fc6-b2fe47519b8c","resolution":{"observed_at":"2026-08-07T11:40:12.061279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:11.998480Z","title":"Solving heads-up limit texas hold’em","venue":null,"work_id":"a2a26aae-6ae9-43f0-8927-7ab9fd53ac54","year":2015},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:40:08.047328Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:d85a574e6614563ff0955741eb65afcc11ba60e991c7e02200069a973b402f0a","observation_id":"dde45a1e-afd1-4950-a66f-001ec74eb64d","resolution":{"observed_at":"2026-08-07T11:40:12.011944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:11.958587Z","title":"Grandmaster level in starcraft ii using multi-agent reinforcement learning.nature, 575(7782): 350–354, 2019","venue":null,"work_id":"b94dd27b-bec2-429d-9ef6-28bb65af3148","year":2019},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:40:09.312917Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:c2a1e5f6d09d8532345d9bd2586049e89cd1e6ea6967f2dccfbc41d3ba66a23b","observation_id":"ba390389-8051-45fc-a6ef-a54c7ea9de51","resolution":{"observed_at":"2026-08-07T11:40:11.978528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:11.810767Z","title":"On the computational complexity of stochastic controller optimization in pomdps.ACM Transactions on Compu- tation Theory (TOCT), 4(4):1–8, 2012","venue":null,"work_id":"4e2cc15e-29d0-4c40-b072-f7e3e91eeec0","year":2012},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:40:09.642696Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:34933823cb35dac15ab7a6bc3a43d8f68e4db595bd50e188bf720c73dda25437","observation_id":"bad90572-2f18-4873-a9fc-1713634acb8b","resolution":{"observed_at":"2026-08-07T11:40:11.882563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T11:40:11.530693Z","title":"Game theoretic motion planning for multi-robot racing","venue":null,"work_id":"57f78ff9-488f-4c3c-ae52-6d40ec494842","year":2019},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T11:40:09.777828Z"},"links":{"citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:21327c13b6643bab059f629dc256ebe88bab6ee59b61b39bf757f9a1ba0d491c","observation_id":"9ed12615-01dc-49cc-ba31-33528f627695","resolution":{"observed_at":"2026-08-07T11:40:11.701192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.00583","last_updated":"2025-08-13T17:31:43Z","snapshot_observed_at":"2026-08-07T03:34:27.861455Z","submitted_at":"2020-11-01T18:24:40Z","title":"Game-Theoretic Multiagent Reinforcement Learning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.00583","snapshot_observed_at":"2026-08-07T11:40:09.868243Z","title":"An overview of multi- agent reinforcement learning from game theoretical per- spective.arXiv preprint arXiv:2011.00583, 2020","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T11:40:09.868243Z"},"links":{"cited_paper":"/paper/2011.00583","citing_paper":"/paper/2506.01927"},"observation_digest":"sha256:c9666c400578112c2b4d5ad2817071b593efb73bb3ff7280b3ef0dcf85e5f0d9","observation_id":"3ef24ad3-e664-40b9-b56e-250c9a67d684","resolution":{"observed_at":"2026-08-07T11:40:09.868243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.01927","last_updated":"2025-06-02T17:45:58Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-07T11:28:57.275531Z","submitted_at":"2025-06-02T17:45:58Z","title":"Online Competitive Information Gathering for Partially Observable Trajectory Games"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":28},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2506.01927."}