{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZEGYI7AUH6BGMSLC75QV4ZLZDY","short_pith_number":"pith:ZEGYI7AU","canonical_record":{"source":{"id":"2607.26816","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-29T12:05:33Z","cross_cats_sorted":[],"title_canon_sha256":"f2ca9d461e865c80718f4ac3e9cee29aa948c32006b068379a4649f381ee2696","abstract_canon_sha256":"4c22dc9f56e515f692e4070ed3f5e865a2883055f3c4afc4abab09c7d77a790d"},"schema_version":"1.0"},"canonical_sha256":"c90d847c143f82664962ff615e65791e1bb8047f4af3586cb7cc231cedcb5c38","source":{"kind":"arxiv","id":"2607.26816","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26816","created_at":"2026-07-30T01:22:25Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26816v1","created_at":"2026-07-30T01:22:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26816","created_at":"2026-07-30T01:22:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZEGYI7AUH6BG","created_at":"2026-07-30T01:22:25Z"},{"alias_kind":"pith_short_16","alias_value":"ZEGYI7AUH6BGMSLC","created_at":"2026-07-30T01:22:25Z"},{"alias_kind":"pith_short_8","alias_value":"ZEGYI7AU","created_at":"2026-07-30T01:22:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZEGYI7AUH6BGMSLC75QV4ZLZDY","target":"record","payload":{"canonical_record":{"source":{"id":"2607.26816","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-29T12:05:33Z","cross_cats_sorted":[],"title_canon_sha256":"f2ca9d461e865c80718f4ac3e9cee29aa948c32006b068379a4649f381ee2696","abstract_canon_sha256":"4c22dc9f56e515f692e4070ed3f5e865a2883055f3c4afc4abab09c7d77a790d"},"schema_version":"1.0"},"canonical_sha256":"c90d847c143f82664962ff615e65791e1bb8047f4af3586cb7cc231cedcb5c38","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c90d847c143f82664962ff615e65791e1bb8047f4af3586cb7cc231cedcb5c38","last_reissued_at":"2026-07-30T01:22:25.388188Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:22:25.388188Z"},"source_kind":"arxiv","source_id":"2607.26816","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-07-30T01:22:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"30StBi3joUBXslFuoRp7j3PGi4rZQBkYHFOUctrEK9BYsVPNkPh8M1MHV+UDDD0Ex8pNVnamhxdweXUpzSuvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T19:02:52.548871Z"},"content_sha256":"c92b8d6087e773b83e83ba64d5eddb0b9f45bd0bebbd36ee7889394dbd97d28a","schema_version":"1.0","event_id":"sha256:c92b8d6087e773b83e83ba64d5eddb0b9f45bd0bebbd36ee7889394dbd97d28a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZEGYI7AUH6BGMSLC75QV4ZLZDY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimax adaptive control for finite sets of positive linear systems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Rantzer, Fethi Bencherki","submitted_at":"2026-07-29T12:05:33Z","abstract_excerpt":"We present a minimax adaptive control framework for discrete-time positive linear systems with parametric uncertainty and adversarial disturbances. The uncertainty in the system dynamics is assumed to lie in a finite set of possible plants. We formulate the problem as a dynamic game between the controller, which minimizes the cost, and an adversary, which selects both the disturbances and the plant dynamics to maximize the cost. An equivalent reformulation of the original game transforms the problem into a standard minimax two-player zero-sum dynamic game. This enables the problem to be addres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26816","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/2607.26816/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-07-30T01:22:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XGgHUw7OYlfwZsWfucGE/4ffbXNi474UYOnOXONrnYHiSJXLMgq1anpnjpXrovmXIEuNZVDjCnh0tAgmTrqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T19:02:52.549479Z"},"content_sha256":"760299f9b777b7441616506298ef18b5ec598c778090a61e6ae2c9150f588496","schema_version":"1.0","event_id":"sha256:760299f9b777b7441616506298ef18b5ec598c778090a61e6ae2c9150f588496"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZEGYI7AUH6BGMSLC75QV4ZLZDY/bundle.json","state_url":"https://pith.science/pith/ZEGYI7AUH6BGMSLC75QV4ZLZDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZEGYI7AUH6BGMSLC75QV4ZLZDY/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-08-06T19:02:52Z","links":{"resolver":"https://pith.science/pith/ZEGYI7AUH6BGMSLC75QV4ZLZDY","bundle":"https://pith.science/pith/ZEGYI7AUH6BGMSLC75QV4ZLZDY/bundle.json","state":"https://pith.science/pith/ZEGYI7AUH6BGMSLC75QV4ZLZDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZEGYI7AUH6BGMSLC75QV4ZLZDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZEGYI7AUH6BGMSLC75QV4ZLZDY","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":"4c22dc9f56e515f692e4070ed3f5e865a2883055f3c4afc4abab09c7d77a790d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-29T12:05:33Z","title_canon_sha256":"f2ca9d461e865c80718f4ac3e9cee29aa948c32006b068379a4649f381ee2696"},"schema_version":"1.0","source":{"id":"2607.26816","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26816","created_at":"2026-07-30T01:22:25Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26816v1","created_at":"2026-07-30T01:22:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26816","created_at":"2026-07-30T01:22:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZEGYI7AUH6BG","created_at":"2026-07-30T01:22:25Z"},{"alias_kind":"pith_short_16","alias_value":"ZEGYI7AUH6BGMSLC","created_at":"2026-07-30T01:22:25Z"},{"alias_kind":"pith_short_8","alias_value":"ZEGYI7AU","created_at":"2026-07-30T01:22:25Z"}],"graph_snapshots":[{"event_id":"sha256:760299f9b777b7441616506298ef18b5ec598c778090a61e6ae2c9150f588496","target":"graph","created_at":"2026-07-30T01:22:25Z","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/2607.26816/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a minimax adaptive control framework for discrete-time positive linear systems with parametric uncertainty and adversarial disturbances. The uncertainty in the system dynamics is assumed to lie in a finite set of possible plants. We formulate the problem as a dynamic game between the controller, which minimizes the cost, and an adversary, which selects both the disturbances and the plant dynamics to maximize the cost. An equivalent reformulation of the original game transforms the problem into a standard minimax two-player zero-sum dynamic game. This enables the problem to be addres","authors_text":"Anders Rantzer, Fethi Bencherki","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-29T12:05:33Z","title":"Minimax adaptive control for finite sets of positive linear systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26816","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:c92b8d6087e773b83e83ba64d5eddb0b9f45bd0bebbd36ee7889394dbd97d28a","target":"record","created_at":"2026-07-30T01:22:25Z","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":"4c22dc9f56e515f692e4070ed3f5e865a2883055f3c4afc4abab09c7d77a790d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-29T12:05:33Z","title_canon_sha256":"f2ca9d461e865c80718f4ac3e9cee29aa948c32006b068379a4649f381ee2696"},"schema_version":"1.0","source":{"id":"2607.26816","kind":"arxiv","version":1}},"canonical_sha256":"c90d847c143f82664962ff615e65791e1bb8047f4af3586cb7cc231cedcb5c38","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c90d847c143f82664962ff615e65791e1bb8047f4af3586cb7cc231cedcb5c38","first_computed_at":"2026-07-30T01:22:25.388188Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:22:25.388188Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.26816","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c92b8d6087e773b83e83ba64d5eddb0b9f45bd0bebbd36ee7889394dbd97d28a","sha256:760299f9b777b7441616506298ef18b5ec598c778090a61e6ae2c9150f588496"],"state_sha256":"730da4d5edaff0d4a7e5b19831e80d25b210b30a6d3575482c4986a10970e8b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/StQT9QGBRaKNjVWA6Fn573tr7EDciHDkkVgtMr+L3qDS0LC8UcNQmHdCF3fhJBF0XOg5WBpSo/8NHVCVjVxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T19:02:52.559505Z","bundle_sha256":"9edfc8f3575d87153562015e413cb0d04b83ea244c3fa068c9991179e215cf36"}}