{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MONQA5BEI4CVWEE4AWACZCHODB","short_pith_number":"pith:MONQA5BE","schema_version":"1.0","canonical_sha256":"639b00742447055b109c05802c88ee186e6623415f0c12738598ea4a303a165a","source":{"kind":"arxiv","id":"2309.07877","version":3},"attestation_state":"computed","paper":{"title":"Mean-field games of speedy information access with observation costs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christoph Reisinger, Dirk Becherer, Jonathan Tam","submitted_at":"2023-09-14T17:24:01Z","abstract_excerpt":"We investigate mean-field games (MFG) in which agents can actively control their speed of access to information. Specifically, the agents can dynamically decide to obtain observations with reduced delay by accepting higher observation costs. Agents seek to exploit their active information acquisition by making further decisions to influence their state dynamics so as to maximise rewards. In a mean-field equilibrium, each generic agent solves individually a partially observed Markov decision problem in which the way partial observations are obtained is itself subject to dynamic control actions,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2309.07877","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-09-14T17:24:01Z","cross_cats_sorted":[],"title_canon_sha256":"6d24a1675810ba367cf2bce74c1adb886565c5e24c7ece4f88d541380c4f53b9","abstract_canon_sha256":"a43adad43e5776b9f758946e35be42a7b5897bb7eba753155c1814aa73007673"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:05.795784Z","signature_b64":"sMWkPY+SZNbo3u54FkEbtH8x2SdB7GaJBdzkiGk3GRMtyYDi7Csz5vRLacIeg7aYmydNYKE1AOPV77QvShOLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"639b00742447055b109c05802c88ee186e6623415f0c12738598ea4a303a165a","last_reissued_at":"2026-07-05T11:13:05.795328Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:05.795328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mean-field games of speedy information access with observation costs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christoph Reisinger, Dirk Becherer, Jonathan Tam","submitted_at":"2023-09-14T17:24:01Z","abstract_excerpt":"We investigate mean-field games (MFG) in which agents can actively control their speed of access to information. Specifically, the agents can dynamically decide to obtain observations with reduced delay by accepting higher observation costs. Agents seek to exploit their active information acquisition by making further decisions to influence their state dynamics so as to maximise rewards. In a mean-field equilibrium, each generic agent solves individually a partially observed Markov decision problem in which the way partial observations are obtained is itself subject to dynamic control actions,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.07877","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.07877/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.07877","created_at":"2026-07-05T11:13:05.795392+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.07877v3","created_at":"2026-07-05T11:13:05.795392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.07877","created_at":"2026-07-05T11:13:05.795392+00:00"},{"alias_kind":"pith_short_12","alias_value":"MONQA5BEI4CV","created_at":"2026-07-05T11:13:05.795392+00:00"},{"alias_kind":"pith_short_16","alias_value":"MONQA5BEI4CVWEE4","created_at":"2026-07-05T11:13:05.795392+00:00"},{"alias_kind":"pith_short_8","alias_value":"MONQA5BE","created_at":"2026-07-05T11:13:05.795392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08992","citing_title":"Optimal hedging of an informed broker facing many traders","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MONQA5BEI4CVWEE4AWACZCHODB","json":"https://pith.science/pith/MONQA5BEI4CVWEE4AWACZCHODB.json","graph_json":"https://pith.science/api/pith-number/MONQA5BEI4CVWEE4AWACZCHODB/graph.json","events_json":"https://pith.science/api/pith-number/MONQA5BEI4CVWEE4AWACZCHODB/events.json","paper":"https://pith.science/paper/MONQA5BE"},"agent_actions":{"view_html":"https://pith.science/pith/MONQA5BEI4CVWEE4AWACZCHODB","download_json":"https://pith.science/pith/MONQA5BEI4CVWEE4AWACZCHODB.json","view_paper":"https://pith.science/paper/MONQA5BE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.07877&json=true","fetch_graph":"https://pith.science/api/pith-number/MONQA5BEI4CVWEE4AWACZCHODB/graph.json","fetch_events":"https://pith.science/api/pith-number/MONQA5BEI4CVWEE4AWACZCHODB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MONQA5BEI4CVWEE4AWACZCHODB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MONQA5BEI4CVWEE4AWACZCHODB/action/storage_attestation","attest_author":"https://pith.science/pith/MONQA5BEI4CVWEE4AWACZCHODB/action/author_attestation","sign_citation":"https://pith.science/pith/MONQA5BEI4CVWEE4AWACZCHODB/action/citation_signature","submit_replication":"https://pith.science/pith/MONQA5BEI4CVWEE4AWACZCHODB/action/replication_record"}},"created_at":"2026-07-05T11:13:05.795392+00:00","updated_at":"2026-07-05T11:13:05.795392+00:00"}