{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YIO56POEQL23KMTQ2CKIJNT375","short_pith_number":"pith:YIO56POE","canonical_record":{"source":{"id":"1808.05305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-15T23:09:21Z","cross_cats_sorted":[],"title_canon_sha256":"f408fe10428806866106637611316cc9ca2f78b59c0f074253be0a59a5562509","abstract_canon_sha256":"cc769bacb344187164fc7df689407650d4c3100325051eb6ee552f0ced184b26"},"schema_version":"1.0"},"canonical_sha256":"c21ddf3dc482f5b53270d09484b67bff405696f65e29835cf1464807aaf120b2","source":{"kind":"arxiv","id":"1808.05305","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05305","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05305v1","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05305","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"YIO56POEQL23","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YIO56POEQL23KMTQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YIO56POE","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YIO56POEQL23KMTQ2CKIJNT375","target":"record","payload":{"canonical_record":{"source":{"id":"1808.05305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-15T23:09:21Z","cross_cats_sorted":[],"title_canon_sha256":"f408fe10428806866106637611316cc9ca2f78b59c0f074253be0a59a5562509","abstract_canon_sha256":"cc769bacb344187164fc7df689407650d4c3100325051eb6ee552f0ced184b26"},"schema_version":"1.0"},"canonical_sha256":"c21ddf3dc482f5b53270d09484b67bff405696f65e29835cf1464807aaf120b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:57.583313Z","signature_b64":"iOfVWZNtV3xNd1BxWTbgez0O1rcetoQ7anlSFIObz1G+PKnt+qaE8sdK3kYPCh239rCs6yWZhimmUsTJNZE7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c21ddf3dc482f5b53270d09484b67bff405696f65e29835cf1464807aaf120b2","last_reissued_at":"2026-05-18T00:07:57.582778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:57.582778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.05305","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ym00QhbcK1d8SwoLZgeccAYQRndBoAHXYIhg8jRoaHpgcrlERGGmbSnd3QE/dM0BMnUurcpZMw5ne9phVJrvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:59:25.588305Z"},"content_sha256":"9fa3b4137623d353314f217c23457a0e688cd2be84f2e1ef7145cd793902b71e","schema_version":"1.0","event_id":"sha256:9fa3b4137623d353314f217c23457a0e688cd2be84f2e1ef7145cd793902b71e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YIO56POEQL23KMTQ2CKIJNT375","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linearly Solvable Mean-Field Road Traffic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ehsan Nekouei, Karl Henrik Johansson, Takashi Tanaka","submitted_at":"2018-08-15T23:09:21Z","abstract_excerpt":"We analyze the behavior of a large number of strategic drivers traveling over an urban traffic network using the mean-field game framework. We assume an incentive mechanism for congestion mitigation under which each driver selecting a particular route is charged a tax penalty that is affine in the logarithm of the number of agents selecting the same route. We show that the mean-field approximation of such a large-population dynamic game leads to the so-called linearly solvable Markov decision process, implying that an open-loop $\\epsilon$-Nash equilibrium of the original game can be found simp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05305","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c1nmz0hkETuOTIN5X0y16c+zyn65d2h3AUfSxl43soW180JTb3T7dU4gb5XIhcce0Eclhy/u67zslqLELhSBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:59:25.589004Z"},"content_sha256":"3733a3d1a0078c6b1513bfd57cde8eb33121a4c4f101c94ab1bed9d66252c0df","schema_version":"1.0","event_id":"sha256:3733a3d1a0078c6b1513bfd57cde8eb33121a4c4f101c94ab1bed9d66252c0df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIO56POEQL23KMTQ2CKIJNT375/bundle.json","state_url":"https://pith.science/pith/YIO56POEQL23KMTQ2CKIJNT375/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIO56POEQL23KMTQ2CKIJNT375/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T15:59:25Z","links":{"resolver":"https://pith.science/pith/YIO56POEQL23KMTQ2CKIJNT375","bundle":"https://pith.science/pith/YIO56POEQL23KMTQ2CKIJNT375/bundle.json","state":"https://pith.science/pith/YIO56POEQL23KMTQ2CKIJNT375/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIO56POEQL23KMTQ2CKIJNT375/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YIO56POEQL23KMTQ2CKIJNT375","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cc769bacb344187164fc7df689407650d4c3100325051eb6ee552f0ced184b26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-15T23:09:21Z","title_canon_sha256":"f408fe10428806866106637611316cc9ca2f78b59c0f074253be0a59a5562509"},"schema_version":"1.0","source":{"id":"1808.05305","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05305","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05305v1","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05305","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"YIO56POEQL23","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YIO56POEQL23KMTQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YIO56POE","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:3733a3d1a0078c6b1513bfd57cde8eb33121a4c4f101c94ab1bed9d66252c0df","target":"graph","created_at":"2026-05-18T00:07:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We analyze the behavior of a large number of strategic drivers traveling over an urban traffic network using the mean-field game framework. We assume an incentive mechanism for congestion mitigation under which each driver selecting a particular route is charged a tax penalty that is affine in the logarithm of the number of agents selecting the same route. We show that the mean-field approximation of such a large-population dynamic game leads to the so-called linearly solvable Markov decision process, implying that an open-loop $\\epsilon$-Nash equilibrium of the original game can be found simp","authors_text":"Ehsan Nekouei, Karl Henrik Johansson, Takashi Tanaka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-15T23:09:21Z","title":"Linearly Solvable Mean-Field Road Traffic Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05305","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9fa3b4137623d353314f217c23457a0e688cd2be84f2e1ef7145cd793902b71e","target":"record","created_at":"2026-05-18T00:07:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cc769bacb344187164fc7df689407650d4c3100325051eb6ee552f0ced184b26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-15T23:09:21Z","title_canon_sha256":"f408fe10428806866106637611316cc9ca2f78b59c0f074253be0a59a5562509"},"schema_version":"1.0","source":{"id":"1808.05305","kind":"arxiv","version":1}},"canonical_sha256":"c21ddf3dc482f5b53270d09484b67bff405696f65e29835cf1464807aaf120b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c21ddf3dc482f5b53270d09484b67bff405696f65e29835cf1464807aaf120b2","first_computed_at":"2026-05-18T00:07:57.582778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:57.582778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iOfVWZNtV3xNd1BxWTbgez0O1rcetoQ7anlSFIObz1G+PKnt+qaE8sdK3kYPCh239rCs6yWZhimmUsTJNZE7Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:57.583313Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.05305","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fa3b4137623d353314f217c23457a0e688cd2be84f2e1ef7145cd793902b71e","sha256:3733a3d1a0078c6b1513bfd57cde8eb33121a4c4f101c94ab1bed9d66252c0df"],"state_sha256":"0e9723846be7b0135ab34f4a4de3fae03dfe0a6a2b3605e001e683b91332b1b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCpv4VSwyinQVghXdewP+J+7gmNO8LNb3/Nq3cEC/wf25QGj8NnhKJYOExJzr4NPP6Cn7/yM/eV5RouTNckOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:59:25.592583Z","bundle_sha256":"6e2ea9d22430926303b754e0b95335c5390f2bba14ce1fa2a9a0b3bffe55c135"}}