{"as_of":"2026-08-19T10:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1797f3c428df2ec619b6b6eadb1aae1c11ce15ec5eeae4c978f21765cea70101","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T13:46:04.338440Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2607.08012/citation-record","integrity":"/paper/2607.08012/integrity","json":"/paper/2607.08012/citation-record.json","paper":"/paper/2607.08012"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T13:47:05.914537Z","title":"Improved differentially private and lazy online convex optimization: Lower regret without smoothness requirements","venue":null,"work_id":"59cb365e-72c2-4eb6-9098-2db2a4a5fe6e","year":2024},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:6d547c46327dc83dd5542dc79fb78f21c03a527836d5580fdc5205682c8847e2","observation_id":"bf57c6c5-f56e-46dc-baf0-ef98ee61337c","resolution":{"observed_at":"2026-07-10T13:47:05.915820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.906426Z","title":"Online learning over a finite action set with limited switching","venue":null,"work_id":"baa1b038-0e7d-4e96-bf29-855763030371","year":2018},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:5d3bc62c2429335b53e642cc34ba2296dd180f0a53403e3f4948eafbf4e534e8","observation_id":"4efe94e3-32e7-4406-816e-1f67572b0393","resolution":{"observed_at":"2026-07-10T13:47:05.907819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.943904Z","title":"Human expertise in algorithmic prediction","venue":null,"work_id":"93fae1f9-8952-4d0e-b24b-5525a0070aa3","year":2024},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:dbc7741e35c0d3ee5c02115c97c8b352a5ef5972afbd0d329d8b52ca6923b123","observation_id":"10e15044-adc5-483f-8311-5ee81c7ab7ea","resolution":{"observed_at":"2026-07-10T13:47:05.945105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.971625Z","title":"Online learning for adversaries with memory: price of past mistakes","venue":null,"work_id":"4632406b-d214-4b44-bcc9-bb3e74e703ed","year":2015},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:d67c4b65603bbedf3e7bed80e4c2efc15117ac00464fc5123fd9e12d8cc4d5a1","observation_id":"c9442b74-c938-4bd3-a317-376aed0f2d4f","resolution":{"observed_at":"2026-07-10T13:47:05.972979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.965853Z","title":"The allocation of decision authority to human and artificial intelligence","venue":null,"work_id":"0960108b-f827-4fbe-8bf6-86c6a556dd9e","year":2014},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:4bbfcb252101c249eedfad1c798f9fcc16196d166a74485ce00a92c82cc0802c","observation_id":"e5b3c055-33ae-4141-91ba-5b17ef455173","resolution":{"observed_at":"2026-07-10T13:47:05.967396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.918331Z","title":"Does the whole exceed its parts? the effect of ai explanations on complementary team performance","venue":null,"work_id":"d36c2211-2cd4-4eb1-90f8-2eabc51bfd3f","year":2021},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:e8f915ddb2be72d727470085978e3a3a0a0af1625a1b671150c441de90596027","observation_id":"865282b5-1446-4030-943f-0a29b1490356","resolution":{"observed_at":"2026-07-10T13:47:05.919963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.911001Z","title":"Is learning in games good for the learners? Advances in Neural Information Processing Systems, 36, 2024","venue":null,"work_id":"fc321b57-f5bc-4bc6-83ba-7db9e1505162","year":2024},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:f22546bfd691e2341a38e6cacc5f7be82f0b364caf0022c78650527e0c49cf0a","observation_id":"c7eba8c3-5824-4195-8fa4-0e3f960b4793","resolution":{"observed_at":"2026-07-10T13:47:05.912396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.941868Z","title":"Mirror descent meets fixed share (and feels no regret)","venue":null,"work_id":"03b472a5-1486-41b8-a943-9010b2ca81bd","year":2012},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:506c1f39b94f3a409ba8dd7b1f4de49f2431b43df85214fd025ddad1861be404","observation_id":"e3573cb1-5c05-4a81-bf38-abc99cfd00b5","resolution":{"observed_at":"2026-07-10T13:47:05.943276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.920489Z","title":"Emergent communication at scale","venue":null,"work_id":"cff5b084-6447-4312-8dd1-07714de29602","year":2022},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:5f4681bc271264085669b81c3d85aa0a3a5c8918829ca5f4c4bf487bbc3cf31c","observation_id":"9d67f9cc-edb3-46c8-943a-6a08622e5022","resolution":{"observed_at":"2026-07-10T13:47:05.921638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.914697Z","title":"Dependent randomized rounding via exchange properties of combinatorial structures","venue":null,"work_id":"bb0409c0-56b9-477b-b037-f384a5848392","year":2010},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:d67755cf1ad071b23631a79c3c156d084f25e42445421d8bf0d0ba2d2d49f448","observation_id":"5a483dd5-3abc-4e0e-8844-499bde85652d","resolution":{"observed_at":"2026-07-10T13:47:05.916002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.948699Z","title":"On the np-completeness of finding an optimal strategy in games with common payoffs","venue":null,"work_id":"adc39cfa-a79f-4b94-bd1f-ff87243d5278","year":2001},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:960a75ce6cb5f2cdb6e48de0b44f92015913e275253121be78ecd7fb7d9930f7","observation_id":"d9ab3098-1349-4975-a61e-aec5c8ab5b73","resolution":{"observed_at":"2026-07-10T13:47:05.949837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.950045Z","title":"Collaborative prediction: Tractable information aggregation via agreement","venue":null,"work_id":"a942d5bf-b910-4b2b-aaad-75c5b89ee672","year":2026},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:1d67899b02a0e2cc34e9ffdf5b0af63e9d7d44ec17c4f422e154c65547c51f34","observation_id":"d8aa3727-bcf9-485b-bd4c-d53e80cec3a2","resolution":{"observed_at":"2026-07-10T13:47:05.951719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.939156Z","title":"Computing the optimal strategy to commit to","venue":null,"work_id":"e728bb9c-31e1-43c6-94a0-2204312c8f43","year":2006},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:7c753a9be926b4e7c8314f9ceaf41dbb187b060c9055dfdb656a7955b0ae53df","observation_id":"860d8b59-595d-450a-bfba-4416748caf9c","resolution":{"observed_at":"2026-07-10T13:47:05.941024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.948008Z","title":"Strongly adaptive online learning","venue":null,"work_id":"ff009b5f-585b-472b-a926-703fad5d3d30","year":2015},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:d52a904b25e99eca526ec825de78466236624c805ff6f078270ef18822aa3df6","observation_id":"0f8fd976-3091-47ec-82d6-94b2dfb9d8fc","resolution":{"observed_at":"2026-07-10T13:47:05.949442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.961155Z","title":"Human-algorithm collaboration: Achieving complementarity and avoiding unfairness","venue":null,"work_id":"043d5d8b-3c05-4bd0-b7c5-e42b148f94c9","year":2022},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:1754678c26f5d68287ccff07e4c37c2ee5650d64e90d95518f4e175e56184f69","observation_id":"32d0adf9-af4d-415f-b910-54b4e8eb75c4","resolution":{"observed_at":"2026-07-10T13:47:05.962812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.973764Z","title":"A threshold of ln n for approximating set cover","venue":null,"work_id":"2be0a821-b65c-45cc-8ae7-ec6c7f8bee21","year":1998},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:9d60884402bae113255577edba7ee532d21f1f1a51e67f1c9ddb2d92caa10613","observation_id":"93d615d2-0583-4b74-b234-3c1db4196fc2","resolution":{"observed_at":"2026-07-10T13:47:05.975018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.952310Z","title":"A decision-theoretic model of assistance","venue":null,"work_id":"cd07ae95-045b-4d94-a27c-17cac289c39e","year":2014},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:929658de31054bbd4bf27af07b552ada845d337b2de05424fdb634f736abd563","observation_id":"9ed5cea4-32b1-43d4-a32e-3bb98e87b57a","resolution":{"observed_at":"2026-07-10T13:47:05.953811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.02672","last_updated":"2016-02-08T18:01:35Z","snapshot_observed_at":"2026-08-18T20:20:16.436306Z","submitted_at":"2016-02-08T18:01:35Z","title":"Learning to Communicate to Solve Riddles with Deep Distributed Recurrent Q-Networks","version":1},"cited_work":{"arxiv_id":"1602.02672","doi":null,"metadata_source":"pith","pith_arxiv_id":"1602.02672","snapshot_observed_at":"2026-07-10T13:47:05.746965Z","title":"Learning to Communicate to Solve Riddles with Deep Distributed Recurrent Q-Networks","venue":"cs.AI","work_id":"ef42de73-f5e3-4349-9eb9-10c40f41ffaf","year":2016},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"cited_paper":"/paper/1602.02672","citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:5b0b3033fa9e24005b2bc1052ec561e25d5d5b5a2477f3f9ac4592371bd6e36a","observation_id":"5bf1adff-5cc1-4763-9807-51157cea4c68","resolution":{"observed_at":"2026-07-10T13:47:05.748441Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.918717Z","title":"Interpretation of optimal signals","venue":null,"work_id":"bc9aa661-dd38-4983-90d1-d838a6c94410","year":2009},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:6c23c9169dcc9b90127cd43a6b65bcebde895cb02bd7df373793ffb0623ad622","observation_id":"308c8182-b1d1-4c18-9aa1-7dcf6842f4e5","resolution":{"observed_at":"2026-07-10T13:47:05.920141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.908425Z","title":"Signal to act: Game theory in pragmatics","venue":null,"work_id":"67b3ea06-d438-43d6-ac1d-3388f5038940","year":2009},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:8d17b51ee22014159602ec845abb981426e68281d86a0e9557cea777453b367b","observation_id":"8f29d5c4-98d1-45ff-9501-b1e8551fd92b","resolution":{"observed_at":"2026-07-10T13:47:05.910041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.935689Z","title":"Nash and correlated equilibria: Some complexity considerations","venue":null,"work_id":"59fd7a0e-88be-48ad-be80-97bb4f769ce8","year":1989},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:f4a8404d77394669da2faaf5b01c5f66149ca6d920d63a52adf001dcf45722f2","observation_id":"282c5dee-bb4e-4c07-b83c-4de7e27760f1","resolution":{"observed_at":"2026-07-10T13:47:05.936991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.939834Z","title":"The principles and limits of algorithm-in-the-loop decision making","venue":null,"work_id":"ec9dd639-0c0e-42e5-8db5-a5551c7aa703","year":2019},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:49353d492e89f3e19af5fb54c930a0ee85f81c5008ab23345b4b2f1c833c6ac3","observation_id":"7e42042b-84e8-4f05-bfaf-05ddb1969559","resolution":{"observed_at":"2026-07-10T13:47:05.941364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.920682Z","title":"Designing algorithmic delegates: The role of indistinguishability in human-ai handoff","venue":null,"work_id":"56880725-7ebd-4e37-81ee-589d90f22d9e","year":2025},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:4161857e001af646a30a188c9af21b1e4a57e7fd7a94aad4e40f493f47031cf9","observation_id":"6baaf041-e370-4bed-a78b-97ee8d484eff","resolution":{"observed_at":"2026-07-10T13:47:05.921940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.957250Z","title":"Cooperative inverse reinforcement learning","venue":null,"work_id":"177e12ec-0b1c-45bc-9159-46d671becf73","year":2016},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:e5f5081ef07adb43e17e6aa82956e671755e87b4b8586621419033cd84e1694a","observation_id":"676bf65e-adb6-470e-895b-9921e1a265de","resolution":{"observed_at":"2026-07-10T13:47:05.958762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.963443Z","title":"The off-switch game","venue":null,"work_id":"ac3334cf-5142-4910-a5ee-ab002ac69f20","year":2017},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:29e3bb647f81c37313b071bcc9d2ba0490e742c1de1c53aacee5cb83097ae15d","observation_id":"76b66119-62cf-4cb0-bbdb-5b01a6bc7a23","resolution":{"observed_at":"2026-07-10T13:47:05.965090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.954153Z","title":"Emergence of language with multi-agent games: Learning to communicate with sequences of symbols","venue":null,"work_id":"c0e6e484-8dfb-44e0-b513-b3eddab49348","year":2017},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:5dfc51b0545b4874078b8d46bb55c875b706dfd4f58babd4ebbf7f95de0a8a8e","observation_id":"8f2e8279-f852-4b7d-95b7-10514d372c74","resolution":{"observed_at":"2026-07-10T13:47:05.955381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.872724Z","title":"Adaptive algorithms for online decision problems","venue":null,"work_id":"e6ab2dee-816f-4690-aa0b-8114ce938bcc","year":2007},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:6aa6f9e2aa17b8071be720503e4facc64560b7d97be0faaabe78782961845511","observation_id":"47e77be0-eb46-4282-a6e8-bfa073eafc4f","resolution":{"observed_at":"2026-07-10T13:47:05.873950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.947229Z","title":"Tracking the best expert","venue":null,"work_id":"916dfce9-ae38-4bef-a859-db84045c400b","year":1998},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:bb77385a6fd5a6e3900d2ec1e3ed329ce830d74cadb90dd77bd43374f8e828c9","observation_id":"a5114093-e081-436a-9430-2f1ac22e0c84","resolution":{"observed_at":"2026-07-10T13:47:05.948231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.943553Z","title":"Team decision theory and information structures in optimal control problems--part i","venue":null,"work_id":"2fc32ae7-56a4-4cc9-b2d1-ca6474556423","year":1972},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:0814972bf283920518ee421465b7977f0b88e4daba4179995f5441caaf661acb","observation_id":"dee198a2-f341-41ad-a8c2-b34e7b392b56","resolution":{"observed_at":"2026-07-10T13:47:05.945258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.09712","last_updated":"2023-11-16T09:42:36Z","snapshot_observed_at":"2026-08-16T14:42:46.033508Z","submitted_at":"2023-11-16T09:42:36Z","title":"Regularized Conventions: Equilibrium Computation as a Model of Pragmatic Reasoning","version":1},"cited_work":{"arxiv_id":"2311.09712","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.09712","snapshot_observed_at":"2026-07-10T13:47:05.758751Z","title":"Regularized Conventions: Equilibrium Computation as a Model of Pragmatic Reasoning","venue":"cs.CL","work_id":"1f44346f-b3b5-445e-b4cf-f6ecd87c30c0","year":2023},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"cited_paper":"/paper/2311.09712","citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:0269a056cdb0f73f8d1e306753c4e6f54d1b620839c370911cf4cdd46a5a5c2b","observation_id":"676438a4-bfaf-410e-8d6c-c8fdb16b33aa","resolution":{"observed_at":"2026-07-10T13:47:05.760078Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.927326Z","title":"Game dynamics connects semantics and pragmatics","venue":null,"work_id":"e9f5b03d-0d5d-4052-93ee-f6464aafea97","year":2007},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:6f9c04b8f28c62c1a9ee8d294aec00407ecbc310c914622c001281c57270b23c","observation_id":"a614084e-3d01-408c-8708-2ab4997f434b","resolution":{"observed_at":"2026-07-10T13:47:05.928735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.945886Z","title":"Game theory in semantics and pragmatics","venue":null,"work_id":"90c058d7-2cb0-4d24-9bda-be191eea0f0f","year":2012},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:d9e87e8270e1398e8aa120ea688942d2ec8b5203f64972e4fcfa150e37490871","observation_id":"b4415652-6186-4394-8402-973e1c4b4c17","resolution":{"observed_at":"2026-07-10T13:47:05.947403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.916391Z","title":"Online submodular welfare maximization: Greedy is optimal","venue":null,"work_id":"32021494-62d4-4718-b2a7-6d61380275e7","year":2013},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:ace8a30958ae411a9673010cdec4c6d453c323cfe897e0c8202af14589d76670","observation_id":"4f071f21-d9c1-48e7-85a1-9659846c78c5","resolution":{"observed_at":"2026-07-10T13:47:05.918163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.968095Z","title":"Emergent communication under varying sizes and connectivities","venue":null,"work_id":"21bc9377-d29e-4d57-8591-e8a3200d5c46","year":2021},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:9536f2b36c0f8852b347518bd14ccaa35334428986c1610e1dcf52bdf6059bca","observation_id":"95e0472c-2ee3-4045-9f89-f6d6784763e3","resolution":{"observed_at":"2026-07-10T13:47:05.969514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.888720Z","title":"Natural language from artificial life","venue":null,"work_id":"764b3a56-1041-4a15-a170-8e7ecd1982ad","year":2002},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:2accca87b40f0b09c160ffc591a463b75c5735c50eb8269b9108af4016d15971","observation_id":"4c2546cb-c9c9-4350-b4e2-5af766c2a88b","resolution":{"observed_at":"2026-07-10T13:47:05.890018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.930292Z","title":"Iterated learning and the evolution of language","venue":null,"work_id":"727071bb-8ba8-4118-8e27-f08393bea3de","year":2014},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:c7cd7ce196ab3cb916b6a8b885ac1e5a42aaa304b3eca6fc7e0c8a9a920a5160","observation_id":"03a877a7-6d71-47b1-bbba-04dd0bacd061","resolution":{"observed_at":"2026-07-10T13:47:05.931601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.959291Z","title":"Assistancezero: Scalably solving assistance games","venue":null,"work_id":"55a31e1e-a0a0-4422-8fba-d06127f40353","year":2025},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:890e65583e1c84b176be6490032f4da3396fdd80ea3a64a86652f5e337b00344","observation_id":"63fe05d7-971c-4a90-84f2-4cebe6dc99b6","resolution":{"observed_at":"2026-07-10T13:47:05.960645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.02419","last_updated":"2020-07-14T09:21:53Z","snapshot_observed_at":"2026-08-14T18:48:00.749362Z","submitted_at":"2020-06-03T17:50:16Z","title":"Emergent Multi-Agent Communication in the Deep Learning Era","version":2},"cited_work":{"arxiv_id":"2006.02419","doi":"10.48550/arxiv.2006.02419","metadata_source":"pith","pith_arxiv_id":"2006.02419","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Angeliki Lazaridou, Alexander Peysakhovich, and Marco Baroni","venue":"cs.CL","work_id":"aedb7cbd-72e2-4ee9-a55a-2592d11b83d5","year":2020},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"cited_paper":"/paper/2006.02419","citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:8c6f4d2efd9c06a4e0da49eda6aee0f81d512c704674716ab2aef6266e8d4b4a","observation_id":"eeed42ea-9491-41e7-bd7c-528e71fe7a3d","resolution":{"observed_at":"2026-07-10T13:47:05.758235Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1612.07182","last_updated":"2017-03-05T21:40:51Z","snapshot_observed_at":"2026-08-14T21:24:17.940465Z","submitted_at":"2016-12-21T15:27:06Z","title":"Multi-Agent Cooperation and the Emergence of (Natural) Language","version":2},"cited_work":{"arxiv_id":"1612.07182","doi":null,"metadata_source":"pith","pith_arxiv_id":"1612.07182","snapshot_observed_at":"2026-07-10T13:47:05.759420Z","title":"Multi-Agent Cooperation and the Emergence of (Natural) Language","venue":"cs.CL","work_id":"1ef456b6-6d48-4211-8ebe-39b490ea2c23","year":2016},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"cited_paper":"/paper/1612.07182","citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:657a506d1507af4b71586487d1bd5c952f2b7b68d9ef381a8f05e81589908d35","observation_id":"e49d094d-3a26-4bab-af74-441d52f5537d","resolution":{"observed_at":"2026-07-10T13:47:05.760816Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.954437Z","title":"Learning and approximating the optimal strategy to commit to","venue":null,"work_id":"0019c3a4-1772-4e51-84fe-e63a5aa30c0e","year":2009},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:108b2fed947ec39a55bafc71269568493b8849bf1786bf36171a3223302e6b3a","observation_id":"1b46fa3a-c47c-4048-80bd-d3ef919f605f","resolution":{"observed_at":"2026-07-10T13:47:05.956196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.900038Z","title":"Ease-of-teaching and language structure from emergent communication","venue":null,"work_id":"28f06f29-95d9-48a5-92ab-2dee9602243f","year":2019},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:f86c2d97c5d64c688e25c1f19b70b164d6d27be28ccd194556f365620dbc0478","observation_id":"a98108da-74fd-43f8-954c-90aa50674464","resolution":{"observed_at":"2026-07-10T13:47:05.901456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.865337Z","title":"The geometry of logconcave functions and sampling algorithms","venue":null,"work_id":"6c94959a-dfc5-4295-a790-5677618f22cd","year":2007},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:ce43fbffe0579705c6e73180f02bbc5186872ec96a2b5903a97c73b2418b9fc8","observation_id":"54c138e6-84ad-412d-afce-637aa1cc1d26","resolution":{"observed_at":"2026-07-10T13:47:05.866640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.945678Z","title":"Decentralized stochastic control","venue":null,"work_id":"9861eab3-2fa2-42bd-9f8e-33021fe6e83b","year":2016},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:18081b68f35b024ad29544a393d27a92ad231ab4200927768e7441e72c40d904","observation_id":"267b4bde-0474-41db-8f07-ee673a267b12","resolution":{"observed_at":"2026-07-10T13:47:05.946719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.894841Z","title":"An efficient, generalized bellman update for cooperative inverse reinforcement learning","venue":null,"work_id":"02f23160-d236-4ff4-904f-4764454a5bb3","year":2018},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:6a1c6071ae9e48ba238bea4d92d1df831e916eb48bfdd05b32c48838ec3cb4a7","observation_id":"12a314d0-525d-4818-971a-7cedcc6b87bf","resolution":{"observed_at":"2026-07-10T13:47:05.896770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.887066Z","title":"On team decision problems with nonclassical information structures","venue":null,"work_id":"264e1851-3956-4f24-840a-3387c73bd886","year":2022},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:b419781c102a2f8e613461c8226884d344abbd700ca00304aa77222deda95de0","observation_id":"3acaf064-315f-4046-9626-eac18b84e49a","resolution":{"observed_at":"2026-07-10T13:47:05.888262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.888953Z","title":"Decentralized stochastic control with partial history sharing: A common information approach","venue":null,"work_id":"0e158634-106a-40c1-b9a5-22e17e3bd4ee","year":2013},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:4a31a6a7d1c5fbaf41d8563ef5e854d5c31af288ebeb649346b3e7abab76bb12","observation_id":"3bc154b7-f88d-4e30-ae10-bb4020610fae","resolution":{"observed_at":"2026-07-10T13:47:05.890167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.935689Z","title":"Learning optimal strategies to commit to","venue":null,"work_id":"e33ee577-d8e9-4b64-8d53-b15c849b7af3","year":2019},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:1daf8e17e3eb7b80feec10e43b07aa93363a493b352f462b116313ed101ba579","observation_id":"af7ee05b-0f85-42ba-b70d-82dc52d3a22d","resolution":{"observed_at":"2026-07-10T13:47:05.937170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.912903Z","title":"Team decision problems","venue":null,"work_id":"d4a50fc6-f6f9-44bf-82f6-edcc1fd03f0b","year":1962},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:bb7270214181be8f68aea50bf376240bf4c4428107e1e7d7e2ac292e6dfe4b3e","observation_id":"7069e25b-2041-407d-b701-7afee210a515","resolution":{"observed_at":"2026-07-10T13:47:05.914067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.924418Z","title":"Enhance the compositionality of emergent language by iterated learning","venue":null,"work_id":"b4cb3055-d1b3-45e7-97cd-bf536e0cb380","year":2019},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:dea9d3bca846f5ae89def252f0c940bf0a45fd31b92beb0c159c1a07c69a8275","observation_id":"9be6ac91-83e7-4e64-8acd-97a7266c81ba","resolution":{"observed_at":"2026-07-10T13:47:05.925855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.01878","last_updated":"2020-10-05T09:25:53Z","snapshot_observed_at":"2026-08-16T19:15:53.112841Z","submitted_at":"2020-10-05T09:25:53Z","title":"\"LazImpa\": Lazy and Impatient neural agents learn to communicate efficiently","version":1},"cited_work":{"arxiv_id":"2010.01878","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.01878","snapshot_observed_at":"2026-07-10T13:47:05.755894Z","title":"\"LazImpa\": Lazy and Impatient neural agents learn to communicate efficiently","venue":"cs.CL","work_id":"4c24f96f-6c38-4116-b59e-a0d6c4aa9151","year":2020},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"cited_paper":"/paper/2010.01878","citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:81b1442abe5e53225ceb3bec0f8772f28983ea465388250cd2284ab434508b32","observation_id":"2cd6b146-894b-4690-8cff-0593b4eb34fc","resolution":{"observed_at":"2026-07-10T13:47:05.757416Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.922130Z","title":"Online submodular maximization via online convex optimization","venue":null,"work_id":"74448289-f850-4a33-a513-d5ff5ad31bb8","year":2024},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:a52c65219076aeaea4ce0259adb054287d054edb803723050ead4b5d7af71dd2","observation_id":"2777f177-e6a3-4428-858e-bf6239ac515d","resolution":{"observed_at":"2026-07-10T13:47:05.924128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.906844Z","title":"Benefits of assistance over reward learning, 2020","venue":null,"work_id":"abf416a1-58bc-421b-aaf0-0e0badb3080c","year":2020},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:87ba5b362462d6f67ae04235396f71d2c4419bc17148538ce9068029abd5e965","observation_id":"b2c7ea86-43b5-4c73-a428-585a25a25268","resolution":{"observed_at":"2026-07-10T13:47:05.908577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.933952Z","title":"Online learning and online convex optimization","venue":null,"work_id":"248af2c2-fc88-482e-a78d-46ad2df9664e","year":2012},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:2e4a18a5d7678a234cf84ce5eef970087be010f5e41d0f5c85e342bd341cc5cc","observation_id":"7c36ff80-d220-462a-8122-cfb2050fe256","resolution":{"observed_at":"2026-07-10T13:47:05.935149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.897573Z","title":"Lazy oco: Online convex optimization on a switching budget","venue":null,"work_id":"26fb494e-1757-45e7-812f-c59d9651fc0c","year":2021},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:6c9532b09c5bd77360e0361d8bff64b34d0f41d531fb9f8ecc0e02e5a425d551","observation_id":"6599fcea-469f-4e19-a13c-4ce0fa6fb1e5","resolution":{"observed_at":"2026-07-10T13:47:05.899435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.937524Z","title":"Bayesian modeling of human--ai complementarity","venue":null,"work_id":"eb06a407-e03a-4f31-ad6c-43a7d9caabf9","year":2022},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:4e17d081e503647e378b97b375954fd87951adfe62c16b619753ea5ccba0fd57","observation_id":"d0307b8b-1f4e-48a6-b5b9-01fc6804edca","resolution":{"observed_at":"2026-07-10T13:47:05.938812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.975539Z","title":"Nash equilibria for an evolutionary language game","venue":null,"work_id":"46c33588-df30-41ad-8d54-2cd8d7449183","year":2000},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:3a86f588824200927559aa615605873cf19490e24d09143cc30bcfe20bb62c21","observation_id":"8cf58629-1e69-4522-b742-a48d4e569a35","resolution":{"observed_at":"2026-07-10T13:47:05.976875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00582","last_updated":"2020-05-01T20:00:23Z","snapshot_observed_at":"2026-08-04T17:32:30.176261Z","submitted_at":"2020-05-01T20:00:23Z","title":"Learning to Complement Humans","version":1},"cited_work":{"arxiv_id":"2005.00582","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.00582","snapshot_observed_at":"2026-07-10T13:47:05.753156Z","title":"Learning to complement humans","venue":"cs.AI","work_id":"cff9c25f-585e-4e0d-98c9-073d7ae4aafc","year":2020},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"cited_paper":"/paper/2005.00582","citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:b03354874a0c31631c2573c2d57337cb475e7c065154d39a71b274281bc3c6da","observation_id":"fd09f9c0-6241-469a-bd9e-63219cce8e7b","resolution":{"observed_at":"2026-07-10T13:47:05.754960Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-10T13:47:05.932439Z","title":"Who leads and who follows in strategic classification? Advances in Neural Information Processing Systems, 34: 0 15257--15269, 2021","venue":null,"work_id":"8dc1ee36-1b8e-4d1e-b8bb-87f4c2e481d3","year":2021},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:40e495cb77fbb30b6ea705dc9eb21316726c7655f0e2aac0a4d70bab928ebc5a","observation_id":"6768246d-b293-4de1-a3f7-1c3cfd14ff97","resolution":{"observed_at":"2026-07-10T13:47:05.934595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T03:24:18.712798Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":5,"verified_fuzzy":52},"total_outbound_references":58},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2607.08012."}