{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MSTVQDU36YV5VBSBHJHOQONIRF","short_pith_number":"pith:MSTVQDU3","canonical_record":{"source":{"id":"1310.8329","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-30T21:26:24Z","cross_cats_sorted":[],"title_canon_sha256":"ac892d994606b956b2266ccf61c99997cb2c1a7cd2a873f68e21ec384d47936c","abstract_canon_sha256":"da977ad680505356234fdd20dfc5c08badbb7032921f515fba69f17e5f891e4f"},"schema_version":"1.0"},"canonical_sha256":"64a7580e9bf62bda86413a4ee839a8895bf497cc64a0fc4bb449e0d472e29d57","source":{"kind":"arxiv","id":"1310.8329","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.8329","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1310.8329v2","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8329","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"MSTVQDU36YV5","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MSTVQDU36YV5VBSB","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MSTVQDU3","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MSTVQDU36YV5VBSBHJHOQONIRF","target":"record","payload":{"canonical_record":{"source":{"id":"1310.8329","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-30T21:26:24Z","cross_cats_sorted":[],"title_canon_sha256":"ac892d994606b956b2266ccf61c99997cb2c1a7cd2a873f68e21ec384d47936c","abstract_canon_sha256":"da977ad680505356234fdd20dfc5c08badbb7032921f515fba69f17e5f891e4f"},"schema_version":"1.0"},"canonical_sha256":"64a7580e9bf62bda86413a4ee839a8895bf497cc64a0fc4bb449e0d472e29d57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:04.551718Z","signature_b64":"RSTNBbECXwW9hkYjfMOOIERdwleXDiUyapFJAmtJ0a2UciLYUCBfnCt6yS3Q/U+nsFBd8oNnGKARCktAhoN2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64a7580e9bf62bda86413a4ee839a8895bf497cc64a0fc4bb449e0d472e29d57","last_reissued_at":"2026-05-18T02:46:04.551153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:04.551153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.8329","source_version":2,"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-18T02:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ys2VEcJJhkfhoG2u1o9alAny4zdr8Du5tarRiWlWPRD1N1ayAZomD6ruHbhROd1ZOr5Ywu5LS5rO35cVVGHkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:47:37.816242Z"},"content_sha256":"5d9f1f1198ca778a184feee627bcef990598194ea97d31a3a2fa341473388c2a","schema_version":"1.0","event_id":"sha256:5d9f1f1198ca778a184feee627bcef990598194ea97d31a3a2fa341473388c2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MSTVQDU36YV5VBSBHJHOQONIRF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An easy-to-use algorithm for simulating traffic flow on networks: numerical experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Emiliano Cristiani, Gabriella Bretti, Maya Briani","submitted_at":"2013-10-30T21:26:24Z","abstract_excerpt":"In this paper we propose a Godunov-based discretization of a hyperbolic system of conservation laws with discontinuous flux, modeling vehicular flow on a network. Each equation describes the density evolution of vehicles having a common path along the network. We show that the algorithm selects automatically an admissible solution at junctions, hence ad hoc external procedures (e.g., maximization of the flux via a linear programming method) usually employed in classical approaches are no needed. Since users have not to deal explicitly with vehicle dynamics at junction, the numerical code can b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8329","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"},"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-18T02:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8+2MeJYzyvmd69iQuA68+M7+/QykeQ2J0bVUR4ummCWIExc2uek/bkjbf0++G9IQhm9+mAbJtPcqeTTYwnRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:47:37.816949Z"},"content_sha256":"cc25960906258556fbe536ed440a8a058142e5ddd980f0f02f5c719c19968633","schema_version":"1.0","event_id":"sha256:cc25960906258556fbe536ed440a8a058142e5ddd980f0f02f5c719c19968633"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSTVQDU36YV5VBSBHJHOQONIRF/bundle.json","state_url":"https://pith.science/pith/MSTVQDU36YV5VBSBHJHOQONIRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSTVQDU36YV5VBSBHJHOQONIRF/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-06-07T18:47:37Z","links":{"resolver":"https://pith.science/pith/MSTVQDU36YV5VBSBHJHOQONIRF","bundle":"https://pith.science/pith/MSTVQDU36YV5VBSBHJHOQONIRF/bundle.json","state":"https://pith.science/pith/MSTVQDU36YV5VBSBHJHOQONIRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSTVQDU36YV5VBSBHJHOQONIRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MSTVQDU36YV5VBSBHJHOQONIRF","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":"da977ad680505356234fdd20dfc5c08badbb7032921f515fba69f17e5f891e4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-30T21:26:24Z","title_canon_sha256":"ac892d994606b956b2266ccf61c99997cb2c1a7cd2a873f68e21ec384d47936c"},"schema_version":"1.0","source":{"id":"1310.8329","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.8329","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1310.8329v2","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8329","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"MSTVQDU36YV5","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MSTVQDU36YV5VBSB","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MSTVQDU3","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:cc25960906258556fbe536ed440a8a058142e5ddd980f0f02f5c719c19968633","target":"graph","created_at":"2026-05-18T02:46:04Z","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":"In this paper we propose a Godunov-based discretization of a hyperbolic system of conservation laws with discontinuous flux, modeling vehicular flow on a network. Each equation describes the density evolution of vehicles having a common path along the network. We show that the algorithm selects automatically an admissible solution at junctions, hence ad hoc external procedures (e.g., maximization of the flux via a linear programming method) usually employed in classical approaches are no needed. Since users have not to deal explicitly with vehicle dynamics at junction, the numerical code can b","authors_text":"Emiliano Cristiani, Gabriella Bretti, Maya Briani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-30T21:26:24Z","title":"An easy-to-use algorithm for simulating traffic flow on networks: numerical experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8329","kind":"arxiv","version":2},"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:5d9f1f1198ca778a184feee627bcef990598194ea97d31a3a2fa341473388c2a","target":"record","created_at":"2026-05-18T02:46:04Z","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":"da977ad680505356234fdd20dfc5c08badbb7032921f515fba69f17e5f891e4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-30T21:26:24Z","title_canon_sha256":"ac892d994606b956b2266ccf61c99997cb2c1a7cd2a873f68e21ec384d47936c"},"schema_version":"1.0","source":{"id":"1310.8329","kind":"arxiv","version":2}},"canonical_sha256":"64a7580e9bf62bda86413a4ee839a8895bf497cc64a0fc4bb449e0d472e29d57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64a7580e9bf62bda86413a4ee839a8895bf497cc64a0fc4bb449e0d472e29d57","first_computed_at":"2026-05-18T02:46:04.551153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:04.551153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RSTNBbECXwW9hkYjfMOOIERdwleXDiUyapFJAmtJ0a2UciLYUCBfnCt6yS3Q/U+nsFBd8oNnGKARCktAhoN2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:04.551718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.8329","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d9f1f1198ca778a184feee627bcef990598194ea97d31a3a2fa341473388c2a","sha256:cc25960906258556fbe536ed440a8a058142e5ddd980f0f02f5c719c19968633"],"state_sha256":"1a6cec06099c452fd9bebf5a577085cd658c16000d5431801847a7cad92f65df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+nHyBUO1tqvyqIjDGISTLkkzmjAGZ4rZ5T+NoLiriFRrY8zgpAirS90kpa85osrLLi3ik1FwNkrfCHEDkr6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:47:37.821565Z","bundle_sha256":"3a264e43ac15e89b9521b2f86fb899e84003bd6e6da3032077f5e855b897422d"}}