{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:H7ZRLW76P6Q6XIHKUQQIMXQX56","short_pith_number":"pith:H7ZRLW76","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"},"canonical_sha256":"3ff315dbfe7fa1eba0eaa420865e17efb3a3882e946103cfffb70a4717cdea3c","source":{"kind":"arxiv","id":"1811.02474","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02474","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02474v1","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02474","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"H7ZRLW76P6Q6","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H7ZRLW76P6Q6XIHK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H7ZRLW76","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:H7ZRLW76P6Q6XIHKUQQIMXQX56","target":"record","payload":{"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"},"canonical_sha256":"3ff315dbfe7fa1eba0eaa420865e17efb3a3882e946103cfffb70a4717cdea3c","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"},"source_kind":"arxiv","source_id":"1811.02474","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:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CuqI1b4zqGlki4/LD3j+FeH6DUMxRHo5cYBAhZ1OsQArBwwRYfIkqITpDssyJRVXE3PhHji5SUAVqarQRCoLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T00:54:59.841870Z"},"content_sha256":"6301c2b3de799c7853b657a3462ee561ea5b28240d214b4d45b9c8b466b88186","schema_version":"1.0","event_id":"sha256:6301c2b3de799c7853b657a3462ee561ea5b28240d214b4d45b9c8b466b88186"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:H7ZRLW76P6Q6XIHKUQQIMXQX56","target":"graph","payload":{"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"},"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:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c5ZpNq7o2QDV2bBb/MVn6QlerY918brG1TEFekMiY0hRC0xnqrNaAA/UFkOf9HbVVe9oHRpXeZAubfuFc52UCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T00:54:59.842209Z"},"content_sha256":"46882a4c899e0ca415541d89f366c7e34e6009b8eb9b0cdec2cc7248820fb739","schema_version":"1.0","event_id":"sha256:46882a4c899e0ca415541d89f366c7e34e6009b8eb9b0cdec2cc7248820fb739"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56/bundle.json","state_url":"https://pith.science/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56/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-07-05T00:54:59Z","links":{"resolver":"https://pith.science/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56","bundle":"https://pith.science/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56/bundle.json","state":"https://pith.science/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H7ZRLW76P6Q6XIHKUQQIMXQX56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:H7ZRLW76P6Q6XIHKUQQIMXQX56","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":"ffe1b54ebe6ddc57542753ae107ae26a416196fe7584a16b37e9d542106e994c","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-06T16:25:21Z","title_canon_sha256":"11d7bcd080db071d875a28902077294fdf6efeccfb93ca2ec02bd0d85488af2d"},"schema_version":"1.0","source":{"id":"1811.02474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02474","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02474v1","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02474","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"H7ZRLW76P6Q6","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H7ZRLW76P6Q6XIHK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H7ZRLW76","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:46882a4c899e0ca415541d89f366c7e34e6009b8eb9b0cdec2cc7248820fb739","target":"graph","created_at":"2026-05-18T00:01:24Z","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":"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","authors_text":"Hemant Gehlot, Satish V. Ukkusuri","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-06T16:25:21Z","title":"User equilibrium with a policy-based link transmission model for stochastic time-dependent traffic networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02474","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:6301c2b3de799c7853b657a3462ee561ea5b28240d214b4d45b9c8b466b88186","target":"record","created_at":"2026-05-18T00:01:24Z","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":"ffe1b54ebe6ddc57542753ae107ae26a416196fe7584a16b37e9d542106e994c","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-06T16:25:21Z","title_canon_sha256":"11d7bcd080db071d875a28902077294fdf6efeccfb93ca2ec02bd0d85488af2d"},"schema_version":"1.0","source":{"id":"1811.02474","kind":"arxiv","version":1}},"canonical_sha256":"3ff315dbfe7fa1eba0eaa420865e17efb3a3882e946103cfffb70a4717cdea3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ff315dbfe7fa1eba0eaa420865e17efb3a3882e946103cfffb70a4717cdea3c","first_computed_at":"2026-05-18T00:01:24.199034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:24.199034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MCPW2ca4gi6LnrKW6k2HEFZVtr/cA3mUOLekJdneeJ6bGKmLQrh53usl9Jj3Q+EhQKmJGELS4dEx520Vii+3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:24.199451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6301c2b3de799c7853b657a3462ee561ea5b28240d214b4d45b9c8b466b88186","sha256:46882a4c899e0ca415541d89f366c7e34e6009b8eb9b0cdec2cc7248820fb739"],"state_sha256":"fd6f9aece6b11773387a5cedee77a5858bc5b1933b98ddbeeda43a79cfbe4778"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eGjn7u16szYPnFzHGhD+nYarGck1v8cvPJ+GLwekMRDSHdn/5PsqouHD5bRn8MYHDtIz1o4cggiMAXmrryyXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T00:54:59.844157Z","bundle_sha256":"c8fcd2a21fec0b8aa5ca15966c98d73b6a9514bcc4e6a81720c3f0303ee36e6f"}}