{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7QCTCIC7FJLLK7H4VMQNGTDJTE","short_pith_number":"pith:7QCTCIC7","canonical_record":{"source":{"id":"1611.09168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-28T15:15:32Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2f1daf3fb7940ce76511d17339fd69c204d4bd6e99afac24dfb2c7f0a60fa76c","abstract_canon_sha256":"f8a29719e15a8d91652ece9b5a8c81e8d26d0792e2e961ea0a1a535836509685"},"schema_version":"1.0"},"canonical_sha256":"fc0531205f2a56b57cfcab20d34c69990522d47f86bd95ac521a4c7f753be0a2","source":{"kind":"arxiv","id":"1611.09168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09168","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09168v1","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09168","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"pith_short_12","alias_value":"7QCTCIC7FJLL","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7QCTCIC7FJLLK7H4","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7QCTCIC7","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7QCTCIC7FJLLK7H4VMQNGTDJTE","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-28T15:15:32Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2f1daf3fb7940ce76511d17339fd69c204d4bd6e99afac24dfb2c7f0a60fa76c","abstract_canon_sha256":"f8a29719e15a8d91652ece9b5a8c81e8d26d0792e2e961ea0a1a535836509685"},"schema_version":"1.0"},"canonical_sha256":"fc0531205f2a56b57cfcab20d34c69990522d47f86bd95ac521a4c7f753be0a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:28.973417Z","signature_b64":"TdW4F+COdRHNmInLkKiFiDt1imWe7c4Bmtr9KHkddGK9Pb2Qm1UlvB5QzDua7H6C1+jJN7Q3rc8rlbgaD69qAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc0531205f2a56b57cfcab20d34c69990522d47f86bd95ac521a4c7f753be0a2","last_reissued_at":"2026-05-18T00:56:28.972724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:28.972724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09168","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-18T00:56:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2SZiq+WHuhW2LJ3HkEuxllUKIBQE/Sx1DAblN2MrTHSqncAbOj2/kDbpHlfxAAZZb8M6Zngs3vyZkMCHM2ojDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:57:34.081056Z"},"content_sha256":"b252f5333e5c0977042b5d9b97e8078df0b1528fa7c38ef25a81644c0d2096d8","schema_version":"1.0","event_id":"sha256:b252f5333e5c0977042b5d9b97e8078df0b1528fa7c38ef25a81644c0d2096d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7QCTCIC7FJLLK7H4VMQNGTDJTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A duality-based approach for distributed min-max optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola, Mauro Franceschelli","submitted_at":"2016-11-28T15:15:32Z","abstract_excerpt":"In this paper we consider a distributed optimization scenario in which a set of processors aims at cooperatively solving a class of min-max optimization problems. This set-up is motivated by peak-demand minimization problems in smart grids. Here, the goal is to minimize the peak value over a finite horizon with: (i) the demand at each time instant being the sum of contributions from different devices, and (ii) the device states at different time instants being coupled through local constraints (e.g., the dynamics). The min-max structure and the double coupling (through the devices and over the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09168","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"},"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-18T00:56:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dp+4Ib82j1DTnbWPM0Bo9uSAeQ2K2k+BpC0JVg3wcokypkJDeot6/XD1WPhfDJZRF406qb2q++ZFuBADN/68Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:57:34.081420Z"},"content_sha256":"9b2c9061b55aabf3b2658f4b4069d968863c8309488d58e9868b13298cc86ccc","schema_version":"1.0","event_id":"sha256:9b2c9061b55aabf3b2658f4b4069d968863c8309488d58e9868b13298cc86ccc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QCTCIC7FJLLK7H4VMQNGTDJTE/bundle.json","state_url":"https://pith.science/pith/7QCTCIC7FJLLK7H4VMQNGTDJTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QCTCIC7FJLLK7H4VMQNGTDJTE/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-04T15:57:34Z","links":{"resolver":"https://pith.science/pith/7QCTCIC7FJLLK7H4VMQNGTDJTE","bundle":"https://pith.science/pith/7QCTCIC7FJLLK7H4VMQNGTDJTE/bundle.json","state":"https://pith.science/pith/7QCTCIC7FJLLK7H4VMQNGTDJTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QCTCIC7FJLLK7H4VMQNGTDJTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7QCTCIC7FJLLK7H4VMQNGTDJTE","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":"f8a29719e15a8d91652ece9b5a8c81e8d26d0792e2e961ea0a1a535836509685","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-28T15:15:32Z","title_canon_sha256":"2f1daf3fb7940ce76511d17339fd69c204d4bd6e99afac24dfb2c7f0a60fa76c"},"schema_version":"1.0","source":{"id":"1611.09168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09168","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09168v1","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09168","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"pith_short_12","alias_value":"7QCTCIC7FJLL","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7QCTCIC7FJLLK7H4","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7QCTCIC7","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:9b2c9061b55aabf3b2658f4b4069d968863c8309488d58e9868b13298cc86ccc","target":"graph","created_at":"2026-05-18T00:56:28Z","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"},"paper":{"abstract_excerpt":"In this paper we consider a distributed optimization scenario in which a set of processors aims at cooperatively solving a class of min-max optimization problems. This set-up is motivated by peak-demand minimization problems in smart grids. Here, the goal is to minimize the peak value over a finite horizon with: (i) the demand at each time instant being the sum of contributions from different devices, and (ii) the device states at different time instants being coupled through local constraints (e.g., the dynamics). The min-max structure and the double coupling (through the devices and over the","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola, Mauro Franceschelli","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-28T15:15:32Z","title":"A duality-based approach for distributed min-max optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09168","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:b252f5333e5c0977042b5d9b97e8078df0b1528fa7c38ef25a81644c0d2096d8","target":"record","created_at":"2026-05-18T00:56:28Z","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":"f8a29719e15a8d91652ece9b5a8c81e8d26d0792e2e961ea0a1a535836509685","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-28T15:15:32Z","title_canon_sha256":"2f1daf3fb7940ce76511d17339fd69c204d4bd6e99afac24dfb2c7f0a60fa76c"},"schema_version":"1.0","source":{"id":"1611.09168","kind":"arxiv","version":1}},"canonical_sha256":"fc0531205f2a56b57cfcab20d34c69990522d47f86bd95ac521a4c7f753be0a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc0531205f2a56b57cfcab20d34c69990522d47f86bd95ac521a4c7f753be0a2","first_computed_at":"2026-05-18T00:56:28.972724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:28.972724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TdW4F+COdRHNmInLkKiFiDt1imWe7c4Bmtr9KHkddGK9Pb2Qm1UlvB5QzDua7H6C1+jJN7Q3rc8rlbgaD69qAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:28.973417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b252f5333e5c0977042b5d9b97e8078df0b1528fa7c38ef25a81644c0d2096d8","sha256:9b2c9061b55aabf3b2658f4b4069d968863c8309488d58e9868b13298cc86ccc"],"state_sha256":"37c821f50b45ec4b2c4930b34c6361572bb6b518d3a246e5403beb84ba67cfaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5LInkiwx/ckTEAKFXG0WAC2D5O/REqLW2ozphgYfHPmpWJSXy20/jsAA9+2ukTYM08sKippUZPgiBp7G7NxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:57:34.083300Z","bundle_sha256":"01781a35587d1e26e69d724d19d626f32aa97798ff8d6c1102722158241d1f9f"}}