{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H7ZRLW76P6Q6XIHKUQQIMXQX56","short_pith_number":"pith:H7ZRLW76","schema_version":"1.0","canonical_sha256":"3ff315dbfe7fa1eba0eaa420865e17efb3a3882e946103cfffb70a4717cdea3c","source":{"kind":"arxiv","id":"1811.02474","version":1},"attestation_state":"computed","paper":{"title":"User equilibrium with a policy-based link transmission model for stochastic time-dependent traffic networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Hemant Gehlot, Satish V. Ukkusuri","submitted_at":"2018-11-06T16:25:21Z","abstract_excerpt":"Non-recurrent congestion is a major problem in traffic networks that causes unexpected delays during travels. In such a scenario, it is preferable to use adaptive paths or policies where next link decisions on reaching junctions are continuously adapted based on the information gained with time. In this paper, we study a traffic assignment problem in stochastic time-dependent networks. The problem is modeled as a fixed-point problem and existence of the equilibrium solution is discussed. We iteratively solve the problem using the method of successive averages (MSA). A novel network loading mod"},"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":"1811.02474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-06T16:25:21Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"11d7bcd080db071d875a28902077294fdf6efeccfb93ca2ec02bd0d85488af2d","abstract_canon_sha256":"ffe1b54ebe6ddc57542753ae107ae26a416196fe7584a16b37e9d542106e994c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:24.199451Z","signature_b64":"MCPW2ca4gi6LnrKW6k2HEFZVtr/cA3mUOLekJdneeJ6bGKmLQrh53usl9Jj3Q+EhQKmJGELS4dEx520Vii+3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ff315dbfe7fa1eba0eaa420865e17efb3a3882e946103cfffb70a4717cdea3c","last_reissued_at":"2026-05-18T00:01:24.199034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:24.199034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"User equilibrium with a policy-based link transmission model for stochastic time-dependent traffic networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Hemant Gehlot, Satish V. Ukkusuri","submitted_at":"2018-11-06T16:25:21Z","abstract_excerpt":"Non-recurrent congestion is a major problem in traffic networks that causes unexpected delays during travels. In such a scenario, it is preferable to use adaptive paths or policies where next link decisions on reaching junctions are continuously adapted based on the information gained with time. In this paper, we study a traffic assignment problem in stochastic time-dependent networks. The problem is modeled as a fixed-point problem and existence of the equilibrium solution is discussed. We iteratively solve the problem using the method of successive averages (MSA). A novel network loading mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02474","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":"1811.02474","created_at":"2026-05-18T00:01:24.199092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02474v1","created_at":"2026-05-18T00:01:24.199092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02474","created_at":"2026-05-18T00:01:24.199092+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7ZRLW76P6Q6","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7ZRLW76P6Q6XIHK","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7ZRLW76","created_at":"2026-05-18T12:32:28.185984+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/H7ZRLW76P6Q6XIHKUQQIMXQX56","json":"https://pith.science/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56.json","graph_json":"https://pith.science/api/pith-number/H7ZRLW76P6Q6XIHKUQQIMXQX56/graph.json","events_json":"https://pith.science/api/pith-number/H7ZRLW76P6Q6XIHKUQQIMXQX56/events.json","paper":"https://pith.science/paper/H7ZRLW76"},"agent_actions":{"view_html":"https://pith.science/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56","download_json":"https://pith.science/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56.json","view_paper":"https://pith.science/paper/H7ZRLW76","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02474&json=true","fetch_graph":"https://pith.science/api/pith-number/H7ZRLW76P6Q6XIHKUQQIMXQX56/graph.json","fetch_events":"https://pith.science/api/pith-number/H7ZRLW76P6Q6XIHKUQQIMXQX56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56/action/storage_attestation","attest_author":"https://pith.science/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56/action/author_attestation","sign_citation":"https://pith.science/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56/action/citation_signature","submit_replication":"https://pith.science/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56/action/replication_record"}},"created_at":"2026-05-18T00:01:24.199092+00:00","updated_at":"2026-05-18T00:01:24.199092+00:00"}