{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IP4NJXRPK67NK623ABBF7RA2J2","short_pith_number":"pith:IP4NJXRP","schema_version":"1.0","canonical_sha256":"43f8d4de2f57bed57b5b00425fc41a4e924f73e4b6754b0cea57318266e110fd","source":{"kind":"arxiv","id":"1705.01784","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.01784","created_at":"2026-05-18T00:45:02.319398+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01784v1","created_at":"2026-05-18T00:45:02.319398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01784","created_at":"2026-05-18T00:45:02.319398+00:00"},{"alias_kind":"pith_short_12","alias_value":"IP4NJXRPK67N","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IP4NJXRPK67NK623","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IP4NJXRP","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2","json":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2.json","graph_json":"https://pith.science/api/pith-number/IP4NJXRPK67NK623ABBF7RA2J2/graph.json","events_json":"https://pith.science/api/pith-number/IP4NJXRPK67NK623ABBF7RA2J2/events.json","paper":"https://pith.science/paper/IP4NJXRP"},"agent_actions":{"view_html":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2","download_json":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2.json","view_paper":"https://pith.science/paper/IP4NJXRP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01784&json=true","fetch_graph":"https://pith.science/api/pith-number/IP4NJXRPK67NK623ABBF7RA2J2/graph.json","fetch_events":"https://pith.science/api/pith-number/IP4NJXRPK67NK623ABBF7RA2J2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2/action/storage_attestation","attest_author":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2/action/author_attestation","sign_citation":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2/action/citation_signature","submit_replication":"https://pith.science/pith/IP4NJXRPK67NK623ABBF7RA2J2/action/replication_record"}},"created_at":"2026-05-18T00:45:02.319398+00:00","updated_at":"2026-05-18T00:45:02.319398+00:00"}