{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:THYLIJPFX3C2EYL2AZ2HNCVQM7","short_pith_number":"pith:THYLIJPF","canonical_record":{"source":{"id":"1811.02673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-06T21:48:10Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"eaa9a35aa2735b70f8c50d45e464b8f2b1e964e4eb124ea82a8b1b34e766dcbc","abstract_canon_sha256":"908d7083e017c7d3607866e37c405a6bbaa6a68cc160d5230be999d5f04d431f"},"schema_version":"1.0"},"canonical_sha256":"99f0b425e5bec5a2617a0674768ab067fe942f50888daff5dafa2fdc56c550f6","source":{"kind":"arxiv","id":"1811.02673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02673","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02673v1","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02673","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"THYLIJPFX3C2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"THYLIJPFX3C2EYL2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"THYLIJPF","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:THYLIJPFX3C2EYL2AZ2HNCVQM7","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-06T21:48:10Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"eaa9a35aa2735b70f8c50d45e464b8f2b1e964e4eb124ea82a8b1b34e766dcbc","abstract_canon_sha256":"908d7083e017c7d3607866e37c405a6bbaa6a68cc160d5230be999d5f04d431f"},"schema_version":"1.0"},"canonical_sha256":"99f0b425e5bec5a2617a0674768ab067fe942f50888daff5dafa2fdc56c550f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:21.051291Z","signature_b64":"A5q3rOdz3pt/jGMbJ8V5+EhFfrTvq5Zf2OYNk9FhaUgKfcHFTaT1d0j1iQr4r+ctqcfQ07PqcQALCCfW/fb8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99f0b425e5bec5a2617a0674768ab067fe942f50888daff5dafa2fdc56c550f6","last_reissued_at":"2026-05-18T00:01:21.050655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:21.050655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02673","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:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B9fyRySezpCmksjYQjMLCrHwpS0g0nEDzjN0ReOaGeaQc2vvTC1o3nQYnDijrdnY6N6tMwcBbL71+zxbluPzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:55:54.855327Z"},"content_sha256":"7e81f131e56f46bc02d5ae0adcbc841c3de0234d5d2be707162315178fe5c573","schema_version":"1.0","event_id":"sha256:7e81f131e56f46bc02d5ae0adcbc841c3de0234d5d2be707162315178fe5c573"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:THYLIJPFX3C2EYL2AZ2HNCVQM7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gramian-Based Optimization for the Analysis and Control of Traffic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Fabio Pasqualetti, Gianluca Bianchin","submitted_at":"2018-11-06T21:48:10Z","abstract_excerpt":"This paper proposes a simplified version of classical models for urban transportation networks, and studies the problem of controlling intersections with the goal of optimizing network-wide congestion. Differently from traditional approaches to control traffic signaling, a simplified framework allows for a more tractable analysis of the network overall dynamics, and enables the design of critical parameters while considering network-wide measures of efficiency. Motivated by the increasing availability of real-time high-resolution traffic data, we cast an optimization problem that formalizes th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02673","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:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6tpPiBoAcRaieG79cz7LEOv0hMXi//aa7kW2JEpnPnmu/OHyJ6RdwpRy9yqSDrxI7E2tuoe4Hdq5iyXHfItCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:55:54.855683Z"},"content_sha256":"4430d11dca2fddd85e16f4e438340c0eb558cbc56b3473737baba1fe0e57c81b","schema_version":"1.0","event_id":"sha256:4430d11dca2fddd85e16f4e438340c0eb558cbc56b3473737baba1fe0e57c81b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7/bundle.json","state_url":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7/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-07T01:55:54Z","links":{"resolver":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7","bundle":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7/bundle.json","state":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:THYLIJPFX3C2EYL2AZ2HNCVQM7","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":"908d7083e017c7d3607866e37c405a6bbaa6a68cc160d5230be999d5f04d431f","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-06T21:48:10Z","title_canon_sha256":"eaa9a35aa2735b70f8c50d45e464b8f2b1e964e4eb124ea82a8b1b34e766dcbc"},"schema_version":"1.0","source":{"id":"1811.02673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02673","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02673v1","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02673","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"THYLIJPFX3C2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"THYLIJPFX3C2EYL2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"THYLIJPF","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:4430d11dca2fddd85e16f4e438340c0eb558cbc56b3473737baba1fe0e57c81b","target":"graph","created_at":"2026-05-18T00:01:21Z","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":"This paper proposes a simplified version of classical models for urban transportation networks, and studies the problem of controlling intersections with the goal of optimizing network-wide congestion. Differently from traditional approaches to control traffic signaling, a simplified framework allows for a more tractable analysis of the network overall dynamics, and enables the design of critical parameters while considering network-wide measures of efficiency. Motivated by the increasing availability of real-time high-resolution traffic data, we cast an optimization problem that formalizes th","authors_text":"Fabio Pasqualetti, Gianluca Bianchin","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-06T21:48:10Z","title":"Gramian-Based Optimization for the Analysis and Control of Traffic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02673","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:7e81f131e56f46bc02d5ae0adcbc841c3de0234d5d2be707162315178fe5c573","target":"record","created_at":"2026-05-18T00:01:21Z","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":"908d7083e017c7d3607866e37c405a6bbaa6a68cc160d5230be999d5f04d431f","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-06T21:48:10Z","title_canon_sha256":"eaa9a35aa2735b70f8c50d45e464b8f2b1e964e4eb124ea82a8b1b34e766dcbc"},"schema_version":"1.0","source":{"id":"1811.02673","kind":"arxiv","version":1}},"canonical_sha256":"99f0b425e5bec5a2617a0674768ab067fe942f50888daff5dafa2fdc56c550f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99f0b425e5bec5a2617a0674768ab067fe942f50888daff5dafa2fdc56c550f6","first_computed_at":"2026-05-18T00:01:21.050655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:21.050655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A5q3rOdz3pt/jGMbJ8V5+EhFfrTvq5Zf2OYNk9FhaUgKfcHFTaT1d0j1iQr4r+ctqcfQ07PqcQALCCfW/fb8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:21.051291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e81f131e56f46bc02d5ae0adcbc841c3de0234d5d2be707162315178fe5c573","sha256:4430d11dca2fddd85e16f4e438340c0eb558cbc56b3473737baba1fe0e57c81b"],"state_sha256":"90676a5609298b627cb357a4546de41fc4bb55c4ab9f6e4c39c0ed986a668769"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9sdgQGzZSuFgWT74xjythr6SI2WVi+Kur+n7zhcXWj33f9c4t1+KjCYvTYkpBpoN9oPjLHVCy3y0dAa+q6DADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T01:55:54.857596Z","bundle_sha256":"b866f9efa0d4c0c452b3b78447a881a311ae266c8eb18e5f616753a0f1c79717"}}