{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GDWSTIIQDGEOKCDVQDARKRBX4A","short_pith_number":"pith:GDWSTIIQ","canonical_record":{"source":{"id":"1703.08376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-24T11:49:57Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"454b33e28e42a2570a9d4688cce2ad3ec26040ee4f1058b47e7dd7761420e913","abstract_canon_sha256":"899b3aa84205c0514404591c9b5cf58b2d75cc6585bea87ee6347cc459d18ec6"},"schema_version":"1.0"},"canonical_sha256":"30ed29a1101988e5087580c1154437e025f84907f4f7b82fc1e1f3f2869af240","source":{"kind":"arxiv","id":"1703.08376","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08376","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08376v1","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08376","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"pith_short_12","alias_value":"GDWSTIIQDGEO","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GDWSTIIQDGEOKCDV","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GDWSTIIQ","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GDWSTIIQDGEOKCDVQDARKRBX4A","target":"record","payload":{"canonical_record":{"source":{"id":"1703.08376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-24T11:49:57Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"454b33e28e42a2570a9d4688cce2ad3ec26040ee4f1058b47e7dd7761420e913","abstract_canon_sha256":"899b3aa84205c0514404591c9b5cf58b2d75cc6585bea87ee6347cc459d18ec6"},"schema_version":"1.0"},"canonical_sha256":"30ed29a1101988e5087580c1154437e025f84907f4f7b82fc1e1f3f2869af240","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:00.072198Z","signature_b64":"w5X8nEOJVLGdcMaeLgG9gb0UNkUzQOXm6Xzm8vz+kO14xjOepcsCtCFp4X86hIBeJmDFB4siNwR2hrPvtRyEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30ed29a1101988e5087580c1154437e025f84907f4f7b82fc1e1f3f2869af240","last_reissued_at":"2026-05-18T00:48:00.071767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:00.071767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.08376","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:48:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDyd3afm07dZjy2z7krGAmo5QXSPcpJe+INjxp16T6aWMtOS+4cpJwQ1KmjQUCLXkLjQTPQTrwpD+NiSy8hTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:47:19.897838Z"},"content_sha256":"2e4ed6a30add1641f907b947b4e907aebfa2e91bc871cd356fb070b9a60a7422","schema_version":"1.0","event_id":"sha256:2e4ed6a30add1641f907b947b4e907aebfa2e91bc871cd356fb070b9a60a7422"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GDWSTIIQDGEOKCDVQDARKRBX4A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A duality-based approach for distributed min-max optimization with application to demand side management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.DC","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola, Mauro Franceschelli","submitted_at":"2017-03-24T11:49:57Z","abstract_excerpt":"In this paper we consider a distributed optimization scenario in which a set of processors aims at minimizing the maximum of a collection of \"separable convex functions\" subject to local constraints. 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 local states at different time instants being coupled through local dynamics. The min-max structure and the double coupling (through the devices "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08376","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:48:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccb9T+iOXQEK4RCCwM5rSB2kjvq/PdWa0lULDhprdb1NvzXojt0md7TCE8zYSQFOKqErD8woFOMSQ7guT/TtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:47:19.898197Z"},"content_sha256":"471ee3f128518841e1b0fb9b723aedcbe2e75397ccf8553981d8089a444670bf","schema_version":"1.0","event_id":"sha256:471ee3f128518841e1b0fb9b723aedcbe2e75397ccf8553981d8089a444670bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A/bundle.json","state_url":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDWSTIIQDGEOKCDVQDARKRBX4A/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-04T14:47:19Z","links":{"resolver":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A","bundle":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A/bundle.json","state":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDWSTIIQDGEOKCDVQDARKRBX4A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GDWSTIIQDGEOKCDVQDARKRBX4A","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":"899b3aa84205c0514404591c9b5cf58b2d75cc6585bea87ee6347cc459d18ec6","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-24T11:49:57Z","title_canon_sha256":"454b33e28e42a2570a9d4688cce2ad3ec26040ee4f1058b47e7dd7761420e913"},"schema_version":"1.0","source":{"id":"1703.08376","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08376","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08376v1","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08376","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"pith_short_12","alias_value":"GDWSTIIQDGEO","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GDWSTIIQDGEOKCDV","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GDWSTIIQ","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:471ee3f128518841e1b0fb9b723aedcbe2e75397ccf8553981d8089a444670bf","target":"graph","created_at":"2026-05-18T00:48:00Z","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 minimizing the maximum of a collection of \"separable convex functions\" subject to local constraints. 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 local states at different time instants being coupled through local dynamics. The min-max structure and the double coupling (through the devices ","authors_text":"Giuseppe Notarstefano, Ivano Notarnicola, Mauro Franceschelli","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-24T11:49:57Z","title":"A duality-based approach for distributed min-max optimization with application to demand side management"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08376","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:2e4ed6a30add1641f907b947b4e907aebfa2e91bc871cd356fb070b9a60a7422","target":"record","created_at":"2026-05-18T00:48:00Z","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":"899b3aa84205c0514404591c9b5cf58b2d75cc6585bea87ee6347cc459d18ec6","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-24T11:49:57Z","title_canon_sha256":"454b33e28e42a2570a9d4688cce2ad3ec26040ee4f1058b47e7dd7761420e913"},"schema_version":"1.0","source":{"id":"1703.08376","kind":"arxiv","version":1}},"canonical_sha256":"30ed29a1101988e5087580c1154437e025f84907f4f7b82fc1e1f3f2869af240","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30ed29a1101988e5087580c1154437e025f84907f4f7b82fc1e1f3f2869af240","first_computed_at":"2026-05-18T00:48:00.071767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:00.071767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w5X8nEOJVLGdcMaeLgG9gb0UNkUzQOXm6Xzm8vz+kO14xjOepcsCtCFp4X86hIBeJmDFB4siNwR2hrPvtRyEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:00.072198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08376","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e4ed6a30add1641f907b947b4e907aebfa2e91bc871cd356fb070b9a60a7422","sha256:471ee3f128518841e1b0fb9b723aedcbe2e75397ccf8553981d8089a444670bf"],"state_sha256":"ced4272a3151ab5dc4be9d82b86423dc4bfc179cf2bea58a5625717326a959b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfWJg3oU3Tco/L44yavhlicY8oftXBAauj+KEsPLyqY5NG0vEhbdLMz/ED/V4SPhqK5WC4lfgJSLSUs4YyVpAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T14:47:19.900353Z","bundle_sha256":"9bdd4ca669c7a5152436cdcf9eb78d323eb5e04ad3a5721f091382d8858403de"}}