{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:R6JQVNDVEPFAAM2XVPA6AHN6JM","short_pith_number":"pith:R6JQVNDV","canonical_record":{"source":{"id":"2605.28550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-27T14:40:36Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"9c45b3c86402025b86cfdbdc5925712a4eb3b6a5cf1633ff66b44296a8abf716","abstract_canon_sha256":"7f8411bb5d46e61c26626ea5925b04312d18b0566ad3d3078336206bf827d09e"},"schema_version":"1.0"},"canonical_sha256":"8f930ab47523ca003357abc1e01dbe4b2d2a036da5d58db20f0010806082662f","source":{"kind":"arxiv","id":"2605.28550","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28550","created_at":"2026-05-28T02:04:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28550v1","created_at":"2026-05-28T02:04:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28550","created_at":"2026-05-28T02:04:56Z"},{"alias_kind":"pith_short_12","alias_value":"R6JQVNDVEPFA","created_at":"2026-05-28T02:04:56Z"},{"alias_kind":"pith_short_16","alias_value":"R6JQVNDVEPFAAM2X","created_at":"2026-05-28T02:04:56Z"},{"alias_kind":"pith_short_8","alias_value":"R6JQVNDV","created_at":"2026-05-28T02:04:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:R6JQVNDVEPFAAM2XVPA6AHN6JM","target":"record","payload":{"canonical_record":{"source":{"id":"2605.28550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-27T14:40:36Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"9c45b3c86402025b86cfdbdc5925712a4eb3b6a5cf1633ff66b44296a8abf716","abstract_canon_sha256":"7f8411bb5d46e61c26626ea5925b04312d18b0566ad3d3078336206bf827d09e"},"schema_version":"1.0"},"canonical_sha256":"8f930ab47523ca003357abc1e01dbe4b2d2a036da5d58db20f0010806082662f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:04:56.117965Z","signature_b64":"1fDz+YLYGohPKotZTH1jCmFG8nJs1M0vs2OmoN/Id6MuVmLy9Guq73IYUf3/Hq/losEuKSprFE92KOUoRdGyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f930ab47523ca003357abc1e01dbe4b2d2a036da5d58db20f0010806082662f","last_reissued_at":"2026-05-28T02:04:56.117518Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:04:56.117518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.28550","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-28T02:04:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mjWsD2QACBGe1/ciKu7i3z4T6y4E1Q64CbVvmgz/yb8VoWcxHRsEju4CSQHpSwdSW2vEaNEdZcBEfY5H6EkUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:32:59.494752Z"},"content_sha256":"f13905302ad82ea397cd840b2662c04475cc61c88a96bc9885fe468b8c77c905","schema_version":"1.0","event_id":"sha256:f13905302ad82ea397cd840b2662c04475cc61c88a96bc9885fe468b8c77c905"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:R6JQVNDVEPFAAM2XVPA6AHN6JM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Predictive Control for Constrained Linear Positive Systems on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Anders Rantzer, David Ohlin, Emma Tegling, Roland Schurig, Rolf Findeisen","submitted_at":"2026-05-27T14:40:36Z","abstract_excerpt":"Positive systems describing networks with inherently non-negative states and inputs arise naturally in routing, logistics, and compartmental modelling. We consider problems modelled as positive linear systems in incidence form with linear cost. The addition of capacity constraints on states (storage) and inputs (flows between nodes) significantly increases the problem complexity. Leveraging the analytic structure of the unconstrained problem, an explicit suboptimal admissible controller is constructed. This yields graph-computable performance bounds and a minimum stabilising horizon length for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28550","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.28550/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"},"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-28T02:04:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4JJTs/DnMd2S3iPdYNlYxI69v8RmJJ0flCOSwyPt/yyz6fvQWtG11/zQ7sfwBIHYHwb0jshzQ46diBFRDfJyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:32:59.495136Z"},"content_sha256":"92e3bb9e85a005908b3893a82d979120284b3968c2cd1381d6f7422b10cac8f5","schema_version":"1.0","event_id":"sha256:92e3bb9e85a005908b3893a82d979120284b3968c2cd1381d6f7422b10cac8f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6JQVNDVEPFAAM2XVPA6AHN6JM/bundle.json","state_url":"https://pith.science/pith/R6JQVNDVEPFAAM2XVPA6AHN6JM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6JQVNDVEPFAAM2XVPA6AHN6JM/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-05T21:32:59Z","links":{"resolver":"https://pith.science/pith/R6JQVNDVEPFAAM2XVPA6AHN6JM","bundle":"https://pith.science/pith/R6JQVNDVEPFAAM2XVPA6AHN6JM/bundle.json","state":"https://pith.science/pith/R6JQVNDVEPFAAM2XVPA6AHN6JM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6JQVNDVEPFAAM2XVPA6AHN6JM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:R6JQVNDVEPFAAM2XVPA6AHN6JM","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":"7f8411bb5d46e61c26626ea5925b04312d18b0566ad3d3078336206bf827d09e","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-27T14:40:36Z","title_canon_sha256":"9c45b3c86402025b86cfdbdc5925712a4eb3b6a5cf1633ff66b44296a8abf716"},"schema_version":"1.0","source":{"id":"2605.28550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28550","created_at":"2026-05-28T02:04:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28550v1","created_at":"2026-05-28T02:04:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28550","created_at":"2026-05-28T02:04:56Z"},{"alias_kind":"pith_short_12","alias_value":"R6JQVNDVEPFA","created_at":"2026-05-28T02:04:56Z"},{"alias_kind":"pith_short_16","alias_value":"R6JQVNDVEPFAAM2X","created_at":"2026-05-28T02:04:56Z"},{"alias_kind":"pith_short_8","alias_value":"R6JQVNDV","created_at":"2026-05-28T02:04:56Z"}],"graph_snapshots":[{"event_id":"sha256:92e3bb9e85a005908b3893a82d979120284b3968c2cd1381d6f7422b10cac8f5","target":"graph","created_at":"2026-05-28T02:04:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.28550/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Positive systems describing networks with inherently non-negative states and inputs arise naturally in routing, logistics, and compartmental modelling. We consider problems modelled as positive linear systems in incidence form with linear cost. The addition of capacity constraints on states (storage) and inputs (flows between nodes) significantly increases the problem complexity. Leveraging the analytic structure of the unconstrained problem, an explicit suboptimal admissible controller is constructed. This yields graph-computable performance bounds and a minimum stabilising horizon length for","authors_text":"Anders Rantzer, David Ohlin, Emma Tegling, Roland Schurig, Rolf Findeisen","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-27T14:40:36Z","title":"Model Predictive Control for Constrained Linear Positive Systems on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28550","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:f13905302ad82ea397cd840b2662c04475cc61c88a96bc9885fe468b8c77c905","target":"record","created_at":"2026-05-28T02:04:56Z","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":"7f8411bb5d46e61c26626ea5925b04312d18b0566ad3d3078336206bf827d09e","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-27T14:40:36Z","title_canon_sha256":"9c45b3c86402025b86cfdbdc5925712a4eb3b6a5cf1633ff66b44296a8abf716"},"schema_version":"1.0","source":{"id":"2605.28550","kind":"arxiv","version":1}},"canonical_sha256":"8f930ab47523ca003357abc1e01dbe4b2d2a036da5d58db20f0010806082662f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f930ab47523ca003357abc1e01dbe4b2d2a036da5d58db20f0010806082662f","first_computed_at":"2026-05-28T02:04:56.117518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T02:04:56.117518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1fDz+YLYGohPKotZTH1jCmFG8nJs1M0vs2OmoN/Id6MuVmLy9Guq73IYUf3/Hq/losEuKSprFE92KOUoRdGyCA==","signature_status":"signed_v1","signed_at":"2026-05-28T02:04:56.117965Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.28550","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f13905302ad82ea397cd840b2662c04475cc61c88a96bc9885fe468b8c77c905","sha256:92e3bb9e85a005908b3893a82d979120284b3968c2cd1381d6f7422b10cac8f5"],"state_sha256":"273b4fc0b1395cb19263f54a685e1a4745696c7efa305947fe66b4823ceecca8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItXrHmipAtdmu+fG+VjMilQl1Qlza9VKUKCZRWd32baT+QMPocPtf1rBJPwgg8602vaW81oqlOqKz+vUuq9iCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:32:59.497241Z","bundle_sha256":"4d98a268c34475e96eceb248492ab33df06ba66c19fe9eccadc87d6a47554764"}}