{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:SALB4TRR774HNVU7TSKQNAPNKF","short_pith_number":"pith:SALB4TRR","canonical_record":{"source":{"id":"2110.11210","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-21T15:34:34Z","cross_cats_sorted":[],"title_canon_sha256":"188347788c222826c8d70d42db2c7b2d68fc1a37b7172a370af14870f3f172a8","abstract_canon_sha256":"79b24d423956911567841eef7e21f052cbe2890532e1d37d1128853043959816"},"schema_version":"1.0"},"canonical_sha256":"90161e4e31fff876d69f9c950681ed51546a67aebe4d1ef2638e341503bf0107","source":{"kind":"arxiv","id":"2110.11210","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.11210","created_at":"2026-07-05T05:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"2110.11210v2","created_at":"2026-07-05T05:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.11210","created_at":"2026-07-05T05:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"SALB4TRR774H","created_at":"2026-07-05T05:19:33Z"},{"alias_kind":"pith_short_16","alias_value":"SALB4TRR774HNVU7","created_at":"2026-07-05T05:19:33Z"},{"alias_kind":"pith_short_8","alias_value":"SALB4TRR","created_at":"2026-07-05T05:19:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:SALB4TRR774HNVU7TSKQNAPNKF","target":"record","payload":{"canonical_record":{"source":{"id":"2110.11210","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-21T15:34:34Z","cross_cats_sorted":[],"title_canon_sha256":"188347788c222826c8d70d42db2c7b2d68fc1a37b7172a370af14870f3f172a8","abstract_canon_sha256":"79b24d423956911567841eef7e21f052cbe2890532e1d37d1128853043959816"},"schema_version":"1.0"},"canonical_sha256":"90161e4e31fff876d69f9c950681ed51546a67aebe4d1ef2638e341503bf0107","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:33.542181Z","signature_b64":"DtgkpBjD9C6nNWJuPneJBA3PmX3Wh7iHf917zdFxeBXlUaniWlFxcg52xWQoxhZrsUl1aK++z0zuYADRIVRwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90161e4e31fff876d69f9c950681ed51546a67aebe4d1ef2638e341503bf0107","last_reissued_at":"2026-07-05T05:19:33.541747Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:33.541747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.11210","source_version":2,"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-05T05:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2XD6ljpJWZuvM/eJJz8CmzHD9QIw8L0BJbYQkqcEPTXsT01QyyiFAKKO99KEyoonZcfVFlBsB2xF8ONEuJLHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:52:29.570588Z"},"content_sha256":"edf6eeebdb6d81c99ca869503c87d5ff3fae82136b57b4532106277861fe1cf3","schema_version":"1.0","event_id":"sha256:edf6eeebdb6d81c99ca869503c87d5ff3fae82136b57b4532106277861fe1cf3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:SALB4TRR774HNVU7TSKQNAPNKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimax Problems with Coupled Linear Constraints: Computational Complexity, Duality and Solution Methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ioannis Tsaknakis, Mingyi Hong, Shuzhong Zhang","submitted_at":"2021-10-21T15:34:34Z","abstract_excerpt":"In this work we study a special minimax problem where there are linear constraints that couple both the minimization and maximization decision variables. The problem is a generalization of the traditional saddle point problem (which does not have the coupling constraint), and it finds applications in wireless communication, game theory, transportation, just to name a few. We show that the considered problem is challenging, in the sense that it violates the classical max-min inequality, and that it is NP-hard even under very strong assumptions (e.g., when the objective is strongly convex-strong"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.11210","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/2110.11210/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-05T05:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HlWakKkDSBwgS6rwCIIpC933vPh7XPM0tNeEmRFbiU5ukVtnHLrKxvPi4/Tdv7N1xVoZeDzv6WO0VTcP81y1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:52:29.571333Z"},"content_sha256":"50d01dbb38db6a591d8c7f6fe114bff5c8c1cabcdfc9359c7d37b64405093892","schema_version":"1.0","event_id":"sha256:50d01dbb38db6a591d8c7f6fe114bff5c8c1cabcdfc9359c7d37b64405093892"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SALB4TRR774HNVU7TSKQNAPNKF/bundle.json","state_url":"https://pith.science/pith/SALB4TRR774HNVU7TSKQNAPNKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SALB4TRR774HNVU7TSKQNAPNKF/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-15T14:52:29Z","links":{"resolver":"https://pith.science/pith/SALB4TRR774HNVU7TSKQNAPNKF","bundle":"https://pith.science/pith/SALB4TRR774HNVU7TSKQNAPNKF/bundle.json","state":"https://pith.science/pith/SALB4TRR774HNVU7TSKQNAPNKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SALB4TRR774HNVU7TSKQNAPNKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:SALB4TRR774HNVU7TSKQNAPNKF","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":"79b24d423956911567841eef7e21f052cbe2890532e1d37d1128853043959816","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-21T15:34:34Z","title_canon_sha256":"188347788c222826c8d70d42db2c7b2d68fc1a37b7172a370af14870f3f172a8"},"schema_version":"1.0","source":{"id":"2110.11210","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.11210","created_at":"2026-07-05T05:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"2110.11210v2","created_at":"2026-07-05T05:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.11210","created_at":"2026-07-05T05:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"SALB4TRR774H","created_at":"2026-07-05T05:19:33Z"},{"alias_kind":"pith_short_16","alias_value":"SALB4TRR774HNVU7","created_at":"2026-07-05T05:19:33Z"},{"alias_kind":"pith_short_8","alias_value":"SALB4TRR","created_at":"2026-07-05T05:19:33Z"}],"graph_snapshots":[{"event_id":"sha256:50d01dbb38db6a591d8c7f6fe114bff5c8c1cabcdfc9359c7d37b64405093892","target":"graph","created_at":"2026-07-05T05:19:33Z","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/2110.11210/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work we study a special minimax problem where there are linear constraints that couple both the minimization and maximization decision variables. The problem is a generalization of the traditional saddle point problem (which does not have the coupling constraint), and it finds applications in wireless communication, game theory, transportation, just to name a few. We show that the considered problem is challenging, in the sense that it violates the classical max-min inequality, and that it is NP-hard even under very strong assumptions (e.g., when the objective is strongly convex-strong","authors_text":"Ioannis Tsaknakis, Mingyi Hong, Shuzhong Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-21T15:34:34Z","title":"Minimax Problems with Coupled Linear Constraints: Computational Complexity, Duality and Solution Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.11210","kind":"arxiv","version":2},"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:edf6eeebdb6d81c99ca869503c87d5ff3fae82136b57b4532106277861fe1cf3","target":"record","created_at":"2026-07-05T05:19:33Z","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":"79b24d423956911567841eef7e21f052cbe2890532e1d37d1128853043959816","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-21T15:34:34Z","title_canon_sha256":"188347788c222826c8d70d42db2c7b2d68fc1a37b7172a370af14870f3f172a8"},"schema_version":"1.0","source":{"id":"2110.11210","kind":"arxiv","version":2}},"canonical_sha256":"90161e4e31fff876d69f9c950681ed51546a67aebe4d1ef2638e341503bf0107","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90161e4e31fff876d69f9c950681ed51546a67aebe4d1ef2638e341503bf0107","first_computed_at":"2026-07-05T05:19:33.541747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:19:33.541747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DtgkpBjD9C6nNWJuPneJBA3PmX3Wh7iHf917zdFxeBXlUaniWlFxcg52xWQoxhZrsUl1aK++z0zuYADRIVRwCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:19:33.542181Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.11210","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edf6eeebdb6d81c99ca869503c87d5ff3fae82136b57b4532106277861fe1cf3","sha256:50d01dbb38db6a591d8c7f6fe114bff5c8c1cabcdfc9359c7d37b64405093892"],"state_sha256":"152eb7a384d05d98b0921d246039e6b0432645231f5e08de7f43c5be720ff384"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"azY3swlekg1Wrrx6+eHTQblIWUwgv2BdfYlC4lysaM3oU16Bvdry8wlwQQ0Qe1HwRJ4ptO6lEjGnb3XMGcCOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T14:52:29.576664Z","bundle_sha256":"1a8e83b34e5a226366a5cdcc50399f1bb1f4331752d7d1de7358af9f384002b9"}}