{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HVTUJHS34X6DDOELATAMLHB6SH","short_pith_number":"pith:HVTUJHS3","canonical_record":{"source":{"id":"1302.0132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-01T10:30:15Z","cross_cats_sorted":["math.CA","math.DS"],"title_canon_sha256":"5a3b6bd7046985b197fee469fc608c6605244b4727539268a7ff3b5e89341671","abstract_canon_sha256":"995a64c6caa8cb107cd4d8eaf6e0c772d8b45eb2e3e2b246babfa16e47ddafc5"},"schema_version":"1.0"},"canonical_sha256":"3d67449e5be5fc31b88b04c0c59c3e91fa471c107b202a30efba5d471d96fddd","source":{"kind":"arxiv","id":"1302.0132","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0132","created_at":"2026-05-18T03:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0132v1","created_at":"2026-05-18T03:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0132","created_at":"2026-05-18T03:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"HVTUJHS34X6D","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HVTUJHS34X6DDOEL","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HVTUJHS3","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HVTUJHS34X6DDOELATAMLHB6SH","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-01T10:30:15Z","cross_cats_sorted":["math.CA","math.DS"],"title_canon_sha256":"5a3b6bd7046985b197fee469fc608c6605244b4727539268a7ff3b5e89341671","abstract_canon_sha256":"995a64c6caa8cb107cd4d8eaf6e0c772d8b45eb2e3e2b246babfa16e47ddafc5"},"schema_version":"1.0"},"canonical_sha256":"3d67449e5be5fc31b88b04c0c59c3e91fa471c107b202a30efba5d471d96fddd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:47.291893Z","signature_b64":"51EbCvizGATg8mluQBHsjsA80g5un4aeD1PnmqXnPAzA3l32DVCGNZ50rAbb0oPTGYFhfhGERGc3PxF09aNOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d67449e5be5fc31b88b04c0c59c3e91fa471c107b202a30efba5d471d96fddd","last_reissued_at":"2026-05-18T03:34:47.291103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:47.291103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0132","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-18T03:34:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQocUrY2owB14Qwb+i0fOJXp/8EPX/JPJ/UeQ4NO5gHAhpGhXv9oaGXAcquC6BwywXRpvqyI7WJPV5Vrf7hDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:13:18.347078Z"},"content_sha256":"258208a643221bf4d8c6cb81c32d5b249cd3c651b93afd0689aef2ec2244d897","schema_version":"1.0","event_id":"sha256:258208a643221bf4d8c6cb81c32d5b249cd3c651b93afd0689aef2ec2244d897"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HVTUJHS34X6DDOELATAMLHB6SH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algebraic Approach for Performance Bound Calculus on Transportation Networks (Road Network Calculus)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA","math.DS"],"primary_cat":"math.OC","authors_text":"Habib Haj-Salem, Jean-Patrick Lebacque, Nadir Farhi","submitted_at":"2013-02-01T10:30:15Z","abstract_excerpt":"We propose in this article an adaptation of the basic techniques of the deterministic network calculus theory to the road traffic flow theory. Network calculus is a theory based on min-plus algebra. It uses algebraic techniques to compute performance bounds in communication networks, such as maximum end-to-end delays and backlogs. The objective of this article is to investigate the application of such techniques for determining performance bounds on road networks, such as maximum bounds on travel times. The main difficulty to apply the network calculus theory on road networks is the modeling o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0132","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-18T03:34:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qVddQmL/UJdp8J9QHfDgApCMYsswCVYcIyPlcjpYdQeHMF8RlBq9M4US64EweJppiFMRAxQ4kYURSuTqUb1JCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:13:18.347812Z"},"content_sha256":"eae9f6b793b1db53a1d1852eaa2544df8698b69d846098e062b707493261c683","schema_version":"1.0","event_id":"sha256:eae9f6b793b1db53a1d1852eaa2544df8698b69d846098e062b707493261c683"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVTUJHS34X6DDOELATAMLHB6SH/bundle.json","state_url":"https://pith.science/pith/HVTUJHS34X6DDOELATAMLHB6SH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVTUJHS34X6DDOELATAMLHB6SH/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-08T14:13:18Z","links":{"resolver":"https://pith.science/pith/HVTUJHS34X6DDOELATAMLHB6SH","bundle":"https://pith.science/pith/HVTUJHS34X6DDOELATAMLHB6SH/bundle.json","state":"https://pith.science/pith/HVTUJHS34X6DDOELATAMLHB6SH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVTUJHS34X6DDOELATAMLHB6SH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HVTUJHS34X6DDOELATAMLHB6SH","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":"995a64c6caa8cb107cd4d8eaf6e0c772d8b45eb2e3e2b246babfa16e47ddafc5","cross_cats_sorted":["math.CA","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-01T10:30:15Z","title_canon_sha256":"5a3b6bd7046985b197fee469fc608c6605244b4727539268a7ff3b5e89341671"},"schema_version":"1.0","source":{"id":"1302.0132","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0132","created_at":"2026-05-18T03:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0132v1","created_at":"2026-05-18T03:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0132","created_at":"2026-05-18T03:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"HVTUJHS34X6D","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HVTUJHS34X6DDOEL","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HVTUJHS3","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:eae9f6b793b1db53a1d1852eaa2544df8698b69d846098e062b707493261c683","target":"graph","created_at":"2026-05-18T03:34:47Z","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 in this article an adaptation of the basic techniques of the deterministic network calculus theory to the road traffic flow theory. Network calculus is a theory based on min-plus algebra. It uses algebraic techniques to compute performance bounds in communication networks, such as maximum end-to-end delays and backlogs. The objective of this article is to investigate the application of such techniques for determining performance bounds on road networks, such as maximum bounds on travel times. The main difficulty to apply the network calculus theory on road networks is the modeling o","authors_text":"Habib Haj-Salem, Jean-Patrick Lebacque, Nadir Farhi","cross_cats":["math.CA","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-01T10:30:15Z","title":"Algebraic Approach for Performance Bound Calculus on Transportation Networks (Road Network Calculus)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0132","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:258208a643221bf4d8c6cb81c32d5b249cd3c651b93afd0689aef2ec2244d897","target":"record","created_at":"2026-05-18T03:34:47Z","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":"995a64c6caa8cb107cd4d8eaf6e0c772d8b45eb2e3e2b246babfa16e47ddafc5","cross_cats_sorted":["math.CA","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-01T10:30:15Z","title_canon_sha256":"5a3b6bd7046985b197fee469fc608c6605244b4727539268a7ff3b5e89341671"},"schema_version":"1.0","source":{"id":"1302.0132","kind":"arxiv","version":1}},"canonical_sha256":"3d67449e5be5fc31b88b04c0c59c3e91fa471c107b202a30efba5d471d96fddd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d67449e5be5fc31b88b04c0c59c3e91fa471c107b202a30efba5d471d96fddd","first_computed_at":"2026-05-18T03:34:47.291103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:47.291103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"51EbCvizGATg8mluQBHsjsA80g5un4aeD1PnmqXnPAzA3l32DVCGNZ50rAbb0oPTGYFhfhGERGc3PxF09aNOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:47.291893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0132","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:258208a643221bf4d8c6cb81c32d5b249cd3c651b93afd0689aef2ec2244d897","sha256:eae9f6b793b1db53a1d1852eaa2544df8698b69d846098e062b707493261c683"],"state_sha256":"b299c8a44aacbea5e7e6d05c6ba5db35d63b01aa089fbac64f8dead2b81cdec4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJdmrbg0h4UjvppBn4UG31zdmoLrgMh+VtXfJ7jUTmhkWd8TGLTATVi8hVAEOOhvXAnvxBIoRfbGSvnqhU6bAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:13:18.351377Z","bundle_sha256":"e2217a51cb91d00cf90de604aa3dee3c1b4220f4a061c23b5ceef0f35f766be3"}}