{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5475FOXABEDTGYFRWXH232IQZE","short_pith_number":"pith:5475FOXA","schema_version":"1.0","canonical_sha256":"ef3fd2bae009073360b1b5cfade910c9394b83ece49cefd627e939d1e275ad5c","source":{"kind":"arxiv","id":"2511.14280","version":2},"attestation_state":"computed","paper":{"title":"A graph-informed regret metric for optimal distributed control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Andrea Martin, Daniele Martinelli, Giancarlo Ferrari-Trecate, Luca Furieri","submitted_at":"2025-11-18T09:14:21Z","abstract_excerpt":"We consider the optimal control of large-scale systems using distributed controllers whose network topology mirrors the coupling graph between subsystems. In this work, we introduce spatial regret, a graph-informed metric measuring the worst-case performance gap between a distributed controller and an oracle with access to additional sensor information. The oracle's graph is a user-specified augmentation of the information graph, yielding a benchmark policy that penalizes disturbances for which additional sensing would improve performance. Minimizing spatial regret yields distributed controlle"},"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":"2511.14280","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2025-11-18T09:14:21Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"25b071ec6e96d5765cccc9504047321b286fe61d327a0fbdff3803d83bac6cfd","abstract_canon_sha256":"6b71f0eaf0a0ed80af0b6221b543dfaef5a8ea1ef4009f2c3856f2fe77eb780f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:49.043740Z","signature_b64":"EHQuXeUjsIF9W2V2rVKbE9ydQnuNWzYcoDR6qoHPAyrq+Xri6ImkY5Yf5DMLN9oYYUogto7dbLboi1rsckHFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef3fd2bae009073360b1b5cfade910c9394b83ece49cefd627e939d1e275ad5c","last_reissued_at":"2026-06-19T16:12:49.043261Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:49.043261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A graph-informed regret metric for optimal distributed control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Andrea Martin, Daniele Martinelli, Giancarlo Ferrari-Trecate, Luca Furieri","submitted_at":"2025-11-18T09:14:21Z","abstract_excerpt":"We consider the optimal control of large-scale systems using distributed controllers whose network topology mirrors the coupling graph between subsystems. In this work, we introduce spatial regret, a graph-informed metric measuring the worst-case performance gap between a distributed controller and an oracle with access to additional sensor information. The oracle's graph is a user-specified augmentation of the information graph, yielding a benchmark policy that penalizes disturbances for which additional sensing would improve performance. Minimizing spatial regret yields distributed controlle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.14280","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.14280/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2511.14280","created_at":"2026-06-19T16:12:49.043320+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.14280v2","created_at":"2026-06-19T16:12:49.043320+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.14280","created_at":"2026-06-19T16:12:49.043320+00:00"},{"alias_kind":"pith_short_12","alias_value":"5475FOXABEDT","created_at":"2026-06-19T16:12:49.043320+00:00"},{"alias_kind":"pith_short_16","alias_value":"5475FOXABEDTGYFR","created_at":"2026-06-19T16:12:49.043320+00:00"},{"alias_kind":"pith_short_8","alias_value":"5475FOXA","created_at":"2026-06-19T16:12:49.043320+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.02506","citing_title":"Data-Driven Optimal Distributed Controller Synthesis via Spatial Regret","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5475FOXABEDTGYFRWXH232IQZE","json":"https://pith.science/pith/5475FOXABEDTGYFRWXH232IQZE.json","graph_json":"https://pith.science/api/pith-number/5475FOXABEDTGYFRWXH232IQZE/graph.json","events_json":"https://pith.science/api/pith-number/5475FOXABEDTGYFRWXH232IQZE/events.json","paper":"https://pith.science/paper/5475FOXA"},"agent_actions":{"view_html":"https://pith.science/pith/5475FOXABEDTGYFRWXH232IQZE","download_json":"https://pith.science/pith/5475FOXABEDTGYFRWXH232IQZE.json","view_paper":"https://pith.science/paper/5475FOXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.14280&json=true","fetch_graph":"https://pith.science/api/pith-number/5475FOXABEDTGYFRWXH232IQZE/graph.json","fetch_events":"https://pith.science/api/pith-number/5475FOXABEDTGYFRWXH232IQZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5475FOXABEDTGYFRWXH232IQZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5475FOXABEDTGYFRWXH232IQZE/action/storage_attestation","attest_author":"https://pith.science/pith/5475FOXABEDTGYFRWXH232IQZE/action/author_attestation","sign_citation":"https://pith.science/pith/5475FOXABEDTGYFRWXH232IQZE/action/citation_signature","submit_replication":"https://pith.science/pith/5475FOXABEDTGYFRWXH232IQZE/action/replication_record"}},"created_at":"2026-06-19T16:12:49.043320+00:00","updated_at":"2026-06-19T16:12:49.043320+00:00"}