{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YI6BHOIMQJTRW5PTFXMTTWL4RM","short_pith_number":"pith:YI6BHOIM","schema_version":"1.0","canonical_sha256":"c23c13b90c82671b75f32dd939d97c8b35ac87a6931594b9c22a2aad8b948b9f","source":{"kind":"arxiv","id":"1810.07934","version":1},"attestation_state":"computed","paper":{"title":"On Socially Optimal Traffic Flow in the Presence of Random Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Abhishek K. Gupta, Amrit S. Bedi, Anant Chopra, Deepak S. Kalhan, Ketan Rajawat","submitted_at":"2018-10-18T07:51:31Z","abstract_excerpt":"Traffic assignment is an integral part of urban city planning. Roads and freeways are constructed to cater to the expected demands of the commuters between different origin-destination pairs with the overall objective of minimising the travel cost. As compared to static traffic assignment problems where the traffic network is fixed over time, a dynamic traffic network is more realistic where the network's cost parameters change over time due to the presence of random congestion. In this paper, we consider a stochastic version of the traffic assignment problem where the central planner is inter"},"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":"1810.07934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-18T07:51:31Z","cross_cats_sorted":[],"title_canon_sha256":"f198d67cd7253592c8270080afe03a519283fb46f6fa3e22856de7d2ce278b9f","abstract_canon_sha256":"90833d5a63f408b92ec3c8fea1ecbcc72aadb39786fee8687870234631cc59ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:48.816501Z","signature_b64":"c0MtpV8BroLvOrhFpK+VGvMOhK7EWb3v6PVaNIz5LimxTKbgjnqMz23A8JNBBbF54+4iIugxdFfV2XLQbk4TAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c23c13b90c82671b75f32dd939d97c8b35ac87a6931594b9c22a2aad8b948b9f","last_reissued_at":"2026-05-18T00:02:48.815846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:48.815846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Socially Optimal Traffic Flow in the Presence of Random Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Abhishek K. Gupta, Amrit S. Bedi, Anant Chopra, Deepak S. Kalhan, Ketan Rajawat","submitted_at":"2018-10-18T07:51:31Z","abstract_excerpt":"Traffic assignment is an integral part of urban city planning. Roads and freeways are constructed to cater to the expected demands of the commuters between different origin-destination pairs with the overall objective of minimising the travel cost. As compared to static traffic assignment problems where the traffic network is fixed over time, a dynamic traffic network is more realistic where the network's cost parameters change over time due to the presence of random congestion. In this paper, we consider a stochastic version of the traffic assignment problem where the central planner is inter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07934","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":"1810.07934","created_at":"2026-05-18T00:02:48.815960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07934v1","created_at":"2026-05-18T00:02:48.815960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07934","created_at":"2026-05-18T00:02:48.815960+00:00"},{"alias_kind":"pith_short_12","alias_value":"YI6BHOIMQJTR","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YI6BHOIMQJTRW5PT","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YI6BHOIM","created_at":"2026-05-18T12:33:04.347982+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/YI6BHOIMQJTRW5PTFXMTTWL4RM","json":"https://pith.science/pith/YI6BHOIMQJTRW5PTFXMTTWL4RM.json","graph_json":"https://pith.science/api/pith-number/YI6BHOIMQJTRW5PTFXMTTWL4RM/graph.json","events_json":"https://pith.science/api/pith-number/YI6BHOIMQJTRW5PTFXMTTWL4RM/events.json","paper":"https://pith.science/paper/YI6BHOIM"},"agent_actions":{"view_html":"https://pith.science/pith/YI6BHOIMQJTRW5PTFXMTTWL4RM","download_json":"https://pith.science/pith/YI6BHOIMQJTRW5PTFXMTTWL4RM.json","view_paper":"https://pith.science/paper/YI6BHOIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07934&json=true","fetch_graph":"https://pith.science/api/pith-number/YI6BHOIMQJTRW5PTFXMTTWL4RM/graph.json","fetch_events":"https://pith.science/api/pith-number/YI6BHOIMQJTRW5PTFXMTTWL4RM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YI6BHOIMQJTRW5PTFXMTTWL4RM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YI6BHOIMQJTRW5PTFXMTTWL4RM/action/storage_attestation","attest_author":"https://pith.science/pith/YI6BHOIMQJTRW5PTFXMTTWL4RM/action/author_attestation","sign_citation":"https://pith.science/pith/YI6BHOIMQJTRW5PTFXMTTWL4RM/action/citation_signature","submit_replication":"https://pith.science/pith/YI6BHOIMQJTRW5PTFXMTTWL4RM/action/replication_record"}},"created_at":"2026-05-18T00:02:48.815960+00:00","updated_at":"2026-05-18T00:02:48.815960+00:00"}