{"as_of":"2026-08-08T11:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8a81431fe31b4287b108dcd889f4ef066bbc349509c4c2c86ffbae9cda180689","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T20:12:35.056000Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.04308/citation-record","integrity":"/paper/2607.04308/integrity","json":"/paper/2607.04308/citation-record.json","paper":"/paper/2607.04308"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Bayesian persuasio n","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:3f6d20248629df4e3e212e29afc74ead507b6994e88d01e8d6390829c2498fd8","observation_id":"a9f21224-3401-4c99-a167-47d09f918953","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"URL https://www.aeaweb.org/articles?id=10.1257/aer.101.6.2590","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:833d01cd4c30a1f8f4fe0ff5b785a774eff18a7006ca1c9b8e614387acdf13ed","observation_id":"5f93353c-ddbe-4fe1-9d91-865b5779a124","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Information design: A unified perspective","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:7e10ba2a59798523a14874e72a8001143b5c14a2e3e720da2a63dc09fc6eeb27","observation_id":"3617a86f-7ba5-43a8-b560-2ea17e007f3b","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Bayes correlated equ ilibrium and the comparison of informa- tion structures in games","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:6323f03df6923c3174d8dda00e87a0786d4262f3829575517d6d4652852bb191","observation_id":"994db0d6-06db-46b8-96dd-057e655e90a4","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","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":"10.3982/ecta11105","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Robust predictions i n games with incomplete information","venue":"Econometrica","work_id":"3ca2adcf-3dc2-4476-b021-1730610add44","year":2013},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:5b7773a1166de2e933e82f4c77762b2ba3b5ec9d4a74786b98ae4b5e5246c090","observation_id":"cf490503-90f1-442d-80f0-87cb96228ede","resolution":{"observed_at":"2026-07-11T20:18:14.361681Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-07-12T10:49:21.258468+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T10:49:21.258468+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.10678","last_updated":"2022-02-22T05:41:43Z","snapshot_observed_at":"2026-07-06T12:40:16.583058Z","submitted_at":"2022-02-22T05:41:43Z","title":"Sequential Information Design: Markov Persuasion Process and Its Efficient Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.10678","snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Jordan, and Haifeng Xu","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"cited_paper":"/paper/2202.10678","citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:48dec8d4bb7fb8b77f82d1cc64c3a49abfb11dc54b0f09a1a3984b307c6dee83","observation_id":"1183e113-ab3b-482c-99af-f44527dea2c0","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Markov persuasion processes: Learning to persuade f rom scratch","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:f394108597dee35b34f9a05e0acd34a5aec891ba88cd6c7bfef9aec10493f900","observation_id":"b76b6a17-9a04-44e0-ac1d-d17459138717","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Markov per suasion processes with endogenous agent be- liefs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:a688ab62c5d22da935cd81a2cddac9a2d252505f648c8eb5311f39e9dffcb067","observation_id":"ab8fb1a3-f738-43f8-8d24-c5b5aebd0436","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Toward a theory of discounted repeated games with imperfect monito ring","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:77946c589af127d5ef1695a4dfa7066c1b900a04a34a662691667bb08ff1317c","observation_id":"1e9ee8b5-7691-4ef8-877e-035e0d73e6d6","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"A continuous- time version of the princi pal: Agent problem","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:bd187e59a79bb173e9c2a9c7c1d4ec89b4df8f47b4cc24d8c2d5d9115f17ac42","observation_id":"e2508f0a-b374-4976-916a-08c1f6e55482","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Information desig n in multistage games","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:8c2b68bf83fa7813f750897d3f907fd856261e42a418fe511b0101fda0851339","observation_id":"83a54da7-a389-42f3-ad74-6e370127e386","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","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":"10.3982/te4769","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URL https://onlinelibrary.wiley.com/doi/abs/10.3982/TE4769","venue":"Theoretical Economics","work_id":"b721f460-2883-41c4-89d4-a1dc0bb62ffa","year":null},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:46b93d51772fa87b267f793ba2aae943ac812c86df46dddcaf3208cfc92b2541","observation_id":"195a3342-3fa4-407c-adc2-f76eb83842b5","resolution":{"observed_at":"2026-07-11T20:18:14.408901Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-07-12T10:49:21.507293+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T10:49:21.507293+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:81f50069b4cad34a43d932f36ff8520886ac9dff23557fcf6e99d324a33c77f8","observation_id":"918e58ea-ef1c-4c75-a6b3-6e7cdfd4c7b7","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","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":"10.1086/705332","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On inf ormation design in games","venue":"Journal of Political Economy","work_id":"8e81967e-c1ec-49a7-82ce-0026480f2cc7","year":2020},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:b17dbbc3887b1b02487f0c2d8d0ea705d7e708619cfcef9856f5ebdcafa68b56","observation_id":"f5fcfbec-033d-4629-9d02-b8cd18d0fe6b","resolution":{"observed_at":"2026-07-11T20:18:14.366167Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-07-12T10:49:21.766997+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T10:49:21.766997+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:ee529847668638c4c06f0c8e6732467c3f6ce4f0016279ec3257eb4f006db6f9","observation_id":"f8ed6c59-60ac-4099-86db-ae7724b820c5","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","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":"10.1016/j.geb.2017.04.010","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Op timal dynamic information provision","venue":"Games and Economic Behavior","work_id":"2b1cf5ab-aa83-468c-9054-6f74595ddf65","year":2017},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:e081663c39388e0f6612613194bddd2263837406cc52ef2ad38ec18758f006a5","observation_id":"134e7ccf-d17b-4e40-aaed-702cc37ae944","resolution":{"observed_at":"2026-07-11T20:18:14.356910Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-07-12T10:49:22.250023+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T10:49:22.250023+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1086/704387","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Ely and Martin Szydlowski","venue":"Journal of Political Economy","work_id":"d68a2b4d-0483-48ff-bf83-4c3123176827","year":2020},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:73bd9c60253cd99646b1abc058ccda024cb19b81d49bf5ebc459fc17ae0ec97f","observation_id":"9381d82a-6abd-4bf9-8cf9-5bb74d564224","resolution":{"observed_at":"2026-07-11T20:18:14.397058Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-07-12T10:49:22.511927+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T10:49:22.511927+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3982/ecta17260","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Econometrica","work_id":"3e45121d-456b-46f1-92e6-070b01e6cff5","year":2020},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:da5ba0c145fdd2437ac150cecbb6fe4e0bbfab6967d1c7ff486b520c21dd3fe6","observation_id":"9710cb69-c423-49d6-b041-a4d8944ad6d1","resolution":{"observed_at":"2026-07-11T20:18:14.379619Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-07-12T10:49:22.762493+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T10:49:22.762493+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/229748","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:18:14.382545Z","title":"Spear and Sanjay Srivastava","venue":null,"work_id":"4fa3b765-b451-4399-a8f4-de71c679c70c","year":1987},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:66623d893d2ba167d1c7e0242a60a4896fcc910d034b0d2782aea960895a4186","observation_id":"e3752cb3-f169-4089-86a8-c56c32afbeaa","resolution":{"observed_at":"2026-07-11T20:18:14.383855Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-07-12T10:49:23.027448+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T10:49:23.027448+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3982/ect","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:18:14.373831Z","title":"Dynami c mechanism design: A myersonian ap- proach","venue":null,"work_id":"74b79fbf-cd1e-432f-bdb7-c9af94a5d3fd","year":2014},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:2f2f093cf4348bc4a143194a7c39065f18ac9c3dad506c8a137062d2b9146f6c","observation_id":"8e467644-8260-4463-b2cb-dd4350f29088","resolution":{"observed_at":"2026-07-11T20:18:14.375422Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Th e value of the information in the moral hazard setting","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:80e6d532f026ddec37782bd6684bb977a9b62b79b83d129fc26a6de79fb61945","observation_id":"38accd24-996b-4120-9f3e-aebe302e88f3","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Improved algorithms for linear stochas- tic bandits","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:50252ffeec36cb9d6608e285deb23c987c9182be05720bcb163a42d5f04ec7d8","observation_id":"58cdadfb-ba71-4de7-95db-3d2e639221f7","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Jor dan, and Benjamin Recht","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:25c782d1f6aafdd4b03ff9743a6c3695351fb41f4074d2ce637834099bc4b0b9","observation_id":"25cd6feb-1dd5-4c6a-b4f0-d12822a6fe23","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"On the sample complexity of the linear quadr atic regulator","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:788f3c0cd5a2e4e08cf295f861af3cd4dac6964f889f0dabfa4947b5712bf3dd","observation_id":"2c5c3a2e-d4ae-4c44-b652-6ddf2e9e79e2","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Fudenberg and D.K","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:7f5d396823a42339c8b0352be9720fb057e6ba35b44304f7344f12c32be63645","observation_id":"d01ba09c-8c51-4e49-9d9e-47f7f1e11bac","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Distributionally robust joint informat ion and mechanism design for multi-area power system coordi nation,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:c6a5ac226b6d0501eb8e9a4ad3e8ed18b35a13ae3fd170d339e8d124e7cf301f","observation_id":"8a955198-36cc-48ca-b2d1-4bd26c3a11e8","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.24015","last_updated":"2026-08-05T15:34:47Z","snapshot_observed_at":"2026-08-08T11:12:08.368537Z","submitted_at":"2026-06-22T23:38:51Z","title":"Continuous-Time Information-Mechanism Control","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.24015","snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"cited_paper":"/paper/2606.24015","citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:bb5beb41fb024e4f535843fe3d6a6b91a5a798641bbf367918afb85f3542038d","observation_id":"b3123923-477b-4fb8-914b-e94c657a7457","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.30320","last_updated":"2026-06-29T14:02:38Z","snapshot_observed_at":"2026-08-06T17:12:54.086565Z","submitted_at":"2026-06-29T14:02:38Z","title":"Continuous-Time Information Design for Hurricane Evacuation: Disclosure, Congestion, and Optimal Phasing under Model Uncertainty","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.30320","snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Continuous-time information design for hurricane evacuation: Disclosure, congestion, and optima l phasing under model uncertainty, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"cited_paper":"/paper/2606.30320","citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:ddf762f16dd702fcf6b23b8c710b7f16876fd43f68ba81ddc91ec5894e87bb10","observation_id":"de0f98ec-c242-4331-9437-5efa8eaf7a71","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:12:35.056000Z","title":"Continuous-time persuasion by filter- ing","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:d6f99115af8b6fd5ffc5f877054e48adea6cb3cd3f07c5102f10ac3ba373cc0c","observation_id":"b6f6defc-ac06-4ce3-b8c2-c88037f44fdd","resolution":{"observed_at":"2026-07-11T20:12:35.056000Z","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":"10.1111/1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T20:18:14.347028Z","title":"Judd, Sevin Yeltekin, and James Conklin","venue":null,"work_id":"63248d7c-98a3-4f9b-8736-0d17ee8eac12","year":2003},"citing_paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-11T20:12:35.056000Z"},"links":{"citing_paper":"/paper/2607.04308"},"observation_digest":"sha256:bc7c0c0865dcf2abb4541db22e732a505524d798e7eff2891654e26ce92f436e","observation_id":"b38545c3-506e-48e9-a10a-bcdb0c873c06","resolution":{"observed_at":"2026-07-11T20:18:14.348914Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.04308","last_updated":"2026-07-05T13:46:06Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-08T10:30:00.871351Z","submitted_at":"2026-07-05T13:46:06Z","title":"Markov Information Processes"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":7,"verified_fuzzy":0},"total_outbound_references":30},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2607.04308."}