{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CZ5L5PK2F4UPUPVDOOROKHY2JR","short_pith_number":"pith:CZ5L5PK2","canonical_record":{"source":{"id":"1403.3750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-03-15T03:46:13Z","cross_cats_sorted":[],"title_canon_sha256":"a6a6d87ec56a425d7a737c644686501783cc8bc569a36cd98930388666e0e201","abstract_canon_sha256":"e554deaed9c634b4cbd2bd944ef1cd52f505fa879ff0c442649ee4c1f6ac7c42"},"schema_version":"1.0"},"canonical_sha256":"167abebd5a2f28fa3ea373a2e51f1a4c5a23b477186235867c587660ac1a0cdc","source":{"kind":"arxiv","id":"1403.3750","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3750","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3750v2","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3750","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"CZ5L5PK2F4UP","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CZ5L5PK2F4UPUPVD","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CZ5L5PK2","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CZ5L5PK2F4UPUPVDOOROKHY2JR","target":"record","payload":{"canonical_record":{"source":{"id":"1403.3750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-03-15T03:46:13Z","cross_cats_sorted":[],"title_canon_sha256":"a6a6d87ec56a425d7a737c644686501783cc8bc569a36cd98930388666e0e201","abstract_canon_sha256":"e554deaed9c634b4cbd2bd944ef1cd52f505fa879ff0c442649ee4c1f6ac7c42"},"schema_version":"1.0"},"canonical_sha256":"167abebd5a2f28fa3ea373a2e51f1a4c5a23b477186235867c587660ac1a0cdc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:52.663141Z","signature_b64":"E8zm9OzLYzerz7TT/nUp9s342uh313fc/IlLubJ6GTgH2To3fCIaeXP9uioTrKIPEGbVs4VVZJdsTZzT+fmlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"167abebd5a2f28fa3ea373a2e51f1a4c5a23b477186235867c587660ac1a0cdc","last_reissued_at":"2026-05-18T02:47:52.662571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:52.662571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.3750","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:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fs0dv28F5pOQY+QGuKNZKGZi/5A4MEWYsYpGuFg0hV9HoJR4sM3lWca0TGlSH0v+v+3GEC0UyLwA6PapvnDWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:40:38.956622Z"},"content_sha256":"8c9f5a6d5241ba5da2dd447fbffbc0804cbf201140d1d0c6e8127697dd147486","schema_version":"1.0","event_id":"sha256:8c9f5a6d5241ba5da2dd447fbffbc0804cbf201140d1d0c6e8127697dd147486"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CZ5L5PK2F4UPUPVDOOROKHY2JR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Runge-Kutta Discontinuous Galerkin Method for Traffic Flow Model on Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Benedetto Piccoli, Jing-Mei Qiu, Suncica Canic, Tan Ren","submitted_at":"2014-03-15T03:46:13Z","abstract_excerpt":"We propose a bound-preserving Runge-Kutta (RK) discontinuous Galerkin (DG) method as an efficient, effective and compact numerical approach for numerical simulation of traffic flow problems on networks, with arbitrary high order accuracy. Road networks are modeled by graphs, composed of a finite number of roads that meet at junctions. On each road, a scalar conservation law describes the dynamics, while coupling conditions are specified at junctions to define flow separation or convergence at the points where roads meet. We incorporate such coupling conditions in the RK DG framework, and apply"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3750","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:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ei7xGXjpHWWXZIv4+R4ZHH9d29Dnt218nLbHf0GHSxDilgXDO9CVlH2asVhkKmSDGN26dloRyA3kWW16pKJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:40:38.957309Z"},"content_sha256":"d823636d8100789d1b663626a0f3ec6e50d6c64fd71c5df3a320dac0e1e9fd0f","schema_version":"1.0","event_id":"sha256:d823636d8100789d1b663626a0f3ec6e50d6c64fd71c5df3a320dac0e1e9fd0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZ5L5PK2F4UPUPVDOOROKHY2JR/bundle.json","state_url":"https://pith.science/pith/CZ5L5PK2F4UPUPVDOOROKHY2JR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZ5L5PK2F4UPUPVDOOROKHY2JR/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-05-31T09:40:38Z","links":{"resolver":"https://pith.science/pith/CZ5L5PK2F4UPUPVDOOROKHY2JR","bundle":"https://pith.science/pith/CZ5L5PK2F4UPUPVDOOROKHY2JR/bundle.json","state":"https://pith.science/pith/CZ5L5PK2F4UPUPVDOOROKHY2JR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZ5L5PK2F4UPUPVDOOROKHY2JR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CZ5L5PK2F4UPUPVDOOROKHY2JR","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":"e554deaed9c634b4cbd2bd944ef1cd52f505fa879ff0c442649ee4c1f6ac7c42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-03-15T03:46:13Z","title_canon_sha256":"a6a6d87ec56a425d7a737c644686501783cc8bc569a36cd98930388666e0e201"},"schema_version":"1.0","source":{"id":"1403.3750","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3750","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3750v2","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3750","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"CZ5L5PK2F4UP","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CZ5L5PK2F4UPUPVD","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CZ5L5PK2","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:d823636d8100789d1b663626a0f3ec6e50d6c64fd71c5df3a320dac0e1e9fd0f","target":"graph","created_at":"2026-05-18T02:47:52Z","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":"We propose a bound-preserving Runge-Kutta (RK) discontinuous Galerkin (DG) method as an efficient, effective and compact numerical approach for numerical simulation of traffic flow problems on networks, with arbitrary high order accuracy. Road networks are modeled by graphs, composed of a finite number of roads that meet at junctions. On each road, a scalar conservation law describes the dynamics, while coupling conditions are specified at junctions to define flow separation or convergence at the points where roads meet. We incorporate such coupling conditions in the RK DG framework, and apply","authors_text":"Benedetto Piccoli, Jing-Mei Qiu, Suncica Canic, Tan Ren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-03-15T03:46:13Z","title":"Runge-Kutta Discontinuous Galerkin Method for Traffic Flow Model on Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3750","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:8c9f5a6d5241ba5da2dd447fbffbc0804cbf201140d1d0c6e8127697dd147486","target":"record","created_at":"2026-05-18T02:47:52Z","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":"e554deaed9c634b4cbd2bd944ef1cd52f505fa879ff0c442649ee4c1f6ac7c42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-03-15T03:46:13Z","title_canon_sha256":"a6a6d87ec56a425d7a737c644686501783cc8bc569a36cd98930388666e0e201"},"schema_version":"1.0","source":{"id":"1403.3750","kind":"arxiv","version":2}},"canonical_sha256":"167abebd5a2f28fa3ea373a2e51f1a4c5a23b477186235867c587660ac1a0cdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"167abebd5a2f28fa3ea373a2e51f1a4c5a23b477186235867c587660ac1a0cdc","first_computed_at":"2026-05-18T02:47:52.662571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:52.662571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E8zm9OzLYzerz7TT/nUp9s342uh313fc/IlLubJ6GTgH2To3fCIaeXP9uioTrKIPEGbVs4VVZJdsTZzT+fmlAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:52.663141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.3750","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c9f5a6d5241ba5da2dd447fbffbc0804cbf201140d1d0c6e8127697dd147486","sha256:d823636d8100789d1b663626a0f3ec6e50d6c64fd71c5df3a320dac0e1e9fd0f"],"state_sha256":"b8fff17f65b5692c9548bba42abd748f11e3353f035f752d94fbc2afb2feb831"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYI+Nt8qDhGcfrT+BK9t1v6XKP+PT9cIug/istfEj05a7filAJCgRTCgd+nvJv0tkbf+A6/59y8xlSv3+gXFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:40:38.960863Z","bundle_sha256":"753c269bf89b746daca4d929eba1812b82ef5bbb79df152d13d00c7933158403"}}