{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IP4NJXRPK67NK623ABBF7RA2J2","short_pith_number":"pith:IP4NJXRP","canonical_record":{"source":{"id":"1705.01784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-04T10:33:03Z","cross_cats_sorted":[],"title_canon_sha256":"9f2043f90355ae174ee43b82696a39b45190981d208dc69babc5044dd37d2390","abstract_canon_sha256":"45a51b0ebac6935b392880295c2d1dd92c5a49d82f16f883626c8297571b159d"},"schema_version":"1.0"},"canonical_sha256":"43f8d4de2f57bed57b5b00425fc41a4e924f73e4b6754b0cea57318266e110fd","source":{"kind":"arxiv","id":"1705.01784","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01784","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01784v1","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01784","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"pith_short_12","alias_value":"IP4NJXRPK67N","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IP4NJXRPK67NK623","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IP4NJXRP","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IP4NJXRPK67NK623ABBF7RA2J2","target":"record","payload":{"canonical_record":{"source":{"id":"1705.01784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-04T10:33:03Z","cross_cats_sorted":[],"title_canon_sha256":"9f2043f90355ae174ee43b82696a39b45190981d208dc69babc5044dd37d2390","abstract_canon_sha256":"45a51b0ebac6935b392880295c2d1dd92c5a49d82f16f883626c8297571b159d"},"schema_version":"1.0"},"canonical_sha256":"43f8d4de2f57bed57b5b00425fc41a4e924f73e4b6754b0cea57318266e110fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:02.319792Z","signature_b64":"UpGxbv3go3mAI71Bv3J2AGipTjKBJQakVN4DW+SJ14uuCzyggfxNdm8YNTOuzq6xrWYG5chYEV+BHDnAwvb+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43f8d4de2f57bed57b5b00425fc41a4e924f73e4b6754b0cea57318266e110fd","last_reissued_at":"2026-05-18T00:45:02.319337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:02.319337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.01784","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:45:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0kdyOecBsyNS6rwDviZXDaw3ryHQTWDZN2Y+rOcIB2WhTJCxuJMyvspMd1MW73vD7wNvjC709Apuguq48kWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T02:36:43.846803Z"},"content_sha256":"719b313618e6a19a4ad04758df7cca58944f8f5d9fb3c834fdd6ca414e453db5","schema_version":"1.0","event_id":"sha256:719b313618e6a19a4ad04758df7cca58944f8f5d9fb3c834fdd6ca414e453db5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IP4NJXRPK67NK623ABBF7RA2J2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Network Game of Dynamic Traffic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Bo Chen, Changjun Wang, Xujin Chen, Zhigang Cao","submitted_at":"2017-05-04T10:33:03Z","abstract_excerpt":"We study a network congestion game of discrete-time dynamic traffic of atomic agents with a single origin-destination pair. Any agent freely makes a dynamic decision at each vertex (e.g., road crossing) and traffic is regulated with given priorities on edges (e.g., road segments). We first constructively prove that there always exists a subgame perfect equilibrium (SPE) in this game. We then study the relationship between this model and a simplified model, in which agents select and fix an origin-destination path simultaneously. We show that the set of Nash equilibrium (NE) flows of the simpli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01784","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:45:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"viPD+d/ltS4wCy5UXiX6i4Bb3FXTa4k6apqXAIchxcgyUlVyBANb0Zlz8M/N0vxV/MYdRJ9JfOOXGAHB0oDIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T02:36:43.847161Z"},"content_sha256":"e7b8c456a6191b1f19877af0a41efd111ec71ed05926ac1188a45d8ef2385f52","schema_version":"1.0","event_id":"sha256:e7b8c456a6191b1f19877af0a41efd111ec71ed05926ac1188a45d8ef2385f52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2/bundle.json","state_url":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IP4NJXRPK67NK623ABBF7RA2J2/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-05-21T02:36:43Z","links":{"resolver":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2","bundle":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2/bundle.json","state":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IP4NJXRPK67NK623ABBF7RA2J2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IP4NJXRPK67NK623ABBF7RA2J2","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":"45a51b0ebac6935b392880295c2d1dd92c5a49d82f16f883626c8297571b159d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-04T10:33:03Z","title_canon_sha256":"9f2043f90355ae174ee43b82696a39b45190981d208dc69babc5044dd37d2390"},"schema_version":"1.0","source":{"id":"1705.01784","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01784","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01784v1","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01784","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"pith_short_12","alias_value":"IP4NJXRPK67N","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IP4NJXRPK67NK623","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IP4NJXRP","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:e7b8c456a6191b1f19877af0a41efd111ec71ed05926ac1188a45d8ef2385f52","target":"graph","created_at":"2026-05-18T00:45:02Z","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 study a network congestion game of discrete-time dynamic traffic of atomic agents with a single origin-destination pair. Any agent freely makes a dynamic decision at each vertex (e.g., road crossing) and traffic is regulated with given priorities on edges (e.g., road segments). We first constructively prove that there always exists a subgame perfect equilibrium (SPE) in this game. We then study the relationship between this model and a simplified model, in which agents select and fix an origin-destination path simultaneously. We show that the set of Nash equilibrium (NE) flows of the simpli","authors_text":"Bo Chen, Changjun Wang, Xujin Chen, Zhigang Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-04T10:33:03Z","title":"A Network Game of Dynamic Traffic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01784","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:719b313618e6a19a4ad04758df7cca58944f8f5d9fb3c834fdd6ca414e453db5","target":"record","created_at":"2026-05-18T00:45:02Z","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":"45a51b0ebac6935b392880295c2d1dd92c5a49d82f16f883626c8297571b159d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-04T10:33:03Z","title_canon_sha256":"9f2043f90355ae174ee43b82696a39b45190981d208dc69babc5044dd37d2390"},"schema_version":"1.0","source":{"id":"1705.01784","kind":"arxiv","version":1}},"canonical_sha256":"43f8d4de2f57bed57b5b00425fc41a4e924f73e4b6754b0cea57318266e110fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43f8d4de2f57bed57b5b00425fc41a4e924f73e4b6754b0cea57318266e110fd","first_computed_at":"2026-05-18T00:45:02.319337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:02.319337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UpGxbv3go3mAI71Bv3J2AGipTjKBJQakVN4DW+SJ14uuCzyggfxNdm8YNTOuzq6xrWYG5chYEV+BHDnAwvb+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:02.319792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01784","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:719b313618e6a19a4ad04758df7cca58944f8f5d9fb3c834fdd6ca414e453db5","sha256:e7b8c456a6191b1f19877af0a41efd111ec71ed05926ac1188a45d8ef2385f52"],"state_sha256":"a35888da0899cc9cd846918dbd5265e36eea72fb8f355f39766b64f932c621d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upvHTj6HKO/j3/NDLGUCOElm6bZY1Uv6BR5qojcepGAG+JUEi5DPfqDhcckCK08X7SmPhTVWLlMY1kj4MuY2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T02:36:43.849663Z","bundle_sha256":"91b16115f1d5804e07920c66b4f244d58d78d0280a6de47d9468642d9a08e724"}}