{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EGUJVL4VEH44Q63FM2QG3WWOWY","short_pith_number":"pith:EGUJVL4V","schema_version":"1.0","canonical_sha256":"21a89aaf9521f9c87b6566a06ddaceb61a7fdbc5ae0f2147741964340a7a8c99","source":{"kind":"arxiv","id":"1401.1651","version":4},"attestation_state":"computed","paper":{"title":"An easy-to-use algorithm for simulating traffic flow on networks: theoretical study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Emiliano Cristiani, Maya Briani","submitted_at":"2014-01-08T10:30:36Z","abstract_excerpt":"In this paper we study a model for traffic flow on networks based on a hyperbolic system of conservation laws with discontinuous flux. Each equation describes the density evolution of vehicles having a common path along the network. In this formulation the junctions apparently disappear since each path is considered as a single uninterrupted road. We consider a Godunov-based approximation scheme for the system which is very easy to implement. Besides basic properties like the conservation of cars and positive bounded solutions, the scheme exhibits nice properties, being able to select automati"},"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":"1401.1651","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-01-08T10:30:36Z","cross_cats_sorted":[],"title_canon_sha256":"ad53559ef6fee8903d97fc2bc268e1fd049b49062acd1bce2546c3dcabe4f7fd","abstract_canon_sha256":"ea36113f01fba00f22901afff61fd24ed5fc072c51f8c15feecbea9380a9b79c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:23.053631Z","signature_b64":"jZAWoN+RQ4mWYXKU8XuFvNyfJ7lHlD/GpJ3Q76LamJIm1PFYxt6z2C5dNOnihHt8wF6ZzCd+pPVgExBbsTEtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21a89aaf9521f9c87b6566a06ddaceb61a7fdbc5ae0f2147741964340a7a8c99","last_reissued_at":"2026-05-18T01:12:23.053138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:23.053138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An easy-to-use algorithm for simulating traffic flow on networks: theoretical study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Emiliano Cristiani, Maya Briani","submitted_at":"2014-01-08T10:30:36Z","abstract_excerpt":"In this paper we study a model for traffic flow on networks based on a hyperbolic system of conservation laws with discontinuous flux. Each equation describes the density evolution of vehicles having a common path along the network. In this formulation the junctions apparently disappear since each path is considered as a single uninterrupted road. We consider a Godunov-based approximation scheme for the system which is very easy to implement. Besides basic properties like the conservation of cars and positive bounded solutions, the scheme exhibits nice properties, being able to select automati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1651","kind":"arxiv","version":4},"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":"1401.1651","created_at":"2026-05-18T01:12:23.053215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.1651v4","created_at":"2026-05-18T01:12:23.053215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1651","created_at":"2026-05-18T01:12:23.053215+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGUJVL4VEH44","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGUJVL4VEH44Q63F","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGUJVL4V","created_at":"2026-05-18T12:28:25.294606+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/EGUJVL4VEH44Q63FM2QG3WWOWY","json":"https://pith.science/pith/EGUJVL4VEH44Q63FM2QG3WWOWY.json","graph_json":"https://pith.science/api/pith-number/EGUJVL4VEH44Q63FM2QG3WWOWY/graph.json","events_json":"https://pith.science/api/pith-number/EGUJVL4VEH44Q63FM2QG3WWOWY/events.json","paper":"https://pith.science/paper/EGUJVL4V"},"agent_actions":{"view_html":"https://pith.science/pith/EGUJVL4VEH44Q63FM2QG3WWOWY","download_json":"https://pith.science/pith/EGUJVL4VEH44Q63FM2QG3WWOWY.json","view_paper":"https://pith.science/paper/EGUJVL4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.1651&json=true","fetch_graph":"https://pith.science/api/pith-number/EGUJVL4VEH44Q63FM2QG3WWOWY/graph.json","fetch_events":"https://pith.science/api/pith-number/EGUJVL4VEH44Q63FM2QG3WWOWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGUJVL4VEH44Q63FM2QG3WWOWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGUJVL4VEH44Q63FM2QG3WWOWY/action/storage_attestation","attest_author":"https://pith.science/pith/EGUJVL4VEH44Q63FM2QG3WWOWY/action/author_attestation","sign_citation":"https://pith.science/pith/EGUJVL4VEH44Q63FM2QG3WWOWY/action/citation_signature","submit_replication":"https://pith.science/pith/EGUJVL4VEH44Q63FM2QG3WWOWY/action/replication_record"}},"created_at":"2026-05-18T01:12:23.053215+00:00","updated_at":"2026-05-18T01:12:23.053215+00:00"}