{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:THYLIJPFX3C2EYL2AZ2HNCVQM7","short_pith_number":"pith:THYLIJPF","schema_version":"1.0","canonical_sha256":"99f0b425e5bec5a2617a0674768ab067fe942f50888daff5dafa2fdc56c550f6","source":{"kind":"arxiv","id":"1811.02673","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.02673","created_at":"2026-05-18T00:01:21.050757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02673v1","created_at":"2026-05-18T00:01:21.050757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02673","created_at":"2026-05-18T00:01:21.050757+00:00"},{"alias_kind":"pith_short_12","alias_value":"THYLIJPFX3C2","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"THYLIJPFX3C2EYL2","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"THYLIJPF","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7","json":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7.json","graph_json":"https://pith.science/api/pith-number/THYLIJPFX3C2EYL2AZ2HNCVQM7/graph.json","events_json":"https://pith.science/api/pith-number/THYLIJPFX3C2EYL2AZ2HNCVQM7/events.json","paper":"https://pith.science/paper/THYLIJPF"},"agent_actions":{"view_html":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7","download_json":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7.json","view_paper":"https://pith.science/paper/THYLIJPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02673&json=true","fetch_graph":"https://pith.science/api/pith-number/THYLIJPFX3C2EYL2AZ2HNCVQM7/graph.json","fetch_events":"https://pith.science/api/pith-number/THYLIJPFX3C2EYL2AZ2HNCVQM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7/action/storage_attestation","attest_author":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7/action/author_attestation","sign_citation":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7/action/citation_signature","submit_replication":"https://pith.science/pith/THYLIJPFX3C2EYL2AZ2HNCVQM7/action/replication_record"}},"created_at":"2026-05-18T00:01:21.050757+00:00","updated_at":"2026-05-18T00:01:21.050757+00:00"}