{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XEJ4PGWCRFOQLO5UZJ45O3MM5S","short_pith_number":"pith:XEJ4PGWC","schema_version":"1.0","canonical_sha256":"b913c79ac2895d05bbb4ca79d76d8cecbfdce7243dc3e1f87aaf1156c48a1b6f","source":{"kind":"arxiv","id":"1811.03657","version":1},"attestation_state":"computed","paper":{"title":"A Primal Decomposition Method with Suboptimality Bounds for Distributed Mixed-Integer Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA","cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Andrea Camisa, Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2018-11-08T19:32:41Z","abstract_excerpt":"In this paper we deal with a network of agents seeking to solve in a distributed way Mixed-Integer Linear Programs (MILPs) with a coupling constraint (modeling a limited shared resource) and local constraints. MILPs are NP-hard problems and several challenges arise in a distributed framework, so that looking for suboptimal solutions is of interest. To achieve this goal, the presence of a linear coupling calls for tailored decomposition approaches. We propose a fully distributed algorithm based on a primal decomposition approach and a suitable tightening of the coupling constraints. Agents repe"},"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":"1811.03657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-11-08T19:32:41Z","cross_cats_sorted":["cs.DC","cs.MA","cs.SY","math.OC"],"title_canon_sha256":"f3cdccaebc0f336527212af9ec6519df10695805d06c340e5914327fd57ed52b","abstract_canon_sha256":"d2a1fcc8e70de70f39503523123761101dc068ece131a7db79553723e76bc961"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:13:40.213398Z","signature_b64":"IBsM02c6OPAXqHswe16HRhqIr/EX3zjyLkemr0qJAiGioiGXHv7G8ntsMm8G0+aT/mb4fisCwbWzHlEOdPKHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b913c79ac2895d05bbb4ca79d76d8cecbfdce7243dc3e1f87aaf1156c48a1b6f","last_reissued_at":"2026-06-04T20:13:40.212772Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:13:40.212772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Primal Decomposition Method with Suboptimality Bounds for Distributed Mixed-Integer Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA","cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Andrea Camisa, Giuseppe Notarstefano, Ivano Notarnicola","submitted_at":"2018-11-08T19:32:41Z","abstract_excerpt":"In this paper we deal with a network of agents seeking to solve in a distributed way Mixed-Integer Linear Programs (MILPs) with a coupling constraint (modeling a limited shared resource) and local constraints. MILPs are NP-hard problems and several challenges arise in a distributed framework, so that looking for suboptimal solutions is of interest. To achieve this goal, the presence of a linear coupling calls for tailored decomposition approaches. We propose a fully distributed algorithm based on a primal decomposition approach and a suitable tightening of the coupling constraints. Agents repe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03657","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/1811.03657/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.03657","created_at":"2026-06-04T20:13:40.212864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03657v1","created_at":"2026-06-04T20:13:40.212864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03657","created_at":"2026-06-04T20:13:40.212864+00:00"},{"alias_kind":"pith_short_12","alias_value":"XEJ4PGWCRFOQ","created_at":"2026-06-04T20:13:40.212864+00:00"},{"alias_kind":"pith_short_16","alias_value":"XEJ4PGWCRFOQLO5U","created_at":"2026-06-04T20:13:40.212864+00:00"},{"alias_kind":"pith_short_8","alias_value":"XEJ4PGWC","created_at":"2026-06-04T20:13:40.212864+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/XEJ4PGWCRFOQLO5UZJ45O3MM5S","json":"https://pith.science/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S.json","graph_json":"https://pith.science/api/pith-number/XEJ4PGWCRFOQLO5UZJ45O3MM5S/graph.json","events_json":"https://pith.science/api/pith-number/XEJ4PGWCRFOQLO5UZJ45O3MM5S/events.json","paper":"https://pith.science/paper/XEJ4PGWC"},"agent_actions":{"view_html":"https://pith.science/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S","download_json":"https://pith.science/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S.json","view_paper":"https://pith.science/paper/XEJ4PGWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03657&json=true","fetch_graph":"https://pith.science/api/pith-number/XEJ4PGWCRFOQLO5UZJ45O3MM5S/graph.json","fetch_events":"https://pith.science/api/pith-number/XEJ4PGWCRFOQLO5UZJ45O3MM5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S/action/storage_attestation","attest_author":"https://pith.science/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S/action/author_attestation","sign_citation":"https://pith.science/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S/action/citation_signature","submit_replication":"https://pith.science/pith/XEJ4PGWCRFOQLO5UZJ45O3MM5S/action/replication_record"}},"created_at":"2026-06-04T20:13:40.212864+00:00","updated_at":"2026-06-04T20:13:40.212864+00:00"}