{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VKGR3TIT56F7ZHPKS44LPBKQP2","short_pith_number":"pith:VKGR3TIT","schema_version":"1.0","canonical_sha256":"aa8d1dcd13ef8bfc9dea9738b785507e8fc49e1945e5b1955ea399f63463c00e","source":{"kind":"arxiv","id":"1802.05391","version":2},"attestation_state":"computed","paper":{"title":"A Fast Lax-Hopf formula to solve the Lighthill-Whitham-Richards traffic flow model on networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Christian Claudel, Michele Simoni","submitted_at":"2018-02-15T02:52:50Z","abstract_excerpt":"Efficient and exact algorithms are important for performing fast and accurate traffic network simulations with macroscopic traffic models. In this paper, we extend the semi-analytical Lax-Hopf algorithm in order to compute link inflows and outflows with the LWR model. Our proposed Fax Lax-Hopf algorithm has a very low computational complexity. We demonstrate that some of the original algorithm's operations (associated with the initial conditions) can be discarded, leading to a faster computation of boundary demand/supplies in network simulation problems, for general concave fundamental diagram"},"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":"1802.05391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2018-02-15T02:52:50Z","cross_cats_sorted":[],"title_canon_sha256":"c980152958c41eb9f33fae34d33a8585a027ca82adebb98a2e1c602b689dd24e","abstract_canon_sha256":"3fb6a687685a0f7b3f75756a92389d838e907386f4d82a7ddf0fc0a1c443ead3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:10.727874Z","signature_b64":"W31NL+nte2xhAvyuhTDLv26vU0w/rGxfa6+cCXTKkLr2O2Hqx1eBoeiS8o4p2fxuzaQd7rslDKHahqQN0BZeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa8d1dcd13ef8bfc9dea9738b785507e8fc49e1945e5b1955ea399f63463c00e","last_reissued_at":"2026-05-18T00:07:10.727209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:10.727209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Lax-Hopf formula to solve the Lighthill-Whitham-Richards traffic flow model on networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Christian Claudel, Michele Simoni","submitted_at":"2018-02-15T02:52:50Z","abstract_excerpt":"Efficient and exact algorithms are important for performing fast and accurate traffic network simulations with macroscopic traffic models. In this paper, we extend the semi-analytical Lax-Hopf algorithm in order to compute link inflows and outflows with the LWR model. Our proposed Fax Lax-Hopf algorithm has a very low computational complexity. We demonstrate that some of the original algorithm's operations (associated with the initial conditions) can be discarded, leading to a faster computation of boundary demand/supplies in network simulation problems, for general concave fundamental diagram"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05391","kind":"arxiv","version":2},"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":"1802.05391","created_at":"2026-05-18T00:07:10.727330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.05391v2","created_at":"2026-05-18T00:07:10.727330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05391","created_at":"2026-05-18T00:07:10.727330+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKGR3TIT56F7","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKGR3TIT56F7ZHPK","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKGR3TIT","created_at":"2026-05-18T12:32:59.047623+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/VKGR3TIT56F7ZHPKS44LPBKQP2","json":"https://pith.science/pith/VKGR3TIT56F7ZHPKS44LPBKQP2.json","graph_json":"https://pith.science/api/pith-number/VKGR3TIT56F7ZHPKS44LPBKQP2/graph.json","events_json":"https://pith.science/api/pith-number/VKGR3TIT56F7ZHPKS44LPBKQP2/events.json","paper":"https://pith.science/paper/VKGR3TIT"},"agent_actions":{"view_html":"https://pith.science/pith/VKGR3TIT56F7ZHPKS44LPBKQP2","download_json":"https://pith.science/pith/VKGR3TIT56F7ZHPKS44LPBKQP2.json","view_paper":"https://pith.science/paper/VKGR3TIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.05391&json=true","fetch_graph":"https://pith.science/api/pith-number/VKGR3TIT56F7ZHPKS44LPBKQP2/graph.json","fetch_events":"https://pith.science/api/pith-number/VKGR3TIT56F7ZHPKS44LPBKQP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKGR3TIT56F7ZHPKS44LPBKQP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKGR3TIT56F7ZHPKS44LPBKQP2/action/storage_attestation","attest_author":"https://pith.science/pith/VKGR3TIT56F7ZHPKS44LPBKQP2/action/author_attestation","sign_citation":"https://pith.science/pith/VKGR3TIT56F7ZHPKS44LPBKQP2/action/citation_signature","submit_replication":"https://pith.science/pith/VKGR3TIT56F7ZHPKS44LPBKQP2/action/replication_record"}},"created_at":"2026-05-18T00:07:10.727330+00:00","updated_at":"2026-05-18T00:07:10.727330+00:00"}