{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K4DIQ6EKSZZA55BNND4PNEBW5C","short_pith_number":"pith:K4DIQ6EK","canonical_record":{"source":{"id":"1803.11163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T17:14:21Z","cross_cats_sorted":[],"title_canon_sha256":"0982e708580303452927914fe94fdc1077e46b79f1f34138f52030ee1b0d55c6","abstract_canon_sha256":"08fc2e91331a09e996697b072b24c33bda3821783d391634c426166791874a68"},"schema_version":"1.0"},"canonical_sha256":"570688788a96720ef42d68f8f69036e8acbc126b1e5259a5fc8ae6ea669375ad","source":{"kind":"arxiv","id":"1803.11163","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.11163","created_at":"2026-05-18T00:19:48Z"},{"alias_kind":"arxiv_version","alias_value":"1803.11163v1","created_at":"2026-05-18T00:19:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11163","created_at":"2026-05-18T00:19:48Z"},{"alias_kind":"pith_short_12","alias_value":"K4DIQ6EKSZZA","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K4DIQ6EKSZZA55BN","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K4DIQ6EK","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K4DIQ6EKSZZA55BNND4PNEBW5C","target":"record","payload":{"canonical_record":{"source":{"id":"1803.11163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T17:14:21Z","cross_cats_sorted":[],"title_canon_sha256":"0982e708580303452927914fe94fdc1077e46b79f1f34138f52030ee1b0d55c6","abstract_canon_sha256":"08fc2e91331a09e996697b072b24c33bda3821783d391634c426166791874a68"},"schema_version":"1.0"},"canonical_sha256":"570688788a96720ef42d68f8f69036e8acbc126b1e5259a5fc8ae6ea669375ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:48.355659Z","signature_b64":"pNpd11nby8NmKG0G0nGQRchVAWjO48jXcAg4guBkg3QUx4uZAm0zru4rJT4+1WhpoDtcfQFmne2HIyoCtbA8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"570688788a96720ef42d68f8f69036e8acbc126b1e5259a5fc8ae6ea669375ad","last_reissued_at":"2026-05-18T00:19:48.354908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:48.354908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.11163","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-18T00:19:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mr0AcR+m3Mpw9aFJjpqhjeellriq8n50D8v5qKCee92umlLg2cvEF64oAJSEP5syJxC3tdfYPCU7QGI3pZoWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:13:47.097361Z"},"content_sha256":"8a72ba8b57c08076d2b71fd4e31d0ed5cf30681a0470147cc84afd9252c35b0b","schema_version":"1.0","event_id":"sha256:8a72ba8b57c08076d2b71fd4e31d0ed5cf30681a0470147cc84afd9252c35b0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K4DIQ6EKSZZA55BNND4PNEBW5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Convex Reformulation of the Robust Freeway Network Control Problem with Controlled Merging Junctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"John Lygeros, Marius Schmitt","submitted_at":"2018-03-29T17:14:21Z","abstract_excerpt":"In the freeway network control (FNC) problem, the operation of a traffic network is optimized using only flow control. For special cases of the FNC problem, in particular the case when all merging flows are controlled, there exist tight convex relaxations of the corresponding optimization problem. However, model uncertainty, in particular regarding the fundamental diagram and predictions of future traffic demand, can be a problem in practice. This uncertainty poses a challenge to control approaches that pursue a model- and optimization-based strategy. In this work, we propose a robust counterp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11163","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-18T00:19:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psX1WoRy5Eegx2y0SnOn6QDBwLbxnBjx3WBrviVg/bwcKH3PjPX2b7ADoSal4ktIyv9P5KKBuiFHJfQdvrkABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:13:47.097998Z"},"content_sha256":"47606321582f6f2b691645dc8be0ea8cb610e5f55929f972a1e14849d74d72fe","schema_version":"1.0","event_id":"sha256:47606321582f6f2b691645dc8be0ea8cb610e5f55929f972a1e14849d74d72fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K4DIQ6EKSZZA55BNND4PNEBW5C/bundle.json","state_url":"https://pith.science/pith/K4DIQ6EKSZZA55BNND4PNEBW5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K4DIQ6EKSZZA55BNND4PNEBW5C/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-05T22:13:47Z","links":{"resolver":"https://pith.science/pith/K4DIQ6EKSZZA55BNND4PNEBW5C","bundle":"https://pith.science/pith/K4DIQ6EKSZZA55BNND4PNEBW5C/bundle.json","state":"https://pith.science/pith/K4DIQ6EKSZZA55BNND4PNEBW5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K4DIQ6EKSZZA55BNND4PNEBW5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K4DIQ6EKSZZA55BNND4PNEBW5C","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":"08fc2e91331a09e996697b072b24c33bda3821783d391634c426166791874a68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T17:14:21Z","title_canon_sha256":"0982e708580303452927914fe94fdc1077e46b79f1f34138f52030ee1b0d55c6"},"schema_version":"1.0","source":{"id":"1803.11163","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.11163","created_at":"2026-05-18T00:19:48Z"},{"alias_kind":"arxiv_version","alias_value":"1803.11163v1","created_at":"2026-05-18T00:19:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11163","created_at":"2026-05-18T00:19:48Z"},{"alias_kind":"pith_short_12","alias_value":"K4DIQ6EKSZZA","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K4DIQ6EKSZZA55BN","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K4DIQ6EK","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:47606321582f6f2b691645dc8be0ea8cb610e5f55929f972a1e14849d74d72fe","target":"graph","created_at":"2026-05-18T00:19:48Z","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 the freeway network control (FNC) problem, the operation of a traffic network is optimized using only flow control. For special cases of the FNC problem, in particular the case when all merging flows are controlled, there exist tight convex relaxations of the corresponding optimization problem. However, model uncertainty, in particular regarding the fundamental diagram and predictions of future traffic demand, can be a problem in practice. This uncertainty poses a challenge to control approaches that pursue a model- and optimization-based strategy. In this work, we propose a robust counterp","authors_text":"John Lygeros, Marius Schmitt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T17:14:21Z","title":"A Convex Reformulation of the Robust Freeway Network Control Problem with Controlled Merging Junctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11163","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:8a72ba8b57c08076d2b71fd4e31d0ed5cf30681a0470147cc84afd9252c35b0b","target":"record","created_at":"2026-05-18T00:19:48Z","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":"08fc2e91331a09e996697b072b24c33bda3821783d391634c426166791874a68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T17:14:21Z","title_canon_sha256":"0982e708580303452927914fe94fdc1077e46b79f1f34138f52030ee1b0d55c6"},"schema_version":"1.0","source":{"id":"1803.11163","kind":"arxiv","version":1}},"canonical_sha256":"570688788a96720ef42d68f8f69036e8acbc126b1e5259a5fc8ae6ea669375ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"570688788a96720ef42d68f8f69036e8acbc126b1e5259a5fc8ae6ea669375ad","first_computed_at":"2026-05-18T00:19:48.354908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:48.354908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pNpd11nby8NmKG0G0nGQRchVAWjO48jXcAg4guBkg3QUx4uZAm0zru4rJT4+1WhpoDtcfQFmne2HIyoCtbA8Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:48.355659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.11163","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a72ba8b57c08076d2b71fd4e31d0ed5cf30681a0470147cc84afd9252c35b0b","sha256:47606321582f6f2b691645dc8be0ea8cb610e5f55929f972a1e14849d74d72fe"],"state_sha256":"a2d2b5b4e96305a3c0a0e246e39cd31082569abdafb8393d18d9783d506e66b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HfPj5ElXNXMIAoxfP0AqXVJjbi23u+QUg0WJKuzApeQkHqYzBa/Ashs5WsBsZXS7OFdmXlPk5MNTWXJFB5dCBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:13:47.102003Z","bundle_sha256":"1bff59f7ea899dfe55cebdc6d6c57cd2f0d7a8d21be47867344c72cd8f041d7d"}}