{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GDWSTIIQDGEOKCDVQDARKRBX4A","short_pith_number":"pith:GDWSTIIQ","schema_version":"1.0","canonical_sha256":"30ed29a1101988e5087580c1154437e025f84907f4f7b82fc1e1f3f2869af240","source":{"kind":"arxiv","id":"1703.08376","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.08376","created_at":"2026-05-18T00:48:00.071835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08376v1","created_at":"2026-05-18T00:48:00.071835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08376","created_at":"2026-05-18T00:48:00.071835+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDWSTIIQDGEO","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDWSTIIQDGEOKCDV","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDWSTIIQ","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A","json":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A.json","graph_json":"https://pith.science/api/pith-number/GDWSTIIQDGEOKCDVQDARKRBX4A/graph.json","events_json":"https://pith.science/api/pith-number/GDWSTIIQDGEOKCDVQDARKRBX4A/events.json","paper":"https://pith.science/paper/GDWSTIIQ"},"agent_actions":{"view_html":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A","download_json":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A.json","view_paper":"https://pith.science/paper/GDWSTIIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08376&json=true","fetch_graph":"https://pith.science/api/pith-number/GDWSTIIQDGEOKCDVQDARKRBX4A/graph.json","fetch_events":"https://pith.science/api/pith-number/GDWSTIIQDGEOKCDVQDARKRBX4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A/action/storage_attestation","attest_author":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A/action/author_attestation","sign_citation":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A/action/citation_signature","submit_replication":"https://pith.science/pith/GDWSTIIQDGEOKCDVQDARKRBX4A/action/replication_record"}},"created_at":"2026-05-18T00:48:00.071835+00:00","updated_at":"2026-05-18T00:48:00.071835+00:00"}